Paper
19 March 2013 An algorithm of fast index constructing and neighbor searching for 3D LiDAR data
Author Affiliations +
Proceedings Volume 8762, PIAGENG 2013: Intelligent Information, Control, and Communication Technology for Agricultural Engineering; 87620Y (2013) https://doi.org/10.1117/12.2019658
Event: Third International Conference on Photonics and Image in Agriculture Engineering (PIAGENG 2013), 2013, Sanya, China
Abstract
As the 3D point-cloud data increase greatly with the development of data acquisition technology, it is an important prerequisite to establish an efficient index constructing and neighbor searching algorithm for point-cloud in data processing. In this paper, an efficient algorithm of index constructing and neighbor searching for 3D LiDAR data was proposed based on the combination of 3D grid, linear octree and Hash table. An experiment was conducted about the 3D LiDAR data and the result shows that the proposed method has higher efficiency of data index constructing and neighbor searching for 3D point-cloud acquired by mobile LiDAR.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
YiCong Feng, MinYi Cen, and TongGang Zhang "An algorithm of fast index constructing and neighbor searching for 3D LiDAR data", Proc. SPIE 8762, PIAGENG 2013: Intelligent Information, Control, and Communication Technology for Agricultural Engineering, 87620Y (19 March 2013); https://doi.org/10.1117/12.2019658
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
LIDAR

Data acquisition

3D acquisition

3D modeling

Data modeling

Binary data

Algorithm development

Back to Top