Computing the bounded subcomplex of an unbounded polyhedron
Combinatorics
2014-12-23 v3
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.
Cite
@article{arxiv.1006.2767,
title = {Computing the bounded subcomplex of an unbounded polyhedron},
author = {Sven Herrmann and Michael Joswig and Marc E. Pfetsch},
journal= {arXiv preprint arXiv:1006.2767},
year = {2014}
}
Comments
16 pages