Finding the convex hull of a sorted point set in parallel (Q1108791)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4068277
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the convex hull of a sorted point set in parallel |
scientific article; zbMATH DE number 4068277 |
Statements
Finding the convex hull of a sorted point set in parallel (English)
0 references
1987
0 references
We present a parallel algorithm for finding the convex hull of a sorted planar point set. Our algorithm runs in O(log n) time using O(n/log n) processors in the CREW PRAM computational model, which is optimal. One of the techniques we use to achieve these optimal bounds is the use of a parallel data structure which we call the hull tree.
0 references
computational geometry
0 references
divide-and-conquer
0 references
parallel algorithm
0 references
convex hull
0 references
CREW PRAM
0 references
parallel data structure
0 references
hull tree
0 references
0.9493094086647034
0 references
0.9221240282058716
0 references
0.8953949213027954
0 references
0.8806222677230835
0 references
0.8624179363250732
0 references
