| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 415458 | Computational Geometry | 2013 | 11 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Sven Herrmann, Michael Joswig, Marc E. Pfetsch,