Finding the shortest watchman route in a simple polygon (Q1807612)

From MaRDI portal
Revision as of 11:56, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding the shortest watchman route in a simple polygon
scientific article

    Statements

    title
    Finding the shortest watchman route in a simple polygon (English)
    0 references
    DOI
    10.1007/PL00009467
    0 references
    publication date
    23 November 1999
    0 references
    zbMATH DE Number
    1367684
    0 references
    zbMATH Keywords
    shortest watchman route
    0 references
    author
    Svante Carlsson
    0 references
    Håkan Jonsson
    0 references
    Bengt J. Nilsson
    0 references
    OpenAlex ID
    W1986642089
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1807612&oldid=37371449"
    Powered by MediaWiki