摘要
点集三角化在CAD、计算机图形学、有限元等领域有着广泛的应用，快速与优化是与之相关的两个重要问题。本文提出一种快速优化构网方法，在实现中采用了基于栅格的离散点组织方式和基于三角形的数据结构，并给出了一些快速搜索和快速计算算法。本方法支持约束边的引入，并无需插入附加点。
Triangulation of discrete points is widely used in many fields such as CAD, computer graphics,finite element and so forth. High speed and optimiztion are two important problems that are correlative to it. In this paper, a fast and optimal method for mesh generation is presented. We adopt grid to organize discrete points and data Structure based on triangle. The paper also introduces some fast algorithms for search and computation. Meanwhile, the method supports the constraint edge to be in mesh without additional point to be inserted.
出处
《工程图学学报》
CSCD
1999年第4期28-35,共8页
Journal of Engineering Graphics
关键词
三角形拓扑
构网
快速优化构网
栅格
数据结构
fast triangulation, optimization, constraint triangulation, grid, data structure,algorithm
