Hotspots: Admin Pages | Turn-in Site |
Current Links: Case Final Project Summer 2007
GTMN5
Case Study for Milestone5
Click here for Project Description: Sp2002 P5 - Help people find their way
Route:
To deal with finding a route we used a graph with edges and nodes. The edges were simply pairs of numbers. The numbers were indexes to points on the map. We implemented a breadth first search tho find a way through the map. We made sure that the path searching worked before we even bothered drawing any lines. It didn't necessarily find the shortest path, but it did find the one with the fewest segments.
Nodes:
Only points on the streets were recorded as nodes. To go from one building to another, the program used the distance formula to find the closest nodes to the given start and stop building. It then found the path between those nodes and traced it.
Connections:
We used two puggable list morphs to get the two buildings, start and stop, from the user. The lines were drawn by creating line morphs from the start to the stop points. The stars are star morphs.
Colors:
The image uses some kind of color map so that when you set the color of the form image's pixel (through a canvas), you never know what the color will actually turn out to be on the display (you can tell it to be blue and it will be red for instance). Fortunately that didn't really matter, we just tried diffent colors until we found one that was good enough.
UML for milestone5
UI for milestone5
back to GTMN
Link to this Page
- Nurun Nahar last edited on 29 April 2002 at 9:14 pm by r43h54.res.gatech.edu