An optimal algorithm for the on-line closest-pair problem
- 1 July 1994
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 12 (1), 18-29
- https://doi.org/10.1007/bf01377181
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Maintaining the minimal distance of a point set in polylogarithmic timeDiscrete & Computational Geometry, 1992
- ENUMERATING INTERDISTANCES IN SPACEInternational Journal of Computational Geometry & Applications, 1992
- An optimal algorithm for the on-line closest-pair problemPublished by Association for Computing Machinery (ACM) ,1992
- Rectangular point location and the dynamic closest pair problemLecture Notes in Computer Science, 1991
- Enumerating k distances for n points in the planePublished by Association for Computing Machinery (ACM) ,1991
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987
- Computational GeometryPublished by Springer Nature ,1985
- A theorem on polygon cutting with applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Divide-and-conquer in multidimensional spacePublished by Association for Computing Machinery (ACM) ,1976
- Closest-point problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975