“An adaptive subdivision method for surface-fitting from sampled data” by Schmitt, Barsky and Du

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. Brian A. Barsky: The Beta-spline: A Local Representation Based on Shape Parameters and Fundamental Geometric Measures, ph.D. Thesis, University of Utah, Salt Lake City Utah, December, 1981,
2. Brian A. Barsky: “A Description and Evaluation of Various 3-D Model,”IEEE Computer Gra{hics and Applications, Vol. 4, NO. 1, January, 1984, pp.
3. Brian A. Barsky: Subdivlsion of Bezier Curves, Technical Report So. UCB/CCSD 85/265, Computer Division, Electrical Engineering and Computer Sciences Department, University of California, Berkeley, California, October, 1985.
4. Brian A. Barsky: Computer Graphics and Geometric Using Beta-splines, Springer verlag, Tokyo, 1986.
5. Brian A. Barsky and John C. Beatty: “Local Control of Bias and Tension in Beta-splines,” ACM Transactions on Graphics, Vol. 2, No. 2, April, 1983, pp. 109-134.Also published in SIGGRAPH’83 Conference Proceedings, Vol. 17, No. 3, ACH, Detroit, 25-29 July, 1983. pp. I93-218.
6. Brian A. Barsky and Tony D. DeRose: Geometric Continuity of Parametric Curves, Technical Report No. UCB/CSD 84/205, Computer science Division, Electrical Engineering and Computer Sciences Department, University of California, Berkeley, California, October, 1984.
7. Brian A. Barsky and Tony D. DeRose: “The Beta2-spllne: A Special Case of the Beta-spline Curve and Surface Representation,” IEEE Computer Graphics and Application, Vpl. 5., No. 9, September, 1985, pp. 46-58.
8. Brian A. Barsky, Tony D. DeRose and Mark D. Dippe: “An Adaptive Subdivision Method with Crack Prevention for Rendering Beta-spltne Objects,” submitted for publication.
9. Richard B. Barrels, John C. Beatty and Brian A. Barsky: An Introduction to the Use of Spllnes In Computer Graphics, to be published by Morgan Kaufmann Publishers, Inc., Los Altos, California, 1987.
10. Etienne Beeker: “Smoothing of Shapes Designed with Free-form Surfaces,” Computer-Aided Design, Vol. 18, No. 4. May, 1986, pp. 224-232.
11. Pierre E. Bezier: “Emploi des machines a commande num4rique,” Masson et Cie., Paris, 1970. Translated by A. Robin Forrest and Anne P. Pankhurst as Numerical Control — Mathematical and Applications, John Wiley and Sons Ltd., London, 1972.
12. Pierre E. Bezler: “Mathematical and Practical Possibilities of UNISURF,” in Computer-Aided Geometric Design, edited by Robert E. Barnhill and Richard,F. Riesenfeld, Academic Press, New York, 1974, pp. 127-152.
13. Pierre E. Bdzier: Essai de ddfinitlon numerique des courdes et des surface experimental, Ph.D. Thesis, I’Univesite Pierre et Marie Curie, Paris, 1977.
14. Wolfgang Boehm: “Inserting New Knots into B- spline Curves,” Computer-Aided Design, Vol. 12, No. 4, 1980, pp. 199-202.
15. Uolfgang Boehm: “On the Efficiency of Knot inset tion Algor i thins,” Computer-Aided Geometric Vol. 1, 1984.
16. Wolfgang Boehm, Gerald Farin and Juergen Kahmann: “A Survey of Curve and Surface Methods in CAGD,” Computer-Aided Geometric Design, vol.1, No. 1, July, 1984, pp. 1-60.
17. Wolfgang Boehm and Hartmut Prautzsch: “The Insertion Algorithm,” Computer-Aided Design Vol. 17, No. 2, March, 1985, pp. 58-59.
18. Edwin E. Catmull: “Computer Display of Curved Surfaces,” Proceedings of IEEE Conference on Computer Graphics, Pattern Recognition, and Data Structure,Los Angeles, May, 1975, pp. 11-17.
19. Edwin E. Catmull and James H. Clark: “Recursively Generated B-spllne Surfaces on Arbitrary Topological Meshes,” Computer-Aided Design, Vol. 10, No. 6, November, 1978, pp. 350-355.
20. George M. Chaiktn: “An Algorithm for High- Speed Curve Generation,”Computer Graphics and Image Processing, Vol. 3, No. 4, December, 1974, pp. 346- 349.
21. Won. L. Chung: “Automatic Curve Fitting Using an Adaptive Local Algorlthm,”. ACM Transactions on Mathematical Software, Vol. 6, No. 1, March, 1980, pp. 45-57.
22. James B. Clark: “A Fast Scan-Line Algorithm for Rendering Parametric Surfaces,”Computer Graphics, Vol. 13, No. 2, 7-12 August, 1979 {addendum to the SIGGRAPH 79 Conference Proceedings}.
23. Elaine Cohen, Tom Lyche and Richard F. Riesenfeld: “Discrete B-spllnes and Subdivision Techniques in Computer-Aided Geometric Design and Computer Graphics,”Computer Graphics and Image Processing, Vol. 14, No. 2, October, 1980, pp. 87-111.
24. Steven A. Coons: “Surfaces for Computer-Aided Design of Space Forms,” Report, MAC-TR-41, Massachusetts Institute of Technology, June, 1967
25. Morris G. Cox: “Curve Fitting with Piecewise Polynomials,” J. Inst. Maths. Applications, Vol. 8, 1971, pp. 36-51.
26. Paul de Casteljau: “Courbes et surfaces a poles,” S. A. Andre Citroen, Paris, 1959.
27. Tony D. DeRose and Brian A. Barsky: “An Intuitive Approach to Geometric Continuity for Parametric Curves and Surfaces,” in Computer-Generated Images The State of the Art, edited by Nadia Magnenat- Thalmann and Daniel Thalmann, Springer-Verlag, 1985, pp. 159-175.
28. P. Dierckx: “An Algorithm for Smoothing, Differentiation and Integration of Experimental Data Using Spline Functions,” J. Comput.Appl. Math., Vol. 1, 1975, pp. 165-184.
29. P. Dierckx: “Algorithms for Smoothing Data with Periodic and Parametric Splines,” Computer Graphics and Image Processing Vol. 20, No. 2, 0ctober, 1982, pp. 171-184.
30. D. W. H. Doo: “A Subdivision Algorithm for Smoothing down Irregularly Shaped Polyhedrons,” in the ProceedinKs of Interactire Techniques in Computer-Aided Design, Bologna, Italia, 1978, pp. 157-165.
31. D. W. H. Doo and M. A. Sabin: “Behaviour of Recursive Division Surfaces Near Extraordinary Points,” Computer-Aided Design, Vol. 10, No. 6, November, 1978, pp. 35~6-360.
32. Gerald Farin: “A Construction for Visual CI Continuity of Polynomial Surface Patches,” computer Graphics and Image Processing, Vol. 20, 1982, pp. 272-282.
33. Ivor D. Faux and Michael J. Pratt: Computational Geometry for Design and Manufacture, Ellis Horwood Ltd., 1979.
34. Alain Fournier and Brian A. Barsky: “Geometric Continuity with Interpolating Bezier Curves (Preliminary Report),” in Computer-Generated Images — The State of the Art, edited by Nadia Magnenat-Thalman and Daniel Thalmann, Springer- Verlag, 1985, pp. 153-158.
35. Behrouz Gholizadeh: Reprdsentation par triangulation de la surface d’objets tridimensionnels.These de 3e Cycle. Universite de Paris-Sud, Centre d’Orsay, December, 1985.
36. Ronald N. Goldman: “Using Degenerate Bezier Triangles and Tetrahedra to Subdivide B4zier Curves, ” Computer-Aided Design, Vol. 14, No. 6, November, 1982, pp. 307-311.
37. K. Ichida and F. Yoshimoto: “Curve Fitting by a One-Pass Method with a Piecewise Cubic Polynomial,” ACM Transactions on Mathematical Software, Vol. 3, No. 2, 1977, pp. 164-174.
38. IEEE Computer Graphics and Applications, Special Issue on” Parametrlc Curves and Surfaces, Vol. 6, No. 2, February, 1986.
39. Juergen Kahmann: “Continuity of Curvature between Adjacent Bezier Patches,” Surfaces in CAGD, edited by Robert E. Barnhill and Wolfgang Boehm, 1983, North-Holland Publishing Company, Amsterdam, pp. 65- 75.
40. Lewis C. Knapp: A Design Scheme Using Coons Surfaces with Nonuniform B-spline Curves, Ph.D. Thesis, Syracuse University, Syracuse, New York, September, 1979.
41. P.A. Koparkar and S. P. Mudur: “A New Class of Algorithms for the Processing of Parametric Curves,” Computer-Aided Design, Vol. 15, No. 1, January, 1983, pp. 41-45.
42. Jeffrey M. Lane and Loren C. Carpenter: “A Generalized Scan Line Algorithm for the Computer Display of Parametrically Defined Surfaces,” Come Gra~ ics and Image Processing, Vol. ii, No. 3, November, 1979, pp. 290– 297.
43. Jeffrey M. Lane, Loren C. Carpenter, J. Turner Uhitted and James F. Blinn: “Scan Line Methods for Displaying Parame tr ically Defined Surfaces, ” Communications of the ACM, Vol. 23, No. i, January, 1980, pp. 23-34.
44. Jeffrey M. Lane and Richard F. Riesenfeld: “A Theoretical Development for the Computer Generation of Piecewise Polynomial Surfaces,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-2 No. 1, January, 1980, pp. 35-46.
45. Jeffrey M. Lane and Richard F. Riesenfeld: “Bounds on a Polynomial,” BIT, Vol. 21, No. 1, 1981, pp. 112-117.
46. Henri Maitre, Jaime Lopez-Krahe, Alain Clainchard, and Francis Schmitt: “Appareil automatique pour la numerisation d’une surface tridimensionnelle,” BREVET No. 81-24418, 1981.
47. Robert W. Nydegger: A Data Minimization Algorithm of Analytical Models for computer Gaphics, Master’s thesis, University of Utah, Salt Lake City, Utah, 1972.
48. L. Piegl: “Recursive AIgorithms for the Representation of Parametric Curves and Surfaces,” Computer-Aided ~Vol. 17, No. 5, June, 1985, pp. 225 -229.
49. Michael Plass and Maureen Stone: “Curve- Fitting with Piecewise Parametric Cubits,” SIG- GRAPH’83 Conference Proceedings, Vol. 17, No. 3, ACM, Detroit 25-29 July, 1983, pp. 229-239.
50. Hartmut Prautzsch: “A Short Proof of the Oslo Algorithm,” Computer-Aided Geometric Design, Vol. 1, No. 1, July, 1982, pp. 95’96.
51. Urs Ramer: “An Iterative Procedure for the Polygonal Approximation of Plane Curves,” and Image Processing, Vol. 1, No. 3, November, 1972, pp. 244-256.
52. William T. Reeves: Quantitative Representations of Computer Dynamic Shape for Motion Analysis, Ph.D. Thesis, University of Toronto, Toronto, July, 1981. Also Technical Note CSRG-23, University of Toronto, Toronto.
53. John R. Rice: “Adaptive Approximation,” Journal of Approximation Theory, Vol. 16, 1976, pp. 329-337.
54. Jokn R. Rice: “Algorithm 525 ADAPT, Adaptive Smooth Curve Fitting,” ACM Transactions on Mathematical Software, Vol. 4, No. 1, March, 1978, pp. 82-994.
55. Richard F. Riesenfeld: “On Chaikin’ s Algorithin, “Computer Graphics and Images Processing, Vol. 4, No. 3, September, 1975, pp. 304-310.
56. Richard F. Riesenfeld, Elaine Cohen, Russell D. Fish, Spencer W. Thomas, Elizabeth S. Cobb, Brian A. Barsky, Dino L. Schweltzer, and Jeffrey M. Lane: “Using the Oslo Algorithm as a Basis for CAD/CAM Geometric Modelling, ” pp. 345-356 in the Proceedings of the Second Annual NCGA National Conference, National Computer Association, Inc., Baltimore, Maryland, 14-18 June, 1981.
57. Francis Schmitt and Behrouz Gholizadeh: “Adaptive Polyhedral Approximation of Digitized Surfaces, ” SFIE Proceedings Vol. 595 of Conference on Computer vision for Robots, Cannes, France, 2-6 December, 1985.
58. Francis Schmitt, Henri Maitre, Alain Clainchard and Jalme Lope z-Krahm: “Acquisition and Representation of Real Object Surface Data,” SPIE Proceedings Vol. 602 of Biostereometrlcs’85 Conference. Cannes, France, 2-6 December, 1985.
59. Guo-Zhao Wang: “The Subdivision Method for Finding the Intersection between Two Bdzier Curves or Surfaces,” Zhejiang University Journal, Special Issue on Computational Geometry (in Chinese), 1984.