Cutting hyperplane arrangements
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Quasi-optimal upper bounds for simplex range searching and new zone theorems
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Ray shooting and parametric search
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Approximate submatrix matching problems
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Relative neighborhood graphs in three dimensions
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Ray shooting in convex polytopes
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Geometric partitioning made easier, even in parallel
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Vertical decompositions for triangles in 3-space
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Constructing levels in arrangements and higher order Voronoi diagrams
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
New techniques for exact and approximate dynamic closest-point problems
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Efficient NC algorithms for set cover with applications to learning and geometry
Proceedings of the 30th IEEE symposium on Foundations of computer science
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Automatic reconstruction of surfaces and scalar fields from 3D scans
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Two algorithms for nearest-neighbor search in high dimensions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Locality-preserving hashing in multidimensional spaces
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficient search for approximate nearest neighbor in high dimensional spaces
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Degenerate convex hulls on-line in any fixed dimension
Proceedings of the fourteenth annual symposium on Computational geometry
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
Ray shooting amidst convex polytopes in three dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Approximate nearest neighbor queries in fixed dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Data structures and algorithms for nearest neighbor search in general metric spaces
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
Tighter bounds for nearest neighbor search and related problems in the cell probe model
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Linear programming queries revisited
Proceedings of the sixteenth annual symposium on Computational geometry
Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Dimensionality reduction techniques for proximity problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Reductions among high dimensional proximity problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Exact L∞ nearest neighbor search in high dimensions
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Approximate nearest neighbor algorithms for Frechet distance via product metrics
Proceedings of the eighteenth annual symposium on Computational geometry
Improved construction of vertical decompositions of three-dimensional arrangements
Proceedings of the eighteenth annual symposium on Computational geometry
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computational Discrete Mathematics
Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Tighter lower bounds for nearest neighbor search and related problems in the cell probe model
Journal of Computer and System Sciences - Special issue on STOC 2000
Approximate Nearest Neighbor under edit distance via product metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Almost tight upper bounds for vertical decompositions in four dimensions
Journal of the ACM (JACM)
A strong lower bound for approximate nearest neighbor searching
Information Processing Letters
Mobile services discovery and selection in the publish/subscribe paradigm
CASCON '04 Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research
Searching dynamic point sets in spaces with bounded doubling dimension
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On overlays and minimization diagrams
Proceedings of the twenty-second annual symposium on Computational geometry
Streaming computation of Delaunay triangulations
ACM SIGGRAPH 2006 Papers
On the bichromatic k-set problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating nearest neighbor among triangles in convex position
Information Processing Letters
Scalable ranked publish/subscribe
Proceedings of the VLDB Endowment
Approximate line nearest neighbor in high dimensions
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Computing hereditary convex structures
Proceedings of the twenty-fifth annual symposium on Computational geometry
Designing eigenspace manifolds: with application to object identification and pose estimation
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Safely selecting subsets of training data
DAS '10 Proceedings of the 9th IAPR International Workshop on Document Analysis Systems
On the bichromatic k-set problem
ACM Transactions on Algorithms (TALG)
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
ACM Transactions on Algorithms (TALG)
Randomly projected KD-trees with distance metric learning for image retrieval
MMM'11 Proceedings of the 17th international conference on Advances in multimedia modeling - Volume Part II
Beating the spread: time-optimal point meshing
Proceedings of the twenty-seventh annual symposium on Computational geometry
SIAM Journal on Computing
A comparison of nearest neighbor search algorithms for generic object recognition
ACIVS'06 Proceedings of the 8th international conference on Advanced Concepts For Intelligent Vision Systems
Data-driven trajectory smoothing
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Approximate nearest neighbor search for low dimensional queries
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Boosting multi-kernel locality-sensitive hashing for scalable image retrieval
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Comparison of point clouds acquired by 3d scanner
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
| Hi-index | 0.00 |