基于约束Delaunay结构的街道中轴线提取及网络模型建立

从街区多边形提街道中轴线并在此基础上建立街道网络模型是城市空间分析及街区地图综合的基础问题,本文基于约束Ｄｅｌａｕｎａｙ三角网结构提出了在邻近街区边界之间的三角形元上提取中轴线从而建立街道网络图模型的方法,区分三种不同三角形元进行中轴线的连接,通过网络图的顶点、边完备地表达出街道、街区、街道交叉口之间的空间关系,并建立了街道中轴线与左右两侧街区多边形边界弧段间的匹配,从而使本文提出的混合数据模型将街道网络结构与街区多边形结构统一起来。     

基于神经网络的街道渐进式选取

定义了街道网选取所需的相关参数,训练并获取计算街道相对重要性的神经网络模型,提出了利用该模型进行渐进式街道选取的方法.     

基于约束Delaunay三角网的道路网自动综合的研究

通过对约束Delaunay三角网特点的研究并结合道路网的规划方法,提出了改进的道路网综合方法。而后进一步地论证了这种方法对保持地图综合后道路网各要素的拓扑一致性较好的效果。     

地图自动综合新理论与方法的研究

地图自动综合是一个公认的世界难题,该问题的解决具有重要的理论与现实意义。本文从现代地图学理论的分析中得出,地图综合是地图学理论的核心问题之一,并从哲学角度分析了地图自动综合的本质问题和可解性。在讨论了地图自动综合现有成果的基础上,提出了应当进一步解决的问题,对部分问题进行了详细的研究,并做了大量的试验工作。本文以研究矢量模式的地图综合理论和方法为主,从理论分析和试验结果上说明地图自动综合是可解的。论文中主要研究的问题如下：１．地图学理论核心的分析。阐述此问题是为了说明地图综合在地图学理论中的地位…     

街道网矢量数据的渐进式表达与综合

基于平面欧几里得图和抽象胞腔复形理论,提出了街道网矢量数据的渐进式表达模型。引用抽象算子和还原算子定义了街道删除算子和街道还原算子,基于这些算子建立的街道网矢量数据的渐进式表达模型具有隐式的拓扑关系一致性。该模型表明,不同表达间的变化量的累积是有顺序的,生成这些变化量的变化算子的执行也是有顺序的。在渐进式表达模型的框架下,提出了基于有序综合树结构的街道网渐进式综合算法,将地图综合知识融入特定的数据结构,实现了街道网智能化综合。     

地图自动综合的协同方法研究

提出了一种在协同论意义下的自动综合方法论，即协同式自动综合，并给出了地图自动综合的协同模式和综合流程。     

基于信息损失的街道渐进式选取方法

对街道网的量测信息、拓扑信息和专题信息进行了计算,在此基础上提出了一种基于信息损失的街道选取方法。按照该方法对GB 12343-90中的一幅街区式居民地地图进行了实验。结果表明,该方法能够动态和渐进地进行街道选取。     

地图图斑群自动综合的分形方法研究

提出了基于分形理论的地图图斑群自动综合的新方法，使地图图斑群的自动综合能够根据其自身的分布变化规律及形状结构特征自适应地进行。     

采用模糊综合评判方法对居民地要素进行自动综合的方法分析

本文介绍了地形图自动综合问题的发展现状,对目前地形图自动综合采用主要数学模型进行了分析。在此基础上,采用模糊综合评判的方法对地形图居民地要素进行了自动综合的可行性、合理性、实用性、适用性分析,以期模糊综合评判的理论和方法在地形图自动综合问题中能有更为深入的应用。     

地图自动综合系统的概念框架设计

分析了现有的综合概念模型和实现地图自动化综合的必备条件,提出了应用数据模型和知识推理相结合的方法,建立地图自动综合的概念框架。     

Context-aware abstraction and generalization of street networks: two cognitively engineered user-oriented approaches using network Voronoi diagrams

Generalization and spatial contextual awareness are prevalent concepts in geographic information systems. This study adopted a context-dependent user-centred network generalization method to create a sub-network for optimal route finding. The results show an increase in the number of preferred traversed edges. A route presentation approach is suggested that is based on cognitively engineered user-oriented abstraction of street network. Successive abstractions hierarchize the street network to create a hierarchical presentation structure. The route is projected onto one level in the structure. Then, instead of showing the exact route, the network Voronoi regions represented by the projected route are shown. Experience indicates that the suggested method is an efficient way of route presentation for a hierarchical regionalized structure of a human cognitive map.     

Schematic road network map progressive generalization based on multiple constraints

Multiple constraints for schematic road network map cartographic design are analyzed and summarized. Based on this, a set of quantitative criteria are set up and a new road network generalization method including progressive selection and displacement is proposed. Furthermore, topological checking methods for road networks are researched. Based on these constraints, the points in a road network are classified, and a satisfactory and effective schematic map is designed in a concrete experiment while maintaining topological consistency of the road network between the original and the schematic map.     

多约束条件下示意性道路网地图渐进式综合

Multiple constraints for schematic road network map cartographic design are analyzed and summarized. Based on this, a set of quantitative criteria are set up and a new road network generalization method including progressive selection and displacement is proposed. Furthermore, topological checking methods for road networks are researched. Based on these constraints, the points in a road network are classified, and a satisfactory and effective schematic map is designed in a con- crete experiment while maintaining topological consistency of the road network between the original and the schematic map     

应用复杂网络理论的城市路网可靠性分析

城市路网作为一种关系居民日常生活、社会经济发展的重要网络,在受到暴雨洪水、交通堵塞以及遭遇破坏时,可能局部失效,进而影响整个路网的运输能力和效率。本文针对城市路网的拓扑特点,以复杂网络理论为基础,对两种不同布局结构的路网分别采用主方法和对偶方法建模,分析比较其复杂网络特性,并在此基础上进行了基于节点度和基于节点中介中心性的选择性破坏实验,最后分析了不同结构的路网在不同攻击策略下所表现出来的可靠性。     

The Spatial Characteristics of a Line and Their Application to Line Simplification

This paper discusses the spatial knowledge related to a line,and the characteristic points of lines is detected.According to the requirements of line generalization,new algorithms for identifying characteristic line points are presented.These characteristic points are used to improve the algorithms of line generalization.An algorithm for identifying bends is shown.In this paper,improved algorithms based on those by Douglas-Peucker,Visvalingam and Whyatt are shown.In this test,the progressive process of line generalization is emphasized.     

Centrality-based hierarchy for street network generalization in multi-resolution maps

This paper introduces a new hierarchy for cartographic generalisation processes, applied in street networks. The aims of implementing this hierarchy are to emphasise on significant street features, and to provide more free spaces between street features. The hierarchy is obtained from the functional classes of the features and four centrality measures in a street network, i.e. betweenness, reach, straightness and closeness extracted from a primary graph. The values of centrality measures change in every zoom level by calculating a radius parameter, which depends on the users’ field of view. The coefficients for the measures are constructed using a decision-making technique called fuzzy analytical hierarchy process (FAHP). The weights for each of the centrality measures are computed and normalised to form the proposed hierarchy. The hierarchy is applied and used later in the thinning process to omit insignificant features from the street network in medium scales.     

基于复杂网络的城市道路重要度评价及路网自动综合方法

利用复杂网络理论,构建城市复杂路网模型,基于该模型从道路的结构和功能特征角度,以连接度、介中心和接近度为度量指标定义道路重要度评价模型,并顾及路网的整体形态及路网的拓扑连通性,提出基于复杂网络理论的路网综合算法。为检验方法有效性,针对成都市道路网络进行实验分析。实验结果表明,该道路重要度评价模型较好地反映道路在整个路网结构和功能上的重要程度,复杂路网综合算法能较好地保持原始路网的整体形态结构特征。     

建筑物多边形化简及优化的自动方案研究

针对居民地地图形状化简的一个方面——建筑物多边形的化简,通过对综合规则的研究和居民地几何特征的剖析,提出一种与比例尺相关的切割实现建筑物多边形化简的方法,在Visual Basic6.0环境下实现了该算法,试验结果表明此方法在保持街区的形态特征上效果较好。     

The method of graphic simplification of area feature boundary with right angles

Some rules of simplification of area feature boundary and the method of acquiring spatial knowledge, such as maintaining area and shape of area feature, are discussed. This paper focuses on the progressive method of graphic simplification of area feature boundary with right angles based on its characteristics.