检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:韩宝睿[1] 董任 丁梓轩 HAN Baorui;DONG Ren;DING Zixuan
机构地区:[1]南京林业大学汽车与交通工程学院
出 处:《现代城市研究》2024年第4期103-108,共6页Modern Urban Research
摘 要:城市道路网在不同时期具有独特的网络结构,然而在近百年历程中如何演变,其过程并不清晰。研究以城市非规则道路网为例,通过历史资料整理提取了南京市鼓楼片区1900年来4个时期道路网,运用分形理论量化表达道路网覆盖均匀度和发育复杂度。结果表明:鼓楼片区非规则路网是由贯通性主干路牵引形成的;其路网相对稀疏,依然有更新和改进的空间;路网覆盖度和连通度近年来趋于平缓,城市应重视干道的功能拓展和“大院制”支路的打通。通过文献史料分析,解释了不同阶段规划思想、社会变革等因素对道路网演变起到的作用,认为历史古城道路网的更新保护应重视起牵引作用的骨架干道,同时重视非机动车和行人的需求,提升其可达性。Urban road networks have a unique network structure in dif ferent periods,however,the process of how the road network has evolved into the present network in the past hundred years is not clear.Taking the urban irregular road network as an example,this paper extracts the road network of Nanjing Gulou area in four periods since 1900 through historical data collation,and used fractal theory to quantify the uniformity of road network coverage and development complexity.The results show that the non-regular road network in the Gulou area is formed by the traction of through main roads.The road network of Gulou area is relatively sparse,and there is still room for updating and improvement.The coverage and connectivity of the road network have tended to be gentle in recent years,and cities should pay attention to the functional expansion of arterial roads and the opening of“courtyard”branches.Through the analysis of literature and historical data,this paper explains the role of planning ideas,social changes and other factors in dif ferent stages on the evolution of road network.This study suggests that the renewal and protection of road networks in historic ancient cities should prioritize the skeleton roads that play a pivotal role in the network and cater to the needs of non-motorized vehicles and pedestrians to enhance accessibility.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15