Skip to main content
Springer Nature Link
Log in

Fitting NURBS spherical patches to measured data

  • Original Article
  • Published:
Engineering with Computers Aims and scope Submit manuscript

Abstract

Algorithms and empirical studies for fitting spherical and planar NURBS patches to random data are presented. Algebraic as well as geometric methods are discussed leading to efficient techniques for surface as well as patch fitting. An automatic fitter is also presented that determines whether a plane or a sphere fit is optimal, computes the appropriate entities, and clips the geometry to obtain a NURBS sphere or plane fit. It is argued that patch fitting is necessary in order to avoid numerical problems due to pole and seam problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Ahn SJ, Rauh W, Warnecke HJ (2001) Least squares orthogonal distances fitting of circle, sphere, ellipse, hyperbola, and parabola. Pattern Recognit 34:2283–2303

    Article  MATH  Google Scholar 

  2. Albano A (1974) Representation of digitized contours in terms of conic arcs and straight-line segments. Comput Graph Image Process 3:23–33

    Article  Google Scholar 

  3. Biggerstaff RH (1972) Three variations in dental arch form estimated by a quadratic equation. J Dent Res 51:1509–1523

    Google Scholar 

  4. Bookstein FL (1979) Fitting conic sections to scattered data. Comput Graph Image Process 9:56–71

    Article  Google Scholar 

  5. Brent RP (1973) Algorithms for Minimization without Derivatives. Prentice Hall, Englewood Cliffs

    MATH  Google Scholar 

  6. Cooper DB, Yalabic N (1976) On the computational cost of approximating and recognizing noise-perturbed straight lines and quadratic arcs in the plane. IEEE Trans Comput C-25:1020–1032

    Article  Google Scholar 

  7. Coxeter HSM (1980) Introduction to Geometry, 2nd Edn, Wiley, New York

    Google Scholar 

  8. Fitzgibbon AW, Fisher RB (1995) A buyer’s guide to conic fitting. British machine vision conference, Birmingam, pp 265–271

  9. Fitzgibbon AW, Pilu M, Fisher RB (1996) Direct least squares fitting of ellipses. Proceedings of 13th international conference on pattern recognition, Vienna, pp 253–257

  10. Fletcher R (1987) Practical methods of optimization. Wiley, New York

    MATH  Google Scholar 

  11. Freeman H, Shapira R (1975) Determining the minimum-area encasing rectangle for an arbitrary closed curve. CACM 18:409–413

    MATH  MathSciNet  Google Scholar 

  12. Gander W, Golub GH, Strebel R (1994) Least squares fitting of circles and ellipses. BIT 34:556–578

    Article  MathSciNet  Google Scholar 

  13. Halir R, Flusser J (1998) Numerically stable direct least squares fitting of ellipses, Proceedings of 6th international conference in central Europe on computer graphics and visualization. Pilzen 1, pp 125–132

  14. Haralick RM, Shapiro LG (1992) Computer and Robot Vision. Vol 1, Addison-Wesley, Reading

    Google Scholar 

  15. Kanatani K (1994) Statistical bias of conic fitting and renormalization. IEEE T-PAMI 16:320–326

    MATH  Google Scholar 

  16. Keren D, Cooper D, Subrahmonia J (1994) Describing complicated objects by implicit polynomials. IEEE T-PAMI 16:38–53

    Google Scholar 

  17. Liming RA (1979) Mathematics for Computer Graphics. Aero Publishers Inc., Fallbrook

    Google Scholar 

  18. Lukacs G, Martin R, Marshall RD (1998) Faithful least-squares fitting of spheres, cylinders, cones and tori for reliable segmentation. in Proc Computer Vision—ECCV 98:671–686

    Google Scholar 

  19. Martin RR, Stephenson PC (1988) Putting objects into boxes. Comput Aided Des 20:506–514

    Article  Google Scholar 

  20. Miller RD (1994) Computing the area of a spherical polygon. In: Heckbert PS (eds) Graphics gems IV. Academic, Boston, pp 132–137

    Google Scholar 

  21. Nakagawa Y, Rosenfeld A (1979) A note on polygonal and elliptical approximation of mechanical parts. Pattern Recognit 11:133–142

    Article  Google Scholar 

  22. O’Rourke J (1985) Finding minimal enclosing boxes. Int J Comp Inf Sci 14:183–199

    Article  MathSciNet  MATH  Google Scholar 

  23. Paton KA (1970) Conic sections in chromosome analysis. Pattern Recognit 2:39–51

    Article  Google Scholar 

  24. Paton KA (1970) Conic sections in automatic chromosome analysis. Mach Intell 5:411–434

    Google Scholar 

  25. Piegl L, Tiller W (1997) The NURBS book. Springer, New York

    Google Scholar 

  26. Porrill J (1990) Fitting ellipses and predicting confidence envelopes using a bias corrected Kalman filter. Image Vis Comput 8:37–41

    Article  Google Scholar 

  27. Pratt V (1987) Direct least-squares fitting of algebraic surfaces. Comput Graph 21:145–152

    MathSciNet  Google Scholar 

  28. Press W, Teukolsky S, Vetterling W, Flannery B (1992) Numerical recipes in C. Cambridge University Press, New York

    MATH  Google Scholar 

  29. Rosin P (1993) A note on the least-squares fitting of ellipses. Pattern Recognit Lett 14:799–808

    Article  MATH  Google Scholar 

  30. Rosin P (1993) Ellipse fitting by accumulating five-point fits. Pattern Recognit Lett 14:661–669

    Article  Google Scholar 

  31. Sampson PD (1982) Fitting conic sections to ‘very scattered’ data: an interactive refinement of the Bookstein algorithm. Comput Graph Image Process 18:97–108

    Article  Google Scholar 

  32. Spath H (1998) Least-squares fitting with spheres. J Opt Theory Appl 96:191–199

    Article  MathSciNet  Google Scholar 

  33. Taubin G (1991) Estimation of planar curves, surfaces and non-planar space curves defined by implicit equations with applications to edge and range image segmentation. IEEE T-PAMI 13:1115–1138

    Google Scholar 

  34. Toussaint GT (1983) Solving geometric problems with the rotating calipers. Proc IEEE MELECON’83, Athens, Greece

  35. Varady T, Benko P, Kos G (1998) Reverse engineering regular objects: simple segmentation and surface fitting procedures. Int J Shape Model 4:127–142

    Article  Google Scholar 

Download references

Acknowledgments

The work reported in this paper was supported by the National Science Foundation under grant No: DMI-0200385, awarded to the University of South Florida. All opinions, findings, conclusions and recommendations expressed in this paper are those of the authors and do not necessarily reflect the views of the National Science Foundation or the University of South Florida.

Author information

Authors and Affiliations

  1. University of South Florida, Tampa, FL, USA

    L. A. Piegl

  2. Geomware, Inc., Tyler, TX, USA

    W. Tiller

Authors
  1. L. A. Piegl
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. W. Tiller
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding authors

Correspondence to L. A. Piegl or W. Tiller.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Piegl, L.A., Tiller, W. Fitting NURBS spherical patches to measured data. Engineering with Computers 24, 97–106 (2008). https://doi.org/10.1007/s00366-007-0076-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00366-007-0076-8

Keywords