Computational Geometry in C - Tapa dura

"It teaches the subject with the care and precision one hopes to find in the best colleges and universities. The development of the material is well placed, self-contained, and wonderfully motivated. The explanations flow at an unhurried pace and account for most any question one might have when meeting the subject for the first time....Teaching a course from this book must be a distinct pleasure." Christoph M. Hoffmann, SIAM Review ."..very clearly written and manages to make traditionally difficult-to-explain topics such as point-line duality very understandable...includes interesting exercises that range from straightforward applications of the material to the more difficult and thought-provoking questions to open problems...conveys the feeling that computational geometry is interesting, exciting, important, and very active." Scot Drysdale, SIGACT News

This is the first textbook suitable for introducing undergraduate students to the design of geometry algorithms. These algorithms arise in many practical areas such as computer graphics, robotics, and pattern recognition. The basic techniques used in computational geometry are all covered: polygon triangulations, convex hulls, Voronoi diagrams, and arrangements. Other topics include partitioning, geometric searching, and motion planning. The self-contained treatment presumes only an elementary knowledge of mathematics, but reaches topics on the frontier of current research. Numerous exercises are provided at the end of every section. A novel aspect of the book is the inclusion of working C code for many of the algorithms. The interplay between practical programming issues and the latest theoretical developments makes this text unique.