Space-efficient region filling in raster graphics | Zendy

Dominik Henrich | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Space-efficient region filling in raster graphics

Author(s) -

Dominik Henrich

Publication year - 1994

Publication title -

the visual computer

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.316

H-Index - 67

eISSN - 1432-2315

pISSN - 0178-2789

DOI - 10.1007/bf01901287

Subject(s) - raster graphics , computer science , computer graphics , graphics , point (geometry) , boundary (topology) , constant (computer programming) , computer graphics (images) , algorithm , raster data , space (punctuation) , theoretical computer science , mathematics , geometry , operating system , mathematical analysis , programming language

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research