Based on the coordinate relationship between the current borderline pixel and its two lockstep borderline pixels

a certain connection by which some pixels on the region connect with the current borderline pixel is defined and constructed here. On the basis of enumerating all the types of the borderline pixels and analyzing their features

an algorithm that ransacks any close region connection by deciding and finding out those pixels in the region corresponding to the current borderline one with that connection

is concluded. Any close region connection means that the close region connection can be either single connectivity one or complexity connectivity one with any borderline pixel curves. That is

the algorithm can deal with almost all close regions in a consistent way. So it has good applicability. Secondly

it gets higher performances in both time and space due to its particular judging rules

retrieving processes and data describing method. Additionally

the operations mainly converge on the integral comparison operation

and the algorithm is simple. In a word

the algorithm meets the region-concerned needs such as region filling

point domain juding

point domain tracking

and so forth. Simultaneously

due to the region pixels describing method

it presents a helpful use for reference for researching how to describing close region more effectively.