基于相邻关系的等高线树建立算法研究  

An algorithm of neighbor relationship oriented contour tree building

作　　者：郭沛沛[1] 李成名[1] 殷勇[1] 丁圣陶[1] 

机构地区：[1]中国测绘科学研究院,北京100830

出　　处：《中国工程科学》2013年第5期42-46,共5页Strategic Study of CAE

基　　金：国家测绘地理信息局科技基金资助项目(A1118)

摘　　要：等高线树在提取地形线、地貌综合等方面具有重要的应用意义。常用的等高线树表达的是等高线的层次关系,直接表达等高线的包含和邻接关系,建树过程复杂,对数据要求较高,需要对数据进行预处理。本文将图幅内等高线按照是否闭合分为两类,分别对两类等高线群进行建树,最后将两个独立的等高线树合并,形成完整的等高线树。最后生成的等高线树表示了等高线之间的相邻关系,再借助其高程值就可以判断出等高线之间的包含邻接关系,算法容易理解,程序实现简单。A contour tree has been found many important applications in extraction of terrain structure lines, terrain analysis, etc. A regular contour tree expressing the spatial relationship of contours is difficult to build, even with data of high quality. A new method is proposed in this paper： classify contours into close group and open group; build contour tree for each group respectively; finally amalgamate these two contour trees into one. With the elevation values, spatial relationship of contours is of easy accessibility. The result shows that the above mentioned method is correct and effective.

关 键 词：等高线树 相邻关系 高程值 闭合等高线 不闭合等高线 

分 类 号：P208[天文地球—地图制图学与地理信息工程]