Computational geometry: an introduction
Computational geometry: an introduction
An O(n log n) algorithm for the all-nearest-neighbors problem
Discrete & Computational Geometry
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Quasi-optimal range searching in spaces of finite VC-dimension
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
K-d trees for semidynamic point sets
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Point location in fat subdivisions
Information Processing Letters
Algorithms for dynamic closest pair and n-body potential fields
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An optimal algorithm for approximate nearest neighbor searching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximate nearest neighbor queries revisited
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Improved algorithms for robust point pattern matching and applications to image registration
Proceedings of the fourteenth annual symposium on Computational geometry
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The analysis of a simple k-means clustering algorithm
Proceedings of the sixteenth annual symposium on Computational geometry
Probabilistic proximity search: fighting the curse of dimensionality in metric spaces
Information Processing Letters
VQ-index: an index structure for similarity searching in multimedia databases
Proceedings of the tenth ACM international conference on Multimedia
New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
K-D Trees Are Better when Cut on the Longest Side
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Region proximity in metric spaces and its use for approximate similarity search
ACM Transactions on Information Systems (TOIS)
Probabilistic proximity searching algorithms based on compact partitions
Journal of Discrete Algorithms - SPIRE 2002
Dynamic algorithms for approximating interdistances
Nordic Journal of Computing
High dimensional nearest neighbor searching
Information Systems
Pattern matching using the Hausdorff distance
AIKED'05 Proceedings of the 4th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering Data Bases
Pattern matching using the Hausdorff distance
AMCOS'05 Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science
Dynamic algorithms for approximating interdistances
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Approximate range searching in external memory
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Balanced aspect ratio trees revisited
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Redundant bit vectors for quickly searching high-dimensional regions
Proceedings of the First international conference on Deterministic and Statistical Methods in Machine Learning
| Hi-index | 0.00 |