An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem (Q3210183)
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: An O(n\log ^2 h) Time Algorithm for the Three-Dimensional Convex Hull Problem |
scientific article; zbMATH DE number 4191125
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem |
scientific article; zbMATH DE number 4191125 |
Statements
An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem (English)
0 references
1991
0 references
computational geometry
0 references
output sensitive
0 references
convex hull
0 references
three dimensions
0 references
0.87892746925354
0 references
0.8704307675361633
0 references
0.8478580713272095
0 references
0.8413683772087097
0 references
