Abstract
Measurements for fitting a given number of concentric circles are recorded. For each concentric circle several measurements are taken. The problem is to fit the given number of circles to the data such that all circles have a common center. This is a generalization of the problem of fitting a set of points to one circle. Three objectives, to be minimized, are considered: the least squares of distances from the circles, the maximum distance from the circles, and the sum of the distances from the circles. Very efficient optimal solution procedures are constructed. Problems based on a total of 10,000 measurements are solved in about 10 s with the least squares objective, \(<\)2 s with the maximum distance objective, and a little more than 1 min for the minisum objective.
Similar content being viewed by others
References
Agarwal PK, Aronov B, Har-Peled S, Sharir M (2000) Approximating and exact algorithms for minimum-width annuli and shells. Discrete Comput Geom 24:687–705
Brimberg J, Juel H, Schöbel A (2009a) Locating a circle on the plane using the minimax criterion. Stud Locat Anal 17:45–60
Brimberg J, Juel H, Schöbel A (2009b) Locating a minisum circle in the plane. Discrete Appl Math 157:901–912
Chernov N, Sapirstein PN (2008) Fitting circles to data with correlated noise. Comput Stat Data Anal 52:5328–5337
Drezner Z (2007) A general global optimization approach for solving location problems in the plane. J Global Optim 37:305–319
Drezner T, Drezner Z (2007) Equity models in planar location. CMS 4:1–16
Drezner Z, Suzuki A (2004) The big triangle small triangle method for the solution of non-convex facility location problems. Oper Res 52:128–135
Drezner Z, Nickel S (2009a) Constructing a DC decomposition for ordered median problems. J Global Optim 45:187–201
Drezner Z, Nickel S (2009b) Solving the ordered one-median problem in the plane. Eur J Oper Res 195:46–61
Drezner Z, Steiner S, Wesolowsky GO (2002) On the circle closest to a set of points. Comput Oper Res 29:637–650
Hansen P, Peeters D, Thisse J-F (1981) On the location of an obnoxious facility. Sistemi Urbani 3:299–317
Karimäki V (1991) Effective circle fitting for particle trajectories. Nucl Instrum Methods Phys Res Sect A 305:187–192
Labbé M, Laporte G, Martin IR, Gonzalez JJS (2005) Locating median cycles in networks. Eur J Oper Res 160:457–470
Lee DT, Schachter BJ (1980) Two algorithms for constructing a Delaunay triangulation. Int J Parallel Prog 9(3):219–242
Nievergelt Y (2002) A finite algorithm to fit geometrically all midrange lines, circles, planes, spheres, hyperplanes, and hyperspheres. Numer Math 91:257–303
Nievergelt Y (2010) Median spheres: theory, algorithms, applications. Numer Math 114:573–606
Nickel S, Puerto J (2005) Facility location—a unified approach. Springer, Berlin
Ohya T, Iri M, Murota K (1984) Improvements of the incremental method of the Voronoi diagram with computational comparison of various algorithms. J Oper Res Soc Jpn 27:306–337
Pearce CEM (1974) Locating concentric ring roads in a city. Transp Sci 8:142–168
Plastria F (1992) GBSSS, the generalized big square small square method for planar single facility location. Eur J Oper Res 62:163–174
Suzuki T (2005) Optimal location of orbital routes in a circular city. In: ISOLDE X conference. Sevilla and Islantilla, Spain
Schöbel A, Scholz D (2010) The big cube small cube solution method for multidimensional facility location problems. Comput Oper Res 37:115–122
Sugihara K, Iri M (1994) A robust topology-oriented incremental algorithm for Voronoi diagram. Int J Comput Geom Appl 4:179–228
Sarkisyan YL, Gupta KC, Roth B (1973) Kinematic geometry associated with the least-square approximation of a given motion. J Eng Ind 95:503–510
Tuy H, Al-Khayyal F, Zhou F (1995) A DC optimization method for single facility location problems. J Global Optim 7:209–227
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Drezner, Z., Brimberg, J. Fitting concentric circles to measurements. Math Meth Oper Res 79, 119–133 (2014). https://doi.org/10.1007/s00186-013-0455-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-013-0455-4