A GIS (Geographic Information System) software that displays maps and relevant information (street names, point of interests, subways etc.) for various major cities around the world. The project was created in C++ and uses APIs based on OSM (Open Street Maps) data. The graphics were created using EZGL Graphics Library in addition to GTK and Glade.
This project was created with a team of two other members for ECE297 which is a course at the University of Toronto on software design and communication. As part of the course guidelines, the source code cannot be publicly shared, however, a detailed description and final software images are given below.
Collaborators: Ji Oh Kim (https://github.com/jioh-kim) and Kartikey Sachdeva (https://github.com/lilkarti)
Final course mark: 93% (4.0 GPA)
- A brief welcome menu is displayed when the map is initially loaded
- Directs the user towards the help menu in case the user is unfamiliar with the software
- Top Left Corner: Input boxes are used to get travel directions between a starting and ending intersection. Drop down menu below to load other maps
- Top Right Corner: Buttons to toggle other modes and features
- Bottom Right Corner: Buttons for zoom and pan. The scroll wheel can be used to zoom and pan as well.
- Bottom Left Corner: Dynamic status updates in reponse to user actions
All selections and items displayed on the map can be cleared using the "Clear" button underneath the maps drop down menu and all input boxes have an autocomplete feature. Any additional windows can be hidden or shown using the "Additional Window" option in the top right corner.
- Maps can be loaded using the drop down menu and the "Load Map" button underneath
- Any other city can be added to the drop down menu as long as the osm.bin file is installed
- The user can enter a start and end intersection to get travel directions which are displayed in a separate window
- The shortest path is found using an A* algorithm
- Point of Interests such as restaurants, banks, hospitals, schools, etc. can be specifically searched for
- Displays all subway stations for the city
- There are two different viewing modes (dark more and colourblind mode) to allow for greater accssibility and ease of use
| Dark Mode | Colourblind Mode |
|---|---|
 |
 |
- Intersections can be either clicked on or searched for through the two input boxes
- An additional window is displayed with all names of the intersections currently being highlighted on the map
- Point of Interests are represented using easily recognizable icons
- One way streets are identified by a blue arrow
- Certain maps such as Tokyo and Tehran have street names displayed in Japanese and Arabic, respectively.
| Icons and Arrows | Language Support |
|---|---|
 |
 |
- Error messages are provided when an invalid input is given or the user misuses the system
- A help menu is available for further guidance
| Error Messages | Help Menu |
|---|---|
 |
 |
- The main path finding algorithm used was Dijkstra's Algorithm
- To imporve the performance an A* heuristic was implemented that uses the shortest travel time for a more directed search
An algorithm was implemented to solve a version of the Traveling Saleman Problem. An iterative approach was taken with the following algorithms used to generate a valid solution within 50 seconds:
- Greedy Algorithm: To generate an intial solution quickly
- Local Pertubations: Swaps and a custom reversal operator was used to improve the initial solution
- Multistart: Multiple start locations were considered and the best one was selected to explore the solution space more
The algorithm was tested for different inputs on multiple maps. These test cases were used to produe an average Quality of Result (QoR). Here is the average QoR for the iterative approach to the problem:
- The presenation summarizes graphics and notable algorithms implemented
- A pitch for potential future use of the software is also included