An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons

Given in the plane a set S of m point sites in a simple polygon P of n vertices, we consider the problem of computing the geodesic farthest-point Voronoi diagram for S in P . It is known that the problem has an Ω ( n + m log m ) time lower bound. Previously, a randomized algorithm was proposed [Barb...

Ausführliche Beschreibung