摘要
对于三角网的表示方法,提出了一种双循环链表结构,这种结构能够方便的表示三角网的边拓扑和面拓扑信息,以及多边形结构。基于这种结构,对三角网点删除算法进行了改进。以前的点删除算法是基于连续的凸耳删除,提出的方法是基于多边形边的构建方法,利用D-三角网的空外接圆属性。与其它方法相比,这种方法具有容易理解,效率高的优点。
As to representation of triangulated irregular network （TIN）, a dual-circulation linked list structure is proposed, this structure can conveniently express edge and plane topology information of triangulated irregular network, and polygon structure. Based on this structure, improvements are achieved about TIN point deletion algorithm. Previous point deletion algorithm is based on continuous ears deletion, the methods proposed is based on edge construction method of polygon, using Delaunay TIN circumcircle property. Compared with other methods, this method has the advantage of easy understanding, higher efficiency.
出处
《计算机工程与设计》
CSCD
北大核心
2008年第3期738-740,744,共4页
Computer Engineering and Design
基金
国家863高技术研究发展计划基金项目(2002AA114020
2001AA135210)
中国科学院知识创新基金项目(20036020)
关键词
DELAUNAY三角网
凸耳
点删除
拓扑结构
双循环链表
Delaunay triangulated irregular network
ears
point deletion
topology structure
dual-circulation linked list
