HexBox: Interactive Box Modeling of Hexahedral Meshes

We introduce HexBox, an intuitive modeling method and interactive tool for creating and editing hexahedral meshes. Hexbox brings the major and widely validated surface modeling paradigm of surface box modeling into the world of hex meshing. The main idea is to allow the user to box-model a volumetric mesh by primarily modifying its surface through a set of topological and geometric operations. We support, in particular, local and global subdivision, various instantiations of extrusion, removal, and cloning of elements, the creation of non-conformal or conformal grids, as well as shape modifications through vertex positioning, including manual editing, automatic smoothing, or, eventually, projection on an externally-provided target surface. At the core of the efficient implementation of the method is the coherent maintenance, at all steps, of two parallel data structures: a hexahedral mesh representing the topology and geometry of the currently modeled shape, and a directed acyclic graph that connects operation nodes to the affected mesh hexahedra. Operations are realized by exploiting recent advancements in grid- based meshing, such as mixing of 3-refinement, 2-refinement, and face-refinement, and using templated topological bridges to enforce on-the-fly mesh conformity across pairs of adjacent elements. A direct manipulation user interface lets users control all operations. The effectiveness of our tool, released as open source to the community, is demonstrated by modeling several complex shapes hard to realize with competing tools and techniques

Computational Engineering

This Workshop treated a variety of finite element methods and applications in computational engineering and expanded their mathematical foundation in engineering analysis. Among the 53 participants were mathematicians and engineers with focus on mixed and nonstandard finite element schemes and their applications

Numerical Methods in Shape Spaces and Optimal Branching Patterns

The contribution of this thesis is twofold. The main part deals with numerical methods in the context of shape space analysis, where the shape space at hand is considered as a Riemannian manifold. In detail, we apply and extend the time-discrete geodesic calculus (established by Rumpf and Wirth [WBRS11, RW15]) to the space of discrete shells, i.e. triangular meshes with fixed connectivity. The essential building block is a variational time-discretization of geodesic curves, which is based on a local approximation of the squared Riemannian distance on the manifold. On physical shape spaces this approximation can be derived e.g. from a dissimilarity measure. The dissimilarity measure between two shell surfaces can naturally be defined as an elastic deformation energy capturing both membrane and bending distortions. Combined with a non-conforming discretization of a physically sound thin shell model the time-discrete geodesic calculus applied to the space of discrete shells is shown to be suitable to solve important problems in computer graphics and animation. To extend the existing calculus, we introduce a generalized spline functional based on the covariant derivative along a curve in shape space whose minimizers can be considered as Riemannian splines. We establish a corresponding time-discrete functional that fits perfectly into the framework of Rumpf and Wirth, and prove this discretization to be consistent. Several numerical simulations reveal that the optimization of the spline functional—subject to appropriate constraints—can be used to solve the multiple interpolation problem in shape space, e.g. to realize keyframe animation. Based on the spline functional, we further develop a simple regression model which generalizes linear regression to nonlinear shape spaces. Numerical examples based on real data from anatomy and botany show the capability of the model. Finally, we apply the statistical analysis of elastic shape spaces presented by Rumpf and Wirth [RW09, RW11] to the space of discrete shells. To this end, we compute a Fréchet mean within a class of shapes bearing highly nonlinear variations and perform a principal component analysis with respect to the metric induced by the Hessian of an elastic shell energy. The last part of this thesis deals with the optimization of microstructures arising e.g. at austenite-martensite interfaces in shape memory alloys. For a corresponding scalar problem, Kohn and Müller [KM92, KM94] proved existence of a minimizer and provided a lower and an upper bound for the optimal energy. To establish the upper bound, they studied a particular branching pattern generated by mixing two different martensite phases. We perform a finite element simulation based on subdivision surfaces that suggests a topologically different class of branching patterns to represent an optimal microstructure. Based on these observations we derive a novel, low dimensional family of patterns and show—numerically and analytically—that our new branching pattern results in a significantly better upper energy bound

NURBS enhanced virtual element methods for the spatial discretization of the multigroup neutron diffusion equation on curvilinear polygonal meshes

The Continuous Galerkin Virtual Element Method (CG-VEM) is a recent innovation in spatial discretization methods that can solve partial differential equations (PDEs) using polygonal (2D) and polyhedral (3D) meshes. Recently, a new formulation of CG-VEM was introduced which can construct VEM spaces on polygons with curvilinear edges. This paper presents the application of the curved VEM to the multigroup neutron diffusion equation and demonstrates its benefits over the conventional straight-sided VEM for a number of benchmark verification test cases with curvilinear domains. These domains were constructed using a topological data-structure developed as part of this paper, based on the doubly-connected edge list, with curves and surfaces both represented using non-uniform rational B-splines (NURBS). This data-structure is used both to specify the geometry of the reactor and to represent the curvilinear polygonal mesh. We also present two separate methods of performing integrations on curvilinear polygons, one for homogeneous functions and one for non-homogeneous functions

C0 Interior Penalty Methods for Cahn-Hilliard Equations

In this work we study C0 interior penalty methods for Cahn-Hilliard equations. In Chapter 1 we introduce Cahn-Hilliard equations and the time discretization that leads to linear fourth order boundary value problems. In Chapter 2 we review related fundamentals of finite element methods and multigrid methods. In Chapter 3 we formulate the discrete problems for linear fourth order boundary value problems with the boundary conditions of the Cahn-Hilliard type, which are called C0 interior penalty methods, and we carry out the convergence analysis. In Chapter 4 we consider multigrid methods for the C0 interior penalty methods. We present two smoothing schemes and compare their performance. In Chapter 5 we apply the C0 interior penalty methods and the time discretization scheme to nonlinear time-dependent Cahn-Hilliard equations. Numerical examples for phase separation and image processing are presented