Small-dimensional linear programming and convex hulls made easy
- 1 September 1991
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 6 (3) , 423-434
- https://doi.org/10.1007/bf02574699
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre ProblemSIAM Journal on Computing, 1986
- Linear programming in O(n × 3d) timeInformation Processing Letters, 1986
- Finding the convex hull facet by facetJournal of Algorithms, 1985
- Linear Time Algorithms for Two- and Three-Variable Linear ProgramsSIAM Journal on Computing, 1984
- Linear Programming in Linear Time When the Dimension Is FixedJournal of the ACM, 1984
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977
- The maximum numbers of faces of a convex polytopeMathematika, 1970
- An Algorithm for Convex PolytopesJournal of the ACM, 1970