An algorithm for enumerating all vertices of a convex polyhedron

DOI10.1007/BF02242366zbMath0312.90034OpenAlexW233935999MaRDI QIDQ1219775

W. Altherr

Publication date: 1975

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02242366

Mathematics Subject Classification ID

Linear programming (90C05) Enumeration in graph theory (05C30) Inequalities and extremum problems involving convexity in convex geometry (52A40) Polytopes and polyhedra (52Bxx)

Related Items

On the Nipp polyhedron algorithm for solving singular perturbation problems, Segments in enumerating faces, A method of transferring polyhedron between the intersection-form and the sum-form, A validation and verification tool for global optimization solvers, Linearly constrained global optimization: a general solution algorithm with applications., Selected bibliography on degeneracy, Degeneracy graphs: Theory and applications. An updated survey, Efficient enumeration of the vertices of polyhedra associated with network LP's

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding all vertices of a convex polyhedron
• On The Number of Faces of a Convex Polytope
• On the Number of Vertices of a Convex Polytope
• ZufÄllige konvexe Polygone in einem Ringgebiet
• Some results in probabilistic geometry
• [https://portal.mardi4nfdi.de/wiki/Publication:5588965 Die konvexe H�lle von n rotationssymmetrisch verteilten Punkten]
• [https://portal.mardi4nfdi.de/wiki/Publication:5728818 �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten]