Author:
Chen Danny Z.,Misiołek Ewa
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Chen, D.Z., Daescu, O., Hu, X.S., Xu, J.: Finding an optimal path without growing the tree. Journal of Algorithms 49(1), 13–41 (2003)
2. Chen, D.Z., Wang, J., Wu, X.: Image segmentation with asteroidality/tubularity and smoothness constraints. International Journal of Computational Geometry and Applications 12(5), 413–428 (2002)
3. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill, New York (2001)
4. Fuchs, H., Kedem, Z.M., Uselton, S.P.: Optimal surface reconstruction from planar contours. Communications of the ACM 20(10), 693–702 (1977)
5. Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Communications of the ACM 18(6), 341–343 (1975)