Computing the bounded subcomplex of an unbounded polyhedron
classification
🧮 math.CO
keywords
boundedpolyhedronunboundedalgorithmscasecombinatorialcomputationalcomputing
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.