Computational Geometry Algorithms and Applications /
Computational geometry emerged from the ?eld of algorithms design and analysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The success of the ?eld as a research discipline can on the one hand be explain...
Main Authors: | , , , |
---|---|
Corporate Author: | |
Format: | Electronic eBook |
Language: | English |
Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2008.
|
Edition: | Third Edition. |
Subjects: | |
Online Access: | Full Text via HEAL-Link |
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.