Related papers: One-parameter tetrahedral mesh generation for sphe…
This paper introduces a highly adaptive and automated approach for generating Finite Element (FE) discretization for a given realistic multi-compartment human head model obtained through magnetic resonance imaging (MRI) dataset. We aim at…
We consider an algorithm called FEMWARP for warping triangular and tetrahedral finite element meshes that computes the warping using the finite element method itself. The algorithm takes as input a two- or three-dimensional domain defined…
Mapping a shape to some parametric domain is a fundamental tool in graphics and scientific computing. In practice, a map between two shapes is commonly represented by two meshes with same connectivity and different embedding. The standard…
Unfitted (also known as embedded or immersed) finite element approximations of partial differential equations are very attractive because they have much lower geometrical requirements than standard body-fitted formulations. These schemes do…
Indirect hex-dominant meshing methods rely on the detection of adjacent tetrahedra an algorithm that performs this identification and builds the set of all possible combinations of tetrahedral elements of an input mesh T into hexahedra,…
This chapter aims at introducing and discussing the techniques for the generation of 3D Finite Element Meshes of human organs. The field of computer assisted surgery is more specifically addressed.
We show that any polyhedron forming a topological ball with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face to face. The result generalizes to non-simply-connected polyhedra satisfying an…
This paper presents a spline-based hexahedral mesh generator for tubular geometries commonly encountered in haemodynamics studies, in particular coronary arteries. We focus on techniques for accurately meshing vessels with stenoses and…
We describe a method for discretizing planar C2-regular domains immersed in non-conforming triangulations. The method consists in constructing mappings from triangles in a background mesh to curvilinear ones that conform exactly to the…
In the past decade frame fields have emerged as a promising approach for generating hexahedral meshes for CFD and CAE applications. One important problem asks for construction of a boundary-aligned frame field with prescribed singularity…
In the current practices of both industry and academia, the convergence and accuracy of finite element calculations are closely related to the methods and quality of mesh generation. For years, the research on high-quality mesh generation…
<incorrect proofs; does not consider an important case because of which the proofs are wrong. The paper was withdrawn from submission> One of the objectives of a Delaunay mesh refinement algorithm is to produce meshes with tetrahedral…
Three-dimensional $N^{th}$ order nodal Lagrangian tetrahedral finite elements ($P_N$ elements) can be generated using Pascal's tetrahedron $\mathcal{H}$ where each node in 3D element space corresponds to an entry in $\mathcal{H}$. For the…
The regular polyhedra have the highest order of 3D symmetries and are exceptionally at- tractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass…
This work presents a polyhedral scaled boundary finite element method (PSBFEM) for three dimensional seepage analysis. We first derive the scaled boundary formulation for 3D seepage problems, and subsequently incorporate Wachspress shape…
This paper presents the development of a complete CAD-compatible framework for structural shape optimization in 3D. The boundaries of the domain are described using NURBS while the interior is discretized with B\'ezier tetrahedra. The…
A simple and efficient interface-fitted mesh generation algorithm is developed in this paper. This algorithm can produce a local anisotropic fitting mixed mesh which consists of both triangles and quadrilaterals near the interface. A new…
We develop a new optimisation technique that combines multiresolution subdivision surfaces for boundary description with immersed finite elements for the discretisation of the primal and adjoint problems of optimisation. Similar to wavelets…
A family of quadratic finite volume method (FVM) schemes are constructed and analyzed over tetrahedral meshes. In order to prove stability and error estimate, we propose the minimum V-angle condition on tetrahedral meshes, and the surface…
I present a 3D advancing-front mesh refinement algorithm that generates a constrained Delaunay mesh for any piecewise linear complex (PLC) and extend this algorithm to produce truly Delaunay meshes for any PLC. First, as in my recently…