Maintaining the minimal distance of a point set in polylogarithmic time
Open Access
- 1 April 1992
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 7 (4), 415-431
- https://doi.org/10.1007/bf02187852
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Shallow interdistance selection and interdistance enumerationPublished by Springer Nature ,2005
- Enumerating k distances for n points in the planePublished by Association for Computing Machinery (ACM) ,1991
- Dynamic fractional cascadingAlgorithmica, 1990
- A linear-time algorithm for computing the voronoi diagram of a convex polygonDiscrete & Computational Geometry, 1989
- AnO(n logn) algorithm for the all-nearest-neighbors ProblemDiscrete & Computational Geometry, 1989
- Dynamically computing the maxima of decomposable functions, with applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Fractional cascading: I. A data structuring techniqueAlgorithmica, 1986
- Computational GeometryPublished by Springer Nature ,1985
- Dynamization of order decomposable set problemsJournal of Algorithms, 1981
- On the average number of rebalancing operations in weight-balanced treesTheoretical Computer Science, 1980