Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time (Q2489016)
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: Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time |
scientific article; zbMATH DE number 5023333
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time |
scientific article; zbMATH DE number 5023333 |
Statements
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time (English)
0 references
16 May 2006
0 references
Computational geometry
0 references
Convex hull
0 references
Space-efficient algorithm
0 references
simple polygonal line
0 references
0.9977415800094604
0 references
0.8310390710830688
0 references
0.8270098567008972
0 references
0.8255717754364014
0 references
0.8181911706924438
0 references
