A Linear Time and Space Algorithm for Detecting Path Intersection (Q3648803): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Developments in Language Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detection of the discrete convexity of polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial View of Digital Convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lyndon + Christoffel = digitally convex / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the tiling by translation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quad trees: A data structure for retrieval by composite keys / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681771 / rank
 
Normal rank

Latest revision as of 06:24, 2 July 2024

scientific article
Language Label Description Also known as
English
A Linear Time and Space Algorithm for Detecting Path Intersection
scientific article

    Statements

    A Linear Time and Space Algorithm for Detecting Path Intersection (English)
    0 references
    0 references
    0 references
    0 references
    1 December 2009
    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
    discrete figures
    0 references
    data structure
    0 references
    0 references