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

About the Author

Langetepe, Elmar; Zachmann, Gabriel

Reviews

" "Langetepe (Univ. of Bonn, Germany) and Zachmann (computer graphics and multimedia, Technical University Clausthal, Germany) offer an elegant and excellent book on the fundamental data structures and algorithms used in computer graphics. Users will learn how to solve problems in computer graphics, recognize geometric problems, and select the most suitable data structure for developing computer graphics algorithms." -C. Tappert, CHOICE Magazine, November 2006 data structures are an indispensable tool in computer graphics. They help to make complex tasks easy, and lead to considerable speed-up. Authored by two experts in Computational Geometry and Computer Graphics, this book explains the latest techniques, along with established classics. A unique reference for cutting-edge software design! " -Prof. Rolf Klein, University of Bonn, Germany, October 2006 "This book is an excellent and readable introduction to Computational Geometry that makes pretty accessible to the non-specialist the quite esoteric topics of specialized data structures for geometric modeling ... attractive and easy to read." -Alberto Paoluzzi, Science Direct, October 2007 "A work of expert and experienced scholarship ... very strongly recommended to advanced students of computer and graphic sciences ..." -Library Bookwatch, May 2006 "The book keeps a refreshing balance between classical geometric data structures and direct application to computer graphics problems." -Mathematiacl Reviews, January 2007"