地貌结构线阵列处理法自动综合等高线

本文提出了一种地貌结构线矩阵数据处理法,并由此来达到地貌等高线自动综合的目的。包括地貌结构线的数字化方法,地貌结构线的数学模型,原始数据整理,地貌沟谷自动综合,等高线自动选取和自动连结同一等高线点并输出等过程。最后用抛物线光滑法输出滑光的等高线图。     

多尺度等高线簇拓扑关系定量表达方法研究

等高线拓扑关系定量表达对空间认知、地形特征挖掘、地图综合等至关重要。然而,已有研究多针对等高线树的生成及综合算法,缺乏等高线拓扑关系及其与尺度变化关系的定量表达,不同地貌类型其变化规律是否一致仍未知。为此,通过分带与投影转换、非闭合等高线拓扑检查与闭合及有向等高线树的构建等,发展了一种等高线拓扑关系定量表达方法。采用高山、中山、平原地貌60组多尺度等高线数据集,探究不同地貌类型的多尺度等高线拓扑指标及其随尺度变化规律的一致性。试验结果表明,相邻尺度等高线拓扑指标变化规律符合空间认知与推理,不同地貌类型多尺度等高线拓扑指标与尺度变化间关系可用同一个幂函数定量表达,该结论为基于多尺度空间相似关系等高线全自动综合的实现提供了理论支撑。     

基于B样条小波的等高线数据简化

基于B样条小波的变换特征,本文研究了地貌形态的自动综合过程中等高线的数据简化问题,提出了基于B样条小波的等高线的数据简化方法,并进行了实验。理论和实验结果表明,利用所述方法对等高线进行数据简化,方法简捷,精确度高,而且能够保留原等高线的形状结构特征。因此,基于B样条小波的数据简化对地貌形态自动综合是可行的。     

复杂等高线自动综合的分形处理方法研究

复杂等高线自动综合是计算机辅助制图领域中一项重要且难度较大的任务。本文根据分形理论的基本原理，提出了一种基于量化等高线形状结构特征的复杂等高线自动综合的新方法。研究和实验表明，该方法充分顾及了地貌形态特征，能够对等高线图形进行客观、有效地概括。     

地形图等高线成组综合的试验

本文在讨论制图自动综合一般问题的基础上,着重分析了两种等高线自动综合的技术路线存在的优缺点。笔者提出,采用模拟人类专家智能的方法,从二维的等高线输入数据出发,提取地貌结构信息,从而对等高线进行成组的综合,直接形成经综合的二维等高线输出数据,有可能获得较为简捷,效果良好的综合结果。在对这条技术路线进行实验的过程中所涉及的人工智能问题,主要包括:对无序数字化等高线数据的整理、等高线上重要特征点的识别、正负向地貌特征的确定、谷地点的选出、谷底线的自动跟踪、谷地重要性的计算、谷间距的自动量算、对称谷地的寻找、综合后图形的生成等。     

采用3维Douglas-Peucker算法的等高线综合

在数字环境下进行等高线综合是制图综合领域中的热点问题.将3维Douglas-Peucker算法应用于等高线综合,是从真3维的角度提取等高线上的特征点.首先根据等高线上高程点的空间分布特征.提出采用空间线规则排序方法组织空间点;引入了全局孤独指数解决综合过程中等高线之间的空间跳跃问题;然后通过空间内插引绘综合后DEM的等高线,从而实现等高线的自动综合.初步实验表明,采用3维Douglas-Peucker算法的等高线综合,从全局上保持了主要地貌形态并抑制了破碎的微地貌特征,具有良好的综合质量和制图效果.     

三维Douglas-Peucker算法的等高线间接综合方法研究

提出一种用三维Douglas-Peucker算法综合无格式离散点,再回放等高线,进而将其作为综合结果的等高线间接综合方法,并进行编程验证。初步试验证明,在主要地貌结构线辅助下,用该方法综合的等高线兼具几何精确性与拓扑一致性,且方法本身对等高线的输入输出形式适应性较强,具有良好的应用前景。     

基于DEM化简的等高线综合研究

文中基于等高线综合的理论,通过制图综合对化简方法的需求分析以及小波方法的特性分析,提出利用小波高频分量滤波进行规则格网化简的等高线综合方法,并使用扩展的开方根选取规律公式确定小波变换层数及化简阈值。以切割较为破碎的中山地貌的1∶5万比例尺等高线,利用文中方法进行化简和等高线综合实验。结果表明,该方法基本能够体现等高线制图综合思想,避免因对等高线直接操作而产生的线相交问题,并在几何精度与地形特征保持方面效果较好。     

基于DEM化简的等高线综合研究

文中基于等高线综合的理论,通过制图综合对化简方法的需求分析以及小波方法的特性分析,提出利用小波高频分量滤波进行规则格网化简的等高线综合方法,并使用扩展的开方根选取规律公式确定小波变换层数及化简阈值。以切割较为破碎的中山地貌的1∶5万比例尺等高线,利用文中方法进行化简和等高线综合实验。结果表明,该方法基本能够体现等高线制图综合思想,避免因对等高线直接操作而产生的线相交问题,并在几何精度与地形特征保持方面效果较好。     

等高线空间关系的确定及应用

等高线空间关系的建立是取得较好地貌综合效果的关键因素之一.等高线之间的层次关系通常利用等高线树来表达,建立等高线树的关键步骤是如何将被图廓截断的那部分等高线闭合起来.提出一种比较可靠的闭合方法,根据相邻高程的等高线的拓扑关系,每条与图廓相交的等高线其闭合走向由其相邻较高和较低等高线的空间位置所决定,由此确定出等高线惟一的一种闭合方向,建立可表达等高线空间关系的等高线树,并用实验证明此方法的可靠性和有效性.     

等高线图形综合策略的研究

利用Arc/Info的功能研究了等高线图形综合方法,其一是通过地形结构线控制的渐进式等高线综合,其二是利用Douglas方法得到更抽象的TIN间接来完成等高线图形综合。     

Generalization of Contours Using Deviation Angles and Error Bands

Abstract

In this paper a new approach for generalization of contours is described. The aim of this approach is to obtain both simplified and smoothed contours lying on a minimum number of characteristic points and inside the error bands. Characteristic points of contours are defined in relation to the skeleton lines of the terrain and determined using the deviation angles at the contour points. Error bands for contours are constructed by means of the steepest slope lines and the mean square planimetric errors at the contour points. The new approach is compared to the Li-Openshaw algorithm according to the experimental testing results.     

利用内切圆内插等高线的算法

等高线内插在地图自动综合、地图数字化、三维地形重建等过程中都具有重要意义。许多等高线内插算法在等高线急剧变化以及闭合等高线处存在问题。在分析已有等高线内插算法优缺点的基础上,提出了一种等高线内插算法。该算法以等高线上的节点为圆心,建立与相邻等高线之间的内切圆来探测相邻等高线之间的空间关系,并获取等高线间的辅助线,进而内插出等高线,一方面弥补了已有等高线内插方法中的问题,另一方面有效提高了等高线内插的速度和质量。通过与其他内插算法之间的实验对比分析,验证了本方法的科学性和先进性。     

联合Delaunay三角网的等高线群综合研究

采用"联合Delaunay三角网"来提取成组等高线的弯曲,在弯曲处利用平三角形连接法进行局部地形结构线的连接,并建立起地形结构线的树状结构。运用方根模型确定谷地选取的数量指标,并提出了一种新的数学模型以确定谷地选取的质量指标,完成等高线群的自动综合。研究和实验表明,该方法充分顾及了地貌形态特征,谷地选取合理,概括程度适当,并完全避免了相邻等高线相交,综合效果较好。     

An algorithm for automatically computing the horizontal shift between homologous contours from DTMs

The algorithm we present here is useful for measuring the planimetric discrepancy between two models which can be represented by contours. In cartography the paradigm of such models is represented by digital terrain models (DTMs). The measure we propose is based on an area enclosed between homologous contours (two level contours, each belonging to two different models). Our measure is similar to another used previously, although, in the previous studies, the area enclosed between homologous contours was computed manually or it was restricted to particular conditions. The innovation of our approach consists of the automation of the entire process and in the constraint elimination. The main problem to solve before computing the horizontal shift measure is how to determine the area enclosed between homologous contours. This is a problem because there is no bijective correspondence between homologous contours, and therefore the identification of the homologous contours is not a trivial task. Our approach overcomes this difficulty by closing following the limit of the DTM the open contours (the contours which cut the limit of the DTM) and classifying them by the external level. We achieve the automation assisted by the Boolean polygon operations, specifically using the symmetric difference operation. Our algorithm facilitates the computation of accuracy of a DTM by comparison with another and it is applicable in such fields as hydrology (precision estimation of the hydrological features), cartographic generalization, and civil engineering. Finally we use our measure for estimating the planimetric discrepancy between the same streams derived from different DEMs (different sources and precisions).     

An ontology-driven multi-agent system for nautical chart generalization

ABSTRACT

On nautical charts, undersea features are portrayed by sets of soundings (depth points) and isobaths (depth contours) from which map readers can interpret undersea features. Different techniques were developed for automatic sounding selection and isobath generalization. These methods are mainly used to generate a new chart from the bathymetric database or from a larger scale chart through selection and simplification. However, a part of the process consists in selecting and emphasizing undersea features formed by groups of soundings and isobaths on the chart according to their relevance to maritime navigation. Hence, automation of the process requires classification of features and their generalization through the application of a set of operators according not only to geometric constraints but also to their meaning.

The objective of this work is to conceive a multi-agent system (MAS) for nautical chart generalization that is driven by the knowledge on the generalization process and the undersea features and their relationships. First, this work provides a feature-centered ontology modeling of the generalization process. Then, the MAS structure is introduced where agents access cartographic knowledge stored in the ontology. The MAS makes use of measure algorithms to evaluate constraint violations on the chart in order to decide which generalization operators to apply. The whole model has been implemented to provide generalization plans on a real case study.     

基于弹性力学思想的河流等高线冲突自动处理方法

文中分析河流等高线冲突的自动处理方法,按照地图综合原理,提出基于弹性力学思想的河流、等高线冲突自动检测和纠正算法。该算法实现河流等高线的冲突探测,并对目标进行受力分析,运用平面杆件弹性体的受力变形模型,得到目标的位移量。该方法在纠正冲突的同时保证目标空间关系的正确,实验证明算法具有较高效率。     

A method for generating contour tree based on voronoi interior adjacency

A contour tree is a good graphical tool for representing the spatial relations of contour lines and has many applications in map generalization, map annotation, terrain analysis, etc. A new method for generating contour trees by introducing a Voronoi-based interior adjacency concept is proposed in this paper. The immediate interior adjacency set is employed to identify all of the children contours of each contour without contour elevations. It has advantages over existing methods such as the geometric method and the region growing-based method.     

基于Voronoi内邻近的等高线树生成法

针对等高线树现有几何计算生成法和区域扩张生成法在判断包含关系方面存在的不足,提出了利用Voronoi内邻集来判断父等高线与子等高线之间“一对多”的直接包含关系,发展了一种基于Voronoi内邻近的等高线树生成方法。