Abstract
A lattice polytope P is the convex hull of finitely many lattice points in ℤd . It is smooth if each cone in the normal fan is unimodular. It has recently been shown that in fixed dimension the number of lattice equivalence classes of smooth lattice polytopes in dimension d with at most N lattice points is finite. We describe an algorithm to compute a representative in each equivalence class, and report on results in dimension 2 and 3 for N ≤ 12. Our algorithm is implemented as an extension to the software system polymake. © 2010 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Haase, C., Lorenz, B., & Paffenholz, A. (2010). Generating smooth lattice polytopes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6327 LNCS, pp. 315–328). https://doi.org/10.1007/978-3-642-15582-6_51
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
