CCB GeodesicPath

This program finds the shortest path on a surface connecting two vertices of that surface.

This path may be constrained to the vertices and edges of the surface (the Dijkstra algorithm), or the path may be allowed to cross the faces of the surface (Geodesic algorithm).

Project Components

• Documentation
  • GeodesicPath User's Guide v 1.0
  • Examples using project version 1.0
  • Changes Log
  • A list of Frequently Asked Questions.
• Feedback
  • Project Bug List (v1.0)
• Download Links
  • Not yet available on Loni SoftwareDownload
• Feature Wish List

Revised 14 March 2007