Computing Shortest Paths in the Plane with Removable Obstacles (Q5116468)

From MaRDI portal
Revision as of 10:40, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7238960
Language Label Description Also known as
English
Computing Shortest Paths in the Plane with Removable Obstacles
scientific article; zbMATH DE number 7238960

    Statements

    0 references
    0 references
    0 references
    0 references
    25 August 2020
    0 references
    Euclidean shortest paths
    0 references
    removable polygonal obstacles
    0 references
    stochastic shortest paths
    0 references
    \(L_1\) shortest paths
    0 references
    0 references
    0 references
    Computing Shortest Paths in the Plane with Removable Obstacles (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references