Guerra-Filho, GutembergAloimonos, YiannisAn original survey addressing time-space complexity covers several stereo matching algorithms and running time experiments are reported. Taking the point of view that good reconstruction needs to be solved in feedback loops, we then present a new dense stereo matching based on a path computation in disparity space. A procedure which improves disparity maps is also introduced as a post-processing step for any technique solving a dense stereo matching problem. Compared to other algorithms, our algorithm has optimal time-space complexity. The algorithm is faster than "real-time" techniques while producing comparable results. The correctness of our algorithm is demonstrated by experiments in real and synthetic benchmark data.en-USTechnical Report