Abstract
There are many applications of fitting circular arcs to data. We have for example, system control, using a computer controlled cutting machine, approximating hulls of boats, drawing and image techniques. Out of these applications comes the least squares norm to be the most commonly used criterion. This paper examines how the l 1 norm is used which seems to be more appropriate than the use of least squares in the context of wild points in the data. An algorithm and different methods to determine the starting points are developed. However, numerical examples are given to help illustrate these methods.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Al-Subaihi, I.A., Watson, G.A.: An algorithm for matching point sets using the l 1 norm. Numer. Algorithms 41, 203–217 (2006)
Al-Subaihi, I.A., Watson, G.A.: Algebraic fitting of quadric surfaces to data. Commun. Appl. Anal. 9, 539–548 (2005)
Al-Subaihi, I.A., Watson, G.A.: The use of the l 1 and l ∞ norms in fitting parametric curves and surfaces to data. Appl. Numer. Anal. Comput. Math. 363–376 (2004)
Antia, H.M.: Numerical Methods for Scientists and Engineers, 2nd edition. Birkhäuser Verlag, Basel (2002)
Atieg, A.: Numerical methods for fitting curves and surfaces to data by orthogonal distance regression and some generalizations. Ph.D. thesis, University of Dundee (2005)
Atieg, A., Watson, G.A.: Fitting circular arcs by orthogonal distance regression. Appl. Numer. Anal. Comput. Math. 1, 66–76 (2004)
Cheng, C.C., Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Drawing planer graphs with circular arcs. Lect. Notes Comput. Sci. 1731, 117 (2000)
Chernov, N., Lesort, C.: Fitting circles and lines by least squares: theory and experiment. http://www.math.uab.edu/cl/cl1 (2007)
Chernov, N., Lesort, C.: Least squres fitting of circles. Math. Imaging Vis. 23, 239–252 (2005)
Gander, W., Golub, G.H., Strebel, R.: Fitting of circles and ellipses: least squares solution. BIT 34, 556–577 (1994)
Horng, J.: An adaptive smoothing approach for fitting digital planar curves with line segments and circular arcs. Pattern Recogn. Lett. 22, 565–577 (2003)
Horng, J., Johnny, T.L.: A dynamic programming approach for fitting digital planar curves with line segments and circular arcs. Pattern Recogn. Lett. 22, 183–197 (2000)
Huynh, H.-H.: Least square curve-fitting with circular arcs. Project RMIT (1985)
Jittorntrum, K., Osborne, M.R.: Strong uniqueness and second order convergence in nonlinear discrete approximation. Numer. Math. 34, 439–455 (1980)
Joseph, S.H.: Unbiased least square fitting of circular arcs. CVGIP Graph. Models Image Process. 56(5), 424–432 (1994)
Karimäki, V.: Fast code to fit circular arcs. Comput. Phys. Commun. 8, 133–141 (1991)
Lillekjendlie, B.: Circular arcs fitted on a Riemann sphere. Comput. Vis. Image Underst. 67(3), 311–317 (1997)
Osborne, M.R.: Finite Algorithms in Optimization and Data Analysis. Wiley, New York (1984)
Osborne, M.R., Watson, G.A.: An analysis of the total approximation problem in separable norms, and an algorithm for the total l 1 problem. SIAM J. Sci. Statist. Comput. 6, 410–424 (1985)
Pei, S., Horng, J.: Fitting digital curve using circular arcs. Pattern Recogn. 28(1), 107–116 (1994)
Piegl, L.A.: Fitting circular arcs to measured data. Int. J. Shape Model. 8(1), 1–21 (2002)
Piegl, L.A.: Curve fitting algorithm for rough cutting. Comput. Aided Des. 18(2), 79–82 (1986)
Pratt, V.: Direct least squares fitting of algebraic surfaces. Comput. Graph. 21, 145–152 (1987)
Späth, H., Watson, G.A.: On orthogonal linear l 1 approximation. Numer. Math. 51, 531–543 (1987)
Taubin, G.: Estimation of planer curves, sufaces and nonplaner space curves defined by implicit equations, with applications to edge and range image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 13, 1115–1138 (1991)
Varah, J.M.: Least squares data fitting with implicit functions. BIT 36, 842–854 (1996)
Watson, G.A.: On the Gauss-Newton method for l 1 orthogonal distance regression. IMA J. Numer. Anal. 22, 345–357 (2002)
Watson, G.A.: Some problems in orthogonal distance and non-orthogonal distance regression. In: Levesley J., Anderson I., Mason J.C. (eds.) Proceedings of Algorithms for Approximation IV, pp. 294–302. University of Huddersfield, Huddersfield (2002)
Watson, G.A.: Approximation in normed linear spaces. J. Comput. Appl. Math. 121, 1–36 (2000)
Watson, G.A.: Least squares fitting of parametric surfaces to measured data. Australian National University CMA Technical Report, No 9.044 (1999)
Watson, G.A.: Least squares fitting of circles and ellipses to measured data. BIT 39, 176–191 (1999)
Watson, G.A.: Some robust methods far fitting parametrically defined curves or surfaces to measured data. In: The series of conferences on Advanced Mathematical and Computational Tools in Metrology (AMCTM), Oxford 1–17 (1999)
Watson, G.A.: Choice of Norms for Data Fitting and Function Approximation, pp. 337–377. Acta Numerica, Cambridge University Press (1998)
Watson, G.A.: Approximation Theory and Numerical Methods. Wiley, Chichester (1980)
Werghi, N., Fisher, R.B., Ashbrook, A., Robertson, C.: Faithful recovering of quadric surfaces from 3D rang data. In: Proc. 2nd Int. Conf. on 3D Digital Imaging and Modeling, Ottawa, Canada, pp. 280–289 (1999)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Al-Subaihi, I.A. An algorithm for fitting circular arcs to data using the l 1 norm. Numer Algor 47, 1–14 (2008). https://doi.org/10.1007/s11075-007-9141-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-007-9141-z