Abstract
In many scientific disciplines it is often necessary to refer to geographical travel distances. While online services can provide such distances, they fail for larger distances or for distances between points not connected by roads, and they do not allow for the calculation of many distances. Here we describe two novel methods of measuring travel distances which overcome these problems. Both use waypoints of populated places from the geonames.org database. The more efficient and accurate of the two uses the Dijkstra algorithm to find the shortest path through a Delaunay graph of neighbouring populated places.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
