An Easy Method for Clipping Regular/Irregular 2D Polygon
K. R. Natarajan, K. Kuppusamy · CiiT international journal of digital image processing · 2011
The paper presents a new simple clipping algorithm for 2D-polygon against rectangular windows. The polygon clipping process often involves a lot of intersection calculations and comparison. This paper propose a new 2D polygon clipping method, which makes only least number of edge and clipping region comparison and very few intersection calculations than any other traditional polygon clipping algorithms. The proposed algorithm is explained in step by step and compared with the Patrick-Gilles Maillot proposed method, and the Sutherland-Hodgeman algorithm and showing very less edge and clipping region comparison. The experimental results strongly support superiority of the proposed algorithm in comparison wise and it is theoretically and experimentally better than the conventional and Patrick-Gilles Maillot proposed method.