Computational Geometry in C (Second Edition)

, Cambridge University Press, pp.376, October 1998

MESHING
RESEARCH
CORNER

Olin Professor of Computer Science
Department of Computer Science
Smith College.
Northampton, MA 01063, USA
orourke@cs.smith.edu
http://grendel.csc.smith.edu/~orou rke/

Summary
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.

Contents: Polygon Triangulation/ Polygon Partitioning/ Convex Hulls/ Convex Hulls in 3D/ Voronoi Diagrams/ Arrangements/ Search and Intersection/ Motion Planning

More info about book can be obtained from authors web site at http://grendel.csc.smith.edu/~orourke/books/compgeom.html