ESA
2007
Springer
14 years 5 months ago
2007
Springer
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 dis...