Chapter 8 is all about indoor routing and finding the shortest path inside a building.
Simple quick shortest path example with Dijkstra
No database needed shortest path route on vector data
Creating polygons based on travel time inside a building
Generating centerlines from building data
Calculating a indoor route through different floors in 3D.
Display the walk time in a user friendly format