Advertisement

An Analysis and Algorithm for Filling Propagation

  • Kenneth P. Fishkin
  • Brian A. Barsky

Abstract

Fill algorithms are a common graphics utility used to change the colour of regions in the frame buffer. The propagation algorithm is a key component of filling algorithms. The problem of propagation within a fill algorithm is presented and defined, and the difficulties of formalization and comparison are discussed. The previous algorithms are presented and analyzed under a new comparison metric whose validity is confirmed by run-time tests. A new algorithm is developed, and is shown to have better average and worst case behaviour than the others.

Keywords

Parental Information Frame Buffer Blocking Edge Seed Pixel Semiconductor Research Corporation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Résumé

Les algorithmes de remplissage sont souvent utiles en infographie. Ils servent à produire des changements chromatiques de certaines régoins dans la mémoire déimage. La propagation du remplissage est un aspect important de ces algorithmes. Dans cet article, nous commençons par définir le probléme de la propagation. Nous discutons ensuite des difficultés inhérentes à la formalisation de cette notion, ainse qu’algorithmes servant à résoudre ce probléme. de cette métrique est confirmée par test empririques. Les algoritmes précédemment proposés sont alors présentés et analysés à la lumiére de cette métrique. Un nouvel algorithme est finalement développé, et nous montrons que celui-ci se comporte mieux que les précédents en moyenne comme en pire cas.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kenneth P. Fishkin and Brian A. Barsky, UA Family of New Algorithms for Soft Filling,” pp. 235–244 in SIGGRAPH ’84 Conference Proceedings, ACM,Minneapolis(July 23–27, 1984). Extended abstract in Proceedings of Graphics Interface ’84, Ottawa (28 May–1 June 1984 ), pp. 181–185.Google Scholar
  2. 2.
    Marc S. Levoy, Area Flooding Algorithms, Report, Hanna-Barbera Productions (June, 1981). Presented at SIGGRAPH ’82 2-D Animation Tutorial.Google Scholar
  3. 3.
    Henry Lieberman, “How To Color in a Coloring Book,” pp. 111–116 in SIGGRAPH ’78 Conference Proceedings, ACM,Atlanta( 1978 ).Google Scholar
  4. 4.
    Theo Pavlidis, “Contour Filling in Raster Graphics,” pp. 29–36 in SIGGRAPH ’81 Conference Proceedings, ACM,Dallas(3–7 August 1981 ).Google Scholar
  5. 5.
    Robert Sedgewick, Algorithms, Addison-Wesley.Google Scholar
  6. 6.
    Uri Shani, “Filling Regions in Binary Raster Images: A Graph-Theoretic Approach,” pp. 321–327 in SIGGRAPH ’80 Conference Proceedings, ACM,Seattle(July, 1980 ).Google Scholar
  7. 7.
    Alvy Ray Smith, “Tint Fill,” pp. 276–283 in SIGGRAPH ’79 Conference Proceedings, ACM,Chicago(August, 1979). Also Technical Memo No. 6, New York Institute of Technology.Google Scholar
  8. 8.
    Alvy Ray Smith, Fill Tutorial Notes, Report No. 40, LucasFilm (April 27, 1982). Presented at SIGGRAPH ’82 2-D Animation Tutorial.Google Scholar

Copyright information

© Springer-Verlag Tokyo 1985

Authors and Affiliations

  • Kenneth P. Fishkin
    • 1
  • Brian A. Barsky
    • 1
  1. 1.Berkeley Computer Graphics Laboratory, Computer Science Division, Department of Electrical Engineering and Computer SciencesUniversity of CaliforniaBerkeleyUSA

Personalised recommendations