EXPERIMENTS ON THE GROUP GENERALIZATIONG OF CONTOUR LINES FOR TOPOGRAPHIC MAPS

This paper analyzes the advantages and disadvantages of two techni-cal lines for automatic group generalization of contour lines.The author suggeststhat it is possible to get faster and better generalization results if we simulate theintelligence of human experts in program designing,retrieve geomorphologicalstructural information using the input data of 2-D contour lines and derive andoutput the generalied 2-D results directly.     

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.     

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

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

Representing of contour lines by turning point preserving quadratic splines

Abstract

Terrain data obtained from satellite imagery or by scanning existing contour maps is in raster mode. Such data may be compressed by detecting and storing the critical points of contour lines. When hand digitising a contour map, a trained digitiser operator would usually select points which visually appear to be critical points. Existing interpolation techniques often fail to restore the critical points, including turning points, to their original positions. This article illustrates the use of splines composed of quadratic Bézier curves with monotone curvature for rendering contour lines which are represented only by their turning and end points, such that the positions of the turning points are preserved.     

基于三角网渐进式简化的等高线多尺度综合

提出了一种基于三角网渐进式简化的等高线多尺度综合方法,实验结果表明,其不仅可以较好地保留地形特征,而且可以完全避免等高线相交现象的产生.     

Eye-tracking Study on Different Perception of 2D and 3D Terrain Visualisation

Abstract

The use of computer-generated perspective views, often named as three-dimensional (3D) maps, is growing. These terrain visualisations should be more understandable for users without cartographic education, which are not familiar with contour lines. Within the study, two eye-tracking experiments and online questionnaire were used for investigating the difference between user cognition of classical two-dimensional (2D) visualisation with contour lines and perspective 3D view. Questionnaire was focused on maps understandability, suitability and aesthetics. Results of the questionnaire shows, that the majority of participants prefer 3D visualisation. First eye-tracking experiment was designed as a pair of maps in one stimulus. One shows 2D visualisation, the other 3D visualisation. No significant differences between user preferences of 2D and 3D visualisation were found, but the results were influenced with the order of the maps in the stimuli. Because of that another experiment was designed. In this case stimuli contained only one of two possible visualisations (2D and 3D). ScanPath comparison of this experiment results confirmed that users have different strategies for cognition of 2D and 3D visualisation, although statistically significant difference between both types of visualisation was found in the ScanPath length metric only.     

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

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

An Algorithm for Localised Contour Removal over Steep Terrain

Abstract

Isolines have proved to be a highly effective way of conveying the shape of a surface (most commonly in the form of height contours to convey geographical landscape). Selecting the right contour interval is a compromise between showing sufficient detail in flat regions, whilst avoiding excessive crowding of lines in steep and morphologically complex areas. The traditional way of avoiding coalescence and confusion across steep regions has been to manually remove short sections of intermediate contours, while retaining index contours. Incorporating humans in automated environments is not viable. This research reports on the design, implementation and evaluation of an automated solution to this problem involving the automatic identification of coalescing lines, and removal of line segments to ensure clarity in the interpretation of contour information. Evaluation was made by subjective comparison with Ordnance Survey products. The results were found to be very close to the quality associated with manual techniques.     

Progressive graphic simplification of contours based on spatial reasoning

This paper discusses the rules representing relief with contour lines and methods for automatically constructing relation of contour lines.Meanwhile,the improvement of existent methods for extracting the topographic characteristic points and lines is described.On the basis of this analysis,we propose a series of practicable progressive graphic simplification ideas of contour lines and concrete algorithms for the exception's handling.In this way,graphic generalizations of contour lines at different scales are integrated into one model that is convenient to implement,and in which contour lines' intersection in generalization can be controlled.     

采用3D D-P算法的等高线三维综合实验研究

将等高线看作是由高程点以特定形式组织得到的空间三维线段,采用3维Douglas-Peucker算法从三维空间提取等高线上的主要特征点。根据等高线数据特点,对该算法进行等高线综合的几种方案进行实验讨论。实验结果和运算速度表明,采用3维Douglas-Peucker算法综合等高线具有广阔的研究前景。     

Progressive graphic simplification of contours based on spatial reasoning

This paper discusses the rules representing relief with contour lines and methods for automatically constructing relation of contour lines. Mean-while, the improvement of existent methods for extracting the topographic characteristic points and lines is described. On the basis of this analysis, we propose a series of practicable progressive graphic simplification ideas of contour lines and concrete algorithms for the exception’s handling. In this way, graphic generalizations of contour lines at different scales are integrated into one model that is convenient to implement, and in which contour lines’ intersection in generalization can be controlled.     

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

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

基于特征的等高线数据聚类方法

针对地理线要素具有的分形特征,将小波分解算法和数值统计算法结合起来,提出并证明等高线小波分解后各层细节分量与复杂度之间具有对数线性的关系,从而计算出等高线的复杂度.再结合等高线自身的位置关系,给出等高线的分类标准,将等高线进行聚类,从而降低图形处理时等高线图形的密度和所需要的等高线的数据量,减少等高线相交的可能性.     

等高线的空间关系规则和渐进式图形简化方法

详细讨论了等高线表达地形的规则和以此为基础自动建立等高线关系的方法,对地形特征点、线的提取改进了已有较成熟的方法,建立了一套实用的等高线图形简化的渐进式方法,并对其特殊情况的处理提 出了具体的算法。这种方法把不同比例尺跨度的等高线图形综合融为一体,易于实现,等高线图形简化时的等高线相交可在综合过程中控制。     

Terrain generalization with line integral convolution

ABSTRACT

Line integral convolution is a technique originally developed for visualizing vector fields, such as wind or water directions, that places densely packed lines following the direction of movement. Geisthövel and Hurni adapted line integral convolution to terrain generalization in 2018. Their method successfully removes details and retains sharp mountain ridges; it is particularly suited for creating generalized shaded relief. This paper extends line integral convolution generalization with a series of enhancements to reduce spurious artifacts, accentuate mountain ridges, control the level of detail in mountain slopes, and preserve sharp transitions to flat areas. The enhanced line integral convolution generalization effectively removes excessive terrain details without changing the position of terrain features. Sharp mountain ridgelines are accentuated, and transitions to flat waterbodies and valley bottoms are preserved. Shaded relief imagery derived from generalized elevation models is visually pleasing and resembles manually produced shaded relief.     

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内邻近的等高线树生成方法。     

A Method for Generating Contour Tree Based on Voronoi Interior Adjacency

IntroductionTopographic contour lines play an i mportantrole in the process of humans analyzing land-form. Particularly ,the spatial relations of con-tours are usually analyzed andinterpreted by hu-mans to recognize topographic features .In orderto model and represent the relationships betweencontour lines ,in 1963 Boyell and Reston pro-posed a contour tree generated by mapping con-tour lines as edges and interstitial spaces asnodes[1 ,2].There has been a great deal of previous workrepresenti…     

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

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