Computing the face lattice of a polytope from its vertex-facet incidences

DOI10.1016/S0925-7721(02)00103-7zbMath1015.52010arXivmath/0106043OpenAlexW1996989230MaRDI QIDQ1862131

Marc E. Pfetsch, Volker Kaibel

Publication date: 10 March 2003

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0106043

zbMATH Keywords

algorithmenumerationpolytopeoriented matroidface latticevertex-facet incidences

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Computational aspects related to convexity (52B55) Oriented matroids in discrete geometry (52C40)

Related Items (13)

A new face iterator for polyhedra and for more general finite locally branched lattices ⋮ Compression with wildcards: Abstract simplicial complexes ⋮ Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes ⋮ PPLite: zero-overhead encoding of NNC polyhedra ⋮ Enumeration of 2-level polytopes ⋮ On Dantzig figures from graded lexicographic orders ⋮ Algorithms for tight spans and tropical linear spaces ⋮ Random Discrete Morse Theory and a New Library of Triangulations ⋮ Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism ⋮ Realizability of polytopes as a low rank matrix completion problem ⋮ Efficient Contact Mode Enumeration in 3D ⋮ Finding a simple polytope from its graph in polynomial time ⋮ Computing the integer hull of convex polyhedral sets

Cites Work

• Unnamed Item
• Combinatorial face enumeration in arrangements and oriented matroids
• Combinatorial face enumeration in convex polytopes
• Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
• Lectures on Polytopes
• Oriented Matroids

This page was built for publication: Computing the face lattice of a polytope from its vertex-facet incidences