An O(n log n) algorithm for the all-nearest-neighbors problem
Discrete & Computational Geometry
Generating textures on arbitrary surfaces using reaction-diffusion
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
A cost model for nearest neighbor search in high-dimensional data space
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An optimal algorithm for approximate nearest neighbor searching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Direct spatial search on pictorial databases using packed R-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
The digital Michelangelo project: 3D scanning of large statues
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Multidimensional binary search trees used for associative searching
Communications of the ACM
Meshless parameterization and surface reconstruction
Computer Aided Geometric Design
Simulation of wrinkled surfaces
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
Database Systems: The Complete Book
Database Systems: The Complete Book
Proceedings of the conference on Visualization '01
Efficient simplification of point-sampled surfaces
Proceedings of the conference on Visualization '02
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Estimating surface normals in noisy point cloud data
Proceedings of the nineteenth annual symposium on Computational geometry
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Metric-Based Shape Retrieval in Large Databases
ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 3 - Volume 3
Level of Detail for 3D Graphics
Level of Detail for 3D Graphics
Shape modeling with point-sampled geometry
ACM SIGGRAPH 2003 Papers
Non-iterative, feature-preserving mesh smoothing
ACM SIGGRAPH 2003 Papers
ACM SIGGRAPH 2003 Papers
Locality-sensitive hashing scheme based on p-stable distributions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
The k-Nearest Neighbour Join: Turbo Charging the KDD Process
Knowledge and Information Systems
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Gorder: an efficient method for KNN join processing
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Least squares quantization in PCM
IEEE Transactions on Information Theory
Post-processing of scanned 3D surface data
SPBG'04 Proceedings of the First Eurographics conference on Point-Based Graphics
Bounds on the k-neighborhood for locally uniformly sampled surfaces
SPBG'04 Proceedings of the First Eurographics conference on Point-Based Graphics
Hit Miss Networks with Applications to Instance Selection
The Journal of Machine Learning Research
Addressing the problems of data-centric physiology-affect relations modeling
Proceedings of the 15th international conference on Intelligent user interfaces
Fast Approximate kNN Graph Construction for High Dimensional Data via Recursive Lanczos Bisection
The Journal of Machine Learning Research
An efficient algorithm to find k-nearest neighbors in flocking behavior
Information Processing Letters
Scalable algorithms for large high-resolution terrain data
Proceedings of the 1st International Conference and Exhibition on Computing for Geospatial Research & Application
Optimizing all-nearest-neighbor queries with trigonometric pruning
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
A new region growing algorithm for triangular mesh recovery from scattered 3D points
Transactions on edutainment VI
Spatial queries with two kNN predicates
Proceedings of the VLDB Endowment
Parallel construction of k-nearest neighbor graphs for point clouds
SPBG'08 Proceedings of the Fifth Eurographics / IEEE VGTC conference on Point-Based Graphics
GeoWhiz: toponym resolution using common categories
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
SAC: semantic adaptive caching for spatial mobile applications
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Structured toponym resolution using combined hierarchical place categories
Proceedings of the 7th Workshop on Geographic Information Retrieval
PhotoStand: a map query interface for a database of news photos
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollification, and noise removal. All of these primitive operations require the seemingly repetitive process of finding the k nearest neighbors (kNNs) of each point. These algorithms are primarily designed to run in main memory. However, rapid advances in scanning technologies have made available point-cloud models that are too large to fit in the main memory of a computer. This calls for more efficient methods of computing the kNNs of a large collection of points many of which are already in close proximity. A fast kNN algorithm is presented that makes use of the locality of successive points whose k nearest neighbors are sought to reduce significantly the time needed to compute the neighborhood needed for the primitive operation as well as enable it to operate in an environment where the data is on disk. Results of experiments demonstrate an order of magnitude improvement in the time to perform the algorithm and several orders of magnitude improvement in work efficiency when compared with several prominent existing methods.