polymake: a Framework for Analyzing Convex Polytopes

polymake is a software tool designed for the algorithmic treatment of polytopes and polyhedra. We give an overview of the functionality as well as of the structure. This paper can be seen as a first approximation to a polymake handbook.

[1]  David Avis,et al.  A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra , 1991, SCG '91.

[2]  Margaret M. Bayer,et al.  Combinatorial Aspects of Convex Polytopes , 1993 .

[3]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[4]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[5]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[6]  Donald Ervin Knuth,et al.  The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information , 1978 .

[7]  G. BLIND,et al.  Cubical 4-Polytopes with Few Vertices , 1997 .

[8]  Komei Fukuda,et al.  Double Description Method Revisited , 1995, Combinatorics and Computer Science.

[9]  Herbert Edelsbrunner.  Fundamental Concepts in Combinatorial Geometry , 1987 .

[10]  R. Blind,et al.  Cubical d-Polytopes with Few Vertices for d>4 , 1997 .

[11]  R. Blind,et al.  Convex polytopes without triangular faces , 1990 .

[12]  Gil Kalai,et al.  Linear programming, the simplex algorithm and simple polytopes , 1997, Math. Program..

[13]  J. Humphreys.  Reflection groups and coxeter groups , 1990 .

[14]  Nina Amenta,et al.  Computational geometry software , 1997 .

[15]  D. Avis.  A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm , 2000 .

[16]  Michael Joswig.  Reconstructing a Non-simple Polytope from its Graph , 2000 .

[17]  Raimund Seidel,et al.  How Good Are Convex Hull Algorithms? , 1997, Comput. Geom..