Line and Polygon Clipping Techniques on Natural Images — A Mathematical Solution and Performance Evaluation

The objective of this paper is to apply clipping techniques on natural images and to analyze the performance of various clipping algorithms in computer graphics. The clipping techniques used in this paper is Cohen–Sutherland line clipping, Liang–Barsky line clipping, Nicholl–Lee–Nicholl line clipping and Sutherland–Hodgman polygon clipping. The clipping algorithms are evaluated by using the three parameters: time complexity, space complexity and image accuracy. Previously, there is no performance evaluation on clipping algorithms done. Motivating by this factor, in this paper an evaluation of clipping algorithms is made. The novelty of this paper is to apply the clipping algorithms on natural images. It is justified that the above mentioned clipping algorithms outperform well on clipping the natural images.