Home Bookmarks Papers Blog

Computing Approximate Shortest Paths on Convex Polytopes - Program

Pankaj K. Agarwal, Sariel Har-Peled, and Meetesh Karia

The program implements the algorithm described here


One you download the program and compiled it (you need LEDA). You can run it, by doing:

./nav inputs/100.off 0.5 inputs/100.in

Last modified: Wed Jun 21 12:02:20 EDT 2000