FINDING MANY OPTIMAL PATHS WITHOUT GROWING ANY OPTIMAL PATH TREES
From MaRDI portal
Publication:4931732
DOI10.1142/S0218195910003384zbMath1197.65025MaRDI QIDQ4931732
Publication date: 30 September 2010
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
pattern recognitionshortest pathsurface reconstructionimage segmentationspace complexitycircular string-to-string correction
Related Items (1)
Cites Work
- Unnamed Item
- On a cyclic string-to-string correction problem
- A linear space algorithm for computing maximal common subsequences
- Optimal surface reconstruction from planar contours
- Finding rotational symmetries by cyclic string matching
- The String-to-String Correction Problem
- IMAGE SEGMENTATION WITH ASTEROIDALITY/TUBULARITY AND SMOOTHNESS CONSTRAINTS
- Finding an optimal path without growing the tree
This page was built for publication: FINDING MANY OPTIMAL PATHS WITHOUT GROWING ANY OPTIMAL PATH TREES