Graph-based data structures for skeleton-based refinement algorithms

DOI10.1002/cnm.460zbMath0995.65126OpenAlexW1997152374MaRDI QIDQ2781036

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

Publication date: 14 March 2002

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

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

zbMATH Keywords

algorithmsnumerical examplesunstructured meshestriangulationsdata structuresmesh refinementskeletonedge bisection

Mathematics Subject Classification ID

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

Related Items (5)

Four-triangles adaptive algorithms for RTIN terrain meshes ⋮ Adaptive techniques for unstructured nested meshes ⋮ A dynamic adaptation scheme for general 3-D hybrid meshes ⋮ Longest-edge \(n\)-section algorithms: properties and open problems ⋮ Local refinement based on the 7-triangle longest-edge partition

Cites Work

• Local refinement of simplicial grids based on the skeleton
• Mesh Refinement Processes Based on the Generalized Bisection of Simplices

This page was built for publication: Graph-based data structures for skeleton-based refinement algorithms