Advertisement

Filling driven by contour marching

  • Gilles Mathieu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1176)

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.

Keywords

Recursive Call Digital Picture Current Contour Filling Algorithm Circular List 
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

  1. [AFH81]
    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.Google Scholar
  2. [CM91]
    J.M. Chassery and A. Montanvert. Géométrie discrète en analyse d'images. Hermes, 1991.Google Scholar
  3. [FHMU85]
    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.Google Scholar
  4. [Fra95]
    J. Françon. Topologie de khalimski-kovalevsky et algorithmique graphique. Technique et science informatiques, 14(10):1195–1219, 1995.Google Scholar
  5. [FVFH90]
    Foley, VanDam, Feiner, and Hughes. Computer graphics: principles and practice. Addison Wesley, 2 edition, 1990.Google Scholar
  6. [Heg85]
    G. Hegron. Synthèse d'image: algorithmes élémentaires. AFCET Dunod, 1985.Google Scholar
  7. [KR89]
    T. Kong and A. Rosenfeld. Digital topology: introduction and survey. Computer vision, graphics and image processing, (48):357–393, 1989.Google Scholar
  8. [Lie78]
    H. Lieberman. How to color in a coloring book. In SIGGRAPH'78, volume 12(3), pages 111–116. ACM, August 1978.Google Scholar
  9. [Mat95]
    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.Google Scholar
  10. [MF82]
    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.Google Scholar
  11. [Pav79]
    T. Pavlidis. Filling algorithms for raster graphics. Computer graphics and image processing, 10:126–141, 1979.Google Scholar
  12. [Pav81]
    T. Pavlidis. Contour filling in raster graphics. In Proceedings SIG-GRAPH'81, volume 15(3), pages 29–36. ACM, aug 1981.Google Scholar
  13. [Sha80]
    U. Shani. Filling regions in binary raster images: a graph-theoretic approach. In SIGGRAPH'80, volume 14, pages 321–327. ACM, 1980.Google Scholar
  14. [SKK91]
    Y. Shinagawa, T. Kunii, and Y. Kergosien. Surface coding based on morse theory. IEEE computer graphics and applications, 11(5):66–78, September 1991.Google Scholar
  15. [Smi79]
    A. Smith. Tint fill. In SIGGRAPH'79, volume 13(2), pages 276–283. ACM, 1979.Google Scholar
  16. [TL88]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Gilles Mathieu
    • 1
  1. 1.Centre SIMADE, Ecole des MinesLISSESaint-Etienne Cedex 2France

Personalised recommendations