TetSplat: Real-time Rendering and Volume Clipping of Large Unstructured Tetrahedral Meshes

We present a novel approach to interactive visualization and exploration of large unstructured tetrahedral meshes. These massive 3D meshes are used in mission-critical CFD and structural mechanics simulations, and typically sample multiple field values on several millions of unstructured grid points. Our method relies on the pre-processing of the tetrahedral mesh to partition it into non-convex boundaries and internal fragments that are subsequently encoded into compressed multi-resolution data representations. These compact hierarchical data structures are then adaptively rendered and probed in real-time on a commodity PC. Our point-based rendering algorithm, which is inspired by QSplat, employs a simple but highly efficient splatting technique that guarantees interactive frame-rates regardless of the size of the input mesh and the available rendering hardware. It furthermore allows for real-time probing of the volumetric data-set through constructive solid geometry operations as well as interactive editing of color transfer functions for an arbitrary number of field values. Thus, the presented visualization technique allows end-users for the first time to interactively render and explore very large unstructured tetrahedral meshes on relatively inexpensive hardware

TVD differencing on three-dimensional unstructured meshes with monotonicity-preserving correction of mesh skewness

This data set contains the data accompanying the article F. Denner and B. van Wachem, TVD differencing on three-dimensional unstructured meshes with monotonicity-preserving correction of mesh skewness, Journal of Computational Physics (2015), http://dx.doi.org/10.1016/j.jcp.2015.06.008.This data set contains the data accompanying the article F. Denner and B. van Wachem, TVD differencing on three-dimensional unstructured meshes with monotonicity-preserving correction of mesh skewness, Journal of Computational Physics (2015), http://dx.doi.org/10.1016/j.jcp.2015.06.008

Doctor of Philosophy

dissertationOne of the fundamental building blocks of many computational sciences is the construction and use of a discretized, geometric representation of a problem domain, often referred to as a mesh. Such a discretization enables an otherwise complex domain to be represented simply, and computation to be performed over that domain with a finite number of basis elements. As mesh generation techniques have become more sophisticated over the years, focus has largely shifted to quality mesh generation techniques that guarantee or empirically generate numerically well-behaved elements. In this dissertation, the two complementary meshing subproblems of vertex placement and element creation are analyzed, both separately and together. First, a dynamic particle system achieves adaptivity over domains by inferring feature size through a new information passing algorithm. Second, a new tetrahedral algorithm is constructed that carefully combines lattice-based stenciling and mesh warping to produce guaranteed quality meshes on multimaterial volumetric domains. Finally, the ideas of lattice cleaving and dynamic particle systems are merged into a unified framework for producing guaranteed quality, unstructured and adaptive meshing of multimaterial volumetric domains

Lattice cleaving: a multimaterial tetrahedral meshing algorithm with guarantees

pre-printWe introduce a new algorithm for generating tetrahedral meshes that conform to physical boundaries in volumetric domains consisting of multiple materials. The proposed method allows for an arbitrary number of materials, produces high-quality tetrahedral meshes with upper and lower bounds on dihedral angles, and guarantees geometric fidelity. Moreover, the method is combinatoric so its implementation enables rapid mesh construction. These meshes are structured in a way that also allows grading, to reduce element counts in regions of homogeneity. Additionally, we provide proofs showing that both element quality and geometric fidelity are bounded using this approach

Trace Finite Element Methods for PDEs on Surfaces

In this paper we consider a class of unfitted finite element methods for discretization of partial differential equations on surfaces. In this class of methods known as the Trace Finite Element Method (TraceFEM), restrictions or traces of background surface-independent finite element functions are used to approximate the solution of a PDE on a surface. We treat equations on steady and time-dependent (evolving) surfaces. Higher order TraceFEM is explained in detail. We review the error analysis and algebraic properties of the method. The paper navigates through the known variants of the TraceFEM and the literature on the subject