Geometric conditions for tangent continuity of interpolatory planar subdivision curves

Curve subdivision is a technique for generating smooth curves from initial control polygons by repeated refinement. The most common subdivision schemes are based on linear refinement rules, which are applied separately to each coordinate of the control points, and the analysis of these schemes is well understood. Since the resulting limit curves are not sufficiently sensitive to the geometry of the control polygons, there is a need for geometric subdivision schemes. Such schemes take the geometry of the control polygons into account by using non-linear refinement rules and are known to generate limit curves with less artefacts. Yet, only few tools exist for their analysis, because the non-linear setting is more complicated. In this paper, we derive sufficient conditions for a convergent interpolatory planar subdivision scheme to produce tangent continuous limit curves. These conditions as well as the proofs are purely geometric and do not rely on any parameterization.

[1]  C. Micchelli,et al.  Stationary Subdivision , 1991 .

[2]  Nira Dyn,et al.  Interpolatory convexity-preserving subdivision schemes for curves and surfaces , 1992, Comput. Aided Des..

[3]  S. Dubuc.  Interpolation through an iterative scheme , 1986 .

[4]  Nira Dyn,et al.  A 4-point interpolatory subdivision scheme for curve design , 1987, Comput. Aided Geom. Des..

[5]  Bert Jüttler,et al.  A non-linear circle-preserving subdivision scheme , 2007, Adv. Comput. Math..

[6]  D. Levin,et al.  Subdivision schemes in geometric modelling , 2002, Acta Numerica.

[7]  Neil A. Dodgson,et al.  A Circle-Preserving Variant of the Four-Point Subdivision Scheme , 2012 .

[8]  U. Reif,et al.  C1-continuity of the generalized four-point scheme , 2009 .

[9]  Nira Dyn,et al.  Geometrically Controlled 4-Point Interpolatory Schemes , 2005, Advances in Multiresolution for Geometric Modelling.

[10]  David Levin,et al.  Using Laurent polynomial representation for the analysis of non‐uniform binary subdivision schemes , 1999, Adv. Comput. Math..

[11]  Nira Dyn,et al.  Convergence and C1 analysis of subdivision schemes on manifolds by proximity , 2005, Comput. Aided Geom. Des..

[12]  D. Levin,et al.  Analysis of asymptotically equivalent binary subdivision schemes , 1995 .

[13]  Reporte De Investigación,et al.  CURVE SUBDIVISION WITH ARC-LENGTH CONTROL , 2009 .

[14]  Nira Dyn,et al.  Four-point curve subdivision based on iterated chordal and centripetal parameterizations , 2009, Comput. Aided Geom. Des..

[15]  Guozhao Wang,et al.  Incenter subdivision scheme for curve interpolation , 2010, Comput. Aided Geom. Des..