Simple algorithm for adaptive refinement of three-dimensional finite element tetrahedral meshes

DOI10.2514/3.12386zbMath0850.73272OpenAlexW2087191299MaRDI QIDQ4865825

K. L. Lawrence, P. S. Shiakolas, S. N. Muthukrishnan, R. V. Nambiar

Publication date: 17 July 1996

Published in: AIAA Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2514/3.12386

Mathematics Subject Classification ID

Finite element methods applied to problems in solid mechanics (74S05)

Related Items (11)

Refinement based on longest-edge and self-similar four-triangle partitions ⋮ Multithread parallelization of LEPP-bisection algorithms ⋮ 3D adaptive mesh refinement ⋮ Scalable parallel implementation of CISAMR: a non-iterative mesh generation algorithm ⋮ Error estimates and adaptive finite element methods ⋮ 2D and 3D finite element meshing and remeshing ⋮ Longest-edge \(n\)-section algorithms: properties and open problems ⋮ Lepp-bisection algorithms, applications and mathematical properties ⋮ A comparative study between some bisection based partitions in 3D ⋮ On the adjacencies of triangular meshes based on skeleton-regular partitions ⋮ A new element bisection algorithm for unstructured adaptive tetrahedral mesh generation

This page was built for publication: Simple algorithm for adaptive refinement of three-dimensional finite element tetrahedral meshes