• search hit 28 of 32
Back to Result List

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.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Author:Dominik Henrich
URN (permanent link):urn:nbn:de:hbz:386-kluedo-9592
Document Type:Article
Language of publication:English
Year of Completion:1994
Year of Publication:1994
Publishing Institute:Technische Universität Kaiserslautern
Date of the Publication (Server):2000/03/29
Tag:AG-RESY; GRAPHICS; PARO; SWEEPING; display algorithms; frame buffer operations; graphic processors; raster graphics; seed filling
Faculties / Organisational entities:Fachbereich Informatik
DDC-Cassification:0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik
Collections:AG RESY
Licence (German):Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011