Delauny三角网与邻接关系自动生成的数据结构与算法  

Data-Structure and Algorithm of auto-building Delauny Triangulation and abutment relationship based on points in a plane

作　　者：刘永和[1] 宋金星[1] 

机构地区：[1]河南理工大学资源与环境学院,河南焦作454003

出　　处：《河南理工大学学报（自然科学版）》2005年第5期361-365,共5页Journal of Henan Polytechnic University（Natural Science）

基　　金：河南省自然科学基金项目资助(0124140155)

摘　　要：在三角网生长法思想的基础上提出了一种Delauny三角网数据结构和基于该数据结构的构网与邻接关系生成的算法.本数据结构采用由三角形对象组成的单表结构,每个三角形对象都有组成它的三个边对象指针;而边对象是作为三角形对象的索引对象,它也有指向其两个左、右邻接三角形的指针.Based on triangle expanding method, a kind of data structure of Delauny triangulation, a algorithm of building triangulation and creating abutment relationship are presented in the paper. Here, data structure of single table structure composed of triangle objects is used, and each triangle has three edge object pointers composed of. Edge objects are used as objects referenced by triangle objects, and it has two pointers of triangles it abuts left and right. This data structure and algorithm has good effect in building triangular net and has advantage in faster abutment query.

关 键 词：Delauny三角网 数字地形模型 平面点集 三角网生长法 

分 类 号：P208[天文地球—地图制图学与地理信息工程]