2 citations · 2 across the 1 of their papers we have counts for
1 paper
Otfried Cheong, Hazel Everett, Marc Glisse +5
Given a family of k disjoint connected polygonal sites in general position and of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distan…