ANALYSIS AND ALGORITHM FOR FILLING PROPAGATION.

Abstract

Fill algorithms are a common graphics utility used to change the colour of regions in the frame buffer. The propagation algorithm is a key component of filling algorithms. The problem of propagation within a fill algorithm is presented and defined, and the difficulties of formalization and comparison are discussed. The previous algorithms are presented and analyzed under a new comparison metric whose validity is confirmed by run-time tests. A new algorithm is developed, and is shown to have better average and worst case behaviour than the others.