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

From MaRDI portal
Revision as of 00:32, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
An O(n log n) Manhattan path algorithm
scientific article

    Statements

    An O(n log n) Manhattan path algorithm (English)
    0 references
    0 references
    1984
    0 references
    computational geometry
    0 references
    shortest paths
    0 references
    segments on the plane
    0 references
    Manhattan path
    0 references

    Identifiers

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