
Digital Topology: Fundamentals 11
p
0
p
9 ,
q
0
q
1
p
1
p
2
q
2
p
3
q
3
p
4
, q
4
p
5
q
5
p
6
q
6
p
7
q
7
p
8
q
8
q
9
(b)
p
q=r
0
r
1
r
2
r
3
r
4
r
5
r
6
r
7
(a)
FIGURE 1.8: (a) The order of searching a foreground pixel in the neigh-
borho od of a border pixel at p with a background neighbor at q in an (8, 4)
digital grid. The order follows clockwise movement starting from q. (b) The
sequence of pairs of border pixels (p
i
, q
i
), where p
i
belongs to the foreground,
and q
i
belongs to background, respectively, for the point set as shown in Fig.
1.7. (See color insert.)
ing or path following is required to obtain the chain code of a sequence of
border points. The advantage of this scheme is in its linear representation. ...