An adaptive method for smooth surface approximation to scattered 3D points

Abstract The construction of a surface from arbitrarily scattered data is an important problem in many applications. When there are a large number of data points, the surface representations generated by interpolation methods may be inefficient in both storage and computational requirements. This paper describes an adaptive method for smooth surface approximation from scattered 3D points. The approximating surface is represented by a piecewise cubic triangular Bezier surface possessing C 1 continuity. The method begins with a rough surface interpolating only boundary points and, in the successive steps, refines it by adding the maximum error point at a time among the remaining internal points until the desired approximation accuracy is reached. Our method is simple in concept and efficient in computational time, yet realizes efficient data reduction. Some experimental results are given to show that surface representations constructed by our method are compact and faithful to the original data points.

[1]  Gerald Farin,et al.  Geometric modeling : algorithms and new trends , 1987 .

[2]  Carlo H. Séquin,et al.  Local surface interpolation with Bézier patches , 1987, Comput. Aided Geom. Des..

[3]  T. Pavlidis Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.

[4]  Gerald Farin,et al.  Triangular Bernstein-Bézier patches , 1986, Comput. Aided Geom. Des..

[5]  Pong C. Yuen,et al.  Detection of dominant points on an object boundary: a discontinuity approach , 1994, Image Vis. Comput..

[6]  Leila De Floriani,et al.  Delaunay-based representation of surfaces defined over arbitrarily shaped domains , 1985, Comput. Vis. Graph. Image Process..

[7]  Jae Ha Lee,et al.  An integrated management model for successful New Product Development structure based on Technology & Market Opportunity , 1993 .

[8]  권영국 누적외상병에 관한 연구 , 1993 .

[9]  Bianca Falcidieno,et al.  Natural surface approximation by constrained stochastic interpolation , 1990, Comput. Aided Des..

[10]  Gerald E. Farin,et al.  A modified Clough-Tocher interpolant , 1985, Comput. Aided Geom. Des..

[11]  Michael E. Agishtein,et al.  Smooth surface reconstruction from scattered data points , 1991, Comput. Graph..

[12]  Per-Olof Fjällström,et al.  Evaluation of a Delaunay-based method for surface approximation , 1993, Comput. Aided Des..

[13]  D. Shepard A two-dimensional interpolation function for irregularly-spaced data , 1968, ACM National Conference.

[14]  Chia-Hsiang Menq,et al.  Smooth-surface approximation and reverse engineering , 1991, Comput. Aided Des..

[15]  Hyungjun Park,et al.  3D Shape Reconstruction from 2D Cross-Sections , 1993 .

[16]  Gregory M. Nielson,et al.  Interpolation over a sphere based upon a minimum norm network , 1987, Comput. Aided Geom. Des..

[17]  Francis J. M. Schmitt,et al.  An adaptive subdivision method for surface-fitting from sampled data , 1986, SIGGRAPH.

[18]  Nickolas S. Sapidis,et al.  Delaunay triangulation of arbitrarily shaped planar domains , 1991, Comput. Aided Geom. Des..

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

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

[21]  Gerald E. Farin,et al.  Curves and surfaces for computer-aided geometric design - a practical guide, 4th Edition , 1997, Computer science and scientific computing.

[22]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[23]  C. Lawson Software for C1 Surface Interpolation , 1977 .

[24]  B. Choi Surface Modeling for Cad/Cam , 1991 .