Finding the convex hull facet by facet
- 1 March 1985
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 6 (1) , 17-48
- https://doi.org/10.1016/0196-6774(85)90017-3
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopesJournal of Combinatorial Theory, Series A, 1981
- Sufficiency of McMullen’s conditions for 𝑓-vectors of simplicial polytopesBulletin of the American Mathematical Society, 1980
- On the Average Number of Maxima in a Set of Vectors and ApplicationsJournal of the ACM, 1978
- Algorithm 523: CONVEX, A New Convex Hull Algorithm for Planar Sets [Z]ACM Transactions on Mathematical Software, 1977
- A New Convex Hull Algorithm for Planar SetsACM Transactions on Mathematical Software, 1977
- A proof of the lower bound conjecture for convex polytopesPacific Journal of Mathematics, 1973
- On the identification of the convex hull of a finite set of points in the planeInformation Processing Letters, 1973
- Sur L'enveloppe convexe des nuages de points aleatoires dans Rn. IJournal of Applied Probability, 1970
- An Algorithm for Convex PolytopesJournal of the ACM, 1970