|Table of Contents|

Triangulating the Contour Data Without Flat Triangle Treatment(PDF)

《南京师大学报（自然科学版）》[ISSN:1001-4616/CN:32-1239/N]

Issue:
2012年04期
Page:
106-111
Research Field:
地理学
Publishing date:

Info

Title:
Triangulating the Contour Data Without Flat Triangle Treatment
Author(s):
Xie Yujia1; 2; 3; Liu Xuejun1; 2; 3; Hu Jiapei1; 2; 3
1.School of Geography Science,Nanjing Normal University,Nanjing 210023,China
Keywords:
flat triangle;  contour line;  adjacency relationship;  constrained delaunay triangulation( CDT)
PACS:
P217
DOI:
-
Abstract:
In this paper，we put forward a new method which could build a CDT without treating the flat triangle． Against the problem that some area in the topographic map where the contour lines is bending too much， this method，by making use of the adjacency relationships between the contour lines in the topographic map，under the premise of extracting the contour empty areas， carves out the promoter regions，which could have the non-flat triangle generated， from the rest of the topographic map independently， then builds structure networks in every promoter region． The set of these networks is the CDT of the entire topographic map． At last， on handling a group of contour experimental data measured from a region in the Yunnan province，we use the method presented in our paper and the method comes from the ArcGIS software respectively． By comparing the results produced by different experimental methods， the effectives of the method presented in this paper is proved．

References:

［1］ Gold C M，Snoeyink J． A one-step crust and skeleton extraction algorithm［J］． Algorithmica， 2001， 30( 2) : 144-163．
［2］ Yan H，Weibel R． An algorithm for point cluster generalization based on the Voronoi diagram［J］． Computer ＆ Geosciences， 2008， 34( 8) : 939-954．
［3］ Mark W． A procedure for automatically correcting invalid flat triangles occurring in triangulated contour data［J］． Computers ＆ Geosciences， 1998， 24( 2) : 141-150．
［4］ 陈仁喜，龙毅． 顾及三角形处理的TIN 建立算法［J］． 武汉大学学报: 信息科学版， 2003， 28( 5) : 619-622．
［5］ 张立朝，郑海鹰，陈引川，等． 基于等高线构建TIN 模型的平三角形修正算法［J］． 测绘科学技术学报，2006，23( 6) : 432-435．
［6］ 陈学工，黄晶晶． 基于等高线建立的TIN 中平坦区域的修正算法［J］． 计算机应用， 2007， 27( 7) : 1 644-1 646．
［7］ 江帆，王志伟，朱长青． 基于地性线的不规则三角网优化构建算法［J］． 武汉大学学报: 信息科学版，2007，32 ( 2) : 124-126．
［8］ 张琳琳，武芳，王辉连． 等高线空间关系的确定及应用［J］． 测绘通报， 2005( 8) : 19-22．
［9］ 吴凡，粟卫民． 顾及地形特征的等高线拓扑空间关系表达［J］． 武汉大学学报: 工学版， 2006， 39( 3) : 140-144．
［10］ 张尧，樊红，黄旺． 基于Delaunay 三角网的等高线树生成方法［J］． 测绘学报， 2012， 41( 3) : 461-467．
［11］ 朱强，武芳，钱海忠，等． 基于空间认知的等高线树的构建［J］． 信息工程大学学报， 2011， 12( 4) : 458-462．

Memo

Memo:
-
Last Update: 2013-03-11