Shortest path in a multiply-connected domain having curved ...

7 Appendix: Pseudocode of the algorithms
Algorithm 1 GetP CT s(X,CurveList)
1: Get all PCTs from X to members in CurveList
2: Eliminate PCTs that are not completely contained in the MCD and store it in P CT List
3: Eliminate curves and PCTs using exterior and interior region identification.
4: return T angentList,CurveList
Algorithm 2 GetBT s(T gtLine,CurveList,P resentP ath,T erminationList)
1: [SearchCurve,SearchP ar,Dir] = T gtLine.[EndCurve, EndP ar, Dir]
2: if T gtLine not eliminated according to section 4.3 then
3: if T gtLine is merged with a processed tangent,P rocessedT angent then
4: Add the subtree of paths under P rocessedT angent and update path lengths
5: else
6: NextInflection= Identify next inflection point
7: for Each Curve in CurveList do
8: BT List= Get all BTs between SearchCurve and Curve
9: Identify BTs having StartP ar between SearchP ar and NextInflection
10: Eliminate BTs that are not consistent with the direction Dir according to lemma2
11: Eliminate BTs that are not completely contained in the MCD
12: end for
13: (NextT gtList,CurveList) = Remaining BTs and Curves after elimination using exterior
and interior region identification.
14: for Each T gtLine in NextT gtList do
15: P resentP ath += Concave portion + T gtLine
16: T ermCheck = Check for termination with tangents from T erminationList
17: if T ermCheck == false then
18: (NextBT List, CurveList) = GetBT s(T gtLine,CurveList,P resentP ath,
T erminationList)
19: else
20: P resentP ath += Concave portion + Corres. tgt. in T erminationList
21: Add P resentP ath to ShortestP athList
22: end if
23: end for
24: end if
25: end if
18