Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

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

Summary: A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of
Arrangements and Polyhedra
David Avis
School of Computer Science
McGill University
3480 University, Montreal, Quebec H3A 2A7
Komei Fukuda
Graduate School of Systems Management
The University of Tsukuba
Otsuka, Bunkyo­ku, Tokyo 112
November 1990, Revised January 1992
ABSTRACT
We present a new pivot­based algorithm which can be used with minor modifica­
tion for the enumeration of the facets of the convex hull of a set of points, or for the enu­
meration of the vertices of an arrangement or of a convex polyhedron, in arbitrary
dimension. The algorithm has the following properties:
(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;

  

Source: Avis, David - School of Computer Science, McGill University

 

Collections: Computer Technologies and Information Sciences