Introductory Tiling Theory for Computer Graphics
From MaRDI portal
Publication:3087838
DOI10.2200/S00207ED1V01Y200907CGR011zbMath1230.68007OpenAlexW2093105957MaRDI QIDQ3087838
Publication date: 17 August 2011
Published in: Synthesis Lectures on Computer Graphics and Animation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2200/s00207ed1v01y200907cgr011
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)
Related Items (7)
Wang Tile Modeling of Wall Patterns ⋮ Escher-like Tilings with Weights ⋮ An efficient exhaustive search algorithm for the Escherization problem ⋮ A figure with Heesch number 6: pushing a two-decade-old boundary ⋮ Unnamed Item ⋮ Using tiling theory to generate angle weaves with beads ⋮ The Heesch number for multiple prototiles is unbounded
This page was built for publication: Introductory Tiling Theory for Computer Graphics