We present an O(n) expected time algorithm and an O(n \log n) deterministic time algorithm to find a set of five points that stab a set of n pairwise intersecting disks in the plane. We also give a simple construction with 13 pairwise intersecting disks that cannot be stabbed by three  points.
Suppose we are given a set \mathcal{D O(n ) time to find five points that stab \mathcal{D give a simple example of 13 pairwise intersecting disks that cannot be stabbed by three points. This provides a simple-albeit slightly weaker-algorithmic version of a classical result by Danzer that such a set \mathcal{D points.
R
We present an O(n) expected time algorithm and an
Suppose we are given a set \mathcal{D
R
\log n) deterministic time algorithm to find a set of
) time to find
R
a set of n pairwise intersecting disks in the plane. We also
\mathcal{D
R
construction with
example of
A
points. This provides a simple-albeit slightly weaker-algorithmic version of a classical result by Danzer that such a set \mathcal{D