Visibility graphs and obstacle-avoiding shortest paths (Q3803163)

From MaRDI portal
Revision as of 18:15, 18 June 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
Visibility graphs and obstacle-avoiding shortest paths
scientific article

    Statements

    title
    Visibility graphs and obstacle-avoiding shortest paths (English)
    0 references
    author
    Helmut Alt
    0 references
    Ermo Welzl
    0 references
    publication date
    1988
    0 references
    zbMATH Keywords
    computational geometry
    0 references
    visibility graphs
    0 references
    shortest paths
    0 references
    efficient algorithms
    0 references

    Identifiers

    DOI
    10.1007/BF01928918
    0 references
    Mathematics Subject Classification ID
    05C99
    0 references
    05C38
    0 references
    05C35
    0 references
    zbMATH DE Number
    4070959
    0 references
    Wikidata QID
    Q54309800
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3803163&oldid=34792862"
    Powered by MediaWiki