CPC G06T 9/40 (2013.01) [G06T 9/00 (2013.01); H04N 19/17 (2014.11); G06T 17/00 (2013.01); G06T 17/005 (2013.01); G06T 2200/04 (2013.01); G06T 2207/10028 (2013.01); G06T 2207/20021 (2013.01); H04N 2007/243 (2013.01); H04N 13/161 (2018.05); H04N 19/96 (2014.11); H04N 21/23614 (2013.01); H04N 21/8146 (2013.01); H04N 21/816 (2013.01)] | 14 Claims |
1. A three-dimensional data encoding method comprising:
encoding three-dimensional points each located in any one of a plurality of regions, on a per region basis, to generate encoded three-dimensional points;
generating connectivity information generated based on a relationship between a first region among the plurality of regions and second regions aside from the first region among the plurality of regions, the connectivity information including (i) tile information indicating values each uniquely assigned to a different one of the plurality of regions and (ii) relation information indicating that the first region and one of the second regions are related; and
generating a bitstream including the connectivity information generated and the encoded three-dimensional points;
wherein the generating of the connectivity information includes:
determining which predetermined group among predetermined groups each of the second regions belongs to based on the relationship; and
generating the connectivity information including group information indicating each predetermined group that is determined.
|