We have attempted in this paper to reduce the number of checked condition through saving frequency of the tandem replicated words, and also using non-overlapping iterative neighbor intervals on plane sweep algorithm. The essential idea of non-overlapping iterative neighbor search in a document lies in focusing the search not on the full space of solutions but on a smaller subspace considering n...

An approximate theoretical formula for the distribution of aerodynamic load over arbitrary thick wings in incompressible flow is developed by combining three-dimensional results from thin-wing theory with two-dimensional results from thick-aerofoil theory. The formula is applied to two wings of identical planform, with 60 degrees trailing-edge sweepback and differing aerofoil thickness, which h...

In this article, we propose a new thinning algorithm based on line sweep operation. A line sweep is a process where the plane figure is divided into parallel slabs by lines passing through certain "events" and items are then processed according to an order of the slabs. Assuming that the contour of the figure to be thinned have been approxiĆ mated by polygons, the "events" are then the vertices...

Given a convex region in the plane, and a sweep-line as a tool, what is best way to reduce the region to a single point by a sequence of sweeps? The problem of sweeping points by orthogonal sweeps was first studied in [2]. Here we consider the following slanted variant of sweeping recently introduced in [1]: In a single sweep, the sweep-line is placed at a start position somewhere in the plane,...

Time-varying coverage, namely sweep coverage is a recent development in the area of wireless sensor networks, where a small number of mobile sensors sweep or monitor comparatively large number of locations periodically. In this article we study barrier sweep coverage with mobile sensors where the barrier is considered as a finite length continuous curve on a plane. The coverage at every point o...

The sweep-line method is a state space reduction technique for memory-efficient on-the-fly verification of concurrent systems. The method relies on a progress measure capturing inherent progress in the system under verification to store only fragments of the state space in memory at a time and thereby reduce peak memory usage. The sweepline method has been applied to many concurrent systems, bu...

We present a new algorithm for triangulating simple polygons that has four advantages over previous solutions [GJPT, Ch]. a) It is faster: Whilst previous solutions worked in time O(nlogn), the new algorithm only needs time O(n+rlogr) where r is the number of concave angles of the polygon. b) It works for a larger class of inputs: Whilst previous solutions worked for simple polygons, the new al...

Regret minimizing sets are a very recent approach to representing a dataset D with a small subset S of representative tuples. The set S is chosen such that executing any top-1 query on S rather than D is minimally perceptible to any user. To discover an optimal regret minimizing set of a predetermined cardinality is conjectured to be a hard problem. In this paper, we generalize the problem to t...

Given a set P of n points in the plane, we consider the problem of covering P with a minimum number of unit disks. This problem is known to be NP-hard. We present a simple 4-approximation algorithm for this problem which runs in O(n log n)-time and uses the plane-sweep technique. Previous algorithms that achieve the same approximation ratio have a higher time complexity. We also show how to ext...