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

Computational Geometry: Theory and Applications

Volumn 23, Issue 3, 2002, Pages 281-290

  Kaibel, Volker ^a   Pfetsch, Marc E ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Algorithm; Enumeration; Face lattice; Oriented matroid; Polytope; Vertex facet incidences

Indexed keywords

EID: 31244437176     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(02)00103-7     Document Type: Article

References (8)

1. K. Fukuda, V. Resta, Combinatorial face enumeration in convex polytopes, Computational Geometry 4 (4) (1994) 191-198.
2. K. Fukuda, T.M. Liebling, F. Margot, Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron, Computational Geometry 8 (1997) 1-12.
3. B. Ganter, Algorithmen zur formalen Begriffsanalyse, in: B. Ganter, R. Wille, K.E. Wolff (Eds.), Beiträge zur Begriffsanalyse, B.I. Wissenschaftsverlag, 1987, pp. 241-254.
4. G.M. Ziegler, Lectures on Polytopes, Springer-Verlag, 1995 (rev. ed. 1998).
5. T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms, 2nd Edition, MIT Press, Cambridge, 2001.
6. A. Björner, M. Las Vergnas, B. Sturmfels, N. White, G.M. Ziegler, Oriented Matroids, 2nd Edition, in: Encyclopedia of Mathematics and its Applications, Vol. 46, Cambridge University Press, 1999.
7. L. Finschi, A graph theoretical approach for reconstruction and generation of oriented matroids, PhD Thesis, IFOR, ETH Zürich, 2001.
8. K. Fukuda, S. Saito, A. Tamura, Combinatorial face enumeration in arrangements and oriented matroids, Discrete Appl. Math. 31 (2) (1991) 141-149.