摘要
提出一种两维区域三角剖分的新算法,算法首先递归应用求两维点集凸包的Graham扫描法,在原始区域的点集中求出一系列的凸包,同时原始两维区域也被这些凸包划分为多个独立的子区域,然后对相邻两个凸包之间的子区域进行三角剖分,从而实现对整个原始两维区域的三角剖分。和以往得算法相比,提出的算法的时间效率大大提高了,并且在作者参与的军队2110建设项目应用中也体现了良好的效果。
A new algorithm about triangulation is presented. Firstly using R. L. Graham scanning method to get the convex hulls of points in the original region, at the same time deviding the original area into many unattached ringed mini-extent, then using the algorithm presented in this article to divide the area between every two neighborly convex hulls, finally the whole original area is devided into tria- ngulars. Comparing with the algorithms before, this new algorithm improve the efficiency and get a satisfying result when applying to the projects of ＂2110 Institution of Army＂.
出处
《计算机工程与设计》
CSCD
北大核心
2007年第8期1750-1751,共2页
Computer Engineering and Design
基金
军队2110工程空军指挥实验室建设基金项目
军事通信学建设基金项目
