Computational geometry: an introduction
Computational geometry: an introduction
A data structure for dynamic trees
Journal of Computer and System Sciences
An O(n log n) algorithm for the all-nearest-neighbors problem
Discrete & Computational Geometry
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An Onlognloglogn algorithm for the on-line closest pair problem
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An optimal algorithm for the on-line closest-pair problem
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Maintaining the minimal distance of a point set in polylogarithmic time
Discrete & Computational Geometry
New techniques for exact and approximate dynamic closest-point problems
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Algorithms for dynamic closest pair and n-body potential fields
Proceedings of the sixth 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
Randomized data structures for the dynamic closest-pair problem
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
New techniques for some dynamic closest-point and farthest-point problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Parallel Construction of Quadtrees and Quality Triangulations
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Combine and Conquer: a General Technique for Dynamic Algorithms (Extended Abstract)
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Divide-and-conquer in multidimensional space
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Incremental distance join algorithms for spatial databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Data structures for mobile data
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Optimal algorithms for complete linkage clustering in d dimensions
Theoretical Computer Science
Reconstructing collections of arbitrary curves
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Distance join queries on spatial networks
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Information Processing Letters
Online discovery and maintenance of time series motifs
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Computational-geometry approach to digital image contour extraction
Transactions on computational science XIII
| Hi-index | 0.00 |