I intend to make my own OSM Router, and I do not want to use third party OSM routers. WHAT I HAVE DONE: I have downloaded OSM data in XML format and applied different algorithms to find the shortest path between two nodes in map using their coordinates (longitude/latitude). Everything is working fine. THE PROBLEM: The only problem is OSM XML data has only limited number of coordinates (longitude/latitude). I want to find the distance between two coordinates (longitudes/latitudes) which are not found as nodes in OSM. I could not find any thing related to this on internet. FOR INSTANCE, I have a random longitude/latitude for point A, and random I have a random longitude/latitude for point B. These longitudes and latitudes are not available in OSM XML data. How can I find the distance between these two points? asked 19 Sep '19, 17:27 hk_hamzakhalid |
Use your favourite search engine to search for the words "Haversine Formula", or you might also find libraries that already implement this. answered 19 Sep '19, 19:03 Frederik Ramm ♦ I have the feeling hk was rather looking for a way to find the closest node in the routing graph and base the distance calculation on the OSM network he has already used for routing.
(20 Sep '19, 08:18)
TZorn
|