Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (Q919827)
From MaRDI portal
scientific article
| 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 |
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
