A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) (Q638566): 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: Q3358270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polygonal representations of digital sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Does Digital Straightness Tell about Digital Convexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time and Space Algorithm for Detecting Path Intersection / 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: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681771 / rank
 
Normal rank

Latest revision as of 11:22, 4 July 2024

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

    Identifiers

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