Maximal Covering by Two Isothetic Unit Squares

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 of P. In case of overlapping, the points in their common zone are counted once. To solve the problem, we propose an algorithm that runs in O(n2 log2 n) time using O(n log n) space.

• Type: Conference
• Year: 2008
• Where: CCCG
• Authors: Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das
• Keywords: CCCG 2008, Computational Geometry, Dimensional Plane, Isothetic Unit, Maximum Number