We devise a generalization of tree approximation that generates conforming meshes, i.e., meshes with a particular structure like edge-to-edge triangulations. A key feature of this generalization is that the choices of the cells to be subdivided are affected by that particular structure. As main result, we prove near best approximation with respect to conforming meshes, independent of constants like the completion constant for newest-vertex bisection. Numerical experiments complement the theoretical results and indicate better approximation properties than previous approaches.Comment: 18 pages, 2 figure
We consider the approximate solution with adaptive finite elements of a class of linear boundary val...
We propose a new method to mark for bisection the edges of an arbitrary 3D unstructured conformal me...
We present two complementary methods for automati-cally improving mesh parameterizations and demonst...
To improve the quality of the results of a numerical simulation with a finite element method, mesh r...
AbstractWe examine a generalized conforming bisection (GCB-)algorithm which allows both global and l...
Conformal mesh refinement has gained much attention as a necessary preprocessing step for the finite...
Adaptive mesh refinement (AMR) suffers from the problem of hanging faces in regions where elements o...
In this paper, the quadtree data structure and conforming polygonal interpolants are used to develop...
Changement dans la version 2 : compilé avec hyperref pour une meilleure consultation sur écran.Mesh ...
AbstractWe propose a new strategy for boundary conforming meshing that decouples the problem of buil...
* This work has been supported by the Office of Naval Research Contract Nr. N0014-91-J1343, the Army...
We prove convergence and optimal complexity of an adaptive finite element algorithm on quadrilateral...
Recently, in [Found. Comput. Math., 7(2) (2007), 245-269], we proved that an adaptive finite element...
. We present an algorithm for the construction of locally adapted conformal tetrahedral meshes. The ...
Topological mesh adaptivity can be required in problems involving large displacements or de-formatio...
We consider the approximate solution with adaptive finite elements of a class of linear boundary val...
We propose a new method to mark for bisection the edges of an arbitrary 3D unstructured conformal me...
We present two complementary methods for automati-cally improving mesh parameterizations and demonst...
To improve the quality of the results of a numerical simulation with a finite element method, mesh r...
AbstractWe examine a generalized conforming bisection (GCB-)algorithm which allows both global and l...
Conformal mesh refinement has gained much attention as a necessary preprocessing step for the finite...
Adaptive mesh refinement (AMR) suffers from the problem of hanging faces in regions where elements o...
In this paper, the quadtree data structure and conforming polygonal interpolants are used to develop...
Changement dans la version 2 : compilé avec hyperref pour une meilleure consultation sur écran.Mesh ...
AbstractWe propose a new strategy for boundary conforming meshing that decouples the problem of buil...
* This work has been supported by the Office of Naval Research Contract Nr. N0014-91-J1343, the Army...
We prove convergence and optimal complexity of an adaptive finite element algorithm on quadrilateral...
Recently, in [Found. Comput. Math., 7(2) (2007), 245-269], we proved that an adaptive finite element...
. We present an algorithm for the construction of locally adapted conformal tetrahedral meshes. The ...
Topological mesh adaptivity can be required in problems involving large displacements or de-formatio...
We consider the approximate solution with adaptive finite elements of a class of linear boundary val...
We propose a new method to mark for bisection the edges of an arbitrary 3D unstructured conformal me...
We present two complementary methods for automati-cally improving mesh parameterizations and demonst...