Efficient data structures for adaptive remeshing with the FEM
From MaRDI portal
Publication:2639620
DOI10.1016/0021-9991(90)90006-MzbMath0718.65078MaRDI QIDQ2639620
Philippe A. Tanguy, H. H. Dannelongue
Publication date: 1990
Published in: Journal of Computational Physics (Search for Journal in Brave)
65N30: Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs
65N50: Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs
Related Items
Three‐dimensional adaptive finite element computations and applications to non‐Newtonian fluids, Finite element solution for advection-dominated thermal flows, A framework for advancing front techniques of finite element mesh generation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adaptive remeshing for compressible flow computations
- Algorithms for interpolation and localization in irregular 2D meshes
- Efficient worst-case data structures for range searching
- Automatic three-dimensional mesh generation by the modified-octree technique
- A new mesh generation scheme for arbitrary planar domains
- Some useful data structures for the generation of unstructured grids
- A Lower Bound on the Complexity of Orthogonal Range Queries
- Adaptive mesh refinement processes for finite element solutions
- Computing Dirichlet Tessellations in the Plane
- Automatic triangulation of arbitrary planar domains for the finite element method