pith. sign in

arxiv: 1408.4653 · v2 · pith:PRXX3RU2new · submitted 2014-08-20 · 🧮 math.CO · math.OC

Computing convex hulls and counting integer points with polymake

classification 🧮 math.CO math.OC
keywords computingconvexcountinghullsintegerpointspolymakealgorithms
0
0 comments X
read the original 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".

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.