A linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares

Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy +1

This paper discusses the problem of covering and hitting a set of line segments $\mathcal{L}$ in ${\mathbb{R}}^2$ by a pair of axis-parallel squares such that the side length of the larg…