Discrete & Computational Geometry
, Volume 8, Issue 1, pp 295313
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
 David AvisAffiliated withSchool of Computer Science, McGill University
 , Komei FukudaAffiliated withGraduate School of Systems Management, University of Tsukuba
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
 (a)
Virtually no additional storage is required beyond the input data.
 (b)
The output list produced is free of duplicates.
 (c)
The algorithm is extremely simple, requires no data structures, and handles all degenerate cases.
 (d)
The running time is output sensitive for nondegenerate inputs.
 (e)
The algorithm is easy to parallelize efficiently.
For example, the algorithm finds thev vertices of a polyhedron inR ^{d} defined by a nondegenerate system ofn inequalities (or, dually, thev facets of the convex hull ofn points inR ^{d}, where each facet contains exactlyd given points) in timeO(ndv) andO(nd) space. Thev vertices in a simple arrangement ofn hyperplanes inR ^{d} can be found inO(n ^{2} dv) time andO(nd) space complexity. The algorithm is based on inverting finite pivot algorithms for linear programming.
 Title
 A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
 Journal

Discrete & Computational Geometry
Volume 8, Issue 1 , pp 295313
 Cover Date
 199212
 DOI
 10.1007/BF02293050
 Print ISSN
 01795376
 Online ISSN
 14320444
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 Authors

 David Avis ^{(1)}
 Komei Fukuda ^{(2)}
 Author Affiliations

 1. School of Computer Science, McGill University, 3480 University Street, H3A 2A7, Montreal, Quebec, Canada
 2. Graduate School of Systems Management, University of Tsukuba, Otsuka, Bunkyoku, 112, Tokyo, Japan