Geometric Data Structures for Computer Graphics | |
by Elmar Langetepe and Gabriel Zachmann | |
A K Peters 2006 (362 pages) | |
ISBN:1568812353 | |
Focusing on algorithms and data structures that have proven to be versatile, efficient, fundamental, and easy to implement, this book familiarizes students, as well as practitioners in the field of computer graphics, with a wide range of data structures. |
Table of Contents | |||
Geometric Data Structures for Computer Graphics | |||
Preface | |||
Chapter 1 | - | Quadtrees and Octrees | |
Chapter 2 | - | Orthogonal Windowing and Stabbing Queries | |
Chapter 3 | - | BSP Trees | |
Chapter 4 | - | Bounding Volume Hierarchies | |
Chapter 5 | - | Distance Fields | |
Chapter 6 | - | Voronoi Diagrams | |
Chapter 7 | - | Geometric Proximity Graphs | |
Chapter 8 | - | Kinetic Data Structures | |
Chapter 9 | - | Degeneracy and Robustness | |
Chapter 10 | - | Dynamization of Geometric Data Structures | |
Bibliography | |||
List of Figures | |||
List of Tables | |||
List of Algorithms |