On the conditions for success of Sklansky's convex hull algorithm (Q1053994): 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(83)90074-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1967454815 / 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: Q3959047 / rank | |||
Normal rank | |||
Latest revision as of 10:03, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the conditions for success of Sklansky's convex hull algorithm |
scientific article |
Statements
On the conditions for success of Sklansky's convex hull algorithm (English)
0 references
1983
0 references
simple polygon
0 references
convex hull, algorithm
0 references
externally left divisible polygons
0 references
computational complexity
0 references
