Skip to main content
Book Chapter

Adaptive contouring with quadratic tetrahedra

Springer Heidelberg, (2006), 3-15
DOI: 10.1007/3-540-30790-7_1
2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present an algorithm for adaptively extracting and rendering isosurfaces of scalar-valued volume datasets represented by quadratic tetrahedra. Hierarchical tetrahedral meshes created by longest-edge bisection are used to construct a multiresolution C0-continuous representation using quadratic basis functions. A new algorithm allows us to contour higher-order volume elements efficiently.

Cite

CITATION STYLE

APA

Gregorski, B. F., Wiley, D. F., Childs, H. R., Hamann, B., & Joy, K. I. (2006). Adaptive contouring with quadratic tetrahedra. In Mathematics and Visualization (Vol. 0, pp. 3–15). Springer Heidelberg. https://doi.org/10.1007/3-540-30790-7_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free