PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS (Q4017520)
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 91599
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS |
scientific article; zbMATH DE number 91599 |
Statements
PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS (English)
0 references
16 January 1993
0 references
visibility
0 references
CREW PRAM
0 references
0.907964825630188
0 references
0.9078364372253418
0 references
0.8545575737953186
0 references
