Improvement of Divide Algorithm for Intersection of Two Parameter Surfaces

In the traditional divide algorithm for intersection of two parameter surfaces, it is impossible to simply calculate the intersection of polygons approxi mated from divided surfaces because of the, thickness of the polygons. An improving algorithm is presented which has eliminated some unreasonable phenomena, such as intersection segments lost, by considering the relationship among faces, edges and vertices of polygons in global view, and by computing the intersection of any two polygons under environment of all polygons. It has been proved by experiments that the algorithm is robust.