An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem (Q3210183)

From MaRDI portal
Revision as of 07:14, 2 September 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem
scientific article

    Statements

    An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem (English)
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    0 references
    computational geometry
    0 references
    output sensitive
    0 references
    convex hull
    0 references
    three dimensions
    0 references