Abstract

Let N be a set of n points in convex position in R3. The farthest-point Voronoi diagram
of N partitions R³ into n convex cells. We consider the intersection G(N) of the diagram
with the boundary of the convex hull of N. We give an algorithm that computes an implicit
representation of G(N)
... read more