✦ LIBER ✦

Two parallel algorithms for the convex hull problem in a two dimensional space

✍ Scribed by D.J. Evans; Shao-wen Mai

Book ID: 107919169
Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 494 KB
Volume: 2
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(85)90030-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

A Randomized Parallel Three-Dimensional

A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers

✍ F. Dehne; X. Deng; P. Dymond; A. Fabri; A. A. Khokhar 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 178 KB

A method for solving the n-dimensional c

A method for solving the n-dimensional convex hull problem

✍ Adam Jóźwik 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 150 KB

A parallel two-list algorithm for the kn

A parallel two-list algorithm for the knapsack problem

✍ Der-Chyuan Lou; Chin-Chen Chang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 695 KB

An n-element knapsack problem has 2" possible solutions to search over, so a task which can be accomplished in 2" trials if an exhaustive search is used. Due to the exponential time in solving the knapsack problem, the problem is considered to be very hard. In the past decade, much effort has been d

Some convexity considerations for a two-

Some convexity considerations for a two-dimensional traction problem

✍ J. N. Flavin; R. J. Knops 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 422 KB