道路网stroke生成问题的形式化表达与新算法

基金项目: 国家基础科学人才培养基金资助项目(J1103409)

详细信息

Formalization and New Algorithm of stroke Generation in Road Networks

¹School of Resource and Environmental Sciences,Wuhan University,Wuhan 430079,China;²Key Laboratory of Geographic Information System,Ministry of Education,Wuhan University,Wuhan 430079,China

Funds: National Science Foundation for Fostering Talents in Basic Research of the National Natural Science Foundation ofChina,No.J1103409.

摘要: 目的首先,将道路网stroke生成问题形式化表达为聚类问题;然后,在该表达下提出了基于层次聚类思想的stroke生成算法,并进行了算法的时间复杂度分析和算法特性分析。最后,用深圳市1∶5万道路网对该算法进行了验证。
- 道路网 /
- stroke /
- 层次聚类 /
- 形式化表达
Abstract: Objective Road network generalization and analysis have been hot issues in the geographical informa-tion science.The stroke in a road network is defined as a set of one or more road segment in a non-branching,connected chain,based on the good continuity principle.The stroke plays an importantrole in road network generalization,analysis,pattern recognition and schematic map generation.Ex-isting studies focus on the stroke generation algorithms.However,the formalization of stroke genera-tion at the conceptual level is absent.This paper first formalizes the stroke generation as clusteringproblem,and then presents a hierarchical clustering based stroke generation algorithm.Time com-plexity and some properties of the proposed algorithm are analyzed in detail.Finally,the algorithm isverified using the Shenzhen road network at the 1∶50 000scale.
- road network /
- stroke /
- hierarchical clustering /
- formalization