skip to content
Computational geometry : algorithms and applications Preview this item
ClosePreview this item

Computational geometry : algorithms and applications

Author: M de Berg; et al
Publisher: Berlin : Springer, cop. 2008.
Edition/Format:   Print book : English : 3rd edView all editions and formats
Summary:
This well-accepted introduction to computational geometry is a textbook for high-level undergraduate and low-level graduate courses.

The focus is on algorithms and hence the book is well suited for students in computer science and engineering.

Motivation is provided from the application areas: all solutions and techniques from computational geometry are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems.

For students this motivation will be especially welcome.

Modern insights in computational geometry are used to provide solutions that are both efficient and easy to understand and implement.

All the basic techniques and topics from computational geometry, as well as several more advanced topics, are covered.

The book is largely self-contained and can be used for self-study by anyone with a basic background in algorithms.

In this third edition, besides revisions to the second edition, new sections discussing Voronoi diagrams of line segments, farthest-point Voronoi diagrams, and realistic input models have been added.

* A broad overview of the major algorithms and data structures of the field * Motivated from applications * Covers concepts and techniquesto be presented in any course on computational geometry * Self-contained and illustrated with 370 figures * Additional online material available under http://www.cs.uu.nl/geobook/ * Besides revisions to the second edition, new sections discussing Voronoi diagrams of line segments, farthest-point Voronoi diagrams, and realistic input models have been added.  Read more...

Getting this item's online copy... Getting this item's online copy...

Find a copy in the library

Getting this item's location and availability... Getting this item's location and availability...

WorldCat

Find it in libraries globally
Worldwide libraries own this item

Details

Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: M de Berg; et al
ISBN: 9783540779735 3540779736 3540656200 9783540656203 9783540779742 3540779744 9783642096815 3642096816
OCLC Number: 213457590
Description: XII, 386 p. : ill. ; 25 cm.
Contents: Computational Geometry: Introduction.- Line Segment Intersection: Thematic Map Overlay.- Polygon Triangulation: Guarding an Art Gallery.- Linear Programming: Manufacturing with Molds.- Orthogonal Range Searching: Querying a Database.- Point Location: Knowing Where You Are.- Voronoi Diagrams: The Post Office Problem.- Arrangements and Duality: Supersampling in Ray Tracing.- Delaunay Triangulations: Height Interpolation.- More Geometric Data Structures: Windowing.- Convex Hulls: Mixing Things.- Binary Space Partitions: The Painter's Algorithm.- Robot Motion Planning: Getting Where You Want to Be.- Quadtrees: Non-Uniform Mesh Generation.- Visibility Graphs: Finding the Shortest Route.- Simplex Range Searching: Windowing Revisited.- Bibliography.- Index.
Responsibility: M. de Berg ... [et al.].

Abstract:

This introduction to computational geometry focuses on algorithms. Modern insights in computational geometry are used to provide solutions that are both efficient and easy to understand and implement.
Retrieving notes about this item Retrieving notes about this item

Reviews

Editorial reviews

Publisher Synopsis

"An excellent introduction to the field is given here, including a general motivation and usage cases beyond simple graphics rendering or interaction." from the ACM Reviews by William Fahle, Read more...

 
User-contributed reviews

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.