Interactive Map of Denmark
A desktop route planner over real OpenStreetMap data: search an address, drop two points, and get the fastest or shortest path across Denmark. Built as a university team project (ITU BFST, Group 15).
Under the hood
The OpenStreetMap dataset is parsed and indexed into a k-d tree for fast nearest-road lookup and a ternary trie for address search. Routing is Dijkstra and A* over a weighted graph of the road network. JavaFX handles the map rendering and the UI.
Team
A group build - credit to the whole team. This was the one that made data structures feel concrete: the difference between a naive scan and a k-d tree is the difference between a frozen app and an instant one, on real country-scale data.