A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- 1 August 1992
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 8 (3) , 295-313
- https://doi.org/10.1007/bf02293050
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On the finiteness of the criss-cross methodEuropean Journal of Operational Research, 1991
- Topologically sweeping an arrangementJournal of Computer and System Sciences, 1989
- Weighted orthogonal linear L ∞-approximation and applicationsPublished by Springer Nature ,1989
- A finite crisscross method for oriented matroidsJournal of Combinatorial Theory, Series B, 1987
- Constructing Arrangements of Lines and Hyperplanes with ApplicationsSIAM Journal on Computing, 1986
- Linear and quadratic programming in oriented matroidsJournal of Combinatorial Theory, Series B, 1985
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral SetsMathematics of Operations Research, 1980
- Notes on Bland’s pivoting rulePublished by Springer Nature ,1978
- New Finite Pivoting Rules for the Simplex MethodMathematics of Operations Research, 1977
- An Algorithm for Convex PolytopesJournal of the ACM, 1970