paper

Computing the bounded subcomplex of an unbounded polyhedron

arXiv:1006.2767 · doi:10.1016/j.comgeo.2011.11.002

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.

arXiv comment16 pages

References in corpus (2)

Cited by in corpus (3)