On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology (Q1603641)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology |
scientific article; zbMATH DE number 1767857
| 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; zbMATH DE number 1767857 |
Statements
On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology (English)
0 references
15 July 2002
0 references
digital topology
0 references
computational complexity
0 references
reachability
0 references
homotopy
0 references
