On finding shortest isothetic path inside a digital object (Q4912420)
From MaRDI portal
!
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 6150273
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On finding shortest isothetic path inside a digital object |
scientific article; zbMATH DE number 6150273 |
Statements
On Finding Shortest Isothetic Path inside a Digital Object (English)
0 references
4 April 2013
0 references
shortest path
0 references
shortest isothetic path
0 references
Manhattan path
0 references
monotone path
0 references
shape analysis
0 references
0.962310552597046
0 references
0.8632605075836182
0 references
0.8040260076522827
0 references
0.8038487434387207
0 references
0.7945926785469055
0 references
