Introduction to the special issue on high performance computing solutions for complex problems
Abstract
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.
Collections
Except where otherwise noted, this item's license is described as Reconocimiento-NoComercial-CompartirIgual 3.0 España