Skip to main content
eScholarship
Open Access Publications from the University of California

Adaptive Contouring with Quadratic Tetrahedra

  • Author(s): Gregorski, Benjamin F.
  • Wiley, David F.
  • Childs, Hank
  • Hamann, Bernd
  • Joy, Ken
  • Editor(s): Bonneau, Georges-Pierre
  • Ertl, Thomas
  • Nielson, G. M.
  • et al.
Abstract

We present an algorithm for adaptively extracting and rendering iso- surfaces of scalar-valued volume datasets represented by quadratic tetrahedra. Hier- archical 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.

Main Content
Current View