Segments in enumerating faces
- 1 October 1995
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 70 (1) , 27-45
- https://doi.org/10.1007/bf01585927
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedraDiscrete & Computational Geometry, 1992
- On the complexity of four polyhedral set containment problemsMathematical Programming, 1985
- The Complexity of Vertex Enumeration MethodsMathematics of Operations Research, 1983
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral SetsMathematics of Operations Research, 1980
- An algorithm for determining all extreme points of a convex polytopeMathematical Programming, 1977
- An algorithm for enumerating all vertices of a convex polyhedronComputing, 1975
- Generating All the Faces of a PolyhedronSIAM Journal on Applied Mathematics, 1974
- The graph of an abstract polytopeMathematical Programming, 1973
- Finding all vertices of a convex polyhedronNumerische Mathematik, 1968
- An Algorithm for Finding All Vertices of Convex Polyhedral SetsJournal of the Society for Industrial and Applied Mathematics, 1961