Non-lattice-periodic tilings of R^3 by single polycubes
DOI10.1016/J.TCS.2012.01.014zbMATH Open1243.05061OpenAlexW2063248089MaRDI QIDQ428854FDOQ428854
Authors: I. Gambini, L. Vuillon 
Publication date: 25 June 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.014
Recommendations
polycubesanisohedral numberlattice-periodic tilingstilings by translationtilings of \(\mathbb R^{3}\)
Three-dimensional polytopes (52B10) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)
Cites Work
- Forcing nonperiodicity with a single tile
- An aperiodic hexagonal tile
- Checker Boards and Polyominoes
- On the tiling by translation problem
- On translating one polyomino to tile the plane
- Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino
- The hexagonal parquet tiling: \(k\)-isohedral monotiles with arbitrarily large \(k\).
- Isohedral polyomino tiling of the plane
- Tilings with congruent tiles
- An algorithm for deciding if a polyomino tiles the plane
- How many faces can the polycubes of lattice tilings by translation of \(\mathbb R^3\) have?
- Polygons, polyominoes and polycubes
Cited In (7)
- On the structure of cube tilings of \(\mathbb R^3\) and \(\mathbb R^4\)
- Structure results for multiple tilings in 3D
- Tiling the space by polycube analogues of Fedorov's polyhedra
- Strongly nonperiodic hyperbolic tilings using single vertex configuration
- How many faces can the polycubes of lattice tilings by translation of \(\mathbb R^3\) have?
- The existence on non-tiles and non-facets in three dimensions
- Concrete polytopes may not tile the space
This page was built for publication: Non-lattice-periodic tilings of \(\mathbb R^3\) by single polycubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428854)
