An optimal convex hull algorithm in any fixed dimension
- First Online:
- Cite this article as:
- Chazelle, B. Discrete Comput Geom (1993) 10: 377. doi:10.1007/BF02573985
- 421 Views
We present a deterministic algorithm for computing the convex hull ofn points inEd 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.