This 1998 book explains the design of geometry algorithms, including discussion of implementation issues and working C code.
This is the newly-revised and expanded edition of a popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. The code in this new edition is significantly improved and four new routines are included. Illustrated.
Inhaltsverzeichnis
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. Sources.
