A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
How good are convex hull algorithms?
Computational Geometry: Theory and Applications
Computational geometry software
Handbook of discrete and computational geometry
The vertex set of a 0/1-polytope is strongly P-enumerable
Computational Geometry: Theory and Applications
More polytopes meeting the conjectured Hirsch bound
Discrete Mathematics
A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions
A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions
h-Assignments of simplicial complexes and reverse search
Discrete Applied Mathematics
Facet defining inequalities among graph invariants: The system GraPHedron
Discrete Applied Mathematics
Note: h-Assignments of simplicial complexes and reverse search
Discrete Applied Mathematics
Flexible object hierarchies in polymake
ICMS'06 Proceedings of the Second international conference on Mathematical Software
An output-sensitive algorithm for computing projections of resultant polytopes
Proceedings of the twenty-eighth annual symposium on Computational geometry
| Hi-index | 0.00 |
polymake is a software package designed for the study of the combinato rics and the geometry of convex polytopes and polyhedra. It offers access to a wide variety of algorithms and tools within a common framework. As a key design feature it allows to incorporate the functionality of a great variety of other software packages in a modular way. polymake is open source software; it is freely available on the Internet at \url{http://www.math.tu-berlin.de/diskregeom/polymake/}. AMS Subject Classification (2000): 52-04 (52Bxx)