A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET (Q4889509)
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 916021
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET |
scientific article; zbMATH DE number 916021 |
Statements
A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET (English)
0 references
12 August 1996
0 references
parallel algorithm
0 references
0.9493094086647034
0 references
0.9484931826591492
0 references
0.8966970443725586
0 references
0.8949753642082214
0 references
