Solution Methodologies for the Smallest Enclosing Circle Problem

Given a set of circles C= { c1, ..., c n} on the Euclidean plane with centers {( a1, b1), ..., ( a n, b n)} and radii { r1, ..., 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...

Full description

Bibliographic Details
Published in:Computational Optimization and Applications : An International Journal, Vol. 25, No. 1/3 (2003), p. 283-292
Main Author: Xu, Sheng
Other Involved Persons: Freund, M. ; Sun, Jie
Format: electronic Article
Language:English
ISSN:1573-2894
Physical Description:Online-Ressource
DOI:10.1023/A:1022977709811
Subjects:
QR Code: Show QR Code