Planar libraries and environments
XYZGeobench
Library of 2-D algorithms with animation, in
ObjectPascal for the MAC. Algorithms include:
- Convex hull of a simple polyline (linear time algorithm)
- Tangents common to two convex polygons
- Contour of a set of rectangles
- Closest pair of line segments (sweep line)
- Euclidean minimum spanning tree (EMST)
- Traveling salesman heuristics (nearest neighbor, EMST, convex hull,
tour optimizer)
- Exact solution to the traveling salesman problem
- Quad-tree operations (creation, boolean operations)
- Test whether an arbitrary polygon is convex
- On line closest pair
For more information, including a full list of algorithms and
references, see the
abstract .
There is also a README file and some papers at the ftp site.
By Peter Schorn and lots of others, at ETH Zurich.
Distributed by ftp from ETH.
geolab
A library of 2-D geometric algorithms and data
structures, with a visualization environment. In C++
for SUN/OS (dynamic linking requires the SUN C++
compiler for the whole package,
but you might be able to hack out and adapt the code for a particular problem).
Over 40 algorithms, including all the computational geometry classics
plus some other interesting things like:
- Furthest point Voronoi diagram
- Nearest neighbors
- Ray shooting
You can look at the README
for more information.
By Pedro J. de Rezende, Welson R. Jacometti, Cesar N. Gon,
and Laerte F. Morgado, Universidade Estadual de Campinas, Brazil.
Because Brazil is far away, we mirror this system in our
ftp
directory.
Up:
Directory of Computational Geometry Software
![[HOME]](/pix/home.gif)
The Geometry Center Home Page
Created: May 31 1995 ---