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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2011.04.019 / rank
Normal rank
 
Property / author
 
Property / author: Srečko Brlek / rank
Normal rank
 
Property / author
 
Property / author: Srečko Brlek / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2120324771 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2011.04.019 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:22, 10 December 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