ABSTRACT

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.

chapter 1|16 pages

Quadtrees and Octrees

chapter 2|33 pages

Orthogonal Windowing and Stabbing Queries

chapter 3|14 pages

BSP Trees

chapter 4|20 pages

Bounding Volume Hierarchies

chapter 5|10 pages

Distance Fields

chapter 6|51 pages

Voronoi Diagrams

chapter 7|34 pages

Geometric Proximity Graphs

chapter 8|21 pages

Kinetic Data Structures

chapter 9|92 pages

Degeneracy and Robustness

chapter 10|28 pages

Dynamization of Geometric Data Structures