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.
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics