The convex hull of a set of points is the smallest convex set that contains the points. This paper presents a practical convex hull algorithm that combines the two-dimensional Quickhull Algorithm with the general dimension Beneath-Beyond Algorithm. It is similar to the randomized, incremental algorithms for convex hull and Delaunay triangulation. We provide empirical evidence that the algorithm runs faster when the input contains nonextreme points, and that it uses less memory. Computational geometry algorithms have traditionally assumed that input sets are well behaved. When an algorithm is implemented with floating point arithmetic, this assumption can lead to serious errors. We briefly describe a solution to this problem when computing the convex hull in two, three, or four dimensions. The output is a set of "thick" facets that contain all possible exact convex hulls of the input. A variation is effective in five or more dimensions. 1. Introduction The convex hull of a set of point...
|
1481
|
Computational Geometry: An introduction
– Preparata, Shamos
- 1985
|
|
376
|
Voronoi diagrams - a survey of a fundamental geometric data structure
– Aurenhammer
- 1991
|
|
314
|
Applications of random sampling in computational geometry
– Clarkson
- 1988
|
|
262
|
Computational Geometry: An Introduction Through Randomized Algorithms
– Mulmuley
- 1994
|
|
248
|
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
– Shewchuk
- 1996
|
|
123
|
Randomized incremental construction of Delaunay and Voronoi diagrams
– Guibas, Knuth, et al.
- 1992
|
|
112
|
Incremental topological flipping works for regular triangulations
– Edelsbrunner, Shah
- 1996
|
|
95
|
Voronoi diagrams--a survey of a fundamental geometric data structure
– Aurenhammer
- 1991
|
|
79
|
The ultimate planar convex hull algorithm
– Kirkpatrick, Seidel
- 1986
|
|
74
|
Four results on randomized incremental constructions
– Clarkson, Mehlhorn, et al.
- 1993
|
|
66
|
Constructing higher-dimensional convex hulls at logarithmic cost per face
– Seidel
- 1986
|
|
62
|
Construction of three-dimensional Delaunay triangulations using local transformations,” Computer Aided Geometric Design 8
– Joe
- 1991
|
|
56
|
Safe and Effective Determinant Evaluation
– Clarkson
- 1992
|
|
54
|
How good are convex hull algorithms
– Avis, Bremner, et al.
- 1997
|
|
53
|
Voronoi diagrams from convex hulls
– Brown
- 1979
|
|
48
|
An algorithm for convex polytopes
– Chand, Kapur
- 1970
|
|
43
|
The double description method
– Motzkin, Raiffa, et al.
- 1953
|
|
42
|
Stable maintenance of point set triangulations in two dimensions
– Fortune
- 1989
|
|
37
|
Double Description method revisited
– Fukuda, Prodon
- 1996
|
|
28
|
Constructing strongly convex hulls using exact or rounded arithmetic
– LI, MILENKOVIC
- 1990
|
|
25
|
A new convex hull algorithm for planar sets
– Eddy
- 1977
|
|
23
|
Automating spectral unmixing of AVIRIS data using convex geometry concepts
– Boardman
- 1993
|
|
21
|
On the randomized construction of the Delaunay tree. Theoret
– Boissonnat, Teillaud
- 1993
|
|
20
|
Measures of symmetry for convex sets
– Grunbaum
- 1961
|
|
19
|
Derandomizing an output-sensitive convex hull algorithm in three dimensions
– Chazelle, Matouˇsek
- 1995
|
|
17
|
Triangle: A Two-Dimensional Quality Mesh Generator and Delaunay Triangulator
– Shewchuk
- 1995
|
|
16
|
On the randomized construction of the Delaunay tree
– Boissonat, Teillaud
- 1993
|
|
14
|
Constructing strongly convex approximate hulls with inaccurate primitives
– Guibas, Salesin, et al.
- 1993
|
|
11
|
Convex hull of a finite set of points in two dimensions
– Bykat
- 1978
|
|
10
|
Learning in navigation: Goal finding in graphs
– Cucka, Netanyahu, et al.
- 1996
|
|
10
|
Progress in computational geometry
– Fortune
- 1993
|
|
9
|
Determination and evaluation of support structures in layered manufacturing
– Allen, Dutta
- 1995
|
|
9
|
Delaunay triangulations in three dimensions with finite precision arithmetic
– Dey, Sugihara, et al.
- 1992
|
|
9
|
Convex hulls and isometries of cusped hyperbolic 3-manifolds
– Weeks
- 1993
|
|
8
|
cdd/cdd+ reference manual
– Fukuda
- 1997
|
|
8
|
Constructing the convex hull of a set of points in the plane
– Green, Silverman
- 1979
|
|
7
|
Private communication
– Floyd
- 1991
|
|
4
|
Convex polytopes and linear programming
– Klee
- 1966
|
|
3
|
Closed-form solutions to constrained control allocation problem
– Bordignon, Durham
- 1995
|
|
3
|
Invariant sets for general second-order low-pass delta-sigma modulators with dc inputs
– Zhang, Goodson, et al.
- 1994
|
|
2
|
Convex Hull Algorithms in Higher Dimensions. Unpublished manuscript
– Kallay
- 1981
|
|
1
|
Personal communications regarding qhull
– Belsis, Grundmann, et al.
- 1995
|
|
1
|
A program for convex hulls. http://netlib.att.com/netlib/ voronoi/hull.html
– Clarkson
- 1995
|
|
1
|
Irregular grain structure in micromagnetic simulation
– Porter, Glavinas, et al.
- 1996
|
|
1
|
Topologically consistent algorithms related to convex polyhedra
– Sugihara
- 1992
|
|
1
|
The Quickhull Algorithm for Convex Hulls • 481
– ALLEN, DUTTA
- 1995
|
|
1
|
A program for convex hulls
– CLARKSON
- 1995
|
|
1
|
The Quickhull Algorithm for Convex Hulls • 483
– MOTZKIN, RAIFFA, et al.
- 1953
|
|
1
|
Convex hulls and isometrics of cusped hyperbolic 3-manifolds
– WEEKS
- 1991
|
|
1
|
Determination& evaluationof support structures in layered manufacturing
– Allen, Dutta
- 1995
|
|
