
Title:
Geometric data structures for computer graphics
Author:
Langetepe, Elmar, 1967-
ISBN:
9781439865620
9781568812359
9780367803735
9781000713862
9781000713503
Publication Information:
Wellesley, Mass. : A K Peters, ©2006.
Physical Description:
1 online resource (xiii, 339 pages, 8 unnumbered pages of plates) : illustrations (some color)
Contents:
Quadtrees and octrees -- Orthogonal windowing and stabbing queries -- BSP trees -- Bounding volume hierarchies -- Distance fields -- Voronoi diagrams -- Geometric proximity graphs -- Kinetic data structures -- Degeneracy and robustness -- Dynamization of geometric data structures.
Abstract:
Annotation 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.
Added Author:
Electronic Access:
Click here to view.Taylor & Francis https://www.taylorfrancis.com/books/9780367803735
OCLC metadata license agreement http://www.oclc.org/content/dam/oclc/forms/terms/vbrl-201703.pdf
Copies:
Available:*
Library | Material Type | Item Barcode | Shelf Number | Status | Item Holds |
|---|---|---|---|---|---|
Searching... | E-Book | 540585-1001 | T385 .L364 2006 EB | Searching... | Searching... |
