
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Michael Connor, Piyush Kumar, "Fast Construction of kNearest Neighbor Graphs for Point Clouds," IEEE Transactions on Visualization and Computer Graphics, vol. 16, no. 4, pp. 599608, July/August, 2010.  
BibTex  x  
@article{ 10.1109/TVCG.2010.9, author = {Michael Connor and Piyush Kumar}, title = {Fast Construction of kNearest Neighbor Graphs for Point Clouds}, journal ={IEEE Transactions on Visualization and Computer Graphics}, volume = {16}, number = {4}, issn = {10772626}, year = {2010}, pages = {599608}, doi = {http://doi.ieeecomputersociety.org/10.1109/TVCG.2010.9}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Visualization and Computer Graphics TI  Fast Construction of kNearest Neighbor Graphs for Point Clouds IS  4 SN  10772626 SP599 EP608 EPD  599608 A1  Michael Connor, A1  Piyush Kumar, PY  2010 KW  Nearest neighbor searching KW  pointbased graphics KW  knearest neighbor graphics KW  Morton ordering KW  parallel algorithms. VL  16 JA  IEEE Transactions on Visualization and Computer Graphics ER   
[1] M. Alexa, J. Behr, D. CohenOr, S. Fleishman, D. Levin, and C.T. Silva, "Point Set Surfaces," Proc. IEEE Conf. Visualization (VIS '01), pp. 2128, 2001.
[2] S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman, and A. Wu, "An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions," J. ACM, vol. 45, no. 6, pp. 891923, 1998.
[3] M. Bern, "Approximate ClosestPoint Queries in High Dimensions," Information Processing Letters, vol. 45, no. 2, pp. 9599, 1993.
[4] P.B. Callahan and S.R. Kosaraju, "A Decomposition of Multidimensional Point Sets with Applications to KNearestNeighbors and NBody Potential Fields," J. ACM, vol. 42, no. 1, pp. 6790, 1995.
[5] T.M. Chan, "Approximate Nearest Neighbor Queries Revisited," Proc. 13th Ann. Symp. Computational Geometry (SCG '97), pp. 352358, 1997.
[6] T.M. Chan, "A Minimalist's Implementation of an Approximate Nearest Neighbor Algorithm in Fixed Dimensions," to be published.
[7] J. Chhugani, B. Purnomo, S. Krishnan, J. Cohen, S. Venkatasubramanian, and D.S. Johnson, "vLOD: HighFidelity Walkthrough of Large Virtual Environments," IEEE Trans. Visualization and Computer Graphics, vol. 11, no. 1, pp. 3547, Jan./Feb. 2005.
[8] U. Clarenz, M. Rumpf, and A. Telea, "Finite Elements on Point Based Surfaces," Proc. Eurographics Symp. Point Based Graphics (SPBG '04), pp. 201211, 2004.
[9] K.L. Clarkson, "Fast Algorithms for the All Nearest Neighbors Problem," Proc. 24th Symp. Foundations of Computer Science (FOCS '83), included in PhD thesis, Nov. 1983.
[10] K.L. Clarkson, "NearestNeighbor Searching and Metric Space Dimensions," NearestNeighbor Methods for Learning and Vision: Theory and Practice, G. Shakhnarovich, T. Darrell, and P. Indyk, eds., pp. 1559, MIT Press, 2006.
[11] D. Cotting, T. Weyrich, M. Pauly, and M. Gross, "Robust Watermarking of PointSampled Geometry," Proc. Shape Modeling Int'l (SMI '04), pp. 233242, 2004.
[12] M.T. Dickerson and D. Eppstein, "Algorithms for Proximity Problems in Higher Dimensions," Computational Geometry Theory and Applications, vol. 5, no. 5, pp. 277291, Jan. 1996.
[13] S. Fleishman, D. CohenOr, and C.T. Silva, "Robust Moving LeastSquares Fitting with Sharp Features," ACM Trans. Graphics, vol. 24, no. 3, pp. 544552, 2005.
[14] M. Frigo, C.E. Leiserson, H. Prokop, and S. Ramachandran, "CacheOblivious Algorithms," Proc. 40th Ann. Symp. Foundations of Computer Science (FOCS '99), pp. 285298, 1999.
[15] D.R. Karger and M. Ruhl, "Finding Nearest Neighbors in GrowthRestricted Metrics," Proc. 34th Ann. ACM Symp. Theory of Computing (STOC '02), pp. 741750, 2002.
[16] S. Liao, M.A. Lopez, and S.T. Leutenegger, "High Dimensional Similarity Search with Space Filling Curves," Proc. 17th Int'l Conf. Data Eng., pp. 615622, 2001.
[17] M.D. Lieberman, J. Sankaranarayanan, and H. Samet, "A Fast Similarity Join Algorithm Using Graphics Processing Units," Proc. IEEE 24th Int'l Conf. Data Eng. (ICDE '08), pp. 11111120, 2008.
[18] N.J. Mitra and A. Nguyen, "Estimating Surface Normals in Noisy Point Cloud Data," Proc. 19th Ann. Symp. Computational Geometry (SCG '03), pp. 322328, 2003.
[19] G.M. Morton, "A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing," technical report, IBM Ltd., 1966.
[20] D. Mount, "ANN: Library for Approximate Nearest Neighbor Searching," http://www.cs.umd.edu/mountANN/, 1998.
[21] N. Nethercote and J. Seward, "Valgrind: A Framework for Heavyweight Dynamic Binary Instrumentation," Proc. 2007 ACM SIGPLAN Conf. Programming Language Design and Implementation (PLDI '07), pp. 89100, 2007.
[22] J.A. Orenstein and T.H. Merrett, "A Class of Data Structures for Associative Searching," Proc. Third ACM SIGACTSIGMOD Symp. Principles of Database Systems (PODS '84), pp. 181190, 1984.
[23] R. Pajarola, "StreamProcessing Points," Proc. IEEE Visualization 2005, pp. 239246, 2005.
[24] M. Pauly, M. Gross, and L.P. Kobbelt, "Efficient Simplification of PointSampled Surfaces," Proc. Conf. Visualization (VIS '02), pp. 163170, 2002.
[25] M. Pauly, R. Keiser, L.P. Kobbelt, and M. Gross, "Shape Modeling with PointSampled Geometry," ACM Trans. Graphics, vol. 22, no. 3, pp. 641650, 2003.
[26] J. Sankaranarayanan, H. Samet, and A. Varshney, "A Fast All Nearest Neighbor Algorithm for Applications Involving Large PointClouds," Computers and Graphics, vol. 31, no. 2, pp. 157174, 2007.
[27] H. Tropf and H. Herzog, "Multidimensional Range Search in Dynamically Balanced Trees," Angewandte Informatik, vol. 2, pp. 7177, 1981.
[28] P. Tsigas and Y. Zhang, "A Simple, Fast Parallel Implementation of Quicksort and Its Performance Evaluation on SUN Enterprise 10000," Proc. 11th Euromicro Conf. Parallel, Distributed and NetworkBased Processing, pp. 372381, 2003.
[29] P.M. Vaidya, "An $O(n \;{\rm log}\; n)$ Algorithm for the AllNearestNeighbors Problem," Discrete and Computational Geometry, vol. 4, no. 2, pp. 101115, 1989.