David Avis, David Bremner  Home/Search
Context
Related
Links: ACM DBLP | mutt.cs.mcgill.ca/pub/doc...AB95a.ps.gz cgm.cs.mcgill.ca/~avis/do...AB95a.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iro.umontreal.ca/~ratib/...socg95 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A convex polytope is the bounded intersection of finite set H of halfspaces. A classic theorem of convexity theory is that every convex polyhedron can be expressed as the convex hull of its set V of vertices. There are three closely related computational problems related to the two descriptions of a polytope. The vertex enumeration problem is to compute V from H. The convex hull problem it to compute H from V. The polytope verification problem is to decide whether a given vertex description... (Update)
Active bibliography (related documents): More All
1.0: How Good are Convex Hull Algorithms? - Avis, Bremner, Seidel (1997) (Correct)
0.5: Incremental Convex Hull Algorithms Are Not Output Sensitive - Bremner (1996) (Correct)
0.5: Determining the Castability of Simple Polyhedra - Bose, Bremner, van Kreveld (1994) (Correct)
Similar documents based on text: More All
0.2: On Canonical Representations of Convex Polyhedra - David Avis Komei (2002) (Correct)
0.2: Primal-Dual Methods for Vertex and Facet Enumeration - Bremner, Fukuda, Marzetta (1998) (Correct)
0.1: Inner Diagonals Of Convex Polytopes - Bremner, Klee (1998) (Correct)
BibTeX entry: (Update)
D. Avis, D. Bremner, and R. Seidel. How good are convex hull algorithms? Comput. Geom.: Theory and Appl., 7(5--6):265--301, Apr. 1997. http://citeseer.ist.psu.edu/avis95how.html More
@inproceedings{ avis95how,
author = "David Avis and David Bremner",
title = "How Good are Convex Hull Algorithms?",
booktitle = "Symposium on Computational Geometry",
pages = "20-28",
year = "1995",
url = "citeseer.ist.psu.edu/avis95how.html" }
Citations (may not include all citations):107 Convex Polytopes (context) - Grunbaum - 1967
91 The quickhull algorithm for convex hull - Barber, Dobkin et al. - 1993
74 A pivoting algorithm for convex hulls and vertex enumeration.. (context) - Avis, Fukuda - 1992 ACM DBLP
63 Linear Programming (context) - Chv'atal - 1983 ACM
56 Constructing higher-dimensional convex hulls at logarithmic .. (context) - Seidel - 1986 ACM DBLP
48 The double description method (context) - Motzkin, Raiffa et al. - 1953
43 An optimal convex hull algorithm in any fixed dimension (context) - Chazelle - 1993 DBLP
32 An algorithm for convex polytopes (context) - Chand, Kapur - 1970
26 Introduction to Convex Polytopes (context) - Brondsted - 1981
17 Algorithms for diametral pairs and convex hulls that are opt.. (context) - Clarkson, Shor - 1988
16 Structural properties for two classes of combined random num.. (context) - Tezuka - 1991
13 A convex hull algorithm optimal for point sets in even dimen.. (context) - Seidel - 1981 ACM
7 A simple and relatively efficient triangulation of the n-cub.. (context) - Haiman - 1991
5 cdd Reference manual (context) - Fukuda
5 and multidimensional determinants (context) - Gel'fand, Kapranov et al. - 1994
5 How good is the simplex method (context) - Klee, Minty - 1972
4 Ground states of a ternary lattice model with nearest and ne.. (context) - Ceder, Garbulsky et al. - 1994
2 Symbolic treatment of geometric dependancies (context) - Yap - 1990
1 Regular triangualations of convex polytopes (context) - Lee - 1991
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC