GOOD: This book is in good condition, showing most of its use and wear in its slightly curled covers. There is no writing on the pages.
Product Details
Continued from the back cover: "The basic techniques used in computational geometry are all covered: polygon triangulations, convex hulls, Voronoi diagrams, arrangements, geometric searching, and motion planning. The self-contained treatment presumes only an elementary knowledge of mathematics, but it reaches topics on the frontier of current research. Thus professional programmers will find it a useful tutorial.
"This edition contains material on several new topics, including randomized algorithms for polygon triangulations, planar point location, and 3D convex hull construction, intersection algorithms for ray-segment and ray-triangle, and point-in-polyhedron. A new 'Sources' chapter points to supplemental literature for readers needing more information on any topic.
"A novel aspect of the book is the inclusion of working C code for many of the algorithms, with discussion of practical implementation issues. The code in this new edition is significantly improved from the first edition (more efficient and more robust), and four new routines are included. Java versions for all code are also available. The code is accessible form the book's web site ... or by anonymous ftp."
Chapters
Polygon Triangulation
Polygon Partitioning
Convex Hulls in Two Dimensions
Convex Hulls in Three Dimensions
Voronoi Diagrams
Arrangements
Search and Intersection
Motion Planning
Sources
The book concludes with a Bibliography and an Index.
