Skip to main content

Interpolation-Based Extraction of Representative Isosurfaces

  • Conference paper
  • First Online:
Advances in Visual Computing (ISVC 2016)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 10072))

Included in the following conference series:

Abstract

We propose a novel technique for the automatic, similarity-based selection of representative surfaces. While our technique can be applied to any set of manifolds, we particularly focus on isosurfaces from volume data. We select representatives from sets of surfaces stemming from varying isovalues or time-dependent data. For selection, our approach interpolates between surfaces using a minimum cost flow solver, and determines whether the interpolate adequately represents the actual surface in-between. For this, we employ the Hausdorff distance as an intuitive measure of the similarity of two components. In contrast to popular contour tree-based approaches which are limited to changes in topology, our approach also accounts for geometric deviations. For interactive visualization, we employ a combination of surface renderings and a graph view that depicts the selected surfaces and their relation. We finally demonstrate the applicability and utility of our approach by means of several data sets from different areas.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

References

  1. Lorensen, W., Cline, H.: Marching cubes: a high resolution 3D surface construction algorithm. Comput. Graph. 21, 163–169 (1987)

    Article  Google Scholar 

  2. Dey, T., Levine, J.: Delaunay meshing of isosurfaces. Shape Model. Appl. 2007, 241–250 (2007)

    Google Scholar 

  3. Schreiner, J., Scheidegger, C., Silva, C.: High-quality extraction of isosurfaces from regular and irregular grids. TVCG 12, 1205–1212 (2006)

    Google Scholar 

  4. Scheidegger, C.E., Fleishman, S., Silva, C.T.: Triangulating point set surfaces with bounded error. In: EG symposium on Geometry processing (2005)

    Google Scholar 

  5. Bommes, D., Lévy, B., Pietroni, N., Puppo, E., Silva, C., Tarini, M., Zorin, D.: Quad meshing. In: Eurographics, The Eurographics Association, pp. 159–182 (2012)

    Google Scholar 

  6. Theisel, H.: Exact isosurfaces for marching cubes. Comput. Graph. Forum 21, 19–32 (2002)

    Article  MATH  Google Scholar 

  7. Remacle, J.F., Henrotte, F., Baudouin, T., Geuzaine, C., Béchet, E., Mouton, T., Marchandise, E.: A frontal Delaunay quad mesh generator. In: 20th Meshing Roundtable, pp. 455–472 (2012)

    Google Scholar 

  8. Wiley, D.F., Childs, H.R., Gregorski, B.F., Hamann, B., Joy, K.I.: Contouring curved quadratic elements. In: VisSym, p. 1 (2003)

    Google Scholar 

  9. Pagot, C.A., Vollrath, J., Sadlo, F., Weiskopf, D., Ertl, T., Comba, J.: Interactive isocontouring of high-order surfaces. In: Scientific Visualization (2011)

    Google Scholar 

  10. Shirazian, P., Wyvill, B., Duprat, J.L.: Polygonization of implicit surfaces on multi-core architectures with SIMD instructions. In: EGPGV, pp. 89–98 (2012)

    Google Scholar 

  11. Knoll, A., Hijazi, Y., Kensler, A., Schott, M., Hansen, C.D., Hagen, H.: Fast ray tracing of arbitrary implicit surfaces. CGF 28, 26–40 (2009)

    Google Scholar 

  12. Biasotti, S., De Floriani, L., Falcidieno, B., Frosini, P., Giorgi, D., Landi, C., Papaleo, L., Spagnuolo, M.: Describing shapes by geometrical-topological properties of real functions. ACM Comput. Surv. 40, 12:1–12:87 (2008)

    Article  Google Scholar 

  13. Carr, H., Snoeyink, J., van de Panne, M.: Flexible isosurfaces: simplifying and displaying scalar topology using the contour tree. CGTA 43, 42–58 (2010)

    MathSciNet  MATH  Google Scholar 

  14. Khoury, M., Wenger, R.: On the fractal dimension of isosurfaces. IEEE Trans. Vis. Comput. Graph. 16, 1198–1205 (2010)

    Article  Google Scholar 

  15. Tenginakai, S., Lee, J., Machiraju, R.: Salient iso-surface detection with model-independent statistical signatures. In: IEEE Visualization (2001)

    Google Scholar 

  16. Tang, M., Lee, M., Kim, Y.J.: Interactive Hausdorff distance computation for general polygonal models. ACM Trans. Graph. 28, 74:1–74:9 (2009)

    Article  Google Scholar 

  17. Bruckner, S., Möller, T.: Isosurface similarity maps. Comput. Graph. Forum 29, 773–782 (2010). EuroVis 2010 best paper award

    Article  Google Scholar 

  18. Wei, T.H., Lee, T.Y., Shen, H.W.: Evaluating isosurfaces with level-set-based information maps. Comput. Graph. Forum 32, 1–10 (2013)

    Article  Google Scholar 

Download references

Acknowledgements

This work was primarily funded by Deutsche Forschungsgemeinschaft (DFG) under grant SPP 1648 (ExaScaleFSA).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Oliver Fernandes .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Fernandes, O., Frey, S., Ertl, T. (2016). Interpolation-Based Extraction of Representative Isosurfaces. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2016. Lecture Notes in Computer Science(), vol 10072. Springer, Cham. https://doi.org/10.1007/978-3-319-50835-1_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-50835-1_37

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-50834-4

  • Online ISBN: 978-3-319-50835-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics