Geometric Data Structures for Computer Graphics

Front Cover
Taylor & Francis, Jan 16, 2006 - Computers - 369 pages
1 Review
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.

From inside the book

What people are saying - Write a review

User Review - Flag as inappropriate

what is geometric algorithm?

Contents

Orthogonal Windowing and Stabbing Queries
17
BSP Trees
51
Bounding Volume Hierarchies
65
Copyright

8 other sections not shown

Other editions - View all

Common terms and phrases

About the author (2006)

Elmar Langetepe is an assitant professor at the University of Bonn, Germany. He received a MSc in mathematics from the University of Osnabrück, Germany and a Ph.D. from the University of Hagen, Germany.Dr. Gabriel Zachmann is an assistant professor at the University of Bonn, Germany and heads a research group for novel interaction methods in virtual prototyping. He received his MSc in computer science from the Technical University Karlsruhe, Germany and his Ph.D. from the Technical University Darmstadt, Germany.

Bibliographic information