Data structures and algorithms for tilings I
From MaRDI portal
Publication:1401377
DOI10.1016/S0304-3975(02)00500-5zbMath1019.68808MaRDI QIDQ1401377
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Data structures (68P05) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)
Related Items (6)
On local operations that preserve symmetries and on preserving polyhedrality of maps ⋮ Experimental investigation of the mechanical stiffness of periodic framework-patterned elastomers ⋮ Surface embeddings of the Klein and the Möbius–Kantor graphs ⋮ Tegula -- exploring a galaxy of two-dimensional periodic tilings ⋮ Isotopic tiling theory for hyperbolic surfaces ⋮ Tile-transitive tilings of the Euclidean and hyperbolic planes by ribbons
Uses Software
Cites Work
- The generation and classification of tile-k-transitive tilings of the Euclidean plane, the sphere and the hyperbolic plane
- On tilings of the plane
- Combinatorial and metric theory of planigons
- Classification of solid transitive simplex tilings in simply connected 3-spaces
- Geometry II: spaces of constant curvature. Transl. from the Russian by V. Minachin
- Presentations of discrete groups, acting on simply connected manifolds, in terms of parametrized systems of Coxeter matrices - a systematic approach
- A hierarchy of classification methods for patterns*
- Recognition of flat orbifolds and the classification of tilings in \(\mathbb{R}^3\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Data structures and algorithms for tilings I
