On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology (Q1603641): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:03, 5 March 2024
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
15 July 2002
0 references
digital topology
0 references
computational complexity
0 references
reachability
0 references
homotopy
0 references
