| 64 | 0 | 7 |
| 下载次数 | 被引频次 | 阅读次数 |
基于 Delaunay 三角化技术,提出一种对任意平面区域生成三角网格的全自动生成算法。此算法具有运行快速,构造网格质量好、区域适应性强等优点。算法包括对散乱数据点排序、三角剖分及网格优化处理等,最后给出的实例也证明了该算法的可靠性和实用性。
Abstract：Based on the Delaunay triangulation method,an automatic triangulation mesh generation algorithm for arbitrarily planar regions is presented;this algorithm has the advantage of fast operation,adaptation to complicate boundaries,high quality mesh.The algorithm includes rank of scattered points,triangulation and mesh optimization;At last,an example is given to demonstrate the reliability and practicability of this algorithm.
[1] Lin Feng,Pan Yunhe.A stack-based approach for shading of regions[J].Computer&Graphics,1992,16(1) :79-84．
[2] Li Xuejun,Yang Changgui,Sun Jiaguang.Shading of planar regions[A].Proceedings of the 4th International Conference on CAD/CG,Wuhan,1995． 33-36．
[3] 孙宏伟,王健,杨百龙.一种适合 VRML 应用的平面三角剖分快速算法[J].计算机辅助设计与图形学学报,2001,13(4) :324-327．
[4] 肖忠晖,卢振荣.三角剖分对偶树的顺序存储[J].计算机辅助设计与图形学学报(增刊),1998:6-9．
基本信息:
DOI：
中图分类号:TP391.7
引用信息:
[1]陈慧群.一种平面区域散乱点集的三角剖分方法[J].机械,2006(S1):59-60.
基金信息: