Computational geometry

Motivation is provided from the application areas: all solutions and techniques of 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.

This textbook on computational geometry is directed to undergraduate and graduate students in computer science, engineering, and mathematics. The very important topic is presented in a modern way by well-known authors: The book focuses on algorithms; applications in computer science and engineering motivate the problems, solutions, and techniques presented.

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.
Quad Trees: Non-Uniform Mesh Generation.
Visibility Graphs: Finding
the Shortest Route.
Simplex Range Searching: Windowing Revisited.
Bibliography.
Index.