GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON
Authors:
- 1 December 2011
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Geometry & Applications
- Vol. 21 (06) , 595-608
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Fast Algorithms for Computing the Smallest k-Enclosing CircleAlgorithmica, 2004
- Geometric range searching and its relatives1999
- Static and Dynamic Algorithms for k-Point Clustering ProblemsJournal of Algorithms, 1995
- On enclosing k points by a circleInformation Processing Letters, 1995
- Ray shooting in polygons using geodesic triangulationsAlgorithmica, 1994
- Iterated nearest neighbors and finding minimal polytopesDiscrete & Computational Geometry, 1994
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991
- Computing the geodesic center of a simple polygonDiscrete & Computational Geometry, 1989
- On the geodesic voronoi diagram of point sites in a simple polygonAlgorithmica, 1989
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987