Previous |  Up |  Next


mesh refinement; longest-edge bisection; right-triangulated irregular network; balanced quadrant tree; homomorphic transformation
Longest-edge bisection algorithms are often used for local mesh refinements within the finite element method in 2D. In this paper, we discuss and describe their conforming variant. A particular attention is devoted to the so-called Right-Triangulated Irregular Network (RTIN) based on isosceles right triangles and its tranformation to more general domains. We suggest to combine RTIN with a balanced quadrant tree (QuadTree) decomposition. This combination does not produce hanging nodes within the mesh refinements and could be extended to tetrahedral meshes in 3D.
Partner of
EuDML logo