Skip to main content
SpringerLink
Log in

Space-efficient region filling in raster graphics

  • Published:
The Visual Computer Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ackland BD, Weste NH (1981) The edge flag algorithma fill method for raster scan displays. IEEE Trans Comput 30:41–48

    Google Scholar 

  2. Brassel KE, Fegeas R (1979) An algorithm for shading of regions on vector display devices. Comput Graph 13:126–133

    Google Scholar 

  3. Cullen HF (1968) Introduction to general topology. Heath, Boston

    Google Scholar 

  4. Dunlavey MR (1983) Efficient polygon-filling algorithms for raster displays. ACM Transactions on Graphics 2:264–275

    Google Scholar 

  5. Fishkin KP, Barsky BA (1984) A family of new algorithms for soft filling. Comput Graph 18:235–244

    Google Scholar 

  6. Foley JD, Dam A van, Feiner SK, Hughes JF (1990) Computer graphics: principles and practice. 2nd edn, Addison-Wesley, Massachusetts: 979–986

    Google Scholar 

  7. Liebermann H (1978) How to color in a coloring book. Comput Graph 12:111–116

    Google Scholar 

  8. Little WD, Heuft R (1979) An area shading graphics display system. IEEE Trans Comput 28:528–531

    Google Scholar 

  9. Newman WM, Sproull RF (1973) Principles of interactive computer graphics. 2nd edn, McGraw-Hill, New York, p. 253.

    Google Scholar 

  10. Pavlidis T (1982) Algorithms for graphics and image processing. Computer Science Press, Berlin, pp. 167–193

    Google Scholar 

  11. Rosenfeld A, Kak AC (1982) Digital picture processing. 2nd edn, Academic Press, New York

    Google Scholar 

  12. Shani U (1980) Filling regions in binary raster images-a graph-thcoretical approach. Comput Graph 14:321–327

    Google Scholar 

  13. Smith AR (1979) Tint fill. Comput Graph 13:276–283

    Google Scholar 

  14. Tang GY, Lien B (1988) Region filling with the use of the discrete Green theorem. Comput Vision, Graph Image Processing 42:297–305

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Real-Time Computer Systems and Robotics, Department of Computer Science, University of Karlsruhe, Karserstrasse 12, D-76128, Karlsruhe, Germany

    Dominik Henrich

Authors
  1. Dominik Henrich
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Henrich, D. Space-efficient region filling in raster graphics. The Visual Computer 10, 205–215 (1994). https://doi.org/10.1007/BF01901287

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01901287

Key words

Search

Navigation