Time-Distance map of typical floors Shinjuku Mitsui building.

If we discretize continuous space by using random delaunay network, it becomes possible to find shortest path even on continuous space with arbitrary obstacles according to Dijkstra’s algorithm. In this article, we find shortest path from entrance of Mitsui building in Shinjuku to every place in the building. First animation shows the process of calculating distance (colors represent distance, red is far and blue is close), and drawing a time distance map from entrance of building. In this animation, you can easily realize how distant each place of building is. At a glance, you may think this building is homogenous, but can realize heterogenous space with many obstacles like walls, […]

Read more