A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) (Q638566)

From MaRDI portal
Revision as of 11:22, 4 July 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
A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
scientific article

    Statements

    A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) (English)
    0 references
    0 references
    0 references
    0 references
    12 September 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Freeman code
    0 references
    lattice paths
    0 references
    self-intersection
    0 references
    radix tree
    0 references
    0 references