A Study on Voronoi Diagrams with Obstacles in the Architectural and Urban Space
| Project/Area Number |
18560592
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Town planning/Architectural planning
|
|---|
| Research Institution | The University of Tokyo |
|---|
Principal Investigator |
FUJII Akira The University of Tokyo, IIS. Department of Human and Social Systems, Professor (20126155)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
OIKAWA Kiyoaki Ritsumeikan University, Department of Architecture & Urban Design, Professor (00168840)
IMAI Kotaro IIS. the University of Tokyo, Department of Human and Social Systems, Lecturer (20262123)
HASHIMOTO Kenichiro IIS. the University of Tokyo, Department of Human and Social Systems, Research Assistant (40361646)
|
|---|
| Project Period (FY) |
2006 – 2007
|
| Project Status |
Completed (Fiscal Year 2007)
|
| Budget Amount *help |
¥2,250,000 (Direct Cost: ¥2,100,000、Indirect Cost: ¥150,000)
Fiscal Year 2007: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2006: ¥1,600,000 (Direct Cost: ¥1,600,000)
|
|---|
| Keywords | Voronoi diagram / Delaunay network / shortest-path distance / spatial tessellation / automated external defibrillator / facility location / 都市計画・建築計画 / 計算機科学 / 地域分析 / 計算幾何学 |
|---|
| Research Abstract |
This research consists of two parts, the first part is the methodology of the Voronoi diagrams with obstacles, and the second one is the application of the method to the actual architectural and urban space, which shows the efficiency and benefit by this method.
In the first part, we propose a method for constructing Voronoi diagrams with two-dimensional obstacles by a simple and practical computer algorithm, using the shortest-path distance of a Delaunay network of many random vertices, which we termed as rDn. By measuring the shortest-path distance of the rDn for the detour distance, this method provides an approximate solution for the Voronoi diagrams with obstacles. We verify the isotropy and stability of the ratio of the shortest-path distance of the rDn and the Euclid distance by a computer experiment. We then show the reliability of the approximate solution by comparing with the exact solution in a simple case, and the effectiveness of this method by solving a sample problem with free shaped obstacles.
The second part describes the construction and application of Voronoi diagrams with obstacles. By applying the model, we analyzed the domain of Automated External Defibrillators (AED) around Ueno Park in Tokyo, Japan, and indicated a more efficient AED location by including the necessary time for the rescuer and his or her helper both of whom happened to be near the victim of Sudden Cardiac Arrest (SCA), to get an AED avoiding various obstacles: pond, building, planting, fence, in the park. After indicating the current location of AEDs, we proposed a new location plan with additional AEDs placed in public facilities in the park with no AED that will improve the average shortest-path distance from 343m to 119m, which is equivalent to almost 18% improvement in survival rate.
|
Report
(3 results)
Research Products
(4 results)
