title: Interactive point-based rendering of higher-order tetrahedral data.
abstract: Computational simulations frequently generate solutions defined over very large tetrahedral volume meshes containing many millions of elements. Furthermore, such solutions may often be expressed using non-linear basis functions. Certain solution techniques, such as discontinuous Galerkin methods, may even produce non-conforming meshes. Such data is difficult to visualize interactively, as it is far too large to fit in memory and many common data reduction techniques, such as mesh simplification, cannot be applied to non-conforming meshes. We introduce a point-based visualization system for interactive rendering of large, potentially non-conforming, tetrahedral meshes. We propose methods for adaptively sampling points from non-linear solution data and for decimating points at run time to fit GPU memory limits. Because these are streaming processes, memory consumption is independent of the input size. We also present an order-independent point rendering method that can efficiently render volumes on the order of 20 million tetrahedra at interactive rates.
authors.affiliation: Department of Computer Science University of Illinois at Urbana-Champaign, USA. yuanzhou@cs.uiuc.edu
authors.forename: Yuan
authors.initials: Y
authors.lastname: Zhou
authors.forename: Michael
authors.initials: M
authors.lastname: Garland