基于对称边双循环链表的三角格网表示与实现  

Representation and Implementation in Triangle Meshes Based on Symmetry Edge Dual-circulation Linked List

作　　者：孟亮[1] 方金云[1] 韩承德[1] 

机构地区：[1]中国科学院计算技术研究所,北京100080

出　　处：《计算机工程》2008年第6期28-29,32,共3页Computer Engineering

基　　金：国家"863"计划基金资助项目(2002AA114020;2001AA135210);中国科学院知识创新基金资助项目(20036020)

摘　　要：针对三角格网提出一种对称边双循环链表结构,对称边是指一条边由2个有向边表示,双循环链表是指这些线段分别以其2个端点为源点,通过同源点关系使线段之间能够顺时针与逆时针方向关联。该结构能方便地维护三角格网拓扑结构。给出三角格网中几个基本操作的伪码实现。与通用的多边形格网结构相比,它具有理解容易、操作方便、使用内存少的优点。With respect to triangle meshes, this paper proposes a symmetry edge dual-circulation linked list structure. Symmetry edge means that one edge is expressed by two directed edge. Dual-circulation linked list means that these edges take two endpoint of one edge as original point, and by same original point relation, it can associate clockwise and anticlockwise between each other. This data structure can conveniently maintain triangle meshes topology structure, and provide several pseudocode implementation of triangle meshes basic operations. Compared with general purpose polygonal meshes data structure, the structure has the advantage of easy understanding, convenient operation and thrifty memory usages.

关 键 词：三角格网 多边形格网 拓扑结构 双循环链表 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]