Reprint of: Memory-constrained algorithms for simple polygons (Q390167)

From MaRDI portal
Revision as of 06:01, 7 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Reprint of: Memory-constrained algorithms for simple polygons
scientific article

    Statements

    Reprint of: Memory-constrained algorithms for simple polygons (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 January 2014
    0 references
    space-time trade-off
    0 references
    constant workspace
    0 references
    triangulation
    0 references
    shortest path
    0 references
    simple polygon
    0 references

    Identifiers