Beneath-and-Beyond Revisited

Michael Joswig ()
Additional contact information
Michael Joswig: Technische Universität Berlin, Institut für Mathematik, MA 6-2

A chapter in Algebra, Geometry and Software Systems, 2003, pp 1-21 from Springer

Abstract: Abstract It is shown how the Beneath-and-Beyond algorithm can be used to yield another proof of the equivalence of V- and H-representations of convex polytopes. In this sense this paper serves as the sketch of an introduction to polytope theory with a focus on algorithmic aspects. Moreover, computational results are presented to compare Beneath-and-Beyond to other convex hull implementations.

Keywords: Convex Hull; Simplicial Complex; Simplicial Polytopes; Reverse Search; Memory Overflow (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-05148-1_1

Ordering information: This item can be ordered from
http://www.springer.com/9783662051481

DOI: 10.1007/978-3-662-05148-1_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().