A new algorithm for computing the convex hull of a planar point set (Q926679)
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 new algorithm for computing the convex hull of a planar point set |
scientific article; zbMATH DE number 5277510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm for computing the convex hull of a planar point set |
scientific article; zbMATH DE number 5277510 |
Statements
A new algorithm for computing the convex hull of a planar point set (English)
0 references
20 May 2008
0 references
computational geometry
0 references
convex hull
0 references
extreme points
0 references
ordered convex hull point sequence
0 references
algorithm
0 references
time complexity
0 references
0 references
0 references
0.8467820286750793
0 references
0.836338996887207
0 references
0.8311752676963806
0 references
0.8199552893638611
0 references
0.8146944046020508
0 references
