Erratum: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon (Q3809268): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 12:47, 5 March 2024

scientific article
Language Label Description Also known as
English
Erratum: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
scientific article

    Statements

    Erratum: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon (English)
    0 references
    1988
    0 references
    amortized
    0 references
    balanced divide and conquer
    0 references
    heterogeneous finger search tree
    0 references
    homogeneous finger search tree
    0 references
    horizontal visibility information
    0 references
    Jordan sorting with error-correction
    0 references
    simplicity testing
    0 references
    triangulation problem
    0 references
    computational geometry
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references