Optimal parallel algorithms for point-set and polygon problems (Q1187196)
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 38889
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal parallel algorithms for point-set and polygon problems |
scientific article; zbMATH DE number 38889 |
Statements
Optimal parallel algorithms for point-set and polygon problems (English)
0 references
28 June 1992
0 references
kernel problem
0 references
convex hull
0 references
point sets
0 references
polygons
0 references
EREW PRAM
0 references
CREW PRAM
0 references
nearest-neighbor problems
0 references
0.8521256446838379
0 references
0.8312516808509827
0 references
0.8297584056854248
0 references
