Complexity of convex stereohedra

DOI10.1007/BF02355091zbMath0926.52022OpenAlexW2056441579MaRDI QIDQ1274100

K. Appert

Publication date: 21 November 1999

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02355091

zbMATH Keywords

stereohedraisohedral tilings (of Euclidean \(d\)-space)spacefiller

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Polyhedra and polytopes; regular figures, division of spaces (51M20) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Related Items (1)

Unnamed Item

Cites Work

• Two finiteness theorems for periodic tilings of \(d\)-dimensional Euclidean space
• An Introduction to the Geometry of Numbers
• The volume of certain convex sets

This page was built for publication: Complexity of convex stereohedra