An algorithm for computing the number of the minimal paths in digital images (Q3817632)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 4090824
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for computing the number of the minimal paths in digital images |
scientific article; zbMATH DE number 4090824 |
Statements
An algorithm for computing the number of the minimal paths in digital images (English)
0 references
1989
0 references
adjacency matrix
0 references
neighbourhood relation
0 references
minimal paths
0 references
digital image
0 references
0.7825185656547546
0 references
0.7804442048072815
0 references
0.7313679456710815
0 references
