An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane (Q1380799)

From MaRDI portal
Revision as of 15:03, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/dcg/KapoorMM97, #quickstatements; #temporary_batch_1731505720702)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
scientific article

    Statements

    title
    An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane (English)
    0 references
    author
    S. N. Maheshwari
    0 references
    Sanjiv Kapoor
    0 references
    Joseph S. B. Mitchell
    0 references
    publication date
    11 March 1998
    0 references
    zbMATH Keywords
    shortest path
    0 references

    Identifiers

    DOI
    10.1007/PL00009323
    0 references
    zbMATH DE Number
    1127621
    0 references
    Wikidata QID
    Q29397229
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1380799&oldid=37906051"
    Powered by MediaWiki