Beneath-and-Beyond revisited

Simple item page
dc.creatorJoswig, Michael
dc.date2002-10-09
dc.date2002-10-10
dc.date.accessioned2026-07-07T04:51:46Z
dc.date.available2026-07-07T04:51:46Z
dc.descriptionIt 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.
dc.description21 pages, 2 figures; v2: added the bibliography which was erroneously omitted in v1
dc.identifierhttps://arxiv.org/abs/math/0210133
dc.identifierhttp://arxiv.org/abs/math/0210133
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/65228
dc.subjectMetric Geometry
dc.subjectCombinatorics
dc.subject52B11; 52B55; 68Q25
dc.titleBeneath-and-Beyond revisited
dc.typetext

Files

Collections

arXiv