Advertisement

The Visual Computer

, Volume 20, Issue 1, pp 17–36 | Cite as

Computing curvature-adaptive surface triangulations of three-dimensional image data

  • Nils Krahnstoever Email author
  • Cristian Lorenz
original article

Abstract

An adaptive surface triangulation algorithm for binary 3D image data is presented. The proposed method is robust and efficient and yields a high-quality surface-mesh description. The main idea of the algorithm is based on selecting a subset of the object voxel surface elements as the vertices of the triangulation and to obtain a discrete approximation of the Voronoi graph on the object surface to generate its dual, the surface Delaunay triangulation. The presented approach incorporates local object shape into the early stages of the algorithm, yielding an elegant method for obtaining shape-adaptive triangular meshes. One of the main advantages of the presented method over previous approaches is that no intermediate surface representation other than the trivial voxel representation provided by the input data is necessary. The method is presented in detail and tested on synthetic as well as real images.

Keywords

Surface triangulation Surface meshes Curvature adaptation Voronoi graph Delaunay triangulation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baker TJ (1991) Shape reconstruction and volume meshing for complex solids. Int J Numer Meth Eng 32(4):665–675 zbMATHGoogle Scholar
  2. 2.
    Baker TJ, Vassberg JC (1998) Tetrahedral mesh generation and optimization. In: Cross M, Soni BK, Thompson JF, Hauser J, Eiseman PR (eds) Proceedings of the 6th international conference on numerical grid generation in computational field simulations, University of Greenwich, July 1998, pp 337–349 Google Scholar
  3. 3.
    Curless B, Levoy M (1996) A volumetric method for building complex models from range images. In: Proceedings of Computer Graphics, SIGGRAPH ’96, New Orleans, LA, July 1996, pp 303–312 Google Scholar
  4. 4.
    Davis MH, Khotanzad A, Flamig DP, Harms SE (1995) Curvature measurement of 3D objects: evaluation and comparison of three methods. In: Proceedings of the international conference on image processing, Washington, DC, 23–26 October 1995, pp 627–630 Google Scholar
  5. 5.
    Delingette H (1998) Initialization of deformable models from 3D data. In: Proceedings of the 6th international conference on computer vision, Bombay, India, 4–7 January 1998, pp 311–316 Google Scholar
  6. 6.
    Delingette H (1999) General object reconstruction based on simplex meshes. Int J Comput Vision 32(2):111–146 Google Scholar
  7. 7.
    Eck M, DeRose T, Duchamp T, Hoppe H, Lounsbery M, Stuetzle W (1995) Multiresolution analysis of arbitrary meshes. In: Proceedings of Computer Graphics, SIGGRAPH ’95, Los Angeles, pp 173–182 Google Scholar
  8. 8.
    Eck M, Hoppe H (1996) Automatic reconstruction of B-spline surfaces of arbitrary topological type. In: Computer Graphics (Proceedings of SIGGRAPH 1996), New Orleans, 4–9 August 1996, pp 325–334 Google Scholar
  9. 9.
    Fleischmann P, Selberherr S (1997) Three-dimensional Delaunay mesh generation using a modified advancing front approach. In: Proceedings of the 6th international meshing roundtable, Sandia National Laboratories, Park City, UT, October 1997, pp 267–278 Google Scholar
  10. 10.
    Hartmann E (1998) A marching method for the triangulation of surfaces. Vis Comput 14(3):95–108 Google Scholar
  11. 11.
    Heckbert P, Garland M (1995) Survey of polygonal surface simplification algorithms. Technical Report CMU-CS-95-194. School of Computer Science, Carnegie Mellon University, Pittsburgh Google Scholar
  12. 12.
    Hilton A, Stoddart AJ, Illingworth J, Windeatt T (1996) Marching triangles: range image fusion for complex object modelling. In: Proceedings of the international conference on image processing. Lausanne, Switzerland, 16–19 September 1996, pp 381–384 Google Scholar
  13. 13.
    Hoppe H, DeRose T, Duchamp T, McDonald J, Stuetzle W (1992) Surface reconstruction from unorganized points. Comput Graph 26(2):71–78 Google Scholar
  14. 14.
    Imielinska C, Laino-Pepper L, Thumann R, Villamil R (1998) Technical challenges of 3D visualization of large color data sets. In: Proceedings of the 2nd user conference of the National Library of Medicine’s Visible Human project, Bethesda, MD, October 1, 1998 Google Scholar
  15. 15.
    Johnson AE, Hebert M (1998) Surface matching for object recognition in complex three-dimensional scenes. Image Vision Comput 16(9–10):635–651 Google Scholar
  16. 16.
    Kobbelt LP, Vorsatz J, Labsik U, Seidel HP (1999) A shrink wrapping approach to remeshing polygonal surfaces. Comput Graph Forum 18(3):119–130 Google Scholar
  17. 17.
    Krahnstoever N, Lorenz C (1999) Development of a point based shape representation of arbitrary three-dimensional medical objects suitable for statistical shape modeling. In: Proceedings of SPIE – the International Society for Optical Engineering, San Diego, 22–25 February 1999, pp 620–631 Google Scholar
  18. 18.
    Li A, Crebbin G (1994) Octree encoding of objects from range images. Patt Recog 27(5):727–739 CrossRefzbMATHGoogle Scholar
  19. 19.
    Lin CC, Ching YT (1997) A note on computing the saddle values in isosurface polygonization. Vis Comput 13(7):342–344 Google Scholar
  20. 20.
    Lorensen W, Cline H (1987) Marching Cubes: a high resolution 3D surface construction algorithm. Comput Graph 21(4):163–169 Google Scholar
  21. 21.
    Lorenz C, Krahnstoever N (1999) 3D statistical shape models for medical image segmentation. In: Proceedings of the 2nd international conference on 3-D digital imaging and modeling, Ottawa, Canada, 4–8 October 1999, pp 414–423 Google Scholar
  22. 22.
    Lorenz C, Krahnstoever N (2000) Generation of point-based 3D statistical shape models for anatomical objects. Comput Vision Image Understand 77(2):175–191 Google Scholar
  23. 23.
    Lotjonen J, Reissman PJ, Magnin IE, Nenonen J, Katila T (1998) A triangulation method of an arbitrary point set for biomagnetic problems. IEEE Trans Magnet 34(4):2228–2233 CrossRefGoogle Scholar
  24. 24.
    Morris DD, Kanade T (2000) Image-consistent surface triangulation. In: Proceedings of the IEEE conference on computer vision and pattern recognition (CVPR 2000), Hilton Head Island, SC, pp 332–338 Google Scholar
  25. 25.
    Ning P, Bloomenthal J (1993) An evaluation of implicit surface tilers. IEEE Comput Graph Appl 13(6):33–41 Google Scholar
  26. 26.
    Oblonsek C, Guid N (1998) A fast surface-based procedure for object reconstruction from 3D scattered points. Comput Vision Image Understand 69(2):185–195 Google Scholar
  27. 27.
    Pappas T (1989) The Moebius Strip and the Klein Bottle. Wide World Publications/Tetra, San Carlos, CA Google Scholar
  28. 28.
    Schroeder WJ, Zarge JA, Lorensen WE (1992) Decimation of triangle meshes. Comput Graph 26(2):65–70 Google Scholar
  29. 29.
    Stokely EM, Wu SY (1992) Surface parameterization and curvature measurement of arbitrary 3-D objects: five practical methods. IEEE Trans Patt Anal Mach Intell 14(8):833–840 CrossRefGoogle Scholar
  30. 30.
    Tarbox GH, Gottschlich SN (1995) Planning for complete sensor coverage in inspection. Comput Vision Image Understand 61(1):84–111 Google Scholar
  31. 31.
    Turk G (1992) Re-tiling polygonal surfaces. Comput Graph 26(2):55–64 Google Scholar
  32. 32.
    Wagner M (1998) Rekonstruktion neuronaler Ströme aus bioelektrischen und biomagnetischen Messungen auf der aus MR-Bildern segmentierten Hirnrinde. Ph.D. thesis, Technical University Hamburg-Harburg, Shaker, Aachen, Germany Google Scholar
  33. 33.
    Wagner M, Fuchs M, Drenckhahn R, Wischmann HA, Köhler T, Theissen A (1997) Automatic generation of BEM and FEM meshes from 3D MR data. Neuroimage 5:S389 Google Scholar
  34. 34.
    Wood ZJ, Desbrun M, Schroder P, Breen D (2000) Semi-regular mesh extraction from volumes. In: Proceedings of Visualization 2000, Salt Lake City, UT, 8–13 October 2000, pp 275–282 Google Scholar
  35. 35.
    Yuan JS, Fitzsimons CJ (1993) A mesh generator for tetrahedral elements using Delaunay triangulation. IEEE Trans Magnet 29(2):1906–1909 CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2003

Authors and Affiliations

  1. 1.Visualization and Computer VisionGeneral Electric Global ResearchNiskayunaUSA
  2. 2.Division Technical SystemsPhilips Research LaboratoriesHamburgGermany

Personalised recommendations