A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra (1992)

by David Avis , Komei Fukuda
Citations:183 - 28 self

Documents Related by Co-Citation

82 How good are convex hull algorithms? – David Avis, David Bremner, Raimund Seidel - 1996
1472 Theory of Linear and Integer Programming – A Schrijver - 1986
694 Algorithms in Combinatorial Geometry – H Edelsbrunner - 1987
23 A C Implementation of the Reverse Search Vertex Enumeration Algorithm – D Avis - 1994
31 The complexity of vertex enumeration methods – M E Dyer - 1983
153 Reverse Search for Enumeration – David Avis, Komei Fukuda - 1993
359 Lectures on Polytopes – Günter M. Ziegler, Günter M. Ziegler - 1994
61 An algorithm for convex polytopes – D R Chand, S S Kapur - 1970
16 More Output-Sensitive Geometric Algorithms (Extended Abstract) – Kenneth L. Clarkson - 1994
33 Primal-Dual Methods for Vertex and Facet Enumeration – David Bremner, Komei Fukuda, Ambros Marzetta - 1998
146 The maximum numbers of faces of a convex polytope, Mathematika 17 – P McMullen - 1970
69 Constructing higher-dimensional convex hulls at logarithmic cost per face – R Seidel - 1986
75 An optimal convex hull algorithm in any fixed dimension – B Chazelle - 1993
17 Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron – K Fukuda, T Liebling, F Margot - 1997
63 The double description method – T S Motzkin, H Raiffa, G L Thompson, R M Thrall
456 The Quickhull algorithm for convex hulls – C. Bradford Barber, David P. Dobkin, Hannu Huhdanpaa - 1996
32 Finding the convex hull facet by facet – G Swart - 1985
260 Convex polytopes – B. Grunbaum, G. C. Shephard - 1967
286 Computational Geometry: An Introduction Through Randomized Algorithms – Ketan Mulmuley - 1993