Browse > Article
http://dx.doi.org/10.7848/ksgpc.2013.31.1.41

Design of Memory-Efficient Octree to Query Large 3D Point Cloud  

Han, Soohee (경일대학교 위성정보공학과)
Publication Information
Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography / v.31, no.1, 2013 , pp. 41-48 More about this Journal
Abstract
The aim of the present study is to design a memory-efficient octree for querying large 3D point cloud. The aim has been fulfilled by omitting variables for minimum bounding hexahedral (MBH) of each octree node expressed in C++ language and by passing the re-estimated MBH from parent nodes to child nodes. More efficiency has been reported by two-fold processes of generating pseudo and regular trees to declare an array for all anticipated nodes, instead of using new operator to declare each child node. Experiments were conducted by constructing tree structures and querying neighbor points out of real point cloud composed of more than 18 million points. Compared with conventional methods using MBH information defined in each node, the suggested methods have proved themselves, in spite of existing trade-off between speed and memory efficiency, to be more memory-efficient than the comparative ones and to be practical alternatives applicable to large 3D point cloud.
Keywords
LiDAR; 3D Point Cloud; Query; Octree;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Cho, H., Cho, W., Park, J. and Song, N. (2008), 3D building modeling using aerial LiDAR data, Korean Journal of Remote Sensing, Vol. 24, pp. 141-152.   과학기술학회마을   DOI
2 Han, S., Lee, S., Kim, S. P., Kim, C., Heo, J. and Lee, H. (2011), A Comparison of 3D R-tree and octree to index large point clouds from a 3D terrestrial laser lcanner, Korean Journal of Geomatics, Vol. 29, No. 1, pp. 531-537.
3 Han, S., Kim, S., Jung, J. H., Kim, C., Yu, K. and Heo, J. (2012), Development of a hashing-based data structure for the fast retrieval of 3D terrestrial laser scanned data, Computers & Geosciences, Vol. 39, pp. 1-10.   DOI   ScienceOn
4 Marechal, L. (2009), Advances in octree-based allhexahedral mesh generation: handling sharp features, 18th International Meshing Roundtable, Salt Lake City, UT, USA, pp. 65-84.
5 Saxena, M., Finnigan, P. M., Graichen, C. M., Hathaway, A. F. and Parthasarathy, V. N. (1995), Octree-based automatic mesh generation for non-manifold domains, Engineering with Computers, Vol. 11, pp. 1-14.   DOI
6 Schnabel, R., Wahl, R., and Klein, R. (2007), Efficient RANSAC for point-cloud shape detection, Computer Graphics Forum, Vol. 26, pp. 214-226.   DOI   ScienceOn
7 Wang, M., Tseng and Y.-H. (2004), Lidar data segmentation and classification based on octree structure, XXth ISPRS Congress, ISPRS, Istanbul, Turkey.
8 Woo, H. ,Kang, E., Wang, S. and Lee, K. H. (2002), A new segmentation method for point cloud data. International Journal of Machine Tools and Manufacture, Vol. 42, pp. 167-178.   DOI   ScienceOn
9 Wikipedia (2010), Schematic drawing of an octree, a data structure of computer science, Wikimedia Foundation, Inc., URL: http://en.wikipedia.org/wiki/Octree (last date accessed: 20 January 2013).
10 Wikipedia (2012), C dynamic memory allocation, Wikimedia Foundation, Inc., URL: http://en.wikipedia.org/wiki/C_dynamic_memory_allocation (last date accessed: 20 January 2013).