Shortest Paths Code

Biliana Kaneva and Joseph O'Rourke

Research supported by National Science Foundation grant CCR-9731804. Views expressed are those of the authors, and do not necessarily reflect those of the NSF.

The Paper

Biliana Kaneva and J. O'Rourke, "An Implementation of Chen & Han's Shortest Paths Algorithm"
in Proc. of the 12th Canadian Conference on Computational Geometry, New Brunswick, August 2000, pp. 139-146.
Download postscript file shortest.ps.gz (1.2M) N.B.: a very large file!

Sample Code Output: Images

Flat Terrains (for testing correctness)	Snake Terrains (for testing correctness)
Convex Polytopes (points on Spheres)	Convex Polytopes (points on Ellipsoids)
Nonconvex Terrains (mild)	Nonconvex Terrains (rough)
Cones & Cylinders	Orthogonal Polyhedra

Code Input & Output Files

sp.cpp Input File format: specifications
sp.cpp Output File format: specifications
Examples

Tetrahedron
Cube
Cube (w/o top)
Creating Input files and processing Output files

The Code

Download a gzip'ed tar archive of Version 1.0 (23 Jun 00) of the C++ source: sp.tar.gz
Download code for generating input and processing output for convex polyhedra: (not yet ready).

Research supported by NSF grant CCR-9731804.
Last Update: