By Topic

Point cloud data reduction methods of octree-based coding and neighborhood search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Qing Xie ; Sch. of Comput. Sci. & Technol., Guizhou Univ., Guiyang, China ; Xiaoyao Xie

Laser scanning technology makes it easy to obtain high accuracy and speed of the surface of the part model information. The amount of data generated is enormous, and therefore need to be streamlined. Based on the reverse engineering point cloud data pretreatment, analyzes the existing data streamline method, this paper puts forward a kind of insufficient based on spatial octree non-uniform grid and combining the neighborhood search algorithm. By octree record division process, thus make neighborhood search method are confined to sampling the bounding box and around where the bounding box. A large number of real data results show that: the algorithm can improve the quality of search neighboring points, and ultimately achieve the good effect of the streamlining.

Published in:

Electronic and Mechanical Engineering and Information Technology (EMEIT), 2011 International Conference on  (Volume:7 )

Date of Conference:

12-14 Aug. 2011