A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Development of Algorithm for Identification of Area for Maximum Coverage and Interference
2017
International Journal of Computer Applications
In this paper we consider the following problem: Given a set n shops of Store1 in the plane P than how many minimum shops of Store2 to be open for the maximum coverage and interference Store1 Shops. The problem is solve using the Stabbing disk induced by points on the plane P. For a point set P, where no two points have the same x or y coordinates, derive an upper bound on the size of the stabbing set of axis-parallel rectangles induced by each pair of points a,b ∈ P as the diagonal of the
doi:10.5120/ijca2017915323
fatcat:xl7t2a6z7nfava2hou2mwls5qu