A new element bisection algorithm for unstructured adaptive tetrahedral mesh generation
From MaRDI portal
Publication:4241289
error boundsnumerical examplesfinite element methodtetrahedral elementsbisection algorithmadaptive mesh geneation
Boundary value problems for second-order elliptic equations (35J25) Error bounds for boundary value problems involving PDEs (65N15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Recommendations
Cites work
- A simple error estimator and adaptive procedure for practical engineerng analysis
- A study of adaptively remeshed finite element problems using higher order tetrahedra
- An approach to refining three‐dimensional tetrahedral meshes based on Delaunay transformations
- Simple algorithm for adaptive refinement of three-dimensional finite element tetrahedral meshes
Cited in
(9)- Locally Adapted Tetrahedral Meshes Using Bisection
- Locally refined tetrahedral mesh generation based on advancing front technique with optimization and smoothing scheme
- Adaptive tetrahedral mesh generation by constrained centroidal Voronoi-Delaunay tessellations for finite element methods
- scientific article; zbMATH DE number 822233 (Why is no real title available?)
- scientific article; zbMATH DE number 926631 (Why is no real title available?)
- New aspects of the CISAMR algorithm for meshing domain geometries with sharp edges and corners
- Error estimates and adaptive finite element methods. A bibliography (1990--2000)
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
- scientific article; zbMATH DE number 1405501 (Why is no real title available?)
This page was built for publication: A new element bisection algorithm for unstructured adaptive tetrahedral mesh generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4241289)