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

DOI10.2514/3.12386MaRDI QIDQ4865825zbMATH OpenOpenAlexFDO

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

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)

Cited in

(11)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4865825)