Showing cs.CGShow all
2 papers · 1 filter
cs.CG2019
Corrigendum to: "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", Theoretical Computer Science 769 (2019) 63--74
Sanjib Sadhu, Xiaozhou He, Sasanka Roy +2
In the paper "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", TCS Volume 769 (2019), pages 63--74, the LHIT problem is propos…
cs.CG2017
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 in by a pair of axis-parallel squares such that the side length of the larg…