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.
This 1998 book explains the design of geometry algorithms, including discussion of implementation issues and working C code.
'... the author does an excellent job of explaining difficult concepts in an accessible, even entertaining, manner ... If this is your field, this is your book!' Developers Review 'The balanced combination of careful descriptions, examples, algorithms and exercises makes it a pleasure to read ...'. Zentralblatt 'Anyone who wants to know what this field is all about should read this book! The book is a pleasure to read, as questions that arise naturally in the reader's mind are answered, in almost all cases, in the following paragraph. The style strikes an ideal balance between rigor and informality. Mr O'Rourke must be a wonderful teacher and I envy his students.' Miriam L. Lucian, Society for Industrial and Applied Mathematics
|
Ask a Question About this Product More... |
|
