Computing the bounded subcomplex of an unbounded polyhedron

Details Computing the bounded subcomplex of an unbounded polyhedron Computing the bounded subcomplex of an unbounded polyhedron

2010-06-14

arxiv.org/abs/1006.2767v3

Mathematics

Combinatorics

16 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computing the bounded subcomplex of an unbounded polyhedron does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing the bounded subcomplex of an unbounded polyhedron, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing the bounded subcomplex of an unbounded polyhedron will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-422832