, Volume 10, Issue 1, pp 377-409

An optimal convex hull algorithm in any fixed dimension

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We present a deterministic algorithm for computing the convex hull ofn points inE d in optimalO(n logn+n ⌞d/2⌟ ) time. Optimal solutions were previously known only in even dimension and in dimension 3. A by-product of our result is an algorithm for computing the Voronoi diagram ofn points ind-space in optimalO(n logn+n ⌜d/2⌝ ) time.