On the complexity of convex hull algorithms if rotational minima can be found very fast (Q3790652)
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: On the complexity of convex hull algorithms if rotational minima can be found very fast |
scientific article; zbMATH DE number 4055046
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of convex hull algorithms if rotational minima can be found very fast |
scientific article; zbMATH DE number 4055046 |
Statements
On the complexity of convex hull algorithms if rotational minima can be found very fast (English)
0 references
1988
0 references
rotational minima
0 references
Jarvis march
0 references
gift-wrapping algorithm
0 references
trees
0 references
parallel networks
0 references
time functions
0 references
parallel processor
0 references
searching
0 references
planar convex hull problem
0 references
worst-case complexity
0 references
sorting
0 references
0.8312755823135376
0 references
0.8211132287979126
0 references
0.816977858543396
0 references
0.8074244856834412
0 references
0.8050364255905151
0 references
