On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology (Q1603641)

From MaRDI portal
Revision as of 04:03, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
scientific article

    Statements

    On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology (English)
    0 references
    0 references
    0 references
    15 July 2002
    0 references
    digital topology
    0 references
    computational complexity
    0 references
    reachability
    0 references
    homotopy
    0 references

    Identifiers