Geodesic remeshing using front propagation
Geodesic remeshing using front propagation
复制标题
DOI：
10.1007/s11263-006-6859-3
复制
发表时间：
2006-08-01
影响因子：
19.5
通讯作者：
Cohen, Laurent D.
中科院分区：
文献类型：
--
作者：
Peyré, Gabriel;Cohen, Laurent D.
在本文中，我们提出了一个完整的框架的三维几何模型在g和过程在2中使用石油I快速测地线计算。这些技术的基本组成部分是一种新颖的贪婪算法，用于对三角曲面进行均匀或自适应的网格划分。我们的其他贡献包括基于质心坐标的参数化方案，一种计算测地线质心镶嵌的内在算法。提出了一种快速、鲁棒的零属表面贴片平整方法。在大型网格（超过500,000个顶点）上。与经典的重网格和参数化方法相比，我们的技术将计算速度提高了一个数量级以上。我们的方法易于实现，并且不需要多层求解器来处理可能包含形状不佳的三角形的复杂模型。
In this paper, we propose a complete framework for 3D geometry model in g and process in 2 that uses oil I v fast geodesic computations. The basic building block for these techniques is a novel greedy algorithm to perform a uniform or adaptive remeshing of a triangulated surface. Our other contributions include a parameterization scheme based on barycentric coordinates, an intrinsic algorithm for computing geodesic centroidal tessellations. and a fast and robust method to flatten a genus-0 surface patch. On large meshes (more than 500,000 vertices). our techniques speed up computation by over one order of magnitude in comparison to classical remeshing and parameterization methods. Our methods are easy to implement and do not need multilevel solvers to handle complex models that may contain poorly shaped triangles.