scientific article; zbMATH DE number 227225
From MaRDI portal
Publication:5286725
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.
Recommendations
- Counting minimal 18-paths in 3D digital space
- An algorithm for computing the number of the minimal paths in digital images
- Enumeration of shortest isothetic paths inside a digital object
- Enumerating minimal length lattice paths
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- Computing minimum length paths of a given homotopy class. (Extended abstract)
- Minimal vertex degree sum of a 3-path in plane maps
- scientific article; zbMATH DE number 3954891
Cited in
(2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286725)
