18.04.2013 Views

The.Algorithm.Design.Manual.Springer-Verlag.1998

The.Algorithm.Design.Manual.Springer-Verlag.1998

The.Algorithm.Design.Manual.Springer-Verlag.1998

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Computational Geometry<br />

complete bibliography on computational geometry. It references over eight thousand books, papers, and<br />

reports and includes detailed abstracts for many of them. Grep-ing through the geom.bib is an amazingly<br />

efficient way to find out about previous work without leaving your office. It is available via anonymous<br />

ftp from ftp.cs.usask.ca, in the file pub/geometry/geombib.tar.Z.<br />

<strong>The</strong>re is a growing body of implementations of geometric algorithms. We point out specific<br />

implementations where applicable in the catalog, but the reader should be aware of three specific WWW<br />

sites:<br />

● <strong>The</strong> Geometry Center's directory of computational geometry software, maintained by Nina<br />

Amenta, is the ``official'' site for all computational geometry software. Check here first to see<br />

what is available: http://www.geom.umn.edu/software/cglist/.<br />

● Graphics Gems is a series of books dedicated to collecting small codes of interest in computer<br />

graphics. Many of these programs are geometric in nature. All associated codes are available from<br />

ftp://ftp-graphics.stanford.edu/pub/Graphics/GraphicsGems.<br />

● CGAL (Computational Geometry <strong>Algorithm</strong>s Library) is a joint European project now underway<br />

to produce a comprehensive library of geometric algorithms. This will likely become the<br />

definitive geometric software project. Check out its progress at http://www.cs.ruu.nl/CGAL/.<br />

● Robust Geometric Primitives<br />

● Convex Hull<br />

● Triangulation<br />

● Voronoi Diagrams<br />

● Nearest Neighbor Search<br />

● Range Search<br />

● Point Location<br />

● Intersection Detection<br />

● Bin Packing<br />

● Medial-Axis Transformation<br />

● Polygon Partitioning<br />

● Simplifying Polygons<br />

● Shape Similarity<br />

● Motion Planning<br />

● Maintaining Line Arrangements<br />

● Minkowski Sum<br />

file:///E|/BOOK/BOOK4/NODE183.HTM (2 of 3) [19/1/2003 1:31:33]

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!