article

Free access

Contour filling in raster graphics

Author:

Theo PavlidisAuthors Info & Claims

ACM SIGGRAPH Computer Graphics, Volume 15, Issue 3

Pages 29 - 36

https://doi.org/10.1145/965161.806786

Published: 01 August 1981 Publication History

Abstract

The paper discusses algorithms for filling contours in raster graphics. Its major feature is the use of the line adjacency graph for the contour in order to fill correctly nonconvex and multiply connected regions, while starting from a “seed.” Because the same graph is used for a “parity check” filling algorithm, the two types of algorithms can be combined into one. This combination is useful for either finding a seed through a parity check, or for resolving ambiguities in parity on the basis of connectivity.

References

[1]

Newman, W. M. and Sproull, R. F. Principles of Interactive Graphics, second edition, McGraw-Hill, 1979.

Digital Library

[2]

Brassel, K. E. and R. Fegeas "An Algorithm for Shading of Regions on Vector Display Devices," Proc. SIGGRAPH 79, pp. 126-133.

Digital Library

[3]

Pavlidis T., "Filling algorithms for raster graphics," Comput, Graphics Image Proc. 10, 1979, pp. 126-141. Also in preliminary form in Proc. SIGGRAPH 78, pp. 161-166.

[4]

Sproull, R. F. Review of {3} in Computing Reviews November 1979, p. 500. (Review No.35, 467.)

[5]

Ackland, B.D. and Weste, N. "The Edge Flag Algorithm - A Fill Method for Raster Scan Displays," IEEE Trans. Computers, C-30 (1980), pp. 41-48.

[6]

Lieberman, M. "How to color in a coloring book," Proc. SIGGRAPH 78, pp. 111-116.

Digital Library

[7]

Smith, A. R. "Tint fill," Proc. SIGGRAPH 79, pp. 276-283.

Digital Library

[8]

Caspers, B. E. and Denes, P. B. "An Interactive Terminal for the Design of Advertisements," Bell System Technical Journal, 58 (1979), pp. 2189-2216.

[9]

Shani, U. "Filling regions in binary raster images - a graphtheoretic approach," Proc. SIGGRAPH 80, pp. 321-327.

Digital Library

[10]

Aho, A. V., J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms Addison-Wesley, 1974.

Digital Library

[11]

Pavlidis, T. Structural Pattern Recognition, Springer Verlag, Berlin-Heidelberg-New York, 1977.

[12]

Pavlidis, T. and Steiglitz, K. "The Automatic Counting of Asbestos Fibers in Air Samples," IEEE Trans. Computers, C-27, 1978, pp. 258-261.

Digital Library

[13]

Shapiro, L. "Data Structures for Picture Processing," Proc. SIGGRAPH 78, pp. 140-146.

Digital Library

[14]

Rosenfeld, A. and Kak, A. C. Digital Picture Processing, Academic Press, New York, 1976.

Digital Library

[15]

Pavlidis, T. Algorithms for Graphics and Image Processing, Computer Science Press, Maryland, 1981 (in press).

Digital Library

Cited By

Schmuck KAntenreiter MAlfreider MKiener D(2024)Automatic and time-resolved determination of fracture characteristics from in situ experimentsMaterials & Design10.1016/j.matdes.2024.113038243(113038)Online publication date: Jul-2024
https://doi.org/10.1016/j.matdes.2024.113038
Distante ADistante CDistante ADistante C(2020)Image SegmentationHandbook of Image Processing and Computer Vision10.1007/978-3-030-42374-2_5(271-332)Online publication date: 30-May-2020
https://doi.org/10.1007/978-3-030-42374-2_5
Ju MYe SLow HZhang JCabrales PLeo HKim S(2013)Effect of deformability difference between two erythrocytes on their aggregationPhysical Biology10.1088/1478-3975/10/3/03600110:3(036001)Online publication date: 10-Apr-2013
https://doi.org/10.1088/1478-3975/10/3/036001
Show More Cited By

Index Terms

Contour filling in raster graphics
1. Computing methodologies
  1. Computer graphics
2. Hardware
  1. Communication hardware, interfaces and storage
    1. Displays and imagers
  2. Robustness

Recommendations

Contour filling in raster graphics
SIGGRAPH '81: Proceedings of the 8th annual conference on Computer graphics and interactive techniques

The paper discusses algorithms for filling contours in raster graphics. Its major feature is the use of the line adjacency graph for the contour in order to fill correctly nonconvex and multiply connected regions, while starting from a “seed.” Because ...
Texture tile considerations for raster graphics

As a technique for rendering texture in images, texture tiles meet the subjective criterion of visual acceptability. A texture tile is a digital array of stored texture information that is replicated on a surface within an image. The purpose is to give ...
Texture tile considerations for raster graphics
SIGGRAPH '78: Proceedings of the 5th annual conference on Computer graphics and interactive techniques

As a technique for rendering texture in images, texture tiles meet the subjective criterion of visual acceptability. A texture tile is a digital array of stored texture information that is replicated on a surface within an image. The purpose is to give ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGGRAPH Computer Graphics

ACM SIGGRAPH Computer Graphics Volume 15, Issue 3

August 1981

303 pages

ISSN:0097-8930

DOI:10.1145/965161

Issue’s Table of Contents

SIGGRAPH '81: Proceedings of the 8th annual conference on Computer graphics and interactive techniques
August 1981
337 pages
ISBN:0897910451
DOI:10.1145/800224
Chairmen:
Doug Green,
Tony Lucido,
Henry Fuchs

Copyright © 1981 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1981

Published in SIGGRAPH Volume 15, Issue 3

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

30
Total Citations
View Citations
1,057
Total Downloads

Downloads (Last 12 months)110
Downloads (Last 6 weeks)31

Reflects downloads up to 20 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Schmuck KAntenreiter MAlfreider MKiener D(2024)Automatic and time-resolved determination of fracture characteristics from in situ experimentsMaterials & Design10.1016/j.matdes.2024.113038243(113038)Online publication date: Jul-2024
https://doi.org/10.1016/j.matdes.2024.113038
Distante ADistante CDistante ADistante C(2020)Image SegmentationHandbook of Image Processing and Computer Vision10.1007/978-3-030-42374-2_5(271-332)Online publication date: 30-May-2020
https://doi.org/10.1007/978-3-030-42374-2_5
Ju MYe SLow HZhang JCabrales PLeo HKim S(2013)Effect of deformability difference between two erythrocytes on their aggregationPhysical Biology10.1088/1478-3975/10/3/03600110:3(036001)Online publication date: 10-Apr-2013
https://doi.org/10.1088/1478-3975/10/3/036001
Stohl ABerg TBurkhart JFjǽraa AForster CHerber AHov ØLunder CMcMillan WOltmans SShiobara MSimpson DSolberg SStebel KStröm JTørseth KTreffeisen RVirkkunen KYttri K(2007)Arctic smoke – record high air pollution levels in the European Arctic due to agricultural fires in Eastern Europe in spring 2006Atmospheric Chemistry and Physics10.5194/acp-7-511-20077:2(511-534)Online publication date: 26-Jan-2007
https://doi.org/10.5194/acp-7-511-2007
Mathieu G(2005)Filling driven by contour marchingDiscrete Geometry for Computer Imagery10.1007/3-540-62005-2_17(205-216)Online publication date: 8-Jul-2005
https://doi.org/10.1007/3-540-62005-2_17
Yu DDong HLai WYang Y(2003)Projection filling based on contour structural pointsProceedings of the 2003 international conference on Computational science and its applications: PartIII10.5555/1761792.1761837(376-386)Online publication date: 18-May-2003
https://dl.acm.org/doi/10.5555/1761792.1761837
Yu DDong HLai WYang Y(2003)Projection Filling Based on Contour Structural PointsComputational Science and Its Applications — ICCSA 200310.1007/3-540-44842-X_39(376-386)Online publication date: 18-Jun-2003
https://doi.org/10.1007/3-540-44842-X_39
Jenq JBryant BLamont GHaddad HCarroll J(1999)Parallel polygon scan conversion on hypercube multiprocessorsProceedings of the 1999 ACM symposium on Applied computing10.1145/298151.298215(110-114)Online publication date: 28-Feb-1999
https://dl.acm.org/doi/10.1145/298151.298215
de Sequeira MCortez D(1997)Partitions: A taxonomy of types and representations and an overview of coding techniquesSignal Processing: Image Communication10.1016/S0923-5965(97)00016-710:1-3(5-19)Online publication date: Jul-1997
https://doi.org/10.1016/S0923-5965(97)00016-7
Parker J(1990)Scaling low-resolution bitmap fonts using linear feature extractionThe Visual Computer10.1007/BF019010686:2(74-78)Online publication date: Mar-1990
https://doi.org/10.1007/BF01901068
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents