\(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116)

From MaRDI portal
Revision as of 17:53, 14 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
\(L_ 1\) shortest paths among polygonal obstacles in the plane
scientific article

    Statements

    \(L_ 1\) shortest paths among polygonal obstacles in the plane (English)
    0 references
    0 references
    13 August 1992
    0 references
    rectilinear paths
    0 references
    wire routing
    0 references
    continuous Dijkstra algorithm
    0 references
    fixed orientation metrics
    0 references
    Voronoi diagram
    0 references

    Identifiers