Stabbing pairwise intersecting disks by five points

01/09/2018

∙

by   Sariel Har-Peled, et al.

∙

0

∙

share

We present an O(n) expected time algorithm and an O(n 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.