Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (Q919827)
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: Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm |
scientific article; zbMATH DE number 4162266
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm |
scientific article; zbMATH DE number 4162266 |
Statements
Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (English)
0 references
1990
0 references
lower bound
0 references
matching algorithm
0 references
parallel computation
0 references
parallel complexity
0 references
nearest neighbor
0 references
CRCW PRAM
0 references
0.9065251
0 references
0.90055573
0 references
0.8998839
0 references
0.89804995
0 references
0.88866585
0 references
0.8862948
0 references
0.8815099
0 references
0.88006806
0 references
