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.
Supported by Deutsche Forschungsgemeinschaft, Sonderforschungsbereich 288 „Differentialgeometrie und Quantenphysik“ and Forschungszentrum „Mathematik für Schlüsseltechnologien.“
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Avis. A revised implementation of the reverse search vertex enumeration algorithm. In Polytopes—combinatorics and computation (Oberwolfach, 1997), volume 29 of DMV Sem., pages 177–198. Birkhäuser, Basel, 2000.
D. Avis. lrs, Irslib, Version 4.1. http://cgm.cs.mcgill.ca/~avis/C/1rs.html, 2001.
D. Avis, D. Bremner, and R. Seidel. How good are convex hull algorithms? Comput. Geom., 7(5–6): 265 301, 1997.
D. Avis and K. Fukuda. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Comput. Geom.,8(3):295313, 1992.
L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and real computation. Springer-Verlag, New York, 1998. With a foreword by Richard M. Karp.
D. Bremner. Incremental convex hull algorithms are not output sensitive. Discrete Comput. Geom., 21 (1): 57–68, 1999.
A. Brondsted. An introduction to convex polytopes, volume 90 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1983.
CGAL, Version 2.4. http://www.cga1.org/,2002.
J.-G. Dumas, F. Heckenbach, D. Saunders, and V. Welker. Computing simplicial homology based on efficient smith normal form algorithms. In this volume,pages 177–206.
H. Edelsbrunner. Algorithms in combinatorial geometry. Springer-Verlag, Berlin, 1987.
K. Fukuda. cdd±, Version 0.76a. http://www.cs.mcgill.ca/~fukuda/soft/cdd_home/cdd.html, 2001.
K. Fukuda. cddlib, Version 0.92a. http://www.cs.mcgill.ca/~fukuda/soft/cdd_home/cdd.html, 2001.
K. Fukuda and A. Prodon. Double description method revisited. In Combinatorics and computer science (Brest, 1995), volume 1120 of Lecture Notes in Comput. Sci., pages 91–111. Springer, Berlin, 1996.
E. Gawrilow and M. Joswig. polymake, version 1.5.1: a software package for analyzing convex polytopes. http://www.math.tu-berlin.de/diskregeom/polymake, 1997–2003.
E. Gawrilow and M. Joswig. polymake: a framework for analyzing convex polytopes. In G. Kalai and G. M. Ziegler, editors, Polytopes - Combinatorics and Computation, pages 43–74. Birkhäuser, 2000.
E. Gawrilow and M. Joswig. polymake: an approach to modular software design in computational geometry. In Proceedings of the 17th Annual Symposium on Computational Geometry,pages 222–231. ACM, 2001. June 3–5, 2001, Medford, MA.
J.E. Goodman, R. Pollack, and B. Sturmfels. The intrinsic spread of a configuration in P d . J. Amer. Math. Soc. 3 (3): 639–651, 1990.
GNU multiprecision library, Version 4.1. http://www. swox.com/gmp/2002.
M. Grötschel. Optimierungsmethoden I. Technical report, Universität Augsburg, 1985. Skriptum zur Vorlesung im WS 1984/85.
B. Grünbaum. Convex polytopes. Springer, 2003. 2nd edition edited by V. Kaibel, V. Klee, and G.M. Ziegler.
M. Haiman. A simple and relatively efficient triangulation of the n-cube. Discrete Comput. Geom., 6 (4): 287–289, 1991.
M. Joswig and G. M. Ziegler. Convex hulls, oracles, and homology. Preprint, 11 pages, arXiv: math.MG/0301100.
V. Kaibel and M. E. Pfetsch. Some algorithmic problems in polytope theory. In this volume,pages 23–47.
LEDA, Version 4.3. Algorithmic Solution Software GmbH, http://www.algorithmic-solutions.com/as_html/products/products.html.
C. W. Lee. Subdivisions and triangulations of polytopes. In J. Goodman and J. O’Rourke, editors, Handbook of Discrete and Computational Geometry, pages 271–290. CRC Press, 1997.
J. Matoušek. Lectures on Discrete Geometry. Springer, 2002.
J. Pfeifle and J. Rambau. Computing triangulations using oriented matroids. In this volume, pages 49–75.
K. Polthier, S. Khadem, E. Preuss, and U. Reitebuch. JavaView, Version 2.21. http://www.javaview.de.
A. Schrijver. Theory of linear and integer programming. Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons Ltd., Chichester, 1986.
C. Yap and Z. Du. Core Library (CORE), Version 1.4. http://cs.nyu.edu/exact/core/, 2002.
G. M. Ziegler. Lectures on Polytopes. Springer, 1998. 2nd ed.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joswig, M. (2003). Beneath-and-Beyond Revisited. In: Joswig, M., Takayama, N. (eds) Algebra, Geometry and Software Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05148-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-05148-1_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05539-3
Online ISBN: 978-3-662-05148-1
eBook Packages: Springer Book Archive