Loop Subdivision Surface Fitting by Geometric Algorithms
Loop Subdivision Surface Fitting by Geometric Algorithms
复制标题
DOI：
--
复制
发表时间：
2008
影响因子：
3.6
通讯作者：
Y. Nishiyama;Masayuki Morioka;T. Maekawa
中科院分区：
文献类型：
--
作者：
Y. Nishiyama;Masayuki Morioka;T. Maekawa
本文提出了一种基于几何算法的环细分曲面逼近点集的方法。我们假设数据点是在任意拓扑类型的三角形网格中给出的。利用QEM算法对输入三角网格进行简化，得到环路细分曲面的初始控制网格。我们的算法基于简单的点-面距离计算，然后沿着位移向量平移控制顶点，以全局方式迭代更新控制网格。与现有的曲面拟合方法相比，我们的方法的主要优点是简单、快速和通用性。计算结果表明，我们的算法运行速度至少比目前最先进的细分拟合方法快6倍。我们用各种复杂的例子来演示我们的技术。
This paper describes a method to approximate point sets by Loop subdivision surfaces based on geometric algorithms. We assume that the data points are given in triangular mesh of arbitrary topological type. The initial control mesh of the Loop subdivision surface is obtained by simplifying the input triangular mesh using QEM algorithm. Our algorithm iteratively updates the control mesh in a global manner based on a simple point-surface distance computation followed by translations of the control vertices along the displacement vectors. The main advantages of our approach compared to existing surface fitting methods are simplicity, speed, and generality. Computational results show that our algorithm runs at least six times faster than current state-of-the-art subdivision fitting methods. We demonstrate our technique with a variety of complex examples.