On the complexity of convex hull algorithms if rotational minima can be found very fast (Q3790652)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the complexity of convex hull algorithms if rotational minima can be found very fast
scientific article

    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 references

    Identifiers