Printer Friendly

Geometric Data Structures For Computer Graphics.

Geometric Data Structures For Computer Graphics

Elmar Langetepe & Gabriel Zachmann

A K Peters, Ltd.

888 Worcester Street, Suite 230, Wellesley, MA 02482

1568812353 $59.00 www.akpeters.com

Expertly co-authored by Elmar Langetepe (Assistant Professor at the University of Bonn, Germany) and Gabriel Zachmann (Professor for Computer Graphics and Multimedia at the Technical University of Clausthal, Germany), Geometric Data Structures For Computer Graphics is a comprehensive documentation of the computer sciences of data structures and algorithms from computational geometry. Providing readers to an extensive guide to the sciences, definitions, properties, algorithms, and examples of Quadtrees, Orthogonal Windowing and Stabbing Queries, BSP Trees, Bounding Volume Hierarchies, Distance Fields, Voronoi Diagrams, and Geometric Proximity Graphs, as well as a knowledgeable reference of using the existing kinetic, robust, and dynamic data structures. A work of expert and experienced scholarship, Geometric Data Structures For Computer Graphics is very strongly recommended to advanced students of computer and graphic sciences with respect to geometric data structures.
COPYRIGHT 2006 Midwest Book Review
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2006, Gale Group. All rights reserved. Gale Group is a Thomson Corporation Company.

Article Details
Printer friendly Cite/link Email Feedback
Publication:Internet Bookwatch
Article Type:Book review
Date:May 1, 2006
Words:160
Previous Article:Black Genesis.
Next Article:O'Reilly.
Topics:


Related Articles
The Textbook of TQ in Healthcare.
A Garden for Art.
"XML Hacks": XML Secrets from the Gurus to You.

Terms of use | Privacy policy | Copyright © 2020 Farlex, Inc. | Feedback | For webmasters