| 改进Delaunay三角剖分算法 |
| |
| 引用本文： | 田军委,程钢. 改进Delaunay三角剖分算法[J]. 西安工业大学学报, 2011, 0(4): 334-339 |
| |
| 作者姓名： | 田军委 程钢 |
| |
| 作者单位： | [1]西安工业大学机电工程学院,西安710032 [2]西安北方光电科技防务有限公司,西安710043 |
| |
| 基金项目： | 陕西省教育厅专项科研计划项目（09JK497）;西安工业大学校长基金项目（XAGDXJJ0904）;陕西省教育厅专项科研计划项目（2010JK600）;陕西省教育厅专项科研计划项目（11JK0981） |
| |
| 摘 要： | 针对传统Delaunay算法对非凸三维曲面剖分结果不理想，提出了基于凸划分的改进Delaunay三角剖分算法．研究了复杂曲面剖分的特性，定义了非凸集合凸划分定理，对任意曲面相对投影平面进行划分．利用一组正交平面对任意复杂曲面的划分，通过变换域对曲面进行了Delaunay三角剖分．实验结果表明，改进算法能够在正交平面对头面数据集合进行正确凸划分，在投影平面改进Delaunay三角剖分结果正确，鲁棒性明显增强，并与理论分析一致，验证了改进算法的正确性和有效性．
|
| 关 键 词： | 三维建模 三角网格 Delaunay剖分 凸划分 |
Improved Delaunay Triangulation Algorithm |
| |
| TIAN Jun-wei,CHENG Gang. Improved Delaunay Triangulation Algorithm[J]. Journal of Xi'an Institute of Technology, 2011, 0(4): 334-339 |
| |
| Authors: | TIAN Jun-wei CHENG Gang |
| |
| Affiliation: | 1. School of Mechatronic Engineering,Xi＇an Technological University,Xi＇an 710032,China; 2. North Optoelectronic Stock Ltd, Xi ＇ an 710043, China) |
| |
| Abstract: | Traditional Delaunay triangulation algorithm is incapable in obtaining ideal partition results for non-convex data set. To solve this problem. An improved Delaunay triangulation algorithm based on convex partition is proposed. The theorem of convex partition for non-convex set is proposed, and convex partition of complex surface on the basis of projection plane is deduced. According to the theorems, the orthogonal plane based Delaunay triangulation can be performed on the complex surface. The experiments performed on head 3D data show that the improved Delaunay triangulation on projection plane is corrected and the robustness is enhanced, which conforms with the theoretical analysis, thus the correctness and effectiveness are testified. |
| |
| Keywords: | three-dimensional modeling triangle mesh Delaunay triangulation convex partition |
| 本文献已被 维普 等数据库收录！ |
