We show that in dimensions higher than two, the popular "red refinement" technique, commonly used for simplicial mesh refinements and adaptivity in the finite element analysis and practice, never yields subsimplices which are all acute even for an acute father element as opposed to the two-dimensional case. In the three-dimensional case we prove that there exists only one tetrahedron that can be partitioned by red refinement into eight congruent subtetrahedra that are all similar to the original one.

EUDML-ID : urn:eudml:doc:287856
Mots clés:
Mots clés:

@article{702939,
     title = {On simplicial red refinement in three and higher dimensions},
     booktitle = {Applications of Mathematics 2013},
     series = {GDML\_Books},
     publisher = {Institute of Mathematics AS CR},
     address = {Prague},
     year = {2013},
     pages = {131-139},
     mrnumber = {MR3204438},
     zbl = {1340.65271},
     url = {http://dml.mathdoc.fr/item/702939}
}

Korotov, Sergey; Křížek, Michal. On simplicial red refinement in three and higher dimensions, dans Applications of Mathematics 2013, GDML_Books,  (2013), pp. 131-139. http://gdmltest.u-ga.fr/item/702939/