Combinatorial mesh optimization
Combinatorial mesh optimization
复制标题
组合网格优化
DOI：
10.1007/s00371-011-0649-9
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
F. Dupont
中科院分区：
文献类型：
--
作者：
V. Vidal;Christian Wolf;F. Dupont
提出了一种新的三维三角形表面网格的网格优化框架，该框架将任务表述为与Hoppe等人（SIGGRAPH'93：Proceedings of the 20th Annual Conference on Computer Graphics and Interactive Techniques，1993）中相同的能量最小化问题。所需的网格属性是通过一个全球性的能量函数，包括数据附加条款测量保真度的原始网格，有利于高品质的三角形的形状潜力，以及连通性，以及控制采样密度的预算条款控制。优化算法修改网格连接以及顶点位置。顶点重新定位步骤的解决方案是通过一个离散图切割算法检查本地candides.Results的全球组合在各种3D meshfavorably比较最近的国家的最先进的算法。应用包括优化三角形网格和简化网格，同时保持高网格质量。目标领域是提高数值模拟的准确性、数值方案的收敛性、改进网格渲染（法向场平滑度）或改进网格压缩技术中的几何预测。
A new mesh optimization framework for 3D triangular surface meshes is presented, which formulates the task as an energy minimization problem in the same spirit as in Hoppe et al. (SIGGRAPH’93: Proceedings of the 20th Annual Conference on Computer Graphics and Interactive Techniques, 1993). The desired mesh properties are controlled through a global energy function including data attached terms measuring the fidelity to the original mesh, shape potentials favoring high quality triangles, and connectivity as well as budget terms controlling the sampling density. The optimization algorithm modifies mesh connectivity as well as the vertex positions. Solutions for the vertex repositioning step are obtained by a discrete graph cut algorithm examining global combinations of local candidates.Results on various 3D meshes compare favorably to recent state-of-the-art algorithms. Applications consist in optimizing triangular meshes and in simplifying meshes, while maintaining high mesh quality. Targeted areas are the improvement of the accuracy of numerical simulations, the convergence of numerical schemes, improvements of mesh rendering (normal field smoothness) or improvements of the geometric prediction in mesh compression techniques.
DOI：
10.1109/tpami.1984.4767596
发表时间：
1984-01-01
影响因子：
23.6
作者：
GEMAN, S;GEMAN, D
通讯作者：
GEMAN, D