Hierarchical Parametrization of Triangulated Surfaces
Hierarchical Parametrization of Triangulated Surfaces
复制标题
DOI：
--
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
K. Hormann;G. Greiner;Swen Campagna
中科院分区：
文献类型：
--
作者：
K. Hormann;G. Greiner;Swen Campagna
在计算机辅助几何设计（CAGD）中，三角网格曲面的全局参数化问题是许多应用的基础。虽然这个问题有几种解决方案，但随着三角形数量的增加，大多数解决方案都变得相当缓慢，因为必须解决大的病态问题。我们展示了如何可以利用三角化表面的层次表示，建立一个类似于多重网格方法，并保证快速收敛速度的战略。
The problem of creating global parametrizations of triangulated surfaces is fundamental for many applications in computer-aided geometric design (CAGD). Although several solutions to this problem exist, most of them become considerably slow as the number of triangles increases, because large, ill-conditioned problems have to be solved. We show how the hierarchical representation of a triangulated surface can be exploited to establish a strategy that is similar to multigrid methods and guarantees fast convergence rates.