Link to Public project page

GeodesicPath Project Definition

Overview

Write an application that finds the shortest path between two points on the surface mesh provided by user. The output will be a data file represents the pathes between two points.

Restrictions, Exclusions, Limitations

* Pathes necessarily pass through the mesh vertices rather than take shortcuts through edges.

People Affected

Person	Initials	Notes
Bae Cheol Shin	BC
Craig Schwartz	CS
Roger Woods	RW

Version

1.0

Requirements

• This program will be written using Java 1.5
• write the results in a new output file whose name is specified by the user.
• A text command line interface (not a Gui) is used.
• Command line parameters will specify
  • the directory and name of the input file.
  • the name of the output file that will be created
  • starting and ending vertex

Requirements Change Procedure

• Changes to be mutually agreed upon by Craig and Bae Cheol Shin.
• Changes and their date will be entered in a 'requirements change' list.

Requirements Changes

• N/A

Products

This project will result in the following products:

• A Java application jar that will create a shape file represents the shortest path between two points on the surface mesh.
• A CVS repository containing the Java source code of this application.
• Examples illustrating use of the application.

Lessons Learned