Exact and approximate computational geom
✍
Frank Dehne; Katia Guimarães
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 746 KB
In this paper we study the problem of computing an exact, or arbitrarily close to exact, solution of an unrestricted point set stereo matching problem. Within the context of classical approaches like the Marr-Poggio algorithm, this means that we study how to solve the unrestricted basic subproblems