Propagation of longest-edge mesh patterns in local adaptive refinement

DOI10.1002/cnm.956zbMath1145.65106OpenAlexW2064553666MaRDI QIDQ3515054

José P. Suárez, Ángel Plaza, Graham F. Carey

Publication date: 24 July 2008

Published in: Communications in Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cnm.956

zbMATH Keywords

numerical examplesadaptive mesh refinementgraphical exampleslongest edge propagation statistics

Mathematics Subject Classification ID

Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items (5)

Hamiltonian triangular refinements and space-filling curves ⋮ Four-triangles adaptive algorithms for RTIN terrain meshes ⋮ On the non-degeneracy property of the longest-edge trisection of triangles ⋮ Longest-edge \(n\)-section algorithms: properties and open problems ⋮ Local refinement based on the 7-triangle longest-edge partition

Uses Software

• PLTMG

Cites Work

• Unnamed Item
• A mesh-refinement scheme for finite element computations
• Mesh quality improvement and other properties in the four-triangles longest-edge partition
• A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
• Parallel Algorithms for Adaptive Mesh Refinement
• Improving the quality of meshes for the simulation of semiconductor devices using Lepp‐based algorithms
• The 4-triangles longest-side partition of triangles and linear refinement algorithms

This page was built for publication: Propagation of longest-edge mesh patterns in local adaptive refinement