An optimal convex hull algorithm in any fixed dimension

@article{Chazelle1993AnOC,
  title={An optimal convex hull algorithm in any fixed dimension},
  author={Bernard Chazelle},
  journal={Discrete \& Computational Geometry},
  year={1993},
  volume={10},
  pages={377-409}
}
  • B. Chazelle
  • Published 1 December 1993
  • Mathematics, Computer Science
  • Discrete & Computational Geometry
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. 
View on Springer
link.springer.com
362 Citations
Highly Influential Citations
16
Background Citations
111
Methods Citations
80
Results Citations
1

362 Citations

Citation Type

Citation Type

An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension D
TLDR
An algorithm which computes the convex hull of a set of n spheres in dimension d in time O (n ⌜ d 2 ⌝ + n log n) is presented, which is worst-case optimal in three dimensions and in even dimensions.
Finding largest rectangles in convex polygons
We consider the following geometric optimization problem: find a maximum-area rectangle and a maximum-perimeter rectangle contained in a given convex polygon with n vertices. We give exact algorithms…
Derandomizing an Output-sensitive Convex Hull Algorithm in Three Dimensions
TLDR
It is pointed out that the proposed optimal randomized algorithm for the computation of the convex hull of a given n-point set in three-dimensional Euclidean space can be made deterministic by using recently developed techniques, thus obtaining an optimal deterministic algorithm.
Convex hulls, oracles, and homology
This paper presents a new algorithm for the convex hull problem, which is based on a reduction to a combinatorial decision problem CompletenessC, which in turn can be solved by a simplicial homology…
Constructing the Convex Hull of a Partially Sorted Set of Points
  • M. Goodrich
  • Computer Science, Mathematics
    Comput. Geom.
  • 1992
TLDR
An optimal algorithm for constructing the convex hull of a partially sorted set S of n points in R 2 is given, where h max is the maximum number of hull edges incident on the points of any single subset S i.
Computation of Convex Hulls
When referring to “computation of convex hulls” we understand this as the task of computing the \(\mathcal {H}\)-representation of the convex hull of a given finite point set V⊆ℝ n . Depending on the…
Optimal Voronoi Diagram Construction with n Convex Sites in Three Dimensions
TLDR
This paper presents a worst-case optimal algorithm for constructing the Voronoi diagram for n disjoint convex and rounded semi-algebraic sites in 3 dimensions, based on a suboptimal 2-dimensional algorithm outlined by Lee and Drysdale and modified by Sharir25,30.
Efficient Computation of the Outer Hull of a Discrete Path
TLDR
By combining the well-known wall follower algorithm for traversing mazes, the desired result with two passes is obtained resulting in a global linear time and space algorithm and the convex hull is obtained as a byproduct.
Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams
TLDR
This is the first algorithm within a polylogarithmic factor of optimal $O(n \log f + f)$ time over the whole range of f to be given for output-sensitive construction of an f-face convex hull of a set of n points in general position in E4.
Densest Lattice Packings of 3 {
Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an eecient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an…
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 24 REFERENCES
Convex hulls of finite sets of points in two and three dimensions
TLDR
The presented algorithms use the “divide and conquer” technique and recursively apply a merge procedure for two nonintersecting convex hulls to ensure optimal time complexity within a multiplicative constant.
The Ultimate Planar Convex Hull Algorithm?
We present a new planar convex hull algorithm with worst case time complexity $O(n \log H)$ where $n$ is the size of the input set and $H$ is the size of the output set, i.e. the number of vertices…
Small-dimensional linear programming and convex hulls made easy
  • R. Seidel
  • Mathematics, Computer Science
    Discret. Comput. Geom.
  • 1991
TLDR
Two randomized algorithms solve linear programs involvingm constraints ind variables in expected timeO(m) and constructs convex hulls ofn points in ℝd,d>3, in expectedTimeO(n[d/2]).
Partitioning arrangements of lines I: An efficient deterministic algorithm
  • P. Agarwal
  • Mathematics, Computer Science
    Discret. Comput. Geom.
  • 1990
TLDR
A deterministic algorithm for partitioning the plane into O(r2) triangles so that no triangle meets more thanO(n/r) lines of ℒ is presented.
A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions
Finding the convex hull of a finite set of points is important not only for practical applications but also for theoretical reasons: a number of geometrical problems, such as constructing Voronoi…
Constructing higher-dimensional convex hulls at logarithmic cost per face
  • R. Seidel
  • Mathematics, Computer Science
    STOC '86
  • 1986
TLDR
The main tool in this new approach is the notion of a straight line shelling of a polytope in convex hull problems, which has best case time complexity O(m 2 -tFlogm), which is an improvement over the best previously achieved bounds for a large range of values of F.
A deterministic view of random sampling and its use in geometry
  • B. Chazelle, J. Friedman
  • Mathematics, Computer Science
    [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
TLDR
It is shown how to compute, in polynomial time, a simplicial packing of size O(r/sup d/) that covers d-space, each of whose simplices intersects O(n/r) hyperplanes.
Cutting hyperplane arrangements
  • J. Matousek
  • Mathematics, Computer Science
    Discret. Comput. Geom.
  • 1991
TLDR
A deterministic algorithm for finding a (1/r)-cutting withO(rd) simplices with asymptotically optimal running time is given, which has numerous applications for derandomizing algorithms in computational geometry without affecting their running time significantly.
Voronoi diagrams and arrangements
TLDR
It turns out that the standard Euclidean Voronoi diagram of point sets inRd along with its order-k generalizations are intimately related to certain arrangements of hyperplanes, and this fact can be used to obtain new Vor onoi diagram algorithms.
Voronoi Diagrams from Convex Hulls
TLDR
The fundamental result is that a K-dimensional Euclidean Voronoi diagram of N points can be constructed by transforming the points to K + I-space, which extends straightforwardly to higher dimensions.
...
1
2
3
...