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

@article{Sadhu2017ALT,
  title={A linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares},
  author={Sanjib Sadhu and Sasanka Roy and Subhas C. Nandy and Suchismita Roy},
  journal={CoRR},
  year={2017},
  volume={abs/1709.04870}
}
This paper discusses the problem of covering and hitting a set of line segments L in R by a pair of axis-parallel squares such that the side length of the larger of the two squares is minimized. We also discuss the restricted version of covering, where each line segment in L is to be covered completely by at least one square. The proposed algorithm for the covering problem reports the optimum result by executing only two passes of reading the input data sequentially. The algorithm proposed for… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 4 times over the past 90 days. VIEW TWEETS