Now showing items 1-2 of 2
On the maximum angle condition for the conforming longest-edge n-section algorithm for large values of n
In this note we introduce the conforming longest-edge $n$-section algorithm and show that for $n \ge 4$ it produces a family of triangulations which does not satisfy the maximum angle condition.
Red refinements of simplices into congruent subsimplices
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 ...