Solving common influence region queries with the GPU

In this paper we propose and solve common influence region queries. We present GPU parallel algorithms, designed under CUDA architecture, for approximately solving the studied queries. We also provide and discuss experimental results showing the efficiency of our approach.Ministerio de Ciencia e Innovació

Continuous surveillance of points by rotating floodlights

Let P and F be sets of n ≥ 2 and m ≥ 2 points in the plane, respectively, so that P∪F is in general position. We study the problem of finding the minimum angle α ∈ [2π/m, 2π] such that one can install at each point of F a stationary rotating floodlight with illumination angle α, initially oriented in a suitable direction, in such a way that, at all times, every target point of P is illuminated by at least one light. All floodlights rotate at unit speed and clockwise. We give an upper bound for the 1-dimensional problem and present results for some instances of the general problem. Specifically, we solve the problem for the case in which we have two floodlights and many points, and give an upper bound for the case in which there are many floodlights and only two target points.Ministerio de Educación y CienciaEuropean Science FoundationMinisterio de Ciencia e InnovaciónComisión Nacional de Investigación Científica y Tecnológica (Chile)Fondo Nacional de Desarrollo Científico y Tecnológico (Chile

Reporting flock patterns on the GPU

In this paper we study the problem of finding flock patterns in a set of trajectories of moving entities. A flock refers to a large enough subset of entities that move close to each other for a given time interval. We present a parallel approach, to be run on a Graphics Processing Unit, for reporting maximal flocks. We also provide experimental results that show the efficiency and scalability of our approach.Ministerio de Ciencia e Innovació