摘要
平面散点域的三角化效率一直是人们关心的问题.以三角形面结构为存储结构,对逐点插入三角化算法中三角形的拓扑关系维护进行了研究,提出了动态创建和维护三角形拓扑关系的算法.算法原理简单、通用性强,实验测试表明基于本文原理所设计的逐点插入算法有较高的执行效率.
Efficiency of triangulation on plane data set is a key issue in GIS and computer graphic field. An algorithm is presented that dynamically creates and renews triangle topological relation based on incremental insertion triangulation algorithm by Lawson in 1977. Though test with six groups of data sets, the running speed of incremental insertion algorithm based on the paper proves far faster than that of the old version. Also the principle of the algorithm is simple and easy to be programmed. 6figs., 3tabs., 19refs.
出处
《湖南科技大学学报（自然科学版）》
CAS
北大核心
2008年第2期79-83,共5页
Journal of Hunan University of Science And Technology：Natural Science Edition
基金
国家863计划资助项目(2006AA12Z212
2007AA12Z238)
关键词
数字高程模型
三角剖分
算法
拓扑关系
digital elevation model （DEM）
triangulation
algorithm
topological relation
