An optimal algorithm for closest pair maintenance (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
A Delaunay based numerical method for three dimensions: generation, formulation, and partition
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Algorithms for dynamic closest pair and n-body potential fields
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Efficient Expected-Case Algorithms for Planar Point Location
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Dynamic Compressed Hypertoctrees with Application to the N-Body Problem
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
The skip quadtree: a simple dynamic data structure for multidimensional data
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition
ACM Transactions on Algorithms (TALG)
Fully retroactive approximate range and nearest neighbor searching
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Hi-index | 0.00 |