A fast all nearest neighbor algorithm for applications involving large point-clouds

Computers and Graphics (Pergamon)

Volumn 31, Issue 2, 2007, Pages 157-174

  Sankaranarayanan, Jagan ^a   Samet, Hanan ^a   Varshney, Amitabh ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

All nearest neighbor algorithm; Disk based data structures; Incremental neighbor finding algorithm; k Nearest neighbors; kNN Algorithm; Locality; Neighbor finding; Neighborhood; Point cloud graphics; Point cloud operations

Indexed keywords

COMPUTATIONAL METHODS; DATA STORAGE EQUIPMENT; MAGNETIC DISK STORAGE; SCANNING;

DISK BASED DATA STRUCTURES; INCREMENTAL NEIGHBOR FINDING ALGORITHMS; K NEAREST NEIGHBORS; KNN ALGORITHM; NEAREST NEIGHBOR ALGORITHM; NEIGHBOR FINDING; POINT CLOUD OPERATIONS;

ALGORITHMS;

EID: 34047112206     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cag.2006.11.011     Document Type: Article

References (37)

1. Andersson M, Giesen J, Pauly M, Speckmann B. Bounds on the k-neighborhood for locally uniformly sampled surfaces. In: Proceedings of the eurographics symposium on point-based graphics, Zurich, Switzerland; 2004. p. 167-71.
2. Hoppe H, DeRose T, Duchamp T, McDonald J, Stuetzle W. Surface reconstruction from unorganized points. In: Proceedings of the SIGGRAPH'92 conference. Chicago, IL: ACM Press; 1992. p. 71-8.
3. Jones TR, Durand F, Desbrun M. Noniterative, feature-preserving mesh smoothing. In: Proceedings of the SIGGRAPH'03 conference, vol. 22(3). San Diego, CA: ACM Press; 2003. p. 943-49.
4. Levoy M, Pulli K, Curless B, Rusinkiewicz S, Koller D, Pereira L, Ginzton M, Anderson S, Davis J, Ginsberg J, Shade J, Fulk D. The digital Michelangelo project: 3D scanning of large statues. In: Proceedings of the SIGGRAPH'00 conference, New Orleans, LA: ACM Press; 2000. p. 131-44.
5. Pauly M., Keiser R., Kobbelt L.P., and Gross M. Shape modeling with point-sampled geometry. ACM Trans. Graph. 22 3 (2003) 641-650
6. Clarkson KL. Fast algorithm for the all nearest neighbors problem. In: Proceedings of the 24th IEEE annual symposium on foundations of computer science, Tucson, AZ, 1983, p. 226-32.
7. Vaidya P.M. An O (n log n) algorithm for the all-nearest-neighbor problem. Discrete and Computational Geometry 4 1 (1989) 101-115
8. Samet H. Foundations of Multidimensional and Metric Data Structures, Morgan-Kaufmann, San Francisco, CA, 2006.
9. Guttman A. R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD'84 conference. Boston, MA: ACM Press; 1984. p. 47-57.
10. Hjaltason G.R., and Samet H. Distance browsing in spatial databases. ACM Transactions on Database Systems 24 2 (1999) 265-318
11. Roussopoulos N, Kelley S, Vincent F. Nearest neighbor queries. In: Proceedings of the ACM SIGMOD'95 conference. San Jose, CA: ACM Press; 1995. p. 71-9.
12. Mount DM, Arya S. ANN: a library for approximate nearest neighbor searching. In: Proceedings of the second annual center for geometric computing workshop on computational geometry, electronic edn., Durham, NC, 1997. URL 〈http://www.cs.duke.edu/CGC/workshop97.html〉.
13. Fleishman S, Drori I, Cohen-Or D. Bilateral mesh denoising. In: Proceedings of the SIGGRAPH'03 conference, vol. 22(3). San Diego, CA: ACM Press; 2003. p. 950-3.
14. Weyrich T, Pauly M, Heinzle S, Keiser R, Scandella S. Post-processing of scanned 3d surface data. In: Proceedings of eurographics symposium on point-based graphics 2004, Eurographics Association, Aire-La- Ville, Switzerland, 2004. p. 85-94.
15. Mitra NJ, Nguyen A. Estimating surface normals in noisy point cloud data. In: Proceedings of the 19th ACM symposium on computational geometry. San Diego, CA: ACM Press; 2003. p. 322-8.
16. Bentley J.L. Multidimensional binary search trees used for associative searching. Communications of the ACM 18 9 (1975) 509-517
17. Arya S, Mount DM, Netanyahu NS, Silverman R, Wu A. An optimal algorithm for approximate nearest neighbor searching. In: Proceedings of the 5th annual ACM-SIAM symposium on discrete algorithms. Arlington, VA, 1994. p. 573-82 (also Journal of the ACM 1998;45(6):891-923).
18. Xia C, Lu J, Ooi BC, Hu J. GORDER: an efficient method for KNN join processing. In: VLDB'04: Proceedings of the 30th international conference on very large data bases. Toronto, Canada: Morgan Kaufmann; 2004. p. 756-67.
19. Böhm C, Krebs F. The k-nearest neighbor join: Turbo charging the KDD process. In: Knowledge and information systems (KAIS), vol. 6. London, UK: Springer; 2004. p. 728-49.
20. Berchtold S, Böhm C, Keim DA, Kriegel H-P. A cost model for nearest neighbor search in high-dimensional data space. In: Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems (PODS). Tucson, AZ, 1997. p. 78-86.
21. Böhm C, Krebs F. Supporting KDD applications by the k-nearest neighbor join. In: Proceedings of international conference on database and expert systems applications (DEXA), Lecture Notes in Computer Science, Vol. 2736. Springer, Prague, Czech Republic, 2003. p. 504-16.
22. Ullman JD, Garcia-Molina H, Widom J. Database systems: the complete book, Upper Saddle River, NJ: Prentice Hall PTR; 2001.
23. Roussopoulos N, Leifker D. Direct spatial search on pictorial databases using packed R-trees. In: Proceedings of the ACM SIGMOD conference, Austin, TX, 1985. p. 17-31.
24. Floater M.S., and Reimers M. Meshless parameterization and surface reconstruction. Computer Aided Geometric Design 18 2 (2001) 77-92
25. Murio D.A. The mollification method and the numerical solutions of Ill-posed problems (1993), Wiley, New York, NY
26. Cook RL. Shade trees. In: Proceedings of the SIGGRAPH'84 conference. New York, NY: ACM Press; 1984. p. 223-31.
27. Blinn JF. Simulation of wrinkled surfaces. In: Proceedings of the SIGGRAPH'78 conference. Atlanta, GA: ACM Press; 1978. p. 286-92.
28. Alexa M, Behr J, Cohen-Or D, Fleishman S, Levin D, Silva CT. Point set surfaces. In: VIS'01: Proceedings of the conference on visualization '01. San Diego, CA: IEEE Computer Society; 2001. p. 21-8.
29. Weisstein EW. Box-Muller Transformation, Math World-A Wolfram Web Resource, Champaign, IL, 1999, 〈http://mathworld.wolfram.com/Box-MullerTransformation.html〉.
30. Sebastian TB, Kimia BB. Metric-based shape retrieval in large databases. In: Kasturi R, Laurendau D, Suen C, editors. Proceedings of the 16th international conference on pattern recognition, vol. 3, Quebec City, Canada: IEE Computer Society; 2002. p. 291-6.
31. Turk G. Generating textures on arbitrary surfaces using reaction-diffusion. In: Proceedings of the SIGGRAPH'91 conference. Las Vegas, NV: ACM Press; 1991. p. 289-98.
32. Garland M, Heckbert P. Surface simplification using quadratic error metrics. In: Proceedings of the SIGGRAPH'97 conference. Los Angeles, CA: ACM Press; 1997. p. 209-16.
33. Pauly M, Gross M, Kobbelt LP. Efficient simplification of point sampled surfaces. In: VIS'02: Proceedings of the conference on visualization'02. Boston, MA: IEEE Computer Society; 2002. p. 163-70.
34. Luebke D, Reddy M, Cohen J, Varshney A, Watson B, Huebner R. Level of detail for 3D graphics. San Francisco, CA: Morgan Kaufmann; 2003.
35. Lloyd S. Least squares quantization in PCM. IEEE Transactions on Visualization and Computer Graphics 28 2 (1982) 129-137
36. Datar M, Immorlica N, Indyk P, Mirrokni VS. Locality-sensitive hashing scheme based on p-stable distributions. In: SCG 04: Proceedings of the twentieth annual symposium on computational geometry, Brooklyn, NY, 2004. p. 253-62.
37. Schroeder W., Martin K., and Lorensen B. Visualization toolkit (1996), Prentice-Hall, Englewood Cliffs, NJ