Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Computational geometry: an introduction
Computational geometry: an introduction
The C++ programming language
Algorithms
Experiments on traveling salesman heuristics
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Optimal Expected-Time Algorithms for Closest Point Problems
ACM Transactions on Mathematical Software (TOMS)
Expected time bounds for selection
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Divide-and-conquer in multidimensional space
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Topics in computational geometry.
Topics in computational geometry.
Ranger: a tool for nearest neighbor search in high dimensions
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A comparison of sequential Delaunay triangulation algorithms
Proceedings of the eleventh annual symposium on Computational geometry
Proceedings of the eleventh annual symposium on Computational geometry
Simulation-based approach to the warehouse location problem for a large-scale real instance
Proceedings of the 29th conference on Winter simulation
Approximate nearest neighbor queries in fixed dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Computational experience with an approximation algorithm on large-scale Euclidean matching instances
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
ICP Registration Using Invariant Features
IEEE Transactions on Pattern Analysis and Machine Intelligence
On a Nearest-Neighbor Problem Under Minkowski and Power Metrics for Large Data Sets
The Journal of Supercomputing - Special issue on computational issues in fluid dynamics optimization and simulation
Improved Large-Step Markov Chain Variants for the Symmetric TSP
Journal of Heuristics
On a Nearest-Neighbor Problem in Minkowski and Power Metrics
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Efficient Image Retrieval through Vantage Objects
VISUAL '99 Proceedings of the Third International Conference on Visual Information and Information Systems
Adapting k-d Trees to Visual Retrieval
VISUAL '99 Proceedings of the Third International Conference on Visual Information and Information Systems
K-D Trees Are Better when Cut on the Longest Side
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions
Journal of Experimental Algorithmics (JEA)
Embedded local search approaches for routing optimization
Computers and Operations Research
Finishing line scheduling in the steel industry
IBM Journal of Research and Development
Three-dimensional view-invariant face recognition using a hierarchical pose-normalization strategy
Machine Vision and Applications
Sizing sketches: a rank-based analysis for similarity search
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Multi-probe LSH: efficient indexing for high-dimensional similarity search
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
An Iterated Local Search Approach for Finding Provably Good Solutions for Very Large TSP Instances
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Modeling LSH for performance tuning
Proceedings of the 17th ACM conference on Information and knowledge management
Multi-dimensional Scale Saliency Feature Extraction Based on Entropic Graphs
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Indexing Multimodal Biometric Databases Using Kd-Tree with Feature Level Fusion
ICISS '08 Proceedings of the 4th International Conference on Information Systems Security
Distributed similarity search in high dimensions using locality sensitive hashing
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Spectral moving removal of non-isolated surface outlier clusters
Computer-Aided Design
PROMISE '09 Proceedings of the 5th International Conference on Predictor Models in Software Engineering
3D Signatures for Fast 3D Face Recognition
ICB '09 Proceedings of the Third International Conference on Advances in Biometrics
An efficient technique for indexing multimodal biometric databases
International Journal of Biometrics
An extended MD-tree with internal leaf for efficient management of moving objects
Journal of Computational Methods in Sciences and Engineering
Thread-based implementations of the false nearest neighbors method
Parallel Computing
Which landmark is useful?: learning selection policies for navigation in unknown environments
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
The traveling salesman: computational solutions for TSP applications
The traveling salesman: computational solutions for TSP applications
A chaining algorithm for mapping cDNA sequences to multiple genomic sequences
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Real-time Object Recognition in Sparse Range Images Using Error Surface Embedding
International Journal of Computer Vision
Fast feature selection and training for AdaBoost-based concept detection with large scale datasets
Proceedings of the international conference on Multimedia
Proceedings of the 2010 ACM workshop on Surreal media and virtual cloning
EuroMPI'10 Proceedings of the 17th European MPI users' group meeting conference on Recent advances in the message passing interface
Behavioral simulations in MapReduce
Proceedings of the VLDB Endowment
An iris retrieval technique based on color and texture
Proceedings of the Seventh Indian Conference on Computer Vision, Graphics and Image Processing
On enhancing scalability for distributed RDF/S stores
Proceedings of the 14th International Conference on Extending Database Technology
Fast outlier detection for very large log data
Expert Systems with Applications: An International Journal
MIDAS: multi-attribute indexing for distributed architecture systems
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Probabilistic near-duplicate detection using simhash
Proceedings of the 20th ACM international conference on Information and knowledge management
K-dimensional trees for continuous traffic classification
TMA'10 Proceedings of the Second international conference on Traffic Monitoring and Analysis
Balanced aspect ratio trees revisited
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
AIRS'11 Proceedings of the 7th Asia conference on Information Retrieval Technology
Locality-sensitive hashing scheme based on dynamic collision counting
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
A context-aware scheme for privacy-preserving location-based services
Computer Networks: The International Journal of Computer and Telecommunications Networking
Measuring two-event structural correlations on graphs
Proceedings of the VLDB Endowment
Interactive particle tracing in time-varying tetrahedral grids
EG PGV'11 Proceedings of the 11th Eurographics conference on Parallel Graphics and Visualization
Scalar quantization for large scale image search
Proceedings of the 20th ACM international conference on Multimedia
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Iterative, simulation-based shape modification by free-form deformation of the NC programs
Advances in Engineering Software
Proceedings of the International Conference on Computer-Aided Design
Application of density-based outlier detection to database activity monitoring
Information Systems Frontiers
Least square regularized spectral hashing for similarity search
Signal Processing
Topology preserving hashing for similarity search
Proceedings of the 21st ACM international conference on Multimedia
Searching similar segments over textual event sequences
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Locality sensitive hashing revisited: filling the gap between theory and algorithm analysis
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Scheduling sensors for monitoring sentient spaces using an approximate POMDP policy
Pervasive and Mobile Computing
| Hi-index | 0.00 |
A K-d tree represents a set of N points in K-dimensional space. Operations on a semidynamic tree may delete and undelete points, but may not insert new points. This paper shows that several operations that require &Ogr;(log N) expected time in general K-d trees may be performed in constant expected time in semidynamic trees. These operations include deletion, undeletion, nearest neighbor searching, and fixed-radius near neighbor searching (the running times of the first two are proved, while the last two are supported by experiments and heuristic arguments). Other new techniques can also be applied to general K-d trees: simple sampling reduces the time to build a tree from &Ogr;(KN log N) to &Ogr;(KN + N log N), and more advanced sampling builds a robust tree in the same time. The methods are straightforward to implement, and lead to a data structure that is significantly faster and less vulnerable to pathological inputs than ordinary K-d trees.