An important application of wireless sensor networks is the deployment of mobile sensors to periodically monitor (cover) a set of points of interest (PoIs). The problem of Point Sweep Coverage is to deploy fewest sensors to periodically cover the set of PoIs. For PoIs in a Eulerian graph, this problem is known NP-Hard even if all sensors are with uniform velocity. In this paper, we study the pr...

We present an algebraic algorithm to generate the exact general sweep boundary of a 2D curved object which changes its shape dynamically while moving along a parametric curve trajectory.

This paper describes a new parallel raster terrain visibility (or viewshed) algorithm, based on the sweep-line model of [Van Kreveld 1996]. Computing the terrain visible from a given observer is required for many GIS applications, with applications ranging from radio tower siting to aesthetics. Processing the newly available higher resolution terrain data requires faster architectures and algor...

MOTIVATION Properly drawn biological networks are of great help in the comprehension of their characteristics. The quality of the layouts for retrieved biological networks is critical for pathway databases. However, since it is unrealistic to manually draw biological networks for every retrieval, automatic drawing algorithms are essential. Grid layout algorithms handle various biological proper...

This paper presents a sweep based algorithm for the cumulative constraint, which can operate in filtering mode as well as in greedy assignment mode. Given n tasks, this algorithm has a worstcase time complexity of O(n). In practice, we use a variant with better average-case complexity but worst-case complexity of O(n log n), which goes down to O(n log n) when all tasks have unit duration, i.e. ...

We introduce a novel algorithm for solving the nearest neighbour problem when the query points are known in advance, which is based on Fortune’s plane sweep algorithm. The crucial idea is to use the wavefront for solving the nearest neighbour queries as the Voronoi diagram is being computed, instead of storing it in an auxiliary data structure, as the algorithm presented by Lee and Yang [9] doe...

We present the plane-sweep incremental algorithm, a hybrid approach for computing Delaunay tessellations of large point sets whose size exceeds the computer’s main memory. This approach unites the simplicity of the incremental algorithms with the comparatively low memory requirements of plane-sweep approaches. The procedure is to first sort the point set along the first principal component and ...

by MICHAEL ANTHONY KOVACINA This work implements and demonstrates a set of tools to automatically generate swarm algorithms. SWEEP, SWarm Experimentation and Evaluation Platform, a swarm algorithm development and simulation platform is implemented. To demonstrate the utility of SWEEP, several swarm-based algorithms are constructed for free-moving and dynamics-constrained agents, culminating in ...

In these notes, we introduce a powerful technique for solving geometric problems. This technique, called the plane sweep technique, appears in Shamos’ Ph.D. thesis from 1978—which is considered the birthplace of computational geometry—although the concept was known already to geometers. The plane sweep technique gives efficient and reasonably simple algorithms for a large variety of geometric p...