Interproximate curve subdivision

This paper presents a new curve subdivision algorithm called interproximate subdivision for generating curves that interpolate some given vertices and approximate the other vertices. By the interproximate subdivision, only the vertices specified to be interpolated are fixed and the other vertices are updated at each refinement step. The refinement rules are derived to ensure that the eigenvalues of the refinement matrix satisfy the necessary condition of C^2 continuity. The interproximate subdivision also contains tension parameters assigned to vertices or edges for shape adjustment. Compared to the 4-point interpolatory subdivision scheme, the interproximate subdivision does not force the new inserted vertices to be interpolated and is thus expected to have improved behavior; and compared to the cubic B-spline refinement scheme, the interproximate subdivision is able to generate curves interpolating user-specified vertices. In addition, the paper also presents two extensions of the interproximate subdivision: one automatically adapts the tension parameters locally according to the geometry of the control polygon during the refinement to achieve convexity preservation and the other automatically relaxes the interpolating property of some vertices to achieve better shape behavior.

[1]  George Merrill Chaikin,et al.  An algorithm for high-speed curve generation , 1974, Comput. Graph. Image Process..

[2]  N. A. Dodgson,et al.  Variations on the four-point subdivision scheme , 2010, Comput. Aided Geom. Des..

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

[4]  Nira Dyn,et al.  Convexity preservation of the four-point interpolatory subdivision scheme , 1999, Comput. Aided Geom. Des..

[5]  Pierre Vandergheynst,et al.  Non-linear subdivision using local spherical coordinates , 2003, Comput. Aided Geom. Des..

[6]  Joe Warren,et al.  Subdivision Methods for Geometric Design: A Constructive Approach , 2001 .

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

[8]  Tom Lyche,et al.  Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics , 1980 .

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

[10]  J. Warren,et al.  Subdivision methods for geometric design , 1995 .

[11]  Malcolm A. Sabin,et al.  Behaviour of recursive division surfaces near extraordinary points , 1998 .

[12]  Fuhua Cheng,et al.  Interproximation: interpolation and approximation using cubic spline curves , 1991, Comput. Aided Des..

[13]  F. Kuijt.  Convexity preserving interpolation - stationary nonlinear subdivision and splines , 1998 .

[14]  Neil A. Dodgson,et al.  Advances in Multiresolution for Geometric Modelling , 2005 .

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

[16]  Jarek Rossignac,et al.  J-splines , 2008, Comput. Aided Des..

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

[18]  D. Ross.  Computer-aided design , 1961, CACM.

[19]  Jarek Rossignac,et al.  ScrewBender: Smoothing Piecewise Helical Motions , 2008, IEEE Computer Graphics and Applications.