A linear time algorithm for computing the convex hull of an ordered crossing polygon (Q792775)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A linear time algorithm for computing the convex hull of an ordered crossing polygon |
scientific article; zbMATH DE number 3854461
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm for computing the convex hull of an ordered crossing polygon |
scientific article; zbMATH DE number 3854461 |
Statements
A linear time algorithm for computing the convex hull of an ordered crossing polygon (English)
0 references
1984
0 references
computational geometry
0 references
linear time algorithm
0 references
convex hull
0 references
ordered crossing polygon
0 references
