Computational geometry: an introduction
Computational geometry: an introduction
A sparse graph almost as good as the complete graph on points in K dimensions
Discrete & Computational Geometry
Construction of multidimensional spanner graphs, with applications to minimum spanning trees
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Euclidean minimum spanning trees and bichromatic closest pairs
Discrete & Computational Geometry
An optimal algorithm for intersecting three-dimensional convex polyhedra
SIAM Journal on Computing
Ray shooting and parametric search
SIAM Journal on Computing
Approximate closest-point queries in high dimensions
Information Processing Letters
An algorithm for approximate closest-point queries
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Proceedings of the eleventh annual symposium on Computational geometry
New Techniques for Exact and Approximate Dynamic Closest-point
SIAM Journal on Computing
Approximate nearest neighbor queries in fixed dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Faster algorithms for some geometric graph problems in higher dimensions
SODA '93 Proceedings of the fourth 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 neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Lower bounds for high dimensional nearest neighbor search and related problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Expected-case complexity of approximate nearest neighbor searching
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Similarity Search in High Dimensions via Hashing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Approximate k -Closest-Pairs with Space Filling Curves
DaWaK 2000 Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery
Energy Optimal Routing in Radio Networks Using Geometric Data Structures
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
An Empirical Study of a New Approach to Nearest Neighbor Searching
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
A strong lower bound for approximate nearest neighbor searching
Information Processing Letters
Outlier Mining in Large High-Dimensional Data Sets
IEEE Transactions on Knowledge and Data Engineering
An approximate algorithm for top-k closest pairs join query in large high dimensional data
Data & Knowledge Engineering
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
kANN on the GPU with shifted sorting
EGGH-HPG'12 Proceedings of the Fourth ACM SIGGRAPH / Eurographics conference on High-Performance Graphics
Indexing methods for moving object databases: games and other applications
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.00 |