This all-new 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.

Computational geometry emerged from the field of algorithms design and anal­ ysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The suc­ cess of the field as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domains--computer graphics, geographic in­ formation systems (GIS), robotics, and others-in which geometric algorithms play a fundamental role. For many geometric problems the early algorithmic solutions were either slow or difficult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simplified many of the previous approaches. In this textbook we have tried to make these modem algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry, but it can also be used for self-study.

1 Computational Geometry: Introduction.- 2 Line Segment Intersection: Thematic Map Overlay.- 3 Polygon Triangulation: Guarding an Art Gallery.- 4 Linear Programming: Manufacturing with Molds.- 5 Orthogonal Range Searching: Querying a Database.- 6 Point Location: Knowing Where You Are.- 7 Voronoi Diagrams: The Post Office Problem.- 8 Arrangements and Duality: Supersampling in Ray Tracing.- 9 Delaunay Triangulations: Height Interpolation.- 10 More Geometric Data Structures: Windowing.- 11 Convex Hulls: Mixing Things.- 12 Binary Space Partitions: The Painter's Algorithm.- 13 Robot Motion Planning: Getting Where You Want to Be.- 14 Quadtrees: Non-Uniform Mesh Generation.- 15 Visibility Graphs: Finding the Shortest Route.- 16 Simplex Range Searching: Windowing Revisited.