The geodesic 2-center problem in a simple polygon
Copyright policy )The geodesic 2-center problem in a simple polygon
The geodesic $k$-center problem in a simple polygon with $n$ vertices consists in the following. Find a set $S$ of $k$ points in the polygon that minimizes the maximum geodesic distance from any point of the polygon to its closest point in $S$. In this paper, we focus on the case where $k=2$ and present an exact algorithm that returns a geodesic $2$-center in $O(n^2\log^2 n)$ time.
- Pohang University of Science and Technology Korea (Republic of)
- University of Ottawa Canada
LINEAR-TIME ALGORITHMS, Computational Geometry (cs.CG), FOS: Computer and information sciences, Geodesic distance, Simple polygons, Computer Science - Computational Geometry, k-center problem
LINEAR-TIME ALGORITHMS, Computational Geometry (cs.CG), FOS: Computer and information sciences, Geodesic distance, Simple polygons, Computer Science - Computational Geometry, k-center problem
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).6 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!