Constructing the convex hull of a partially sorted set of points
نویسندگان
چکیده
منابع مشابه
A fast parallel algorithm for finding the convex hull of a sorted point set
We present a parallel algorithm for nding the convex hull of a sorted point set. The algorithm runs in O(log log n) (doubly logarithmic) time using n= log logn processors on a Common CRCW PRAM. To break the (log n= loglog n) time barrier required to output the convex hull in a contiguous array, we introduce a novel data structure for representing the convex hull. The algorithm is optimal in two...
متن کاملFinding the Convex Hull of a Sorted Point Set in Parallel
We present a parallel algorithm for finding the convex hull of a sorted planar point set. Our algorithm runs in O(logn) time using O(n/logn) processors in the CREW PRAM computational model, which is optimal. One of the techniques we use to achieve these optimal bounds is the use a parallel data structure which we call the hull tree.
متن کاملOn Constructing Approximate Convex Hull
The algorithms of convex hull have been extensively studied in literature, principally because of their wide range of applications in different areas. This article presents an efficient algorithm to construct approximate convex hull from a set of n points in the plane in O(n+ k) time, where k is the approximation error control parameter. The proposed algorithm is suitable for applications prefe...
متن کاملAn Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension D
We present an algorithm which computes the convex hull of a set of n spheres in dimension d in time O(n d d 2 e + n log n). It is worst-case optimal in three dimensions and in even dimensions. The same method can also be used to compute the convex hull of a set of n homothetic convex objects of IE d. If the complexity of each object is constant, the time needed in the worst case is O(n d d 2 e ...
متن کاملConvex Hull, Set of Convex Combinations and Convex Cone
Let V be a real linear space. The functor ConvexComb(V ) yielding a set is defined by: (Def. 1) For every set L holds L ∈ ConvexComb(V ) iff L is a convex combination of V . Let V be a real linear space and let M be a non empty subset of V . The functor ConvexComb(M) yielding a set is defined as follows: (Def. 2) For every set L holds L ∈ ConvexComb(M) iff L is a convex combination of M . We no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1993
ISSN: 0925-7721
DOI: 10.1016/0925-7721(93)90023-y