The furthest-site geodesic voronoi diagram

Abstract

We present an O((n+k) log(n+k))-time, O(n+k)-space algorithm for computing the furthest-site Voronoi diagram of k point sites with respect to the geodesic metric within a simple n-sided polygon. © 1993 Springer-Verlag New York Inc.