No label defined (Q5286725)
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 227225
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 227225 |
Statements
30 August 1993
0 references
minimal paths
0 references
counting
0 references
generating function
0 references
0.91430116
0 references
0.84245706
0 references
0.82399446
0 references
0.8168482
0 references
0.81601954
0 references
0.8152268
0 references
0 references
The minimal Euclidean path between two points in real space is unique. However, in digital space, there may be multiple minimal paths. The purpose of this dissertation is to solve the problems of counting minimal 6-, 26-, and 18-paths in 3D digital space. We derive formulae for counting minimal 6- and 26-paths using generating function techniques. The problem of counting minimal 18-paths is considered under three cases. We solve the first two using generating function techniques and the remaining case by mathematical induction on the length of minimal 18-paths.
0 references
