Data structures and algorithms for tilings I
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3857374 (Why is no real title available?)
- scientific article; zbMATH DE number 3917125 (Why is no real title available?)
- scientific article; zbMATH DE number 3968590 (Why is no real title available?)
- scientific article; zbMATH DE number 43081 (Why is no real title available?)
- scientific article; zbMATH DE number 53726 (Why is no real title available?)
- scientific article; zbMATH DE number 739033 (Why is no real title available?)
- scientific article; zbMATH DE number 3286754 (Why is no real title available?)
- A hierarchy of classification methods for patterns*
- Classification of solid transitive simplex tilings in simply connected 3-spaces
- Combinatorial and metric theory of planigons
- Geometry II: spaces of constant curvature. Transl. from the Russian by V. Minachin
- On tilings of the plane
- Presentations of discrete groups, acting on simply connected manifolds, in terms of parametrized systems of Coxeter matrices - a systematic approach
- Recognition of flat orbifolds and the classification of tilings in \(\mathbb{R}^3\)
- The generation and classification of tile-k-transitive tilings of the Euclidean plane, the sphere and the hyperbolic plane
Cited in
(6)- Isotopic tiling theory for hyperbolic surfaces
- On local operations that preserve symmetries and on preserving polyhedrality of maps
- Experimental investigation of the mechanical stiffness of periodic framework-patterned elastomers
- Tile-transitive tilings of the Euclidean and hyperbolic planes by ribbons
- Tegula -- exploring a galaxy of two-dimensional periodic tilings
- Surface embeddings of the Klein and the Möbius–Kantor graphs
This page was built for publication: Data structures and algorithms for tilings I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401377)
