Space-efficient region filling in raster graphics

• 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 using the internal connectivity of the region with a given inner point. Basic methods as well as additional heuristics for speeding up the algorithm are described and verified. For different classes of regions, the time complexity of the algorithms is compared using empirical results.

Additional Services

Author: Dominik Henrich urn:nbn:de:hbz:386-kluedo-9592 Article English 1994 1994 Technische Universität Kaiserslautern 2000/03/29 AG-RESY ; GRAPHICS ; PARO ; SWEEPING ; display algorithms ; frame buffer operations ; graphic processors ; raster graphics; seed filling Fachbereich Informatik 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik AG RESY Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011

$Rev: 13581$