GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON
From MaRDI portal
Publication:4650081
DOI10.1142/S0218195911003822zbMath1251.68281OpenAlexW2073543798MaRDI QIDQ4650081
Magdalene G. Borgelt, Jun Luo, Marc J. van Kreveld
Publication date: 23 November 2012
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195911003822
Nonnumerical algorithms (68W05) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (3)
The geodesic 2-center problem in a simple polygon ⋮ Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon ⋮ Relative convex hulls in semi-dynamic arrangements
Cites Work
- Unnamed Item
- Unnamed Item
- Computing the geodesic center of a simple polygon
- On enclosing k points by a circle
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Iterated nearest neighbors and finding minimal polytopes
- Ray shooting in polygons using geodesic triangulations
- Fast algorithms for computing the smallest \(k\)-enclosing circle
- Static and Dynamic Algorithms for k-Point Clustering Problems
This page was built for publication: GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON