Add to ORKGrithm that produces conforming locally refined simplicial meshes; Helsinki Univer
We propose a new method to mark for bisection the edges of an arbitrary three-dimensional unstructur...
We investigate parallel adaptive grid refinement and focus in particular on hierarchically adaptive,...
We propose a new method to mark for bisection the edges of an arbitrary 3D unstructured conformal me...
A simple local bisection refinement algorithm for the adaptive refinement of $n$-simplicial grids is...
We present a conformal bisection procedure for local refinement of 4D unstructured simplicial meshes...
We present a conformal bisection procedure for local refinement of 4D unstructured simplicial meshes...
We examine a generalized conforming bisection (GCB-)algorithm which allows both global and local nes...
Abstract We present an algorithm for the construction of locally adapted conformal tetrahedral mesh...
. We present an algorithm for the construction of locally adapted conformal tetrahedral meshes. The ...
AbstractWe examine a generalized conforming bisection (GCB-)algorithm which allows both global and l...
Numerical experiments in J. Maubach: Local bisection refinement and optimal order algebraic multilev...
Recently, in [Found. Comput. Math., 7(2) (2007), 245-269], we proved that an adaptive finite element...
Abstract. A simple criterion that allows the efficient local coarsening of triangulations created by...
In this paper we present a novel approach to the development of a class of local simplicial refineme...
With newest vertex bisection, there is no uniform bound on the number of n-simplices that need to be...
We propose a new method to mark for bisection the edges of an arbitrary three-dimensional unstructur...
We investigate parallel adaptive grid refinement and focus in particular on hierarchically adaptive,...
We propose a new method to mark for bisection the edges of an arbitrary 3D unstructured conformal me...
A simple local bisection refinement algorithm for the adaptive refinement of $n$-simplicial grids is...
We present a conformal bisection procedure for local refinement of 4D unstructured simplicial meshes...
We present a conformal bisection procedure for local refinement of 4D unstructured simplicial meshes...
We examine a generalized conforming bisection (GCB-)algorithm which allows both global and local nes...
Abstract We present an algorithm for the construction of locally adapted conformal tetrahedral mesh...
. We present an algorithm for the construction of locally adapted conformal tetrahedral meshes. The ...
AbstractWe examine a generalized conforming bisection (GCB-)algorithm which allows both global and l...
Numerical experiments in J. Maubach: Local bisection refinement and optimal order algebraic multilev...
Recently, in [Found. Comput. Math., 7(2) (2007), 245-269], we proved that an adaptive finite element...
Abstract. A simple criterion that allows the efficient local coarsening of triangulations created by...
In this paper we present a novel approach to the development of a class of local simplicial refineme...
With newest vertex bisection, there is no uniform bound on the number of n-simplices that need to be...
We propose a new method to mark for bisection the edges of an arbitrary three-dimensional unstructur...
We investigate parallel adaptive grid refinement and focus in particular on hierarchically adaptive,...
We propose a new method to mark for bisection the edges of an arbitrary 3D unstructured conformal me...