CPC H03M 13/658 (2013.01) [G06F 8/43 (2013.01); G06F 40/146 (2020.01); G06T 9/40 (2013.01); G06T 15/08 (2013.01); H03M 7/3059 (2013.01); H03M 7/40 (2013.01)] | 14 Claims |
1. A method for encoding there-dimensional data, comprising:
encoding a first node, using a first encoding process, included in one of levels in an N-ary tree representing three-dimensional points, where N is greater than or equal to 2;
encoding a second node, using a second encoding process, included in one of levels in the N-ary tree; and
generating a bitstream including the first node encoded and the second node encoded, wherein
the first encoding process is different from the second encoding process,
a total number of one or more point positions in the first node is less than a predetermined threshold value,
one or more point positions in the first node are expressed using a first formula, and
one or more point positions in the second node are expressed using a second formula different from the first formula.
|