Space-efficient region filling in raster graphics

Abstract

This paper presents fill algorithms for boundary-defined regions in raster graphics. The algorithms require only a constant-size working memory. The methods presented are based on the so-called “seed fill” algorithms that use the internal connectivity of the region with a given inner point. Basic methods, as well as additional hcuristics for speeding up the algorithm, are described and verified. Empirical results are used to compare the time complexities of the algorithms for different classes of regions.