机构地区: 中国矿业大学北京3S与沉陷工程研究所
出 处: 《地理与地理信息科学》 2004年第5期28-31,共4页
摘 要: 二维Delaunay三角网的局部更新在地学分析、道路CAD、城市规划等领域有着广泛的用途 ,点插入和点删除则是其中最重要、最基本的操作。该文针对原有逐点插入法和凸耳权值点删除算法存在的不足 ,利用动态包围三角形和特征三角形分别对其进行改进 ,在设计的具有拓扑关系Delaunay的三角网数据结构基础上 ,实现Delaunay三角网的快速局部更新 ,且使之满足Delaunay特性。 The local updating of two dimensional Delaunay TIN has extensive applications in geoscientific analysis,road CAD,city planning and other domains.Point insertion and point deletion are two of the basic and important operations.For the deficiency of present point inserting algorithm and ear-priority point deleting algorithm,the authors used the dynamical boundary triangle and feature triangle to improve it.The fast updating for TIN was realized,and the updated TIN was also Delaunay.The experiments show that the improved algorithm is of high efficiency and validity.