Discrete & Computational Geometry
, Volume 10, Issue 1, pp 377409
An optimal convex hull algorithm in any fixed dimension
 Bernard ChazelleAffiliated withDepartment of Computer Science, Princeton University
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
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 byproduct of our result is an algorithm for computing the Voronoi diagram ofn points indspace in optimalO(n logn+n ^{ ⌜d/2⌝ }) time.
 Title
 An optimal convex hull algorithm in any fixed dimension
 Journal

Discrete & Computational Geometry
Volume 10, Issue 1 , pp 377409
 Cover Date
 199312
 DOI
 10.1007/BF02573985
 Print ISSN
 01795376
 Online ISSN
 14320444
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 Authors

 Bernard Chazelle ^{(1)}
 Author Affiliations

 1. Department of Computer Science, Princeton University, 08544, Princeton, NJ, USA