高级检索

G1连续任意拓扑曲面的几何重建

Geometric Reconstruction of G1 Surface with Arbitrary Topology

  • 摘要: 文中算法沿用了C-T分割算法的基本思想,从任意拓扑类型的曲面三角剖分T(P)出发,重建一张G1连续拼接的分段光滑曲面,用以插值T(P)的顶点集P及其中各点的法矢.在插值点的法矢没有给定的情况下,引入了“惯量估计”以估算各点的法矢.与Farin的C-T分割算法相比,本算法的结果不依赖于顶点的处理顺序,因而更为合理.其次,它不需要进行控制顶点的初估及修正,而是对多余的自由度进行了合理的分配,使各控制顶点的计算一次完成.由于算法是局部的,因此具有较高的效率.

     

    Abstract: This paper follows the basic idea of C-T subdivision algorithm and reconstructs a G1 piecewise smooth surface from a given triangulation T(P) of arbitrary topology to fit the positions and normals at points of 《P. When the normals are not given in advance, an ‘inertia estimation’ is promoted to estimate them. Unlike the C-T subdivision algorithm of Farin, a more reasonable approach which is unaffected by the handling order of given points is proposed. Moreover, new algorithm needn't estimate and correct the position of control vertexes, instead, it calculates them at once by reasonably assigning the redundant degrees of freedom. Since the algorithm is confined to local area, it is highly efficient.

     

/

返回文章
返回