Interpolating an Unlimited Number of Curves Meeting at Extraordinary Points on Subdivision Surfaces *

Interpolating curves by subdivision surfaces is one of the major constraints that is partially addressed in the literature. So far, no more than two intersecting curves can be interpolated by a subdivision surface such as Doo‐Sabin or Catmull‐Clark surfaces. One approach that has been used in both of theses surfaces is the polygonal complex approach where a curve can be defined by a control mesh rather than a control polygon. Such a definition allows a curve to carry with it cross derivative information which can be naturally embodied in the mesh of a subdivision surface. This paper extends the use of this approach to interpolate an unlimited number of curves meeting at an extraordinary point on a subdivision surface. At that point, the curves can all meet with either C 0 or C 1 continuity, yet still have common tangent plane. A straight forward application is the generation of subdivision surfaces through 3‐regular meshes of curves for which an easy interface can be used.

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

[2]  Adi Levin,et al.  Interpolating nets of curves by smooth subdivision surfaces , 1999, SIGGRAPH.

[3]  J. Clark,et al.  Recursively generated B-spline surfaces on arbitrary topological meshes , 1978 .

[4]  Ulrich Reif,et al.  A unified approach to subdivision algorithms near extraordinary vertices , 1995, Comput. Aided Geom. Des..

[5]  Ahmad H. Nasri.  Constructing polygonal complexes with shape handles for curve interpolation by subdivision surfaces , 2001, Comput. Aided Des..

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

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

[8]  Ahmad H. Nasri,et al.  Taxonomy of interpolation constraints on recursive subdivision surfaces , 2002, The Visual Computer.

[9]  Ahmad H. Nasri.  A polygonal approach for interpolating meshes of curves by subdivision surfaces , 2000, Proceedings Geometric Modeling and Processing 2000. Theory and Applications.

[10]  Tony DeRose,et al.  Efficient, fair interpolation using Catmull-Clark surfaces , 1993, SIGGRAPH.

[11]  Ahmad H. Nasri,et al.  Taxonomy of interpolation constraints on recursive subdivision curves , 2002, The Visual Computer.

[12]  Ahmad H. Nasri,et al.  Recursive subdivision of polygonal complexes and its applications in computer-aided geometric design , 2000, Comput. Aided Geom. Des..

[13]  Ahmad H. Nasri,et al.  Designing Catmull-Clark subdivision surfaces with curve interpolation constraints , 2002, Comput. Graph..

[14]  J. Peters,et al.  Analysis of Algorithms Generalizing B-Spline Subdivision , 1998 .

[15]  Malcolm A. Sabin,et al.  Non-uniform recursive subdivision surfaces , 1998, SIGGRAPH.

[16]  Henning Biermann,et al.  Piecewise smooth subdivision surfaces with normal control , 2000, SIGGRAPH.