Computing the maximum overlap of a disk and a piecewise circular domain under translation
Marta Fort, J. Antoni Sellarès · 2016
We present a GPU parallel algorithm for approximately computing the maximum overlap of a disk and a piecewise circular domain under translation. We also provide initial experimental results obtained with the implementation of our algorithm. The continuous maximal coverage problem consists in siting facilities in the continuous space to maximize coverage of regional demand. We study the onefacility case, with the assumption of uniformly distributed demand and a disk-like service area for the facility (see Figure 1 for a motivational example).