Computational Geometry
Algorithms and Applications
2nd Edition
Published on 28. January 2000
Book
Hardback
XII, 367 pages
978-3-540-65620-3 (ISBN)
Description
This introduction to computational geometry focuses on algorithms. Motivation is provided from the application areas as all techniques are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems. Modern insights in computational geometry are used to provide solutions that are both efficient and easy to understand and implement.
More details
Edition
2nd rev. ed.
Language
English
Place of publication
Heidelberg
Germany
Publishing group
Springer Berlin
Target group
College/higher education
Professional and scholarly
Edition type
Revised edition
Illustrations
249 s/w Abbildungen
1
Dimensions
Height: 26 cm
Width: 19 cm
Thickness: 22 mm
Weight
953 gr
ISBN-13
978-3-540-65620-3 (9783540656203)
DOI
10.1007/978-3-662-04245-8
Schweitzer Classification
Other editions
New editions
Book
03/2008
3rd Edition
Springer
€58.84
Available immediately
Previous edition
Book
06/1997
Springer
€85.59
Article exhausted; check for reprint
Content
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.