A linear time algorithm for obtaining the convex hull of a simple polygon (Q1053995): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:02, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A linear time algorithm for obtaining the convex hull of a simple polygon |
scientific article |
Statements
A linear time algorithm for obtaining the convex hull of a simple polygon (English)
0 references
1983
0 references
convex hull algorithm
0 references
computational complexity
0 references
simple polygon
0 references
convex polygon
0 references
ordered crossing polygon
0 references