Geometric Data Structures for Computer Graphics
Data structures and tools from computational geometry help to solve problems in computer graphics; these methods have been widely adopted by the computer graphics community yielding elegant and efficient algorithms. This book focuses on algorithms and data structures that have proven to be versatile, efficient, fundamental, and easy to implement. The book familiarizes students, as well as practitioners in the field of computer graphics, with a wide range of data structures. The authors describe each data structure in detail, highlight fundamental properties, and present algorithms based on the data structure. A number of recent representative and useful algorithms from computer graphics are described in detail, illuminating the utilization of the data structure in a creative way.
Table of Contents
1. Quadtrees and Octrees 2. Orthogonal Windowing and Stabbing Queries 3. BSP Trees 4. Bounding Volume Hierarchies 5. Distance Fields 6. Voronoi Diagrams 7. Geometric Proximity Graphs 8. Kinetic Data Structures 9. Degeneracy and Robustness 10. Dynamization of Geometric Data Structures
Langetepe, Elmar; Zachmann, Gabriel