US 11,936,910 B2
Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device
Chi Wang, Singapore (SG); Pongsak Lasang, Singapore (SG); Chung Dean Han, Singapore (SG); and Toshiyasu Sugio, Osaka (JP)
Assigned to PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA, Torrance, CA (US)
Filed by Panasonic Intellectual Property Corporation of America, Torrance, CA (US)
Filed on Dec. 30, 2022, as Appl. No. 18/091,554.
Application 18/091,554 is a continuation of application No. 17/065,019, filed on Oct. 7, 2020, granted, now 11,575,936.
Application 17/065,019 is a continuation of application No. PCT/JP2019/015122, filed on Apr. 5, 2019.
Claims priority of provisional application 62/655,525, filed on Apr. 10, 2018.
Prior Publication US 2023/0141458 A1, May 11, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. H04N 19/597 (2014.01); H04N 19/103 (2014.01); H04N 19/136 (2014.01); H04N 19/91 (2014.01); H04N 19/96 (2014.01)
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
OG exemplary drawing
 
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.