面向等高线与河流冲突处理的多约束移位方法

本文针对等高线与河流的不一致性问题,以移位等高线匹配河流为出发点,提出一种对每个特征点动态确定仿射变换模型进行移位的方法。该方法综合考虑移位角度比例、地形特征点相对位置、局部形态的保持和变换等因素,对各特征点实时计算其位移的角度、位置和缩放变化等约束建立其移位模型。实验结果表明,本文提出的方法能够较好地实现等高线到河流的一致性改正,可有效解决等高线与河流数据的空间匹配问题。     

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.     

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.     

一种由等高线构建DEM的新方法

基于HASM,提出了一种由等高线建立DEM的新方法HASM-OC。HASM—OC方法保证地形曲面的整体光滑性,保证DEM最大程度上忠实于原始等高线数据。实际等高线案例结果表明,HASM—OC方法与基于薄板样条原理的Hutchinson方法的DEM模拟结果及其回放的等高线差相比,前者比后者保留更多的地形特征信息,前者的回放等高线比后者回放等高线更忠实于原始数据。     

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

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

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

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

Obtaining High Fidelity Triangular Regular Network from Only DEM Points

Abstract

<title/>

When the source data for the digital elevation model (DEM) are not known and any additional information or features such as skeleton lines of terrain is not available, a triangular regular network (TRN) is constructed with simple subdivision using one or two diagonals uniformly. Such a model gives inaccurate directions for interpolation because of the inaccurate diagonals used in triangulation and thereby, results in inaccurate contours representing artificial terrain features. In this study, a new method is developed based on slope information computed at DEM points determining accurate diagonals in the subdivision process, which is beneficial not only through the skeleton lines of a terrain but also all over the DEM. Consequently, it is shown that the proposed method is able to build a high fidelity TRN from a DEM without any additional information or features.     

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

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

A Mathematical Approach to the Storage of Digitised Contours

Abstract

The increasing use of digitised data, especially contours, is creating problems of storage in the smaller computers. Efforts made to make digitised contour information more compact for use in a data bank are described which can produce savings in storage requirements of up to 85 per cent.     

基于等高线的表面估计滤波方法

提出一种基于等高线的滤波方法,它先由LIDAR数据生成数字表面模型,并内插出等高线,再根据DSM等高线的特征,如闭合性、首尾点距离、等高线的长度及等高线间距离等,通过设定阈值自动提取出属于自然地面的等高线线段,以获得初始的自然地面点,然后内插生成初始数字地面模型,最后使用迭代逼近法生成最终的(精确的)数字地面模型,即比较初始DTM与DSM,差值小于预设阈值的点视为DTM点,而差值大于预设阈值的点则标记为无数据点,最后,这些无数据点由选择的DTM点内插出.通过与现有表面估计的滤波方法的对比实验以及所提取地物轮廓线与航片的叠加对比试验,证明新方法可适用于地表起伏较大的地形,地物提取精度高、计算量小、效率高.     

Contour line simplification method based on the two‐level Bellman–Ford algorithm

The contour line is one of the basic elements of a topographic map. Existing contour line simplification methods are generally applied to maps without topological errors. However, contour lines acquired from a digital elevation model (DEM) may contain topological errors before simplification. Targeted at contour lines with topological errors, a progressive simplification method based on the two‐level Bellman–Ford algorithm is proposed in this study. Simplified contour lines and elevation error bands were extracted from the DEM. The contour lines of the elevation error bands were initially simplified with the Bellman–Ford (BF) algorithm. The contour lines were then segmented using the vertices of the initial simplification result and connected curves with the same bending direction were merged into a new curve. Subsequently, various directed graphs of the merged curves were constructed and a second simplification was made using the BF algorithm. Finally, the simplification result was selected based on the similarity between several simplification results and adjacent contour lines. The experimental results indicate that the main shapes of the contour groups can be maintained with this method and original topological errors are resolved.     

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

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

一种符合视觉规律的,基于地图数据的虚拟地景仿真

本文分析和解决了两个关键性问题，使计算机所生成的虚拟地景符合人的“越近看得越清”视觉规律，并通过实例对该方法的实现过程给予了详细的描述。     

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.     

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…     

基于等高线膨胀生成规则格网DEM的算法

介绍一种通过等高线膨胀生成格网的新算法，该算法将等高线栅格化并交替进行4连通和8连通膨胀，两条相邻等高线膨胀的交界处即为相邻等高线的中间等高线，将新产生的等高线通过界线提取加入到栅格等高线中并继续扩张，重复进行直到没有新的中间等高线生成为止。该算法具有易于实现、程序运行速度快、效果较好、生成的差值小和对硬件要求不高等优点。     

根据地性线绘制等高线的研究

根据地形特征点和地性线绘制等高线是测绘大比例尺地形图等高线的主要方法,本文在分析现有自动绘制等高线方法的基础上,提出了一种根据地性线及其拓扑关系直接求取和跟踪等高线的方法。针对利用各种传统曲线光滑算法所绘相邻等高线间常常出现不协调现象的缺点,首次提出并详细讨论了相邻等高线通过点间的抛物线双向加权平均光滑算法。大量实践表明,利用本文所提出的跟踪和光滑方法所绘等高线的光滑性和协调性是令人满意的。     

CONSTRUCTION OF A DIGITAL TERRAIN MODEL

An approach is outlined for the construction of a digital terrain model based on elevations assigned to nodes of an irregular (non-rectangular) grid. More specifically, this grid consists of a series of non-intersecting, non-equilateral triangles whose apices are prominent points of local relief or points located on structure lines, and whose sides represent portions of structure lines or arbitrarily selected line segments. Such an irregular model provides for a better approximation of basic terrain structure than those constructed from traditional, geometrically regular networks. Operation of algorithms for the plotting of contour lines from such a model is described. Translated from: Geodeziya i kartografiya, 1986, No. 2, pp. 34-38.     

EXPERIMENTS ON THE GROUP GENERALIZATIONG OF CONTOUR LINES FOR TOPOGRAPHIC MAPS

ABSTRACT

This paper analyzes the advantages and disadvantages of two technical lines for automatic group generalization of contour lines. The author suggests that it is possible to get faster and better generalization results if we simulate the intelligence of human experts in program designing, retrieve geomorphological structural information using the input data of 2-D contour lines and derive and output the generalized 2-D results directly.