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

From MaRDI portal
Revision as of 10:51, 27 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q29397229, #quickstatements; #temporary_batch_1706348838909)
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