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.
Les mer
This book focuses on algorithms and geometric data structures that have proven to be versatile, efficient and fundamental. It endows practitioners in the computer graphics field with a working knowledge of a wide range of geometric data structures from computational geometry.
Les mer
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
Les mer
Produktdetaljer
ISBN
9780367453862
Publisert
2019-12-18
Utgiver
Taylor & Francis Ltd
Vekt
670 gr
Høyde
229 mm
Bredde
152 mm
Aldersnivå
P, 06
Språk
Product language
Engelsk
Format
Product format
Heftet
Antall sider
362