Informatics Publishing Limited

Koppala Guravaiah ¹, M. Ramu ², A. Damodhar ³, B. D. Kalyan Kumar ²

Affiliations
1 Department of Information Technology, Sree Vidyanikethan Engineering College, Tirupati, AP, IN
2 Department of Computer science & Systems Engineering, Sree Vidyanikethan Engineering College, Tirupati, AP, IN
3 Department of Computer Science Engineering,, Sree Venkateswara College of Engineering, Tirupati, AP, IN
4 Department of Computer Science & Systems Engineering, Sree Vidyanikethan Engineering College, Tirupati, AP, IN

Abstract

Region filling is the most important in many applications like computer graphics, computer cartography, pattern recognition, and scene analysis. The conventional pixel based region filling algorithms like flood filling, boundary filling are the recursive algorithms and these algorithms have the ability to use an indefinite amount of stack space and can cause a system to become unstable. And these recursive algorithms are not suitable for filling the larger size polygons. The proposed algorithm using divide and conquer approach, divides the polygon into subparts and fills the subparts for solving the above difficulties. And finally we compare and present the results of existing and proposed algorithms.

Keywords

Polygon, Divide and Conquer, Region Filling, Raster Scan.

Full Text