Farthest-polygon voronoi diagrams

Abstract

Given a family of k disjoint connected polygonal sites of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(n log3 n) time algorithm to compute it. © Springer-Verlag Berlin Heidelberg 2007.