A convex hull algorithm for planar simple polygons (Q1060850): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0031-3203(85)90027-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2069373610 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Measuring Concavity on a Rectangular Mosaic / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear algorithm for finding the convex hull of a simple polygon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On finding the convex hull of a simple polygon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the conditions for success of Sklansky's convex hull algorithm / rank | |||
Normal rank | |||
Latest revision as of 18:23, 14 June 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
