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

2019 ◽  
Vol 19 (02) ◽  
pp. 1950012
Author(s):  
S. P. Raja
Keyword(s):  
Performance Evaluation ◽  
Computer Graphics ◽  
Time Complexity ◽  
Space Complexity ◽  
Natural Images ◽  
Mathematical Solution ◽  
Line Clipping ◽  
And Performance

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.

scholarly journals Comparison and Performance Evaluation of Boundary Fill and Flood Fill Algorithm

2020 ◽  
Vol 8 (12s3) ◽  
pp. 9-13
Keyword(s):  
Performance Evaluation ◽  
Computer Graphics ◽  
Literature Review ◽  
System Performance ◽  
Research Paper ◽  
C Language ◽  
Running Time ◽  
Scan Line ◽  
And Performance ◽  
Flood Fill

In computer graphics, there are many polygon filling algorithms available like as inside and outside test, scan line method, boundary fill, flood fill, edge fill and fence fill algorithm. In this paper we focus on the flood fill and boundary fill algorithms for both four connected as well as eight connected pixels. This research paper shows the comparison and performance evaluation of boundary fill and flood fill algorithms with consideration of running time in C-language. And also shows the how stack affects the performance of the system due to overflow of buffer later on JAVA implementation with queue improves the system performance for large polygon. It also shows the literature review of various papers use the fill algorithm on different applications, some proposed the new and enhanced polygon fill algorithms.

NUMERICAL INVESTIGATIONS AND PERFORMANCE EVALUATION OF A FOLDED TUBE HEAT TRANSPORT SYSTEM UNDER BOILING CONDITIONS

2018 ◽  
Vol 30 (4) ◽  
pp. 267-291
Author(s):  
Mukesh Kumar ◽  
Avinash Moharana ◽  
Raj K. Singh ◽  
Arun K. Nayak ◽  
Jyeshtharaj B. Joshi
Keyword(s):  
Performance Evaluation ◽  
Heat Transport ◽  
Transport System ◽  
Numerical Investigations ◽  
And Performance
Sign in / Sign up

Export Citation Format

Share Document