How good are convex hull algorithms?
- 1 April 1997
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 7 (5-6) , 265-301
- https://doi.org/10.1016/s0925-7721(96)00023-5
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Efficient enumeration of the vertices of polyhedra associated with network LP'sMathematical Programming, 1994
- Ground states of a ternary fcc lattice model with nearest- and next-nearest-neighbor interactionsPhysical Review B, 1994
- Bounds on the number of vertices of perturbed polyhedraAnnals of Operations Research, 1993
- Selected bibliography on degeneracyAnnals of Operations Research, 1993
- Computing extreme rays of the metric cone for seven pointsEuropean Journal of Combinatorics, 1992
- A simple and relatively efficient triangulation of then-cubeDiscrete & Computational Geometry, 1991
- Efficient and portable combined random number generatorsCommunications of the ACM, 1988
- Finding the convex hull facet by facetJournal of Algorithms, 1985
- An Algorithm for Convex PolytopesJournal of the ACM, 1970
- XVII. On the enumeration of x-edra having triedral summits, and an (x—1)-gonal basePhilosophical Transactions of the Royal Society of London, 1856