Geometric Data Structures for Computer Graphics

Elmar Langetepe, Gabriel Zachmann (Autoren)

Buch | Hardcover

362 Seiten

2006
A K Peters (Verlag)
978-1-56881-235-9 (ISBN)

Titel z.Zt. nicht lieferbar
Versandkostenfrei
Auch auf Rechnung

Artikel merken

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.

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.

Langetepe, Elmar; Zachmann, Gabriel

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

Erscheint lt. Verlag	16.1.2006
Verlagsort	Natick
Sprache	englisch
Maße	152 x 229 mm
Gewicht	830 g
Themenwelt	Mathematik / Informatik ► Informatik ► Grafik / Design
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
ISBN-10	1-56881-235-3 / 1568812353
ISBN-13	978-1-56881-235-9 / 9781568812359
Zustand	Neuware