三维网格模型的局部三角剖分算法
Local Delaunay Triangulation Generation Algorithm on Triangulated Solids
李岩席 1贺可太 1朱冬梅1
作者信息
- 1. 北京科技大学 机械工程学院, 北京 100083
- 折叠
摘要
为了提高三维网格模型的渲染显示效率和提高网格质量以满足有限元分析,提出了一种新的三维网格模型的局部三角剖分方法.本方法的三角剖分基于Bowyer-Watson插点算法实现.通过在新插入点的邻域内搜索三角形来提高三角剖分的效率,通过对网格的几何形状和连通性进行局部修改来提高网格质量.通过尺寸场来约束控制三角剖分区域,使得生成的网格质量和算法性能有较好的综合表现.
Abstract
In order to improve the rendering display efficiency of the three-dimensional grid model and improve the quality of the graphic grid,a new three-dimensional grid model of the three-dimensional grid model is proposed.The triangle section of this method is based on the Bowyer-Watson method.By searching the triangle in the neighborhood of the newly inserted point to improve the efficiency of the triangular section,the grid quality is improved by local modification of the geometric shape and connectivity of the grid.The size field is constrained to control the triangular dissection area,so that the quality and algorithm performance of the generated grid have a good comprehensive performance.The experiment in the plane set,the algorithm proposed can perform more accurate triangular section.
关键词
三维网格模型/三角剖分/Delaunay三角网Key words
Computation geometry/Triangulated solids/Triangulation/Delaunay triangulated network引用本文复制引用
基金项目
网络协同制造和智能工厂国家重点研发计划(2020YFB1709101)
出版年
2024
NETL
NSTL
维普
万方数据