Summary: How Good are Convex Hull Algorithms?
David Avis \Lambda
School of Computer Science
McGill University
Montreal, QC, CANADA, H3A 2A7
David Bremner \Lambda
School of Computer Science
McGill University
Montreal, QC, CANADA, H3A 2A7
Raimund Seidel y
Computer Science Division
University of California Berkeley
Berkeley CA 94720
Fachberich Informatik
Universit¨at des Saarlandes
D­66041 Saarbr¨ucken, GERMANY
February 1996
Abstract
A convex polytope P can be specified in two ways: as the convex hull of the vertex set V of
P , or as the intersection of the set H of its facet­inducing halfspaces. The vertex enumeration

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

Collections: Computer Technologies and Information Sciences