Finding many optimal paths without growing any optimal path trees

DOI10.1142/S0218195910003384MaRDI QIDQ4931732zbMATH OpenFDO

Authors Danny Z. Chen, Ewa Misiołek

Publication date 30 September 2010

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218195910003384

zbMATH Keywords

circular string-to-string correctionimage segmentationpattern recognitionshortest pathspace complexitysurface reconstruction

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Finding Many Optimal Paths Without Growing Any Optimal Path Trees
• Finding an optimal path without growing the tree
• scientific article; zbMATH DE number 1305095
• scientific article; zbMATH DE number 1145908
• Finding k simple shortest paths and cycles

Cites work

• A linear space algorithm for computing maximal common subsequences
• Finding an optimal path without growing the tree
• Finding rotational symmetries by cyclic string matching
• IMAGE SEGMENTATION WITH ASTEROIDALITY/TUBULARITY AND SMOOTHNESS CONSTRAINTS
• Introduction to algorithms
• On a cyclic string-to-string correction problem
• Optimal surface reconstruction from planar contours
• The String-to-String Correction Problem

Cited in

(5)

• Finding Many Optimal Paths Without Growing Any Optimal Path Trees
• scientific article; zbMATH DE number 1305095 (Why is no real title available?)
• scientific article; zbMATH DE number 1145908 (Why is no real title available?)
• Computing feasible toolpaths for 5-axis machines
• Finding an optimal path without growing the tree

This page was built for publication: Finding many optimal paths without growing any optimal path trees

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