In this chapter we show how to solve the completion problem, namely we characterize those oriented plane graphs that are visible part of an apparent contour (Theorem 4.3.1). The proof is generalized to the case where the background is not reduced to the external region. In our presentation we need some elementary concepts of the theory of oriented graphs, and the Morse description of a graph, as outlined in Sect. 2.5.3 In Chap. 9 we describe a code that automates the construction of the proof of Theorem 4.3.1.
Solving the Completion Problem / Bellettini, Giovanni; Beorchia, Valentina; Paolini, Maurizio; Pasquarelli, Franco. - STAMPA. - 44:(2015), pp. 73-100. [10.1007/978-3-662-45191-5_4]
Solving the Completion Problem
Beorchia, Valentina;
2015-01-01
Abstract
In this chapter we show how to solve the completion problem, namely we characterize those oriented plane graphs that are visible part of an apparent contour (Theorem 4.3.1). The proof is generalized to the case where the background is not reduced to the external region. In our presentation we need some elementary concepts of the theory of oriented graphs, and the Morse description of a graph, as outlined in Sect. 2.5.3 In Chap. 9 we describe a code that automates the construction of the proof of Theorem 4.3.1.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
