Graph-based data structures for skeleton-based refinement algorithms

DOI10.1002/CNM.460MaRDI QIDQ2781036zbMATH OpenOpenAlexFDO

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

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

algorithmsdata structuresedge bisectionmesh refinementnumerical examplesskeletontriangulationsunstructured meshes

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2029425
• scientific article; zbMATH DE number 1744982
• Graph realizations constrained by skeleton graphs
• scientific article; zbMATH DE number 3848560
• Local refinement of simplicial grids based on the skeleton
• Skeleton based solid representation with topology preservation

Cites work

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

Cited in

(6)

• Local refinement based on the 7-triangle longest-edge partition
• Adaptive techniques for unstructured nested meshes
• Four-triangles adaptive algorithms for RTIN terrain meshes
• A dynamic adaptation scheme for general 3-D hybrid meshes
• scientific article; zbMATH DE number 2029425 (Why is no real title available?)
• Longest-edge \(n\)-section algorithms: properties and open problems

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

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