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 discountRent now
* Final gross prices may vary according to local VAT.Get Access
Virtually no additional storage is required beyond the input data.
The output list produced is free of duplicates.
The algorithm is extremely simple, requires no data structures, and handles all degenerate cases.
The running time is output sensitive for nondegenerate inputs.
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.
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
Discrete & Computational Geometry
Volume 8, Issue 1 , pp 295-313
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Industry Sectors