## Geometric Data Structures for Computer GraphicsData 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. |

### 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

Geometric Data Structures for Computer Graphics Elmar Langetepe,Gabriel Zachmann No preview available - 2006 |

### Common terms and phrases

Additionally algebraic algorithm approximation assume axis-parallel binary decomposition bounding volume BSP tree cell CGAL circumcenter collision detection Computational Geometry Computer Graphics construction convex hull corresponding d-dimensional data structure DCEL defined definition Delaunay triangulation delete denote distance field dynamic efficient endpoints Equation evaluation exact example Figure floating-point arithmetic floating-point number function Geom geometric algorithm Geometric Computation given Guibas IEEE implemented input interpolation search intersection interval tree kd-tree Klein leaf Lemma line segments logn matrix mod q nearest neighbor node objects octree orientation test Overmars perturbation plane point cloud polygons precision predicates problem Proc proximity graph quadtree range tree recursive relative error representation represents RightChild robust root scheme Section segment tree set of points Shewchuk simple space sphere split stabbing query static stored surface Theorem training set triangle vector vertex vertices Voronoi diagram WeakDelete operation x-coordinates Zachmann