An algorithm for computing the number of the minimal paths in digital images

DOI10.1016/0167-8655(89)90043-3MaRDI QIDQ3817632zbMATH OpenOpenAlexFDO

Authors

Publication date 1989

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8655(89)90043-3

zbMATH Keywords

adjacency matrixminimal pathsdigital imageneighbourhood relation

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Recommendations

• scientific article; zbMATH DE number 227225
• scientific article; zbMATH DE number 727953
• Counting minimal 18-paths in 3D digital space
• Minimal rectangular partitions of digitized blobs
• On the number of shortest paths by neighborhood sequences on the square grid

Cited in

(4)

• Minimal paths by sum of distance transforms
• Counting minimal 18-paths in 3D digital space
• scientific article; zbMATH DE number 227225 (Why is no real title available?)
• Extracting connectivity paths in digital core images using solution of partial minimum eigenvalue problem

This page was built for publication: An algorithm for computing the number of the minimal paths in digital images

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3817632)