Discrete & Computational Geometry

, Volume 10, Issue 4, pp 377–409

An optimal convex hull algorithm in any fixed dimension

  • Bernard Chazelle
Article

DOI: 10.1007/BF02573985

Cite this article as:
Chazelle, B. Discrete Comput Geom (1993) 10: 377. doi:10.1007/BF02573985

Abstract

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.

Copyright information

© Springer-Verlag New York Inc. 1993

Authors and Affiliations

  • Bernard Chazelle
    • 1
  1. 1.Department of Computer SciencePrinceton UniversityPrincetonUSA