A program which reads in a wavefront (.obj) file, parses it into a graph-like structure, and applies Dijkstra's shortest path algorithm to it in order to find the shortest path (based on Euclidean distance) between any two faces. Finally, this path of faces is then outputted as a wavefront file.
-
Notifications
You must be signed in to change notification settings - Fork 0
SantriptaSharma/CS-1101-FinalProject
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Performing pathfinding on a 3D object and outputting the shortest path between 2 faces as a 3D object.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published