Computing the bounded subcomplex of an unbounded polyhedron

DOI10.1016/J.COMGEO.2011.11.002MaRDI QIDQ1941218zbMATH OpenOpenAlexWikidataFDO

Authors Sven Herrmann, Michael Joswig, Marc E. Pfetsch

Publication date 12 March 2013

Published in Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

numerical examplestight spancombinatorial algorithmsHasse diagrambounded subcomplexunbounded polyhedronvertex-incidences

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Abstract: We study efficient combinatorial algorithms to produce the Hasse diagram of the poset of bounded faces of an unbounded polyhedron, given vertex-facet incidences. We also discuss the special case of simple polyhedra and present computational results.

Recommendations

• Computing the face lattice of a polytope from its vertex-facet incidences
• Finding the convex hull facet by facet
• Combinatorial face enumeration in convex polytopes
• Vertex-facet incidences of unbounded polyhedra
• Bounds on the complexity of halfspace intersections when the bounded faces have small dimension

Cited in

(5)

• Ambiguous incidences of unbounded polyhedra
• Algorithms for tight spans and tropical linear spaces
• Vertex-facet incidences of unbounded polyhedra
• Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
• Bounds on the complexity of halfspace intersections when the bounded faces have small dimension

Describes a project that uses

Uses Software

• polymake

This page was built for publication: Computing the bounded subcomplex of an unbounded polyhedron

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1941218)