Computing farthest neighbors on a convex
β
Otfried Cheong; Chan-Su Shin; Antoine Vigneron
π
Article
π
2003
π
Elsevier Science
π
English
β 302 KB
Let N be a set of n points in convex position in R 3 . The farthest point Voronoi diagram of N partitions R 3 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 ) in e