✦ LIBER ✦

A constant-time parallel algorithm for computing convex hulls

✍ Scribed by Selim G. Akl

Publisher: Springer Netherlands
Year: 1982
Tongue: English
Weight: 261 KB
Volume: 22
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01944471

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A time-optimal parallel algorithm for th

A time-optimal parallel algorithm for three-dimensional convex hulls

✍ N. M. Amato; F. P. Preparata 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 937 KB

Optimal parallel algorithms for computin

Optimal parallel algorithms for computing convex hulls and for sorting

✍ S. G. Akl 📂 Article 📅 1984 🏛 Springer Vienna 🌐 English ⚖ 679 KB

A constant time algorithm for computing

A constant time algorithm for computing hough transform

✍ Tzong-Wann Kao; Shi-Jinn Horng; Yue-Li Wang; Kuo-Liang Chung 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 645 KB

A note on linear expected time algorithm

A note on linear expected time algorithms for finding convex hulls

✍ L. Devroye; G. T. Toussaint 📂 Article 📅 1981 🏛 Springer Vienna 🌐 English ⚖ 288 KB

Comments on two parallel algorithms for

Comments on two parallel algorithms for the planar convex hull problem

✍ Ivan Stojmenović; David J Evans 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 249 KB

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