Abstract: Boolean operations on two sets of polygons are studied in this paper.The class of polygons is defined as an open set,and the result of all Boolean operations are defined as an open set too.Under these definitions,the class of polygons is a closure.The algorithm investigated in this paper does match these definitions,and is simple.It is proved that there are not undue line segments in the result set of polygons.