Locate a Pair Squares for Maximum Points Containment

Main Article Content

Priya Ranjan Sinha Mahapatra


Given a set P of n points in
2 R , locate two disjoint or overlapping axis-parallel squares, say 1 S and 2 S , covering maximum
number of points from P . However, in case of overlapping, their overlapped zone is empty. This work proposes ( log ) 2 O n n time and
( ) 2 O n space algorithm to locate 1 S and 2 S .




Keywords: Facility Location, Axis-parallel square, Range tree, Staircase.


Download data is not yet available.

Article Details