Finding the upper envelope of n line segments in O(n log n) time (Q582095)

From MaRDI portal
Revision as of 18:03, 1 July 2023 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Finding the upper envelope of n line segments in O(n log n) time
scientific article

    Statements

    Finding the upper envelope of n line segments in O(n log n) time (English)
    0 references
    0 references
    1989
    0 references
    computational geometry
    0 references
    upper envelope
    0 references
    Davenport-Schinzel sequence
    0 references

    Identifiers