中文摘要：

道路网中的Stroke是根据“好的连续性规律”将路段连接形成的道路链。生成Stroke通常作为道路网综合、拓扑分析、示意性地图生成、模式识别等研究的首要步骤。本文对自身最大适合策略进行了两个方面的改进：第一,根据路段重要性来规定路段处理的顺序,而不是对路段进行随机处理;第二,对“最大适合”的概念进行了扩展,定义满足连接条件且最重要的路段为其“最大适合”的路段,而非转折角最小的路段。以深圳市1∶1万道路网为实验数据进行了实验,从视觉认知与网络功能两个方面进行了评价。结果表明：（1）由改进的自身最大适合策略生成的Stroke一般而言是确定的;（2）在视觉认知方面,改进的自身最大适合策略比每对最大适合策略更易形成较长并具有全局性的Stroke;（3）在网络功能方面,就平均水平而言,改进的自身最大适合策略优于每对最大适合策略、自身最大适合策略和自身适合策略;就单次结果而言,改进的自身最大适合策略次于自身最大适合策略和自身适合策略的最优解。

英文摘要：

A Stroke in a road network is defined as a set of one or more road segments in a non-branching, connected chain, according to the good continuity principle. The Stroke plays an important role in road network generalization, topology analysis, pattern recognition and schematic map generation. This paper demonstrates ways to improve the self-best-fit strategy in two aspects. One is that the processing order of segments is determined based on their importance rather than random order, another is extending the definition of best-fit, proposing that segment which satisfying the concatenation criterion and the most important segment is defined as the best-fit segment instead of segment with the smallest deflection angle. The Shenzhen road network at the scale of 1 ： 10 000 was used as experimental data. An evaluation from the visual cognition and network functionality points of view shows that： （1） the Stroke set generated by the modified self-best-fit strategy is usually unique. （2） From the visual cognition point of view, the modified self-best-fit strategy performs better than the everybest-fit strategy. In a Stroke set generated by modified self-best-fit strategy the Strokes are normally longer and have more global properties. （3） From the network functionality point of view, the modified self-best-fit strategy performs better than the self-best-fit strategy, as the self-fit strategy and the every-best-fit strategy performs less efficently than the optimum solution of the self-best-fit strategy and the self-fit strategy in the experiment.