𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal parallel algorithms for computing convex hulls and for sorting

✍ Scribed by S. G. Akl

Publisher
Springer Vienna
Year
1984
Tongue
English
Weight
679 KB
Volume
33
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Faster output-sensitive parallel algorit
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima
✍ Neelima Gupta; Sandeep Sen πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 263 KB

In this paper we focus on the problem of designing very fast parallel algorithms for the convex hull and the vector maxima problems in three dimensions that are output-size sensitive. Our algorithms achieve Oðlog log 2 n log hÞ parallel time and optimal Oðn log hÞ work with high probability in the C

Optimal Parallel Algorithms for Computer
Optimal Parallel Algorithms for Computer Vision Problems
✍ Chin-Hsiung Wu; Shi-Jinn Horng; Horng-Ren Tsai πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 315 KB

The computational model on which the algorithms are developed is the arrays with reconfigurable optical buses (abbreviated to AROB). It integrates the advantages of both optical transmission and electronic computation. In this paper, instead of using the radix-2 system, a radix-x system can be used