| OCR Text |
Show 83 right edge points part of with the not are really necessary for It algorithm. the computation of however the boundary edge because they right possible X to dispense right silhouette edge trackers left edges of iterations if trackers, be must the Z scan followed component of changes sign. normal their into turn can the be might the Acceleratin Convergence The convergence be of extrapolation previous pos i tion. fed to the position, This two. This can process similar When Newton but as is the on to iteration the in of a of is computed, in the on the current· initial the an tracking point with Yscan, by to iteration the iteration guess as the current from the previous not position extrapolated illustrated proven order high along new has substantially the saved updating scene a for necessary position used is in improved position u,v value Yscan points be that to The algorithms. iteration the roughly 2.5. points number average figure 22. V U1.. \J 1 I X 2 Z I ---------------------- Figure Since the 22 - Extrapolation path of the of iteration Iteration points in 2 u - , VI - u.o Vo u Point u,v Position is roughly |
