A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon
Chih-Hung Liu · Algorithmica · 2019
The geodesic Voronoi diagram of m point sites inside a simple polygon of n vertices is a subdivision of the polygon into m cells, one to each site, such that all points in a cell share the same nearest site under the geodesic distance. The best known lower bound for the construction time is $$\varOmega (n+m\log m)$$ Ω(n+mlogm), and a matching upper bound is a long-standing open question. The state-of-the-art construction algorithms achieve $$O( (n+m) \log (n+m) )$$ O((n+m)log(n+m)) and $$O(n+m\log m\log ^2n)$$ O(n+mlogmlog2n) time, which are optimal for $$m=\varOmega (n)$$ m=Ω(n) and $$m=O(\frac{n}{\log ^3n})$$ m=O(nlog3n), respectively. In this paper, we give a construction algorithm with $$O( n + m ( \log m+ \log ^2 n ) )$$ O(n+m(logm+log2n)) time, and it is nearly optimal in the sense that if a single Voronoi vertex can be computed in $$O(\log n)$$ O(logn) time, then the construction time will become the optimal $$O(n+m\log m)$$ O(n+mlogm). In other words, we reduce the problem of constructing the diagram in the optimal time to the problem of computing a single Voronoi vertex in $$O(\log n)$$ O(logn) time.