权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

A spatial analysis on the way how the city shapes have been formed.

对城市形态形成方式的空间分析。

基本信息

批准号：
15560534
负责人：
FURUYAMA Masao
金额：
$ 2.24万
依托单位：
Kyoto Institute of Technology
依托单位国家：
日本
项目类别：
Grant-in-Aid for Scientific Research (C)
财政年份：
2003
资助国家：
日本
起止时间：
2003 至 2004
项目状态：
已结题

来源：
https://kaken.nii.ac.jp/en/grant/KAKENHI-PROJECT-15560534/
关键词：
√<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の法則包含率再現率都市解析

项目摘要

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 resultsThe 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.

城市是各种元素的复合体。为了寻找满足各年龄段人口经济、国防、文化等帕累托效率的理想城市形态，提出了一种城市熵系数的方法来考察各年龄段城市的动态状况。本文将城市熵系数定义为空间概念“全局”与“局部”之间的距离的度量。结论1：理论结果本研究的主要结果表明，最小生成树的90%的链路是由最短邻居和次短邻居的链路组成的。更具体地说，最小生成树的69%的链路由最近的链路组成，大约22%的链路由第二最近的邻居组成，9%的链路由第三最近的邻居组成，依此类推。根据这些信息，如果N个点设施均匀随机地位于1 × 1的正方形中，我们可以估计这N个点上的最小生成树的长度的下界，比以前好得多。从而证明了<N>当N个点在1 × 1中随机定位时，最小生成树的长度大于0.64 μ m。结论2：应用结果：本研究的第二个目的是为了弄清英国历史城镇中复杂街道网络的性质。它通过测量我们可以使用由最短距离的合理性构建的网络模式来重建网络的程度来实现。我们把切斯特、坎特伯雷、诺维奇、剑桥和巴斯排除在英国历史城镇之外。如果我们用Exodic-tree构造模型网络，并通过与真实的网络的比较来测量其再生率，实验结果表明我们得到了较高的再生率。我们可以估计，即使在历史城镇中，最短距离的合理性也在起作用。