But this even-odd test fails when the intersection point is a vertex. This can be done in two ways: Four Connected Point Neighborhood Method Eight Connected Point Neighborhood Method In first method, four surrounded pixels are taken simultaneously and replaced with the required color. When no more pixels of the original interior color exist, the algorithm is completed. The following steps illustrate the idea of the recursive boundary-fill algorithm: 1. Inside-Outside Tests.
nest...