An efficient algorithm to clip a 2D-polygon against a rectangular clip window

作     者：Sushil Chandra Dimri Umesh Kumar Tiwari Mangey Ram Sushil Chandra Dimri;Umesh Kumar Tiwari;Mangey Ram

作者机构：Department of Computer Science and EngineeringGraphic Era(Deemed to be University)DehradunUttarakhandIndia 

出 版 物：《Applied Mathematics(A Journal of Chinese Universities)》 (高校应用数学学报（英文版）（B辑）)

年 卷 期：2022年第37卷第1期

页      面：147-158页

核心收录：

学科分类：08[工学] 080203[工学-机械设计及理论] 0802[工学-机械工程] 0701[理学-数学] 

主　　题：point clipping polygon clipping clip window line segment computational complexity 

摘      要：Polygon clipping is of great importance in computer graphics.One of the popular algorithms to clip a polygon is Cohan–Sutherland Hodgeman algorithm which is based on line clipping.Cohan–Sutherland Hodgeman algorithm clips the polygon against the given rectangular clip window with the help of line clipping method.Cohan–Sutherland algorithm requires traversing the polygon in anti clockwise direction(positive orientation).In this work we propose an efficient polygon clipping algorithm against a rectangular clip window.Proposed algorithm uses parametric representation of polygon edges.Using the concept of point clipping,we can find required intersection points of edges of polygon with clip window boundaries.Well suited numerical illustrations are used to explain the proposed polygon clipping method.The proposed algorithm is computationally less expensive and comprehensive.