An Enhanced Method for Filling a 2D-Polygon

Abstract

Polygon filling is a fundamental operation in computer graphics and image processing. The conventional polygon filling algorithms normally adopt an approach of scan line at a time generally called Scan_ Line Algorithms typically uses many procedures and data structure of table (records) and fields. Using these procedures and data structures, the polygon filling process slows down because, many procedures which are involving to fill a polygon  performing operation of sorting, reordering records and fields in a table and it makes these algorithm a time-consuming, tedious and very complex. This paper presents an enhanced 2D polygon filling method based on to the Scan-Line algorithm. After discussing simply about the Scan-Line filling algorithm and its procedures, a different approach is proposed and is explained step by step.

This proposed method, KN algorithm is fast, and uses simple data structure and less execution time, data reordering work and is independent of the polygon geometry. The experimental results strongly support superiority of the proposed algorithm in execution time wise and it is theoretically and experimentally better than the conventional algorithm.