Skip to content

Files

Failed to load latest commit information.

Latest commit

 Cannot retrieve latest commit at this time.

History

History
 
 

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 
 
 

Chapter 8 Network Routing

Chapter 8 is all about indoor routing and finding the shortest path inside a building.

Finding the Dijkstra shortest path with pgRouting

Simple quick shortest path example with Dijkstra

Finding the Dijkstra shortest path with NetworkX in pure python

No database needed shortest path route on vector data

Generating evacuation polygons based on indoor shortest path

Creating polygons based on travel time inside a building

Creating centerlines from polygons

Generating centerlines from building data

Indoor routing through a building in 3D

Calculating a indoor route through different floors in 3D.

Calculating indoor route walk times

Display the walk time in a user friendly format