RTIN-based strategies for local mesh refinement

Kolcun, Alexej; Sysala, Stanislav

  • Programs and Algorithms of Numerical Mathematics, Publisher: Institute of Mathematics CAS(Prague), page 59-68

Abstract

top
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.

How to cite

top

Kolcun, Alexej, and Sysala, Stanislav. "RTIN-based strategies for local mesh refinement." Programs and Algorithms of Numerical Mathematics. Prague: Institute of Mathematics CAS, 2021. 59-68. <http://eudml.org/doc/296850>.

@inProceedings{Kolcun2021,
abstract = {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.},
author = {Kolcun, Alexej, Sysala, Stanislav},
booktitle = {Programs and Algorithms of Numerical Mathematics},
keywords = {mesh refinement; longest-edge bisection; right-triangulated irregular network; balanced quadrant tree; homomorphic transformation},
location = {Prague},
pages = {59-68},
publisher = {Institute of Mathematics CAS},
title = {RTIN-based strategies for local mesh refinement},
url = {http://eudml.org/doc/296850},
year = {2021},
}

TY - CLSWK
AU - Kolcun, Alexej
AU - Sysala, Stanislav
TI - RTIN-based strategies for local mesh refinement
T2 - Programs and Algorithms of Numerical Mathematics
PY - 2021
CY - Prague
PB - Institute of Mathematics CAS
SP - 59
EP - 68
AB - 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.
KW - mesh refinement; longest-edge bisection; right-triangulated irregular network; balanced quadrant tree; homomorphic transformation
UR - http://eudml.org/doc/296850
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.