This is my map software developed using C++. It serves as the background for my LinkedIn profile and was created through a collaboration with Fabien and Yuan, two of my close friends at the University of Toronto. This project was developed using Git.
This project entered the Courier Problem Contest(A special case of the Traveling Salesman problem) and won third place thanks to the clever use of Simulated Annealing heuristics and parallel programming. The contest consists of more than 100 teams and 87 valid submissions, this contest is open to all Electrical and Computer Engineering students.
Please do not hesitate to contact me for a live demo. I am more than happy to personally live demo to you. The source code for this project is available upon request. If you're interested in gaining access or have any questions, please contact me using the information provided below:
- Email: danjie.tang@outlook.com
- LinkedIn: Danjie Tang
Displaying all the information contained in the map simultaneously can overwhelm the user with unnecessary details and result in long refreshing time. Therefore, it is necessary to optimize the amount of information presented. Inspired by Google Map, our team came up with a solution that prioritizes the most interesting points to tourism. As the user zooms in, less significant points will gradually appear(Figure 4).
| Zoomed Out (Freeways) | Zoomed In A Little (Big roads) |
|---|---|
 |
 |
| Zoomed In (Small Roads) | Detail View (Building and Restaurants) |
 |
 |
| A* algorithm for path finding | Live Weather |
|---|---|
 |
 |
This map supports 19 cities around the world, nothing is hardcoded!
| Beijing | Hamilton |
|---|---|
 |
 |
| Singapore | New York |
 |
 |