US 11,882,317 B2
Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device
Toshiyasu Sugio, Osaka (JP); and Tatsuya Koyama, Kyoto (JP)
Filed by Panasonic Intellectual Property Corporation of America, Torrance, CA (US)
Filed on Nov. 17, 2021, as Appl. No. 17/528,771.
Application 17/528,771 is a continuation of application No. 16/985,565, filed on Aug. 5, 2020, granted, now 11,212,558.
Application 16/985,565 is a continuation of application No. PCT/JP2019/004346, filed on Feb. 7, 2019.
Claims priority of provisional application 62/627,891, filed on Feb. 8, 2018.
Prior Publication US 2022/0078490 A1, Mar. 10, 2022
Int. Cl. H04N 19/96 (2014.01); H04N 19/107 (2014.01); H04N 19/149 (2014.01); H04N 19/152 (2014.01); H04N 19/91 (2014.01); G06T 9/40 (2006.01)
CPC H04N 19/96 (2014.11) [G06T 9/40 (2013.01); H04N 19/107 (2014.11); H04N 19/149 (2014.11); H04N 19/152 (2014.11); H04N 19/91 (2014.11)] 15 Claims
OG exemplary drawing
1. A method for encoding three-dimensional data, comprising:
obtaining data with respect to three-dimensional points;
generating an N-ary tree structure representing the three-dimensional points, where N is an integer greater than or equal to 2;
determining referenceable nodes for a current node included in the N-ary tree structure;
generating first information with respect to the determined referenceable nodes; and
encoding the current node referring to neighboring nodes, each of the neighboring nodes being included in the determined referenceable nodes and neighboring the current node in one of a first axis direction, a second axis direction, and a third axis direction,
wherein when the first information indicates a first value, only neighboring nodes located inside a parent node of the current node are determined as the referenceable nodes.