If we want to find out nearby hotels, coffee shop etc on google maps we can find it easily by just right clicking on the selected location and go for search nearby option. The map will show all the nearby selected hotels, coffee shop etc. I wonder how can I do this on a leaflet map with myself. In quest of this question I found Isodistance and Isochrone map APIs.
What are Isodistance and Isochrone maps?
An isodistance map is a map showing equal distance polygons from a point of interest considering every possible route. For example you decide to go for a morning walk daily for about 1 mile and you want to find out all the possible routes from your house on which you can walk ½ mile and then come back ½ mile, isodistance map is your solution.
As stated in Mapbox – “Isodistances offer realistic travel distances by considering roads and sidewalks, which can be the difference between a day at the beach and waiting for a tow truck.”
Isochrone maps are similar to isodistance map but here we consider time. An isochrone map is map which shows lines of equal travel time across a geographic area. As in the below snapshot example if you decide to walk 8 mins daily then you can find how much distance you might cover from your house in 8 mins.
APIs for Isodistance and Isochrone maps:
There are two APIs available for creating Isodistance maps. One is MapBox Directions API and another is ISO4APP API. This two APIs can be used with leaflet or google map. For Isochrone maps there is one API available that is ISO4APP API.
What you think about isodistance and isochrone maps? In which situtation are you using this algorithm? Do you know any other api which i have not listed? Do share your answer by commenting below in the area provided.
Flight Routes Network Analysis. When we think of Network analysis in GIS we think of roads, rivers, waterlines etc. In GIS two types of network are modeled. i.e:
1.)Transportation Networkfor example road networksand
2.) Utility Network for example gas pipeline network.
In transportation network model analysing air transportation network is afascinating network visualisation exercise.
FLIGHT ROUTES NETWORK ANALYSIS
Force-directed graph drawing algorithms are a class of algorithms for drawing graphs in an aesthetically pleasing way. This algorithm used by Martin Grandjean a researcher from The University of Lausanne, Switzerland to analyze the air transportation network created by 100,000 airline flights that take place around the world. Data for this analysis of the 3,275 airports across the globe was taken from openFlights.org.
A map showing flight routesbetween these airports is a network graph. Martin Grandjean attempts to make explicit the network behind air transport. The structure of the relationships has an impact on the spatial distribution of nodes in a graph. Let’s see how this landscape is reorganized without geographical constraints.
Explanation of the above image: “Naturally, network geography is not completely disrupted: the continents are mostly visible and regions are generally in their original position (with the exception of the Pacific islands that connect Asia and America – imagine this graph in three dimensions, with the Pacific Ocean behind). Major observations: India is more connected to the Middle East than to South and East Asia. The Russian cluster is very visible, connecting airports in Russia but also in many former Soviet republics. Latin america is clearly divided between a South cluster and a Central American cluster very connected with the U.S.”
I found this information very fascinating, to know the way for Flight Routes Network Analysis.