An O(log N) Parallel Time Exact Hidden-Line Algorithm
نویسنده
چکیده
منابع مشابه
Approximate and Exact Deterministic Parallel Selection
The selection problem of Bise n is, given a. set of n elements drawn !rom an ordered universe and an integer r with 1 ~ r ~ n, to identify the rth smallest element in the set. We study approximate and exact selection on deterministic concurrent-read concurrent-write parallel RAMs, where approximate selection with relative accuracy ~ > 0 asks for any element whose true rank difi'ers !rom r by at...
متن کاملParallel Algorithms for Arrangements 1
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(log n log∗ n) time and n2/ log n processors. We generalize this to obtain an O(log n log∗ n)-time algorithm using nd / log n processors for solving the problem in d dimensions. We also give a randomized algorithm for th...
متن کاملcient Parallel Factorization and Solution ofStructured and Unstructured Linear
This paper gives improved parallel methods for several exact factoriza-tions of some classes of symmetric positive deenite (SPD) matrices. Our factorizations also provide us similarly eecient algorithms for exact computation of the solution of the corresponding linear systems (which need not be SPD), and for nding rank and determinant magnitude. We assume the input matrices have entries that ar...
متن کاملScalable Algorithms for Bichromatic Line Segment Intersection Problems on Coarse Grained Multicomputers
We present output-sensitive scalable parallel algorithms for bichromatic line segment intersection problems for the coarse grained multicomputer model. Under the assumption that n p 2 , where n is the number of line segments and p the number of processors, we obtain an intersection counting algorithm with a time complexity of O(n log n log p p + T s (n log p; p)), where T s (m; p) is the time u...
متن کاملapply an optimal serial algorithm to those subproblems with no more than segments, and apply Goodrich's algorithm to the remainder.
We describe randomized parallel CREW PRAM algorithms for building trapezoidal diagrams of line segments in the plane. For general segments, we give an algorithm requiring optimal O(A + n logn) expected work and optimal O(logn) time, where A is the number of intersecting pairs of segments. If the segments form a simple chain, we give an algorithm requiring optimal O(n) expected work and O(logn l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1987