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

From MaRDI portal
Revision as of 09:04, 20 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(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

    An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane (English)
    0 references
    0 references
    0 references
    0 references
    11 March 1998
    0 references
    shortest path
    0 references

    Identifiers