A comparative study between some bisection based partitions in 3D

DOI10.1016/j.apnum.2005.04.035zbMath1087.65615OpenAlexW2156516460MaRDI QIDQ2573278

Miguel A. Padrón, José P. Suárez, Ángel Plaza

Publication date: 7 November 2005

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2005.04.035

zbMATH Keywords

numerical examplesadaptivitymesh refinementtetrahedral grids

Mathematics Subject Classification ID

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

Related Items (7)

Properties of triangulations obtained by the longest-edge bisection ⋮ On Numerical Regularity of Trisection-Based Algorithms in 3D ⋮ The eight-tetrahedra longest-edge partition and Kuhn triangulations ⋮ The 8T-LE Partition Applied to the Barycentric Division of a 3-D Cube ⋮ Partition of unity refinement for local approximation ⋮ The 8T-LE partition applied to the obtuse triangulations of the 3D-cube ⋮ Similarity classes generated by the 8T-LE partition applied to trirectangular tetrahedra

Cites Work

• A recursive approach to local mesh refinement in two and three dimensions
• Local refinement of simplicial grids based on the skeleton
• A grid generator based on 4-triangles conforming mesh-refinement algorithms
• Local mesh refinement in 2 and 3 dimensions
• Optimal Multilevel Iterative Methods for Adaptive Grids
• A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
• ON GOOD TRIANGULATIONS IN THREE DIMENSIONS
• On the Shape of Tetrahedra from Bisection
• Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
• A comparison of adaptive refinement techniques for elliptic problems
• Quality Local Refinement of Tetrahedral Meshes Based on Bisection
• Simple algorithm for adaptive refinement of three-dimensional finite element tetrahedral meshes

This page was built for publication: A comparative study between some bisection based partitions in 3D