Title : Smallest Intersecting Circle for a Set of Polygons

Motivated by automated label placement of groups of islands, we consider the
following problem: given a set S = {P1, . . . , Pm} of m polygons, with n vertices
in total, find the circle c of smallest radius such that c intersects Pi for 1 <= i <= m.

Participants : Peter, Otfried, Joachim, Christian, Marc, Esther, Rene, Michiel, Antoine, Alexander