|
66
|
How good are convex hull algorithms?
– David Avis, David Bremner, Raimund Seidel
- 1996
|
|
121
|
Reverse Search for Enumeration
– David Avis, Komei Fukuda
- 1993
|
|
1233
|
Theory of linear and integer programming
– A Schrijver
- 1986
|
|
643
|
Algorithms in Combinatorial Geometry
– Herbert Edelsbrunner
- 1987
|
|
22
|
A C-implementation of the reverse search vertex enumeration algorithm
– D Avis
- 1993
|
|
27
|
The complexity of vertex enumeration methods
– M E Dyer
- 1983
|
|
295
|
Lectures on polytopes
– G Ziegler
- 1995
|
|
13
|
More Output-Sensitive Geometric Algorithms (Extended Abstract)
– Kenneth L. Clarkson
- 1994
|
|
50
|
An algorithm for convex polytopes
– D R Chand, S S Kapur
- 1970
|
|
30
|
Primal-Dual Methods for Vertex and Facet Enumeration
– David Bremner, Komei Fukuda, Ambros Marzetta
- 1998
|
|
129
|
The maximum number of faces of a convex polytope
– P McMullen
- 1970
|
|
65
|
Constructing higher dimensional convex hulls at logarithmic cost per face
– R Seidel
- 1986
|
|
70
|
An optimal convex hull algorithm in any fixed dimension, Discrete Comput
– Bernard Chazelle
- 1993
|
|
13
|
Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron
– K Fukuda, T M Liebling, F Margot
- 1997
|
|
51
|
The double description method
– T S Motzkin, H Raiffa, G L Thompson, R M Thrall
- 1953
|
|
320
|
The Quickhull algorithm for convex hulls
– C. Bradford Barber, David P. Dobkin, Hannu Huhdanpaa
- 1996
|
|
27
|
Finding the convex hull facet by facet
– G Swart
- 1985
|
|
228
|
Convex polytopes
– B. Grunbaum, G. C. Shephard
- 1967
|
|
275
|
Computational Geometry: An Introduction Through Randomized Algorithms
– K Mulmuley
- 1993
|
