Abstract
We study three covering problems in the plane. Our original motivation for these problems comes from trajectory analysis. The first is to decide whether a given set of line segments can be covered by up to k = 4 unit-sized, axis-parallel squares. We give linear time algorithms for k ≤
... read more