IPNWPSR: Iterated Partial Neighbor Word Plane Sweep Replicated, Evolution of Searching in Partial Tandem Replicated Sequence on Plane Sweep Algorithm
نویسندگان
چکیده
منابع مشابه
IPNWPSR: Iterated Partial Neighbour Word Plane Sweep Replicated, Evolution of Searching in Partial Tandem Replicated Sequence on Plane Sweep Algorithm
This paper describes a method to optimize the plane sweep algorithm. The goal of this paper is to develop a method that reduces the comparison through removing the tandem replicated word comparison and also using partial search technique in a document for escaping from the keywords that are ineffective. The approach introduces Plane Sweep algorithm that is the base algorithm used to search for ...
متن کاملWPSR: Word Plane Sweep Replicated, Present a Plane sweep Algorithm to optimize the use of Replicated data in a document
This paper describes the plane sweep algorithm for optimal use of tandem replicated data in a document. It is based on an observation that the original plane sweep algorithm is used to search in documents. Plane sweep algorithm does not feature a fast algorithm to find the word that is repeated in tandem in a document. With the help of effective parameters we could make a new technique to creat...
متن کاملSpace-Efficient Plane-Sweep Algorithms
We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assumed that the input is in a read-only array of n items and that the available workspace is Θ(s) bits, where lgn ≤ s ≤ n · lg n. In particular, we give an almost-optimal algorithm for finding the closest pair among a set of n points that runs in O(n/s+n·lg s) time. We give a simple algorithm to enum...
متن کاملPlane-Sweep Incremental Algorithm: Computing Delaunay Tessellations of Large Datasets
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 ...
متن کاملRobust Plane Sweep for Intersecting Segments
In this paper, we reexamine in the framework of robust computation the BentleyOttmann algorithm for reporting intersecting pairs of segments in the plane. This algorithm has been reported as being very sensitive to numerical errors. Indeed, a simple analysis reveals that it involves predicates of degree 5, presumably never evaluated exactly in most implementation. Within the exact-computation p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/8163-1377