Finding k points with minimum diameter and related problems
- 31 March 1991
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 12 (1) , 38-56
- https://doi.org/10.1016/0196-6774(91)90022-q
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A linear-time algorithm for computing the voronoi diagram of a convex polygonDiscrete & Computational Geometry, 1989
- Geometry Helps in MatchingSIAM Journal on Computing, 1989
- Efficient Algorithms for Geometric Graph Search ProblemsSIAM Journal on Computing, 1986
- Voronoi diagrams and arrangementsDiscrete & Computational Geometry, 1986
- On k-Nearest Neighbor Voronoi Diagrams in the PlaneIEEE Transactions on Computers, 1982