arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0906.1226cs.GRcs.CC
收藏

四边形网格光滑样条曲面的复杂性

On the Complexity of Smooth Spline Surfaces from Quad Meshes

Jorg Peters, Jianhua Fan

摘要:

本文导出了用局部平均法计算曲面片时,曲面片光滑复形的边界曲线所必须服从的强关系。这些关系限制了几何连续性重参数化的选择。特别地,当一个双三次张量积B样条曲面片与具有n价顶点的四边形网格的每个面相关联,并且我们不希望边界曲线的段被强制为线性时,则关系决定了节点的最小数量和多重性:对于一般数据,张量积样条曲面片的每条边必须至少有两个内部双结点,才能模拟C^1样条的G^1-连通复体。通过适当地解释现有的表面构造,任何构造的复杂性的下限被证明是尖锐的。也就是说,我们有一个严格的约束上的复杂性平滑四网格与双三次张量积B样条补丁。

英文摘要:

This paper derives strong relations that boundary curves of a smooth complex of patches have to obey when the patches are computed by local averaging. These relations restrict the choice of reparameterizations for geometric continuity. In particular, when one bicubic tensor-product B-spline patch is associated with each facet of a quadrilateral mesh with n-valent vertices and we do not want segments of the boundary curves forced to be linear, then the relations dictate the minimal number and multiplicity of knots: For general data, the tensor-product spline patches must have at least two internal double knots per edge to be able to model a G^1-conneced complex of C^1 splines. This lower bound on the complexity of any construction is proven to be sharp by suitably interpreting an existing surface construction. That is, we have a tight bound on the complexity of smoothing quad meshes with bicubic tensor-product B-spline patches.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑