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

From MaRDI portal
Revision as of 16:36, 17 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q29304368, #quickstatements; #temporary_batch_1705502051474)
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
    0 references