Abstract
A filling algorithm is proposed that works in a matrix of pixels. It proceeds by spans and is directed by contour marching, a contour being viewed as a circular list of linels. This technique has 3D applications: it is used in traversing the surfels graph of a voxelized object.
The author wishes to thank the anonymous reviewers, D. Michelucci and B. Péroche for their constructive remarks on the preliminary version of this paper.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
E. Artzy, G. Frieder, and G. Herman. The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm. Computer graphics and image processing, (15):1–24, 1981.
J.M. Chassery and A. Montanvert. Géométrie discrète en analyse d'images. Hermes, 1991.
G. Frieder, G. Herman, C. Meyer, and J. Udupa. Large software problems for small computers: an example from medical imaging. IEEE Software. (2):37–47, September 1985.
J. Françon. Topologie de khalimski-kovalevsky et algorithmique graphique. Technique et science informatiques, 14(10):1195–1219, 1995.
Foley, VanDam, Feiner, and Hughes. Computer graphics: principles and practice. Addison Wesley, 2 edition, 1990.
G. Hegron. Synthèse d'image: algorithmes élémentaires. AFCET Dunod, 1985.
T. Kong and A. Rosenfeld. Digital topology: introduction and survey. Computer vision, graphics and image processing, (48):357–393, 1989.
H. Lieberman. How to color in a coloring book. In SIGGRAPH'78, volume 12(3), pages 111–116. ACM, August 1978.
G. Mathieu. Points significatifs dans un contour discret: caractérisation des cavités et dilatation. In 5th Discrete geometry for computer imagery, pages 249–258, 1995.
D. Montuno and A. Fournier. Finding the x-y convex hull of a set of x-y polygons. Technical Report CSRG-148, University of Toronto, November 1982.
T. Pavlidis. Filling algorithms for raster graphics. Computer graphics and image processing, 10:126–141, 1979.
T. Pavlidis. Contour filling in raster graphics. In Proceedings SIG-GRAPH'81, volume 15(3), pages 29–36. ACM, aug 1981.
U. Shani. Filling regions in binary raster images: a graph-theoretic approach. In SIGGRAPH'80, volume 14, pages 321–327. ACM, 1980.
Y. Shinagawa, T. Kunii, and Y. Kergosien. Surface coding based on morse theory. IEEE computer graphics and applications, 11(5):66–78, September 1991.
A. Smith. Tint fill. In SIGGRAPH'79, volume 13(2), pages 276–283. ACM, 1979.
G. Tang and B. Lien. Region filling with the use of the discrete green theorem. Computer vision, graphics and image processing, (42):297–305, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mathieu, G. (1996). Filling driven by contour marching. In: Miguet, S., Montanvert, A., Ubéda, S. (eds) Discrete Geometry for Computer Imagery. DGCI 1996. Lecture Notes in Computer Science, vol 1176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62005-2_17
Download citation
DOI: https://doi.org/10.1007/3-540-62005-2_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62005-1
Online ISBN: 978-3-540-49595-6
eBook Packages: Springer Book Archive