Maximal Covering by Two Isothetic Unit Squares
Priya Ranjan, Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das · Canadian Conference on Computational Geometry · 2008
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of points from P. In case of overlapping, the points in their common zone are counted once. To solve the problem, we propose an algorithm that runs