An Improved Algorithm for Polygon Clipping in Complex Polygon Window
Hou Bao-ming · Computer and Modernization · 2009
Polygon clipping is a very hot research issue in computer graphics.An efficient and reliable algorithm for complex polygon clipping in a complex polygon window is proposed.Virtual edges are added to eliminate holes,and traversal method is improved to restore the original appearance of the clipping results.In the new traversal algorithm,after the two polygons are traversed only one time,it is very clever to get all the clipping results and restore the topology between the outside border and the holes of the every clipping result with holes.Neither untie and unite ring,nor recombination of clipping borders is used.