Parallel algorithms for separation of two sets of points and recognition of digital convex polygons (Q685228): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Minimum polygonal separation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A taxonomy of problems with fast parallel algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal parallel generation of a computation tree form / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the convex hull of a sorted point set in parallel / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal parallel circle-cover algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Digital Convexity, Straightness, and Convex Polygons / rank | |||
Normal rank | |||
Revision as of 09:30, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel algorithms for separation of two sets of points and recognition of digital convex polygons |
scientific article |
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
