In previous studies, the efficiency of the Half-Sweep Multigrid method has been shown to be very fast as compared with the standard Multigrid method. This is due to its ability to reduce computational complexity of the standard method. In this paper, the primary goal is to purpose the Half-Sweep Algebraic Multigrid (HSAMG) method using the HSCN finite difference scheme for solving one-dimension...

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 does, a...

Local search methods are often used to reduce the power consumption of broadcast routing in wireless networks. For a classic such method, sweep, the best available time complexity result is O(|V |4). We present an O(|V |2)-time method, which exhaustively removes unnecessary transmissions yielding a solution comparable to that of sweep.

In this study we tested an alternative method for collecting mosquito larvae called the sweep net catch method and compared its efficiency to that of the traditional dip method. The two methods were compared in various water bodies within Kruger National Park and Lapalala Wilderness area, South Africa. The sweep net catch method performed 5 times better in the collection of Anopheles larvae and...

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...

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...

This paper proposes a backward/forward sweep method to analyze the power flow in radial distribution systems. The distribution system has radial structure and high R/X ratios. So the newton-raphson and fast decoupled methods are failed with distribution system. The proposed method presents a load flow study using backward/forward sweep method, which is one of the most effective methods for the ...