Finding Shortest Triangular Path in a Digital Object (Q5739397)
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: Finding Shortest Triangular Path in a Digital Object |
scientific article; zbMATH DE number 6603918
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding Shortest Triangular Path in a Digital Object |
scientific article; zbMATH DE number 6603918 |
Statements
Finding Shortest Triangular Path in a Digital Object (English)
0 references
15 July 2016
0 references
shortest path
0 references
shortest triangular path
0 references
monotone path
0 references
shape analysis
0 references
shape complexity
0 references
digital geometry
0 references
0.9625328
0 references
0.9625328
0 references
0.9024093
0 references
0.87196076
0 references
0.87176573
0 references
0.87133455
0 references
0.85903615
0 references
0.8561915
0 references
0.8515843
0 references
