Maintaining the minimal distance of a point set in polylogarithmic time

Authors:
Michiel Smid
Affiliations:
Fachbereich Informatik, Universität des Saarlandes, D-6600, Saarbrücken, Germany
Venue:
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Year:
1991

Citing 2
Cited 2

A linear-time algorithm for computing the Voronoi diagram of a convex polygon

Discrete & Computational Geometry
An O(n log n) algorithm for the all-nearest-neighbors problem

Discrete & Computational Geometry

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

Quantified Score

Hi-index	0.00

Visualization

Abstract