What if we can cancel the restriction of one-way street in Kyoto?

Min-Max is a decision rule used in decision theory, game theory, statistics and for minimizing the possible loss for a worst case (maximum loss) scenario. The presence or absence of one-way street will affect on accessibilities of places. In this article, we will adopt this index to every intersections in Kyoto, assuming many situations includingRead More »

  • Comments Off on What if we can cancel the restriction of one-way street in Kyoto?

Sequential Time-map on directional weighted graph (street network including public transportation on slopes)

This example is about Tokyo Ueno area. Considering about undulating terrain can be ignored when thinking about how various means of transportation shrink cities. When trying to consider about this effects, calculating the ratio of walking speed to the other speed of transportation. In this article, we will show “Time Distance Map” of a city,Read More »

  • Comments Off on Sequential Time-map on directional weighted graph (street network including public transportation on slopes)

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 calculatingRead More »

  • Comments Off on Time-Distance map of typical floors Shinjuku Mitsui building.