Efficient K -nearest neighbors searching algorithms for unorganized cloud points

Proceedings of the World Congress on Intelligent Control and Automation (WCICA)

Volumn , Issue , 2008, Pages 8501-8505

  Yuan, Xia ^a   Guo, Ling ^a   Wang, Jianyu ^a   Zhao, Chunxia ^a  

^a NANJING UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

K nearest neighbor; Morton code; Single axes; Unorganized cloud points

Indexed keywords

3-D SPACE; CLOUD POINTS; CONTROL AND AUTOMATION; HIGH-EFFICIENCY; K-NEAREST NEIGHBOR; K-NEAREST NEIGHBORS; MORTON-CODE; SEARCHING ALGORITHMS; SEARCHING SPACES; SINGLE AXES; UNORGANIZED CLOUD; UNORGANIZED CLOUD POINTS;

CLASSIFICATION (OF INFORMATION); CODES (STANDARDS); CODES (SYMBOLS); INDUSTRIAL ENGINEERING; INTELLIGENT CONTROL; LEARNING SYSTEMS; OBJECT RECOGNITION; TOOLS;

ALGORITHMS;

EID: 52149089912     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCICA.2008.4594264     Document Type: Conference Paper

References (7)

1. Hoppe H, DeRose T, Duchamp T. Surface Reconstruction from Unorganized Points [J]. ACM Proceedings of Siggraph, 1992, 26(2) :71-78.
2. Goodsell G. On finding p2th nearest neighbors of scattered points in two dimensions for small p [J]. Computer Aided Geometric Design , 2000 , 17 (4) : 387-392
3. Dickerson M T , Drysdale R L S , Sack J R. Simple algorithms for enumerating interpoint distances and finding k nearest neighbors [J]. International Journal of Computational Geometry and Applications 1992 , 2 (3) : 221-239
4. Chinese source
5. Chinese source
6. Xiaotian Yan, Fang Meng, Hongbin Zha. Fan-Meshes: A Geometric Primitive for Point-based Description of 3D Models and Scenes. Proceedings of the 2nd International Symposium on 3D Data Processing, Visualization and Transmission (3DPVT'04).
7. J. Lalonde. Data Structure for Efficient Dynamic Processing in 3-D. master's thesis, tech. report CMU-RI-TR-06-22, Robotics Institute, Carnegie Mellon University, May, 2006.