2002/10/09 by Michael Joswig, Joswig, Michael
Arts and Humanities · Computer Science · Mathematics · #Algorithms and Data Compression #Music Technology and Sound Studies #Musicology and Musical Analysis #math.CO #math.MG #msc:52B11 #msc:52B55 #msc:68Q25
paper · pdf · doi:10.48550/arxiv.math/0210133
21 pages, 2 figures; v2: added the bibliography which was erroneously omitted in v1
arxiv created 2002/10/10 · arxiv updated 2009/11/30
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.