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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 217-255 |
| Number of pages | 39 |
| Journal | Discrete & Computational Geometry |
| Volume | 9 |
| Issue number | 1 |
| DOIs | |
| State | Published - Dec 1993 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics