scientific article; zbMATH DE number 1174755
From MaRDI portal
Publication:4398027
DOI<651::AID-NME304>3.0.CO;2-P 10.1002/(SICI)1097-0207(19980228)41:4<651::AID-NME304>3.0.CO;2-PzbMath0905.65110MaRDI QIDQ4398027
Publication date: 14 July 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
numerical examplesunstructured meshesmesh optimizationtetrahedral mesh generationadvancing front technique
Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Related Items
A back-tracking procedure for optimization of simplex meshes ⋮ Boundary recovery for three dimensional conforming Delaunay triangulation ⋮ 2D and 3D finite element meshing and remeshing ⋮ Generation of finite element mesh with variable size over an unbounded 2D domain ⋮ Generation of tetrahedral mesh of variable element size by sphere packing over an unbounded 3D domain ⋮ Recent progress in robust and quality Delaunay mesh generation
Cites Work
- Adaptive remeshing for compressible flow computations
- Developments and trends in three-dimensional mesh generation
- Automatic mesh generator with specified boundary
- Delaunay triangulation of non-convex planar domains
- An apporach to automatic three-dimensional finite element mesh generation
- A simple error estimator and adaptive procedure for practical engineerng analysis
- Some useful data structures for the generation of unstructured grids
- Generation of three‐dimensional unstructured grids by the advancing‐front method
- Delaunay versus max-min solid angle triangulations for three-dimensional mesh generation
- Volume discretization into tetrahedra—I. Verification and orientation of boundary surfaces
- Volume discretization into tetrahedra—II. 3D triangulation by advancing front approach
- On advancing front mesh generation in three dimensions
- Generation of unstructured tetrahedral meshes by advancing front technique
- A combined octree/delaunay method for fully automatic 3‐D mesh generation
