Libraries:
Other texts:
-
J. O'Rourke. Computational Geometry in C.
Cambridge U. Press, 1993.
A good undergraduate text (Joe O'Rourke teaches at
Smith College and wrote the text for his senior class).
Of necessity limited in scope and more oriented toward
presenting interesting ideas and geometric structures
than toward algorithms for computational geometry.
Very well written and presented.
-
K. Mulmuley. Computational Geometry: An Introduction
Through Randomized Algorithms. Prentice-Hall.
Unfortunately out of print. Not particularly well written, but by
far the best presentation of randomization anywhere.
Very detailed discussion of semidynamic and dynamic
algorithms. More advanced and more specialized than
the text of de Berg et al.
-
F. Preparata and I. Shamos. Computational Geometry.
Springer Verlag.
Somewhat dated; the first text on the topic; several chapters
are much too dense for what they have to say and others present
a very complex approach where we now know of simple ones.
-
H. Edelsbrunner. Algorithms in Combinatorial Geometry.
Springer Verlag.
Somewhat old, although by one of the top 2-3 people in the field.
Very much oriented toward geometry, somewhat less so towards
algorithms and computation -- thus of a more theoretical and
foundational flavor.
-
J. Goodman and J. O'Rourke, eds. Handbook of Discrete and
Computational Geometry. CRC Press.
A monster of a book (about 1,000 pp.), covering both computational
and non-computational aspects of discrete geometry.
Of necessity, most chapters are short, with long lists of
references. Not a textbook, and not even a really good reference,
but a very good index to the literature.
Standard conferences:
-
The ACM Annual Symposium on Computational Geometry
(1998 will see the 14th symposium) is the top conference in
the field; each year has about 35-40 papers of 10 pages each,
many of which end up in some journal later.
-
The Canadian Conference on Computational Geometry (1998
will see the 10th conference) is the second best conference in
the area. Again, about 30-40 papers are presented; a subset appears
each year in a special issue of Computational Geometry:
Theory and Applications
-
Many other conferences touching on algorithms include work on
computational geometry, particularly the ACM/SIAM Symposium
on Discrete Algorithms (SODA), the ACM Symposium on
the Theory of Computing (STOC), the Workshop on Algorithms
and Data Structures (WADS) (Canadian) and its twin
Scandinavian Workshop on Algorithms (SWAT), and many
others.
Standard journals:
-
Three specialized journals are devoted to computational geometry:
Discrete and Computational Geometry has been published
since 1986 and is the most prestigious, but also the most
theoretical of the three, while Computational Geometry:
Theory and Applications and International Journal of
Computational Geometry and Applications are more recent
arrivals (early 1990s for both).
-
Several algorithms journals regularly publish articles in the area.
Best among these is Algorithmica, which also periodically
devotes a special issue to the topic. Others include the
Journal of Algorithms, the Journal of the ACM,
the SIAM Journal of Computing, the SIAM Journal of
Discrete Mathematics, and Discrete and Applied
Mathematics.
Applications:
Much work in applied computational geometry gets published in journals
and conferences devoted to computer graphics, pattern recognition,
image understanding, visualization, scientific computing (especially
work on meshes), databases, etc.
Web resources:
Several researchers maintain elaborate web sites on the topic; best
among these are David Eppstein's
Geometry Junkyard,
Jeff Erickson's Geometry Page. A fun Voronoi diagram code written in GL for the SGI sits in
my directories under ~moret/bin/sgi/voronoi -- try it sometime on an SGI.
Code for box intersection in high dimensions: my code for four different approaches
can be found here; there are four approaches: brute force
(directory brute, priority kd-tree (directory kd), segment-range
trees (directory segment-range, and the theoretically optimal approach
(directory linear).