Computing convex hulls and counting integer points with polymake
Benjamin Assarf, Ewgenij Gawrilow, Katrin Herr, Michael Joswig,, Benjamin Lorenz, Andreas Paffenholz, Thomas Rehn

TL;DR
This paper reviews current methods and algorithms for computing convex hulls, integer hulls, and counting lattice points in convex polytopes using polymake, providing practical insights and rules of thumb.
Contribution
It offers a comprehensive overview of algorithms and implementations for convex hulls and lattice point counting within the polymake system, including practical guidelines.
Findings
Summarizes ten practical rules of thumb for computing integer hulls.
Evaluates various algorithms and their performance within polymake.
Provides insights into the state-of-the-art computational techniques.
Abstract
The main purpose of this paper is to report on the state of the art of computing integer hulls and their facets as well as counting lattice points in convex polytopes. Using the polymake system we explore various algorithms and implementations. Our experience in this area is summarized in ten "rules of thumb".
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Computational Geometry and Mesh Generation · Data Management and Algorithms
