R. Bellman, Dynamic Programming, 1957.

C. Buehler, S. Gortler, M. Cohen, L. Mcmillancg97-]-b, A. Cherkassky et al., Minimal surfaces for stereo On implementing the push-relabel method for the maximum flow problem, ECCV Flows in Networks, pp.390-410, 1962.

O. Faugeras, R. Goldberg, and S. Rao, Variational principles, surface evolution, PDE's, level set methods and the stereo problem Length functions for flow computations Disparity-space images and large occlusion stereo, ECCV, 1994.

R. Koch, M. Pollefeys, L. Van-gool-[-kz01-]-v, R. Kolmogorov, . Zabihkz02a-]-v et al., A theory of shape by space carving Computing visual correspondence with occlusions using graph cuts Multi-camera scene reconstruction via graph cuts What energy functions can be minimized via graph cuts Stereo by intra-and inter-scanline search using dynamic programming A multiple-baseline stereo, Multi viewpoint stereo from uncalibrated video sequences ICCV ICCV ECCV ECCVPS02] S. Paris and F. Sillion. Robust acquisition of 3d informations from short image sequences Pacific GraphicsRC98] S. Roy and I. Cox. A maximum-flow formulation of the n-camera stereo correspondence problem ICCV, pp.139-154353, 1406.

G. Slabaugh, B. Culbertson, T. Malzbender, and R. Schafer, A Survey of Methods for Volumetric Scene Reconstruction from Photographs, VolumeGraphics, 2001.
DOI : 10.1007/978-3-7091-6756-4_6

M. Ulvklo, H. Knutsson, G. Granlundvek99-]-o, and . Veksler, Depth segmentation and occluded scene reconstruction using ego-motion Efficient Graph-Based Energy Minimization Methods in Computer Vision, Proc. SPIE Visual Information Processing VII, pp.112-123, 1998.