A two-pass filling algorithm for raster graphics

https://doi.org/10.1016/0146-664X(82)90087-9Get rights and content

Abstract

An algorithm for filling irregular polygons is presented. It is designed to operate in raster mode and uses the refresh memory of a graphic display as working space. The algorithm has been implemented in a host computer but it can be implemented easily within the microprocessor controlling the display. All areas contoured by closed lines are shaded at the same time according to a preassigned color code.

Referenceas (10)

  • PavlidisT.

    Filling algorithms for raster graphics

    Computer Graphics and Image Processing

    (1979)
  • MarangelliB. et al.

    A pointer for analog refresh memories

    Computer Graphics and Image Processing

    (1980)
  • DudaniS.A.

    Region extraction using boundary following

  • FultonD.L.

    A Plasma-panel Interactive Graphic System

  • MerrillR.D.

    Representation of contours and regions for efficient computer search

    Commun. ACM

    (1973)
There are more references available in the full text version of this article.

Cited by (0)

View full text