Lausanne_HEM-shortestPath
Using the network of all streets and paths in Lausanne wider than 2m, restructured as a Half-Edge Mesh, this map illustrates an analysis of the distance to each segment by the shortest path through the graph (i.e. actual walking distance) from three randomly chosen starting points (red circles)
I'm pretty impressed with how well this is working. Compared to the previous examples which had around 350 ½-edges, this example has 12686! ½-edges and has a number of unusual faces where bridges pass over roads without an intersection.
link to .gh file
Lausanne_HEM-shortestPath
Using the network of all streets and paths in Lausanne wider than 2m, restructured as a Half-Edge Mesh, this map illustrates an analysis of the distance to each segment by the shortest path through the graph (i.e. actual walking distance) from three randomly chosen starting points (red circles)
I'm pretty impressed with how well this is working. Compared to the previous examples which had around 350 ½-edges, this example has 12686! ½-edges and has a number of unusual faces where bridges pass over roads without an intersection.
link to .gh file