Massive Point Cloud Space Management Method Based on Octree-Like Encoding

Based on the mass point cloud data, this paper proposes a hybrid octree mixing point cloud index structure which combines the KD-tree spatial segmentation idea to realize the efficient management of mass point cloud. In this paper, the space of the point cloud is firstly divided by the KD-tree idea....

Full description

Saved in:
Bibliographic Details
Published inArabian journal for science and engineering (2011) Vol. 44; no. 11; pp. 9397 - 9411
Main Authors Lu, Bin, Wang, Qiang, Li, A’Nan
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2019
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN2193-567X
1319-8025
2191-4281
DOI10.1007/s13369-019-03968-7

Cover

More Information
Summary:Based on the mass point cloud data, this paper proposes a hybrid octree mixing point cloud index structure which combines the KD-tree spatial segmentation idea to realize the efficient management of mass point cloud. In this paper, the space of the point cloud is firstly divided by the KD-tree idea. On this basis, the octree is used for further segmentation to establish an octree-like index structure. Then the point cloud dataset is spatially encoded using the improved encoding to achieve better spatial management and neighborhood search. Finally, using five groups of incremented point cloud set as test data, the experimental results and comparison analysis show that the octree-like space can make the overall structure of the data organization more reasonable, effectively improve the access efficiency and reduce the occupancy of memory space. The index structure not only improves the speed of the traditional KD-tree construction index but also improves the problem that the traditional octree is too large for space occupation and the neighborhood search takes too long. It achieves reasonable management of massive point cloud space.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2193-567X
1319-8025
2191-4281
DOI:10.1007/s13369-019-03968-7