A spatial analysis on the way how the city shapes have been formed.
| Project/Area Number |
15560534
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Town planning/Architectural planning
|
|---|
| Research Institution | Kyoto Institute of Technology |
|---|
Principal Investigator |
FURUYAMA Masao Kyoto Institute of Technology, Vice-President, 副学長 (60107349)
|
|---|
| Project Period (FY) |
2003 – 2004
|
| Project Status |
Completed (Fiscal Year 2004)
|
| Budget Amount *help |
¥3,500,000 (Direct Cost: ¥3,500,000)
Fiscal Year 2004: ¥1,300,000 (Direct Cost: ¥1,300,000)
Fiscal Year 2003: ¥2,200,000 (Direct Cost: ¥2,200,000)
|
|---|
| Keywords | √<N> Law / Minimum-Spanning Tree / Neighborhood Tree / Estimation Form of the Network Length / LogN Law / Space-Syntax / English Historical Towns / Kyoto and Paris / √<N>の法則 / logNの法則 / ルートNの法則 / 包含率 / 再現率 / 都市解析 |
|---|
| Research Abstract |
A city is a compound of various elements. It has been constructed dynamically in search of an ideal urban form, which satisfies the Pareto efficiency of the people of each ages, such as economy, defense, culture and so on. In order to examine dynamic conditions of a city of ages, a methodology-Urban Entropy coefficient-will be proposed. The Urban Entropy Coefficient is defined as a measure of estrangement between "Global and Local"" which are concepts of Space Syntax.
Conclusion 1 : Theoretical results
The main result of this research is to show that almost 90% links of a minimum spanning tree are composed by the links of the shortest neighbor and the second shortest neighbor. More concretely, exactly 69% links of a minimum spanning tree are made up of the nearest links, and about 22% links are made up of the second nearest neighbor and 9% links are made up of the third nearest and so on. From this information, if N points-facilities are located uniformly randomly in a 1 x 1 square, we can estimate the lower bound for the length of the minimum spanning tree on these N points far better than it has been. So that we can prove that the length of minimum spanning tree is greater than 0.64√<N> when N points are located randomly in 1 x 1.
Conclusion 2 : Applied results:
The second purpose of this study is to make clear the property of the complicated street networks in English historic towns. It does so by measuring what degree we can reconstructed the networks by using the network patterns that are constructed by the rationality of the shortest distance. We take out Chester, Canterbury, Norwich, Cambridge and Bath in English historic towns. If we construct the model networks by Exodic-tree and measure the re-production rate by comparing with the real network, we got a high re-production rate in the experimental results. We can estimate that the rationality of the shortest distance is acting even in the historic towns.
|
Report
(3 results)
Research Products
(12 results)
