高级检索

基于GNURBS曲面的多边域填充的改进算法

An Improved N-Sided Filling Algorithm Based on GNURBS Surface

  • 摘要: 针对现有多边区域填充算法难以处理填充曲面的拓扑复杂性、光顺性,以及无法平衡曲面质量和控制点数量的问题,提出一种基于广义非均匀有理B样条(generalized non-uniform rational B-splines,GNURBS)曲面的多边区域填充改进算法。首先采用三次均匀B样条曲线分别拟合给定边界曲线及其对应的C1和C2曲线,确定满足误差要求的控制点数量;然后根据各边界控制点数量构建多边区域的四边形拓扑结构,构造出相容的GNURBS控制网格与基函数;最后建立包含形状能量与边界约束能量的优化目标,并迭代求解线性方程组优化控制点位置,生成高质量填充曲面。与商业软件XNURBS生成的填充曲面进行多组实验的结果表明,在同样的误差、约束与曲面质量下,所提算法生成的填充曲面可以减少约70%的控制点。

     

    Abstract: This paper proposes an N-side hole filling algorithm based on generalized non-uniform rational B-splines (GNURBS) to address the limitations of existing methods in handling the topological complexity and smoothness of filling surfaces, and the trade-off between surface quality and the number of control points. First, cubic uniform B-splines are employed to fit the given boundary curves along with their corresponding C1 and C2 curves, determining the required number of control points to satisfy error tolerances. Next, a quadrilateral topology for the N-side hole is constructed based on the control point counts of each boundary, facilitating the generation of a compatible GNURBS control grid and basis functions. Finally, an optimization objective incorporating shape energy and boundary constraint energy is established, and the positions of the control points are optimized by iteratively solving a system of linear equations to generate a high-quality filling surface. Comparative experiments with the commercial software XNURBS demonstrate that, under identical conditions of error, constraints, and surface quality, the proposed algorithm reduces the number of control points by approximately 70%.

     

/

返回文章
返回