CPC H04N 19/597 (2014.11) [H04N 19/119 (2014.11); H04N 19/46 (2014.11)] | 4 Claims |
1. A three-dimensional data encoding method, comprising:
encoding a plurality of divided data items to generate a plurality of encoded data items each corresponding to a respective one of the plurality of divided data items, the plurality of divided data items being included in a plurality of subspaces obtained by dividing a current space, the plurality of divided data items each including a three-dimensional point from among a plurality of three-dimensional points included in the current space; and
generating a bitstream,
wherein the encoding includes, for each of the plurality of divided data items, (i) encoding geometry information corresponding the three-dimensional point included in the divided data item to generate encoded geometry information for an encoded data item corresponding to the divided data item, and (ii) encoding attribute information corresponding to the geometry information to generate encoded attribute information for the encoded data item corresponding to the divided data item, and
wherein the bitstream includes, for each of the encoded data items, a combination of the encoded geometry information for the encoded data item and control information for encoded data item, the control information including (a) a first identifier indicating a subspace corresponding to the encoded data item from among the plurality of subspaces, and (b) a second identifier indicating a divided data item corresponding to the encoded data item from among the plurality of divided data items.
|