计算机工程2011，Vol.37Issue(12)：56-58,61,4.DOI:10.3969/j.issn.1000-3428.2011.12.019
基于不规则三角网构建的网格生长算法
Grid Growing Algorithm Based on Triangular Irregular Network Construction
摘要
Abstract
This paper presents a grid growing algorithm for fast construction of Delaunay irregular network based on discrete point. In this algorithm, a grid is achieved to express discrete point uniquely based on the divide-and-conquer method, which is compressed storage in a sparse matrix, and an efficient retrieval method is established between value cell and discrete point by identification code, which is effectively to improve the efficiency of the construction of Triangular Irregular Network(TIN). According to the density of value cells, a default square search space is acquired, and it is allowed to create the square search space dynamically in the expansion process of TIN, which ensures the accuracy of the grid growing. Experimental results show that the time complexity of the proposed algorithm is O(nlogn), and the algorithm is available to both small and massive amount of discrete points.关键词
Delaunay三角网/不规则三角网/离散点/正方形搜素空间/网格生长算法Key words
Delaunay triangular network/ Triangular Irregular Network(TIN)/ discrete point/ square search space/ grid growing algorithm分类
天文与地球科学引用本文复制引用
刘刚,李永树,张水舰..基于不规则三角网构建的网格生长算法[J].计算机工程,2011,37(12):56-58,61,4.基金项目
"十一五"国家科技支撑计划基金资助项目(2006BAJ05A13) （2006BAJ05A13）
