2014/08/20 by Benjamin Assarf, Ewgenij Gawrilow, Assarf, Benjamin +11 · 2 citations
Computer Science · Engineering · Mathematics · #Advanced Combinatorial Mathematics #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Convex hull #Convex optimization #Convex polytope #Convex set #Data Management and Algorithms #Discrete mathematics #Engineering #Geometry #Half-integer #Hull #Implementation #Integer (computer science) #Integer lattice #Integer programming #Lattice (music) #Mathematical optimization #Mathematics #Polyhedron #Polytope #Regular polygon #math.CO #math.OC #msc:52-04 #msc:90-08
paper · pdf · doi:10.48550/arxiv.1408.4653
published in arXiv (Cornell University) (Cornell University) · major revision: experiments repeated with new software versions; new experiments and additional software tested; new title; 38 pages including appendix, 10 figures, 9 tables
openalex publication_date 2014/08/20 · arxiv created 2015/11/27 · arxiv updated 2015/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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".