Introductory tiling theory for computer graphics
By: Craig S. Kaplan
Series: Synthesis lectures on computer graphics and animation -- # 11
Publisher: Morgan & Claypool Publishers
Published: 2009
Place of publication: San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA)
Language: eng
Format: [electronic resource] /
ISBN-13: 9781608450183; 9781608450176
Subjects: Computer graphics; Tiling (Mathematics)
Other titles: Synthesis digital library of engineering and computer science.
Description: Tiling theory is an elegant branch of mathematics that has applications in several areas of computer science. The most immediate application area is graphics, where tiling theory has been used in the contexts of texture generation, sampling theory, remeshing, and of course the generation of decorative patterns. The combination of a solid theoretical base (complete with tantalizing open problems), practical algorithmic techniques, and exciting applications make tiling theory a worthwhile area of study for practitioners and students in computer science. This synthesis lecture introduces the mathematical and algorithmic foundations of tiling theory to a computer graphics audience. The goal is primarily to introduce concepts and terminology, clear up common misconceptions, and state and apply important results. The book also describes some of the algorithms and data structures that allow several aspects of tiling theory to be used in practice.
Notes: Part of: Synthesis digital library of engineering and computer science.

Title from PDF t.p. (viewed on August 9, 2009).

Series from website.

Includes bibliographical references (p. 99-102).

Abstract freely available; full-text restricted to subscribers or individual document purchasers.

Also available in print.

Mode of access: World Wide Web.

System requirements: Adobe Acrobat reader.
Table of contents: title: Introduction; title: Organization; title: Tiling basics; title: Defining tilings; title: Anatomy of a tiling; title: Patches; title: Tilings with congruent tiles; title: Symmetry; title: The set of symmetries; title: Symmetry groups; title: Factoring out repetition; title: Periodic replication; title: Symmetries of tilings; title: Other forms of symmetry; title: Colour symmetry; title: Symmetry in other spaces; title: Orbifolds; title: Tilings by polygons; title: Regular and uniform tilings; title: Laves tilings; title: Isohedral tilings; title: Basic definitions; title: Isohedral tiling types; title: Parameterizing the isohedral tilings; title: Edge shape parameterization; title: Tiling vertex parameterization; title: Data structures and algorithms for IH; title: Representing tiling vertex parameterizations; title: Computing transformation matrices; title: Colourings; title: Tiling edge shapes; title: Isohedral templates and prototiles; title: Beyond isohedral tilings; title: Nonperiodic and aperiodic tilings; title: Substitution tilings and rep-tiles; title: Wang tiles and aperiodicity; title: Penrose tilings; title: Survey; title: Drawing periodic tilings; title: Drawing nonperiodic tilings; title: Escher-like tilings; title: Sampling; title: Texture generation; title: The isohedral tiling types.