Shortest Path Graph
An implementation of the Shortest Path Graph [1] is provided with the latest development of the GeoDataAnalysis [2] project. The Shortest Path Graph is useful for deciding the boundary of an imprecise area given as a point set and for visualising overlapping point sets. Shortest Path Graph of lake Michigan configuration parameter, t = 2 configuration parameter, t = 4 configuration parameter, t = INFINITY When the configuration parameter (t) of the Shortest Path Graph reaches infinity, the inferred graph structure becomes the minimum spanning tree [3] of the point set. References [1] https://en.wikipedia.org/wiki/Shortest-path_graph [2] https://github.com/sameerak/GeoDataAnalysis [3] https://en.wikipedia.org/wiki/Minimum_spanning_tree