Algorithmische Geometrie 001

1. Polygon Triangulation -- 2. Polygon Partitioning -- 3. Convex Hulls In Two Dimensions -- 4. Convex Hulls In Three Dimensions -- 5. Voronoi Diagrams -- 6. Arrangements -- 7. Search And Intersection -- 8. Motion Planning -- 9. Additional Topics. Joseph O'rourke. Includes Bibliographical References (p. [321]-333) And Index. A textbook which introduces undergraduates to the design of geometry algorithms, which arise in a range of practical areas such as computer graphics, robotics and pattern recognition. The basic techniques used in computational geometry are covered - polygon triangulations and so on. Much of computational geometry performs its computations on geometrical objects known as polygons.