On a bisection algorithm that produces conforming locally refined simplicial meshes
From MaRDI portal
Publication:3069563
Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Recommendations
- Locally Adapted Tetrahedral Meshes Using Bisection
- Mesh Refinement Processes Based on the Generalized Bisection of Simplices
- On global and local mesh refinements by a generalized conforming bisection algorithm
- The completion of locally refined simplicial partitions created by bisection
- Local mesh refinement in 2 and 3 dimensions
Cited in
(8)- Locally Adapted Tetrahedral Meshes Using Bisection
- Longest-edge \(n\)-section algorithms: properties and open problems
- The completion of locally refined simplicial partitions created by bisection
- Local coarsening of simplicial finite element meshes generated by bisections
- A mesh partitioning algorithm for preserving spatial locality in arbitrary geometries
- On global and local mesh refinements by a generalized conforming bisection algorithm
- Local Refinement of 3D-Meshes Consisting of Prisms and Conforming Closure
- Mesh Refinement Processes Based on the Generalized Bisection of Simplices
This page was built for publication: On a bisection algorithm that produces conforming locally refined simplicial meshes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3069563)