Skip to main content

Isosurface Polygonization

  • Chapter
  • 4431 Accesses

Abstract

In the final chapter, we cover how to go from an implicit representation back to a triangle mesh. Since the methods in Chaps. 16 and 17 produce implicit surface representations, isosurface polygonization is essential to complete the reconstruction pipeline. We focus on the popular cell-based approaches where the volume is split into (typically cubical) regions and a polygonal approximation to the surface is computed for each cubical cell. The most famous of these algorithms is the table driven Marching Cubes algorithm. However, we also discuss the more recent dual contouring methods which arguably produce nicer meshes because they have more flexibility with regard to vertex placement.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Fuchs, H., Kedem, Z.M., Uselton, S.P.: Optimal surface reconstruction from planar contours. Commun. ACM 20(10), 693–702 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  2. Akkouche, S., Galin, E.: Adaptive implicit surface polygonization using marching triangles. Comput. Graph. Forum 20(2), 67–80 (2001)

    Article  MATH  Google Scholar 

  3. Lorensen, W.E., Cline, H.E.: Marching cubes: a high resolution 3D surface construction algorithm. In: ACM Computer Graphics (1987)

    Google Scholar 

  4. Wyvill, B., McPheeters, C., Wyvill, G.: Data structure for soft objects. Vis. Comput. 2(4), 227–234 (1986)

    Article  Google Scholar 

  5. Bloomenthal, J.: Polygonization of implicit surfaces. Comput. Aided Geom. Des. 5(4), 341–355 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  6. Nielson, G.M., Hamann, B.: The asymptotic decider: Resolving the ambiguity in marching cubes. In: Nielson, G.M., Rosenblum, L.J. (eds.) IEEE Visualization ’91, pp. 83–91. IEEE Comput. Soc., Los Alamitos (1991)

    Google Scholar 

  7. Gibson, S.F.F.: Constrained elastic surface nets: generating smooth surfaces from binary segmented data. In: First International Conference. Medical Image Computing and Computer-Assisted Intervention—MICCAI’98. Proceedings, pp. 888–898 (1998)

    Chapter  Google Scholar 

  8. Ju, T., Losasso, F., Schaefer, S., Warren, J.: Dual contouring of hermite data. ACM Trans. Graph. 21(3), 339–346 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jakob Andreas Bærentzen .

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag London

About this chapter

Cite this chapter

Bærentzen, J.A., Gravesen, J., Anton, F., Aanæs, H. (2012). Isosurface Polygonization. In: Guide to Computational Geometry Processing. Springer, London. https://doi.org/10.1007/978-1-4471-4075-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-4075-7_18

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-4074-0

  • Online ISBN: 978-1-4471-4075-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics