Abstract
Given a set of circles C = {c 1, ..., c n} on the Euclidean plane with centers {(a 1, b 1), ..., (a n, b n)} and radii {r 1, ..., r n}, the smallest enclosing circle (of fixed circles) problem is to find the circle of minimum radius that encloses all circles in C. We survey four known approaches for this problem, including a second order cone reformulation, a subgradient approach, a quadratic programming scheme, and a randomized incremental algorithm. For the last algorithm we also give some implementation details. It turns out the quadratic programming scheme outperforms the other three in our computational experiment.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Barahona and P. Anbil, “The volume algorithm: Producing primal solutions with a subgradient method,” Mathematical Programming, vol. 87, pp. 385-399, 2000.
M. Berg, Computational Geometry: Algorithms and Applications, Springer, 1997.
D. Bertsimas and R. Freund, Data, Models, and Decisions: The Fundamentals of Management Science, South-Western College Pub., 2000.
P. Chrystal, “On the problem to construct the minimum circle enclosing n given points in a plane,” in Proceedings of the Edinburgh Mathematical Society, Third Meeting, 1885, p. 30.
J. Eliosoff and R. Unger, “Minimal spanning circle of a set of points,” Computer Science 308-507: Computational Geometry Project, School of Computer Science, McGill University, 1998.
J. Elzinga and D. Hearn, “The Minimum covering sphere problem,” Management Science, vol. 19, pp. 96-104, 1972.
B. G¨artner, “Fast and robust smallest enclosing balls,” in Algorithms-ESA'99: 7th Annual European Symposium, Proceedings, J. Nestril (Ed.), vol. 1643 of Lecture Notes in Computer Science. Springer-Verlag, 1999, pp. 325-338.
D.W. Hearn and J. Vijan, “Efficient algorithms for the minimum circle problem,” Oper. Res., vol. 30, pp. 777-795, 1982.
M. Lobo, L. Vandenberghe, S. Boyd, and H. Lebret, “Applications of second-order cone programming,” Linear Algebra and its Applications, vol. 284, pp. 193-228, 1998.
N. Megiddo, “Linear-time algorithms for linear programming in R3 and related problems,” SIAM J. Comput., vol. 12, pp. 759-776, 1983.
J. Sturm, “Using SeDuMi 1.0x, A MATLAB toolbox for optimization over symmetric cones,” 1999. http://www.unimaas.nl/sturm.
E. Welzl, “Smallest enclosing disks (balls and ellipsoids),” in New Results and New Trends in Computer Science, H. Maurer (Ed.), vol. 555 of Lecture Notes in Computer Science. Springer-Verlag, 1991, pp. 359-370.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Xu, S., Freund, R.M. & Sun, J. Solution Methodologies for the Smallest Enclosing Circle Problem. Computational Optimization and Applications 25, 283–292 (2003). https://doi.org/10.1023/A:1022977709811
Issue Date:
DOI: https://doi.org/10.1023/A:1022977709811