# Computational Geometry in C

**Computational Geometry in C.**

Joseph O'Rourke

Cambridge University Press, 1994.

346+xi pages, 228 exercises, 200 figures, 219 references.

ISBN 0-521-44592-2/Pb $28.95.

ISBN 0-521-44034-3/Hc $64.95.

40 West 20th St.,
New York, NY 10011-4211

1-800-872-7423.

How to order

Fig: convex hull of 10,000 points in a sphere, produced

by code from the book: `sphere 10000 | chull`

### First Edition Jacket Description

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, rogotics, 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. Thus,
though it is designed for a course at the junior undergraduate level, it can
be used for graduate courses as well. 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. Researchers in computer
graphics, robotics, computer vision, and geometric design will find this a
useful source book.