On Romeo and Juliet problems: minimizing distance-to-sight (Q2331220)

From MaRDI portal
Revision as of 19:37, 20 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
On Romeo and Juliet problems: minimizing distance-to-sight
scientific article

    Statements

    title
    On Romeo and Juliet problems: minimizing distance-to-sight (English)
    0 references
    author
    Hee-Kap Ahn
    0 references
    Eunjin Oh
    0 references
    Lena Schlipf
    0 references
    Fabian Stehn
    0 references
    Darren Strash
    0 references
    publication date
    25 October 2019
    0 references
    zbMATH Keywords
    visibility polygon
    0 references
    shortest path
    0 references
    watchman problems
    0 references

    Identifiers

    zbMATH DE Number
    7122176
    0 references
    OpenAlex ID
    W2966831074
    0 references
    arXiv ID
    1906.01114
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2331220&oldid=36533090"
    Powered by MediaWiki