Fast computation of shortest watchman routes in simple polygons (Q1607078)

From MaRDI portal
Revision as of 21:39, 23 July 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
Fast computation of shortest watchman routes in simple polygons
scientific article

    Statements

    Fast computation of shortest watchman routes in simple polygons (English)
    0 references
    0 references
    25 July 2002
    0 references
    0 references
    watchman route problem
    0 references