Convenience stores in Japan become more and more important not only in a normal time but also in a time of disaster. Therefore, locating convenience stores in accordance with fairness becomes very important to enhance safety of a region. In this article, we try to relocate convenience stores in Ueno, Tokyo as a trial experiment. There are 215 convenience stores in Ueno. Usually, we draw voronoi diagrams when estimating “sphere” of certain facility (convenience store), but note that we have to consider not “Euclidean distance” but “Network distance”. When we focus on one sphere and calculate min-sum point of this sphere, the location of convenience store is not correspond toRead More »
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 including cancellation of restrictions of one-way street. Index of “min-max” is very important when we have to decide a location of emergence vehicle station, because this index means that how efficiently we can relief a person in disadvantage. The left side of figure3 shows distribution of one-way streets in Kyoto (red represents one-way, blue represents two-wayRead More »
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, which has various transportation. The above animation shows traveling time distance map when a traveler move from his origin to destination. The procedure of drawing time distance map. Calculating shortest path and time from a present point. Drawing concentric circles at regular intervals (1 minutes). Moving all points with preserving the angle between origin andRead More »
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 »
”Time Distance Map” of WTC (World Trade Center) in New York and CCTV (China Central TV) in Beijing
Animation represent time distance from entrance to all places in WTC. Bank segmentation of elevator
Percolation Test (single process) Percolation Test (dual process)