scientific article; zbMATH DE number 5242321
From MaRDI portal
Publication:5445352
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Quadratic forms (reduction theory, extreme forms, etc.) (11H55) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)
Recommendations
- Perfect Delaunay polytopes
- Perfect Delaunay polytopes and perfect quadratic functions of lattices
- Almost regular Delaunay-triangulations
- Complexity of Delaunay triangulation for points on lower-dimensional polyhedra
- Delaunay polytopes of cut lattices
- scientific article; zbMATH DE number 2066953
- A tight bound for the Delaunay triangulation of points on a polyhedron
- The seven dimensional perfect Delaunay polytopes and Delaunay simplices
- Optimal higher order Delaunay triangulations of polygons
- Optimal Higher Order Delaunay Triangulations of Polygons
Cited in
(9)- The seven dimensional perfect Delaunay polytopes and Delaunay simplices
- Delaunay polytopes derived from the Leech lattice
- Perfect Delaunay polytopes
- Delaunay transformations of a Delaunay polytope
- Classification of eight-dimensional perfect forms
- The six-dimensional Delaunay polytopes
- Inhomogeneous extreme forms
- Perfect and almost perfect homogeneous polytopes
- Perfect Delaunay polytopes and perfect quadratic functions of lattices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445352)