An O(n log n) Manhattan path algorithm (Q795510)

From MaRDI portal
Revision as of 12:16, 14 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An O(n log n) Manhattan path algorithm
scientific article

    Statements

    title
    An O(n log n) Manhattan path algorithm (English)
    0 references
    author
    Witold jun. Lipski
    0 references
    publication date
    1984
    0 references
    zbMATH Keywords
    computational geometry
    0 references
    shortest paths
    0 references
    segments on the plane
    0 references
    Manhattan path
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    68Q25
    0 references
    05C35
    0 references
    05C38
    0 references
    zbMATH DE Number
    3862457
    0 references
    OpenAlex ID
    W2004369220
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q795510&oldid=34701020"
    Powered by MediaWiki