Complexity of convex stereohedra
From MaRDI portal
The author proves that any \(d\)-dimensional stereohedron, i.e., a spacefiller which admits an isohedral face-to-face tiling (that is, a tiling for which its symmetry group acts transitively on the tiles), has at most \( f(d) = 2^d ( H(d) - {1\over 2}) - 2 \) \((d-1)\)-dimensional faces where \( H(d) \) is the maximal index of the translation subgroup in an arbitrary crystallographic group (of dimension \(d\)). This improves the known bound by Delaunay (=Delone) (1961) by \( 3 \cdot 2^{d-1} \).
Recommendations
- On tilings whose tiles have many facets
- On the number of facets of three-dimensional Dirichlet stereohedra. III: Full cubic groups
- On the number of facets of three-dimensional Dirichlet stereohedra. IV: Quarter cubic groups
- On the number of facets of three-dimensional Dirichlet stereohedra. II: Non-cubic groups
- On the number of facets of three-dimensional Dirichlet stereohedra. I: Groups with reflections
Cites work
Cited in
(6)- On the number of facets of three-dimensional Dirichlet stereohedra. II: Non-cubic groups
- scientific article; zbMATH DE number 5302815 (Why is no real title available?)
- Stereology for some classes of polyhedrons
- How many facets on average can a tile have in a tiling?
- On the number of facets of three-dimensional Dirichlet stereohedra. I: Groups with reflections
- On the number of facets of three-dimensional Dirichlet stereohedra. III: Full cubic groups
This page was built for publication: Complexity of convex stereohedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1274100)