An adaptive subdivision method for surface-fitting from sampled data

A method is developed for surface-fitting from sampled data. Surface-fitting is the process of constructing a compact representation to model the surface of an object based on a fairly large number of given data points. In our case, the data is obtained from a real object using an automatic three-dimensional digitizing system. The method is based on an adaptive subdivision approach, a technique previously used for the design and display of free-form curved surface objects. Our approach begins with a rough approximating surface and progressively refines it in successive steps in regions where the data is poorly approximated. The method has been implemented using a parametric piecewise bicubic Bernstein-Bézier surface possessing G1 geometric continuity. An advantage of this approach is that the refinement is essentially local reducing the computational requirements which permits the processing of large databases. Furthermore, the method is simple in concept, yet realizes efficient data compression. Some experimental results are given which show that the representation constructed by this method is faithful to the original database.

[1]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[2]  La Taille,et al.  Courbes et surfaces , 1959 .

[3]  S. A. Coons.  SURFACES FOR COMPUTER-AIDED DESIGN OF SPACE FORMS , 1967 .

[4]  T. J. Rivlin.  Bounds on a polynomial , 1970 .

[5]  M. Cox.  Curve Fitting with Piecewise Polynomials , 1971 .

[6]  Henry Gouraud,et al.  Computer Display of Curved Surfaces , 1971, Outstanding Dissertations in the Computer Sciences.

[7]  Urs Ramer,et al.  An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..

[8]  P. Bézier.  MATHEMATICAL AND PRACTICAL POSSIBILITIES OF UNISURF , 1974 .

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

[10]  P. Dierckx.  An algorithm for smoothing, differentiation and integration of experimental data using spline functions , 1975 .

[11]  R. Riesenfeld.  On Chaikin's algorithm , 1975 .

[12]  Takeshi Kiyono,et al.  Curve Fitting by a One-Pass Method With a Piecewise Cubic Polynomial , 1977, TOMS.

[13]  M. Sabin,et al.  Behaviour of recursive division surfaces near extraordinary points , 1978 .

[14]  John R. Rice.  Algorithm 525: ADAPT, Adaptive Smooth Curve Fitting [E2] , 1978, TOMS.

[15]  E. Catmull,et al.  Recursively generated B-spline surfaces on arbitrary topological meshes , 1978 .

[16]  I. Faux,et al.  Computational Geometry for Design and Manufacture , 1979 .

[17]  J. Lane,et al.  A generalized scan line algorithm for the computer display of parametrically defined surfaces , 1979 .

[18]  James H. Clark.  A fast scan-line algorithm for rendering parametric surfaces , 1979, SIGGRAPH '79.

[19]  L. C. Knapp.  A design scheme using coons surfaces with nonuniform basis b-spline curves , 1979 .

[20]  W. L. Chung,et al.  Automatic Curve Fitting Using an Adaptive Local Algorithm , 1980, TOMS.

[21]  James F. Blinn,et al.  Scan line methods for displaying parametrically defined surfaces , 1988, CACM.

[22]  William Thomas Reeves.  Quantitative representations of complex dynamic shape for motion analysis , 1980 .

[23]  W. Boehm.  Inserting New Knots into B-spline Curves , 1980 .

[24]  Richard F. Riesenfeld,et al.  A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[25]  B. Barsky.  The beta-spline: a local representation based on shape parameters and fundamental geometric measures , 1981 .

[26]  Paul Dierckx.  Algorithms for smoothing data with periodic and parametric splines , 1982, Comput. Graph. Image Process..

[27]  Gerald E. Farin,et al.  A construction for visual C1 continuity of polynomial surface patches , 1982, Comput. Graph. Image Process..

[28]  Gerald E. Farin,et al.  A construction for visualC1 continuity of polynomial surface patches , 1982, Comput. Graph. Image Process..

[29]  R. Goldman.  Using degenerate Bézier triangles and tetrahedra to subdivide Bézier curves , 1982 .

[30]  S. Mudur,et al.  A new class of algorithms for the processing of parametric curves , 1983 .

[31]  Local Control of Bias and Tension in Beta-splines , 1983, TOGS.

[32]  Maureen Stone,et al.  Curve-fitting with piecewise parametric cubics , 1983, SIGGRAPH.

[33]  Wolfgang Böhm,et al.  A survey of curve and surface methods in CAGD , 1984, Comput. Aided Geom. Des..

[34]  Hartmut PRAUTZSCH.  A short proof of the Oslo algorithm , 1984, Comput. Aided Geom. Des..

[35]  Brian A. Barsky,et al.  A Description and Evaluation of Various 3-D Models , 1984, IEEE Computer Graphics and Applications.

[36]  B. Barsky.  Arbitrary Subdivision of Bezier Curves , 1985 .

[37]  B. Barsky,et al.  An Intuitive Approach to Geometric Continuity for Parametric Curves and Surfaces (Extended Abstract) , 1985 .

[38]  W. Boehm,et al.  The insertion algorithm , 1985 .

[39]  Tony DeRose,et al.  The Beta2-spline: A Special Case of the Beta-spline Curve and Surface Representation , 1983, IEEE Computer Graphics and Applications.

[40]  Wolfgang Böhm.  On the efficiency of knot insertion algorithms , 1985, Comput. Aided Geom. Des..

[41]  L. Piegl.  Recursive algorithms for the representation of parametric curves and surfaces , 1985 .

[42]  Brian A. Barsky,et al.  Geometric continuity with interpolating Be´zier curves , 1986 .

[43]  Schmitt Francis,et al.  Adaptative Polyhedral Approximation Of Digitized Surfaces , 1986, Other Conferences.

[44]  Richard H. Bartels,et al.  An introduction to the use of splines in computer graphics and geometric modeling , 1986 .

[45]  Etienne Beeker.  Smoothing of shapes designed with free-form surfaces , 1986 .

[46]  B. Barsky,et al.  An Adaptive Subdivision Method with Crack Prevention for Rendering Beta-Spline Objects. , 1987 .