Skip to main content
. 2018 Mar 8;4(1):18–28. doi: 10.1016/j.cdtm.2018.01.002

Fig. 2.

Fig. 2

(A) A contour on a 2D transversal image is defined as the optimal path with the minimum cost between two corresponding nodes in the graph, which can be searched by dynamic-programming methods such as Dijkstra's algorithm.20, 21 (B) A contour in the image corresponds to the optimal path in (A).