A convex hull algorithm for planar simple polygons (Q1060850): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:31, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A convex hull algorithm for planar simple polygons |
scientific article |
Statements
A convex hull algorithm for planar simple polygons (English)
0 references
1985
0 references
A linear convex hull algorithm which is an improvement on the algorithm due to Sklansky is given.
0 references
linear convex hull algorithm
0 references
