• Title/Summary/Keyword: Hierarchical B-spline Curve

Search Result 2, Processing Time 0.019 seconds

Multilevel Editing for Hierarchical B-spline Curves using Rotation Minimizing Frames (RMF을 이용한 계층적 B-spline 곡선의 다단계 편집기법)

  • Zhang, Ci;Yoon, Seung-Hyun;Lee, Ji-Eun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.16 no.4
    • /
    • pp.41-50
    • /
    • 2010
  • We present a new technique for multilevel editing of hierarchical B-spline curves. At each level, control points of a displacement function are expressed in the rotation minimizing frames (RMFs) [1] which are computed on nodal points of the curve at previous level. When the curve is edited at previous level, the corresponding RMFs are updated and the control points of the displacement function at current level are applied to the new RMFs, which maintains the relative details of the curve at current level to those of previous level. We demonstrate the effectiveness and robustness of the proposed technique using several experimental results.

Curve Reconstruction from Oriented Points Using Hierarchical ZP-Splines (계층적 ZP-스플라인을 이용한 곡선 복구 기법)

  • Kim, Hyunjun;Kim, Minho
    • Journal of the Korea Computer Graphics Society
    • /
    • v.22 no.5
    • /
    • pp.1-16
    • /
    • 2016
  • In this paper, we propose and efficient curve reconstruction method based on the classical least-square fitting scheme. Specifically, given planar sample points equipped with normals, we reconstruct the objective curve as the zero set of a hierarchical implicit ZP(Zwart-Powell)-spline that can recover large holes of dataset without loosing the fine details. As regularizers, we adopted two: a Tikhonov regularizer to reduce the singularity of the linear system and a discrete Laplacian operator to smooth out the isocurves. Benchmark tests with quantitative measurements are done and our method shows much better quality than polynomial methods. Compared with the hierarchical bi-quadratic spline for datasets with holes, our method results in compatible quality but with less than 90% computational overhead.