Computational Geometry : Algorithms and Applications /
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 s...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Other Authors: | , , |
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2000.
|
| Edition: | Second, Revised Edition. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
Table of 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.