Parallel algorithms for separation of two sets of points and recognition of digital convex polygons (Q685228)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel algorithms for separation of two sets of points and recognition of digital convex polygons |
scientific article; zbMATH DE number 417141
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel algorithms for separation of two sets of points and recognition of digital convex polygons |
scientific article; zbMATH DE number 417141 |
Statements
Parallel algorithms for separation of two sets of points and recognition of digital convex polygons (English)
0 references
30 September 1993
0 references
digital polygons
0 references
polygon separation
0 references
CREW PRAM
0 references
0.853681206703186
0 references
0.8515628576278687
0 references
0.8461427688598633
0 references
0.8243962526321411
0 references
