International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 173 - Issue 6 |
Published: Sep 2017 |
Authors: Janak Gupta, Pankaj Kumar |
![]() |
Janak Gupta, Pankaj Kumar . Development of Algorithm for Identification of Area for Maximum Coverage and Interference. International Journal of Computer Applications. 173, 6 (Sep 2017), 10-13. DOI=10.5120/ijca2017915323
@article{ 10.5120/ijca2017915323, author = { Janak Gupta,Pankaj Kumar }, title = { Development of Algorithm for Identification of Area for Maximum Coverage and Interference }, journal = { International Journal of Computer Applications }, year = { 2017 }, volume = { 173 }, number = { 6 }, pages = { 10-13 }, doi = { 10.5120/ijca2017915323 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2017 %A Janak Gupta %A Pankaj Kumar %T Development of Algorithm for Identification of Area for Maximum Coverage and Interference%T %J International Journal of Computer Applications %V 173 %N 6 %P 10-13 %R 10.5120/ijca2017915323 %I Foundation of Computer Science (FCS), NY, USA
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 n/2 axis-parallel rectangles induced by each pair of points a,b ∈ P as the diagonal of the rectangles. For a point set P in convex position, derive a lower bound on the size of the stabbing set n/2 axis-parallel rectangles induced by each pair of points a,b∈P as the diagonal of the rectangles.