𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Planar Convex Hull Algorithms in Theory and Practice

✍ Scribed by A. M. Day

Book ID
115215565
Publisher
John Wiley and Sons
Year
1988
Tongue
English
Weight
995 KB
Volume
7
Category
Article
ISSN
0167-7055

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Space-efficient planar convex hull algor
Space-efficient planar convex hull algorithms
✍ HervΓ© BrΓΆnnimann; John Iacono; Jyrki Katajainen; Pat Morin; Jason Morrison; Godf πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 283 KB
On a Simple, Practical, Optimal, Output-
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm
✍ Binay K Bhattacharya; Sandeep Sen πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 212 KB

In this paper we present a truly practical and provably optimal O n log h time output-sensitive algorithm for the planar convex hull problem. The basic algorithm Ž is similar to the algorithm presented by Chan, Snoeyink, and Yap in ''Proceedings . of the 6th ACM᎐SIAM Symposium on Discrete Algorithms

Distributed algorithm for the planar con
Distributed algorithm for the planar convex hull problem
✍ H.E. Bez; J. Edwards πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 475 KB

The problem of computing the convex hull of a set of vectors in the two-dimensional plane is considered from the point of view ot parallel implementation on transputer networks. A parallel algorithm is described, timed and evaluated against tunctionally equivalent single processor code. The results