Topologically defined isosurfaces

  • Jacques-Olivier Lachaud
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1176)


In this article, we present a new process for defining and building the set of configurations of Marching-Cubes algorithms. Our aim is to extract a topologically correct isosurface from a volumetric image. Our approach exploits the underlying discrete topology of voxels. Our main contribution is to provide a formal proof of the validity of the generated isosurface. The generated isosurface is a closed, oriented surface without singularity with no self-intersection. Furthermore, we demonstrate that it separates the foreground from the background. Finally we show that the graph defining the isosurface is closely linked to the surfel-adjacency graph of the digital surface of the same image.


Complete Graph Adjacency Graph Oriented Edge Local Graph Volumetric Image 
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.


  1. 1.
    J.-H. Chuang and W.-C. Lee. Efficient Generation of Isosurfaces in Volume Rendering. Computer & Graphics, 19(6):805–813, 1995.Google Scholar
  2. 2.
    M.J. Dürst. Additionnal Reference to Marching Cubes. Computer Graphics, 22(2):72–73, 1988.Google Scholar
  3. 3.
    J. Françon. Discrete Combinatorial Surfaces. CVGIP: Graphical Models and Image Processing, 57(1):20–26, January 1995.Google Scholar
  4. 4.
    G.T. Herman. “Discrete Multidimensional Jordan Surfaces”. CVGIP, 54(6):507–515, November 1992.Google Scholar
  5. 5.
    T.Y. Kong and J.K. Udupa. A justification of a fast surface tracking algorithm. CVGIP: Graphical Models and Image Processing, 54(6):507–515, November 1992.Google Scholar
  6. 6.
    J-O. Lachaud and A. Montanvert. “Volumic Segmentation using Hierarchical Representation and Triangulated Surface”. In 6th European Conference on Computer Vision, pages 137–146, Cambridge, UK, April 1996.Google Scholar
  7. 7.
    J.O. Lachaud. “Topologically Defined Isosurfaces”. Research Report 96-20, LIP 3-ENS Lyon, France, 1996.Google Scholar
  8. 8.
    W. E. Lorensen and H. E. Cline. “Marching Cubes: A High Resolution 3D Surface Construction Algorithm”. Computer Graphics, 21:163–169, January 1987.Google Scholar
  9. 9.
    S. Miguet and J-M. Nicod. “A load-balanced parallel implementation of the Marching-Cube algorithm”. In HPCS, July 1995.Google Scholar
  10. 10.
    S. Miguet and L. Perroton. “Discrete surfaces of 26-connected sets of voxels”. In 5th Discrete Geometry for Computer Imagery, September 1995.Google Scholar
  11. 11.
    G.M. Nielson and B. Hamman. The Asymptotic Decider: Resolving the Ambiguity in Marching Cubes. In IEEE, editor, Visualization'91, pages 83–90, San Diego, 1991.Google Scholar
  12. 12.
    L. Perroton. A 26-connected object surface tracking algorithm. Géométrie discrète en imagerie, fondements et applications, 1:1–10, September 1993.Google Scholar
  13. 13.
    S. Röll, A. Haase, and M. von Kienlin. “Fast Generation of Leakproof Surfaces from Well-Defined Objects by a Modified Marching Cubes Algorithm”. Computer Graphics Forum, 14(2):127–138, January 1995.Google Scholar
  14. 14.
    A. Rosenfeld, T.Y. Kong, and A.Y. Wu. “Digital Surfaces”. CVGIP, 53(4):305–312, July 1991.Google Scholar
  15. 15.
    J.K. Udupa. Multidimensional Digital Boundaries. CVGIP: Graphical Models and Image Processing, 56(4):311–323, July 1994.Google Scholar
  16. 16.
    A. van Gelder and J. Wilhelms. Topological Considerations in Isosurface Generation. ACM Transactions on Graphics, 13(4):337–375, October 1994.Google Scholar
  17. 17.
    J. Wilhelms and A. van Gelder. Octrees for Faster Isosurface Generation. ACM Transactions on Graphics, 11(3):201–227, July 1992.Google Scholar
  18. 18.
    G. Wyvill, C. McPheeters, and B. Wyvill. Data Structure for Soft Objects. The visual Computer, 2:227–234, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Jacques-Olivier Lachaud
    • 1
  1. 1.LIP, ENS-Lyon, URA CNRS 1398Lyon Cedex 7

Personalised recommendations