LatticePolytopes -- for computations with lattice polytopes. A lattice polytope is a bounded object of the type Polyhedron. This package is focused on functions that are specific for lattice polytopes rather than general polyhedra. Examples of such methods are isCayley , cayley and randZPoly. Moreover the package contains known classifications of smooth 2-polytopes with up to 12 lattice points and smooth 3-polytopes with up to 16 lattice points. These classifications are accessible via the functions listSmooth2D and listSmooth3D

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 2 articles )

Showing results 1 to 2 of 2.
Sorted by year (citations)

  1. Di Rocco, Sandra; Jabbusch, Kelly; Lundman, Anders: A note on higher-order Gauss maps (2017)
  2. Ziegler, Günter M.: Lectures on polytopes (1995)