Skip to main content
. Author manuscript; available in PMC: 2009 Sep 1.
Published in final edited form as: Comput Med Imaging Graph. 2008 Jun 2;32(6):452–462. doi: 10.1016/j.compmedimag.2008.04.005

Fig. 2.

Fig. 2

Basic steps for marching border algorithm and the marching step in this simplified example is every five points: (a) point 1 is selected as the starting point and p1p2 is selected as the directed reference line marked in red; (b) the directed reference line p1p2 is replaced with p1p3 because point 3 is found to be on the right side of the last directed reference line p1p2; (c) because the remaining points within the marching step length are all on the left side of the reference line, the directed reference line becomes a convex track in green and another round of marching operation starts again where the starting point is replaced with point 3; and (d) the border in green is the final result after repeating (a)~(c).