CPC H04N 19/597 (2014.11) [H04N 19/103 (2014.11); H04N 19/136 (2014.11); H04N 19/91 (2014.11); H04N 19/96 (2014.11)] | 18 Claims |
1. A three-dimensional data encoding method, comprising:
encoding information of a current node included in an N-ary tree structure of three-dimensional points included in three-dimensional data, where N is an integer greater than or equal to 2; and
generating a bitstream including first information,
wherein in the encoding, the first information is encoded, the first information indicating a range for one or more available nodes being referable during the encoding,
wherein in the encoding, the current node is encoded with reference to a neighboring node corresponding to one of the one or more available nodes within the range, and
wherein in the encoding, whether the neighboring node includes a three-dimensional point is determined.
|