Comparison and Performance Evaluation of Boundary Fill and Flood Fill Algorithm
Bhawnesh Kumar, Umesh Kumar Tiwari, Santosh Kumar, Vikas Tomer, Jasmeet Kalra, N Nisha, S Varshney, E, M Dunlavey, Vipul Aggarwal, S Salunke, W Geraets, A Van Daatselaar, J Verheij, H Liu, M Chen, S Hsu, C Chien, T Kuo, Y Wang, K Kallio, J Arvo, M Hirvikorpi, J Tyystjrvi, A Javeed
Abstract
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.