Skip to main content

Data—Dependent Surface Simplification

  • Conference paper
Visualization in Scientific Computing ’98

Part of the book series: Eurographics ((EUROGRAPH))

Abstract

In Scientific Visualization, surfaces have often attached data, e. g. cutting surfaces or isosurfaces in numerical simulations with multiple data components. These surfaces can be e. g. the output of a marching cubes algorithm which produces a large number of very small triangles. Existing triangle decimation algorithms use purely geometric criteria to simplify over sampled surfaces. This approach can lead to coarse representations of the surface in areas with high data gradients, thus loosing important information.

In this paper, a data-dependent reduction algorithm for arbitrary triangulated surfaces is presented using besides geometric criteria a gradient approximation of the data to define the order of geometric elements to be removed. Examples show that the algorithm works sufficiently fast to be used interactively in a VR environment and allows relatively high reduction rates keeping a good quality representation of the surfaces.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Alboul, R. van Damme. Polyhedral metrics in surface reconstruction: Tight triangulations. Memorandum No. 1275, Faculty of Applied Mathematics, University of Twente (NL), 1995.

    Google Scholar 

  2. L. Alboul, R. van Damme. Polyhedral metrics in surface reconstruction. In Mathematics on Surfaces VI, pages 171–200. Clarendon Press, 1996.

    Google Scholar 

  3. A. D. Aleksandrov. On a class of closed surfaces (in russian). Mat. Sbornik, 4:69–77, 1938.

    Google Scholar 

  4. A. D. Aleksandrov, V. A. Zalgaller. Intrinsic Geometry of Surfaces. AMS, 1967.

    Google Scholar 

  5. M. de Berg, M. van Krefeld, M. Overmars, O. Schwarzkopf. Computational Geometry. Springer, 1997.

    MATH  Google Scholar 

  6. B. Chazelle. Triangulating a simple polygon in linear time. Discrete Comput. Geom., 6:485–524, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  7. N. Dyn, S. Rippa. Data dependent triangulations for scattered data interpolation and finite element approximation. Applied Numerical Mathematics, 12:89–105, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  8. M. Garland, Heckbert P. S. Surface simplification using quadric error metrics. In Computer Graphics, 1997.

    Google Scholar 

  9. R. Grosso, Ch. Lürig,, T. Ertl. The multilevel finite element method for adaptive mesh optimization and visualization of volume data. In IEEE Visualization 97, pages 387–394. IEEE, 1997.

    Google Scholar 

  10. A. Gueziec. Surface simplification inside a tolerance volume. Technical Report RC 20440, IBM Research Report, 1997.

    Google Scholar 

  11. B. Hamann. Curvature approximation of 3d manifolds in 4d space. CAGD, 11:621–632, 1994.

    MathSciNet  Google Scholar 

  12. B. Hamann. A data reduction scheme for triangulated surfaces. CAGD, 11:197–214, 1994.

    MathSciNet  MATH  Google Scholar 

  13. H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, W. Stuetzle. Mesh optimization. Computer Graphics (Proc. SIGGRAPH), 27(2):19–25, 1993.

    Google Scholar 

  14. R. Klein, G. Liebich, W. Strasser. Mesh reduction with error control. In IEEE Visualization ‘96, pages 311–318. IEEE, 1996.

    Google Scholar 

  15. J. Popovic, H. Hoppe. Progressive simplicial complexes. Computer Graphics (Proc. SIGGRAPH), 31:217–224, 1997.

    Google Scholar 

  16. D. Rantzau, U. Lang. A Scalable Virtual Environment for Large Scale Scientific Data Analysis. In: Proceedings of the Euro VR Mini Conference 97, Amsterdam, 10–11. Nov. 1997, Elsevier 1998.

    Google Scholar 

  17. W. Schroeder, J. Zarge, W. E. Lorensen. Decimation of triangle meshes. Computer Graphics (Proc. SIGGRAPH), 26(2):65–70, 1992.

    Article  Google Scholar 

  18. R. Seidel. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom. Theory Appl., 1:51–64, 1991.

    MathSciNet  MATH  Google Scholar 

  19. S. Stead. Estimation of gradients from scattered data. Rocky Mountain J. Math., 14(1):265–279, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  20. G. Taubin. Estimating the tensor of curvature of a surface from a polyhedral approximation. In 5th Intern. Conf. on Comp. Vision, Los Alamitos. IEEE Comp. Society Press, 1995.

    Google Scholar 

  21. A. Wierse, U. Lang, R. Rühle. Architectures of Distributed Visualization Systems and their Enhancements. Eurographics Workshop on Visualization in Scientific Computing, Abingdon, 1993.

    Google Scholar 

  22. J. Wilhelms, A. Van Gelder. Multi-dimensional trees for controlled volume rendering and compression. In 1994 Symposium on Volume Visualization. ACM SIGGRAPH, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag/Wien

About this paper

Cite this paper

Frank, K., Lang, U. (1998). Data—Dependent Surface Simplification. In: Bartz, D. (eds) Visualization in Scientific Computing ’98. Eurographics. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7517-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-7517-0_1

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-83209-7

  • Online ISBN: 978-3-7091-7517-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics