In this work we present a survey of some geometric results on tetrahedral partitions and their refinements in a unified manner. They can be used for mesh generation and adaptivity in practical calculations by the finite element method (FEM), and also in theoretical finite element (FE) analysis. Special emphasis is laid on the correspondence between relevant results and terminology used in FE computations, and those established in the area of discrete and computational geometry (DCG)
A {\it constrained Delaunay tetrahedralization} of a domain in $\mathbb{R}^3$ is a tetrahedralizatio...
AbstractPreservation of basic qualitative properties (for example, the maximum principle) ofthe solu...
summary:Linear tetrahedral finite elements whose dihedral angles are all nonobtuse guarantee the val...
In this work we present a survey of some geometric results on tetrahedral partitions and their refin...
In this work we present a survey of some geometric results on tetrahedral partitions and their refin...
It is known that piecewise linear continuous finite element (FE) approximations on nonobtuse tetrahe...
summary:Linear tetrahedral finite elements whose dihedral angles are all nonobtuse guarantee the val...
summary:Linear tetrahedral finite elements whose dihedral angles are all nonobtuse guarantee the val...
It is known that piecewise linear continuous finite element (FE) approximations on nonobtuse tetrahe...
AbstractPreservation of basic qualitative properties (for example, the maximum principle) ofthe solu...
We present an algorithm for conform (face-to-face) subdividing prismatic partitions into tetrahedra....
In this note we show how to generate and conformly refine nonobtuse tetrahedral meshes locally aroun...
In this note we show how to generate and conformally refine nonobtuse tetrahedral meshes locally in ...
This investigation examines the quality of finite element analysis (FEA) results based on the use of...
A it constrained Delaunay tetrahedralization of a domain in $mathbbR^3$ is a tetrahedralization such...
A {\it constrained Delaunay tetrahedralization} of a domain in $\mathbb{R}^3$ is a tetrahedralizatio...
AbstractPreservation of basic qualitative properties (for example, the maximum principle) ofthe solu...
summary:Linear tetrahedral finite elements whose dihedral angles are all nonobtuse guarantee the val...
In this work we present a survey of some geometric results on tetrahedral partitions and their refin...
In this work we present a survey of some geometric results on tetrahedral partitions and their refin...
It is known that piecewise linear continuous finite element (FE) approximations on nonobtuse tetrahe...
summary:Linear tetrahedral finite elements whose dihedral angles are all nonobtuse guarantee the val...
summary:Linear tetrahedral finite elements whose dihedral angles are all nonobtuse guarantee the val...
It is known that piecewise linear continuous finite element (FE) approximations on nonobtuse tetrahe...
AbstractPreservation of basic qualitative properties (for example, the maximum principle) ofthe solu...
We present an algorithm for conform (face-to-face) subdividing prismatic partitions into tetrahedra....
In this note we show how to generate and conformly refine nonobtuse tetrahedral meshes locally aroun...
In this note we show how to generate and conformally refine nonobtuse tetrahedral meshes locally in ...
This investigation examines the quality of finite element analysis (FEA) results based on the use of...
A it constrained Delaunay tetrahedralization of a domain in $mathbbR^3$ is a tetrahedralization such...
A {\it constrained Delaunay tetrahedralization} of a domain in $\mathbb{R}^3$ is a tetrahedralizatio...
AbstractPreservation of basic qualitative properties (for example, the maximum principle) ofthe solu...
summary:Linear tetrahedral finite elements whose dihedral angles are all nonobtuse guarantee the val...