Computational geometry: an introduction
Computational geometry: an introduction
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multidimensional divide-and-conquer
Communications of the ACM
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Divide and conquer algorithms for closest point problems in multidimensional space.
Divide and conquer algorithms for closest point problems in multidimensional space.
Planar geometric location problems and maintaining the width of a planar set
SODA '91 Proceedings of the second 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
New techniques for exact and approximate dynamic closest-point problems
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
An optimal algorithm for closest pair maintenance (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Randomized data structures for the dynamic closest-pair problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Fast hierarchical clustering and other applications of dynamic closest pairs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Fast hierarchical clustering and other applications of dynamic closest pairs
Journal of Experimental Algorithmics (JEA)
A fully dynamic algorithm for planar
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
On computing the diameter of a point set in high dimensional Euclidean space
Theoretical Computer Science
| Hi-index | 0.00 |