Skip to main content
. Author manuscript; available in PMC: 2011 Feb 8.
Published in final edited form as: Proc IEEE Comput Soc Conf Comput Vis Pattern Recognit. 2007 Jul 16;2007(17-22 June 2007):1–7. doi: 10.1109/CVPR.2007.383185
Algorithm 9 Initialization of a path α on Inline graphic between q0, q1Inline graphic.
1: Let α(0) = q0. Let k be the number of steps along the discretized path.
2: f = q1 − 〈q1, q0q0, f=ff,f
3: for all τ = 1 to k do
4:
α(τk)=χτk(q0,f)
5:  Project α(τk) into Inline graphic using Algorithm 1.
6: end for