Craig S. Kaplan “Introductory Tiling Theory for Computer Graphics (Synthesis Lectures on Computer Graphics & Animation)”
Morgan & Claypool | English | 2009-07-15 | ISBN: 1608450171 | 120 pages | PDF | 1,4 MB

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.

Download | Mirror | mirror

Download fast

Related Posts

1. Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration
2. Computer Network Security: Theory and Practice
3. Computer Graphics for Java Programmers
4. Cooperative and Noncooperative Multi-Level Programming (Operations Research/Computer Science Interfaces Series)
5. A Concise Introduction to Languages and Machines (Undergraduate Topics in Computer Science)