Automatic mesh generator with specified boundary
From MaRDI portal
Publication:1191976
DOI10.1016/0045-7825(91)90017-ZzbMath0756.65133MaRDI QIDQ1191976
Eric Saltel, Frederic Hecht, Paul-Louis George
Publication date: 27 September 1992
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
finite element methodautomatic mesh generationboundary fittingDelaunay tesselationDirichlet triangulationVoronoi's method
Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Related Items (50)
Automatic structured mesh generation around two-dimensional bodies defined by polylines or polyC1 curves ⋮ Simplicial mesh of an arbitrary polyhedron. ⋮ OPTIMAL DELAUNAY POINT INSERTION ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Redesign of a conformal boundary recovery algorithm for 3D Delaunay triangulation ⋮ Recent advances in parallel advancing front grid generation ⋮ 3D simulation of fluid-particle interactions with the number of particles reaching 100 ⋮ Locally implicit discontinuous Galerkin method for time domain electromagnetics ⋮ 3D mesh adaptation. Optimization of tetrahedral meshes by advancing front technique ⋮ Three-dimensional unstructured mesh generation. III: Volume meshes ⋮ Analysis and verification of the boundary surfaces of solid objects ⋮ Unnamed Item ⋮ Investigation on polynomial integrators for time-domain electromagnetics using a high-order discontinuous Galerkin method ⋮ Multithread parallelization of LEPP-bisection algorithms ⋮ An iterative method for the creation of structured hexahedral meshes over complex orography ⋮ A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points ⋮ A three-dimensional boundary element approach to confined free-surface flow as applied to die casting ⋮ Variational Delaunay approach to the generation of tetrahedral finite element meshes ⋮ Automatic mesh generation on a regular background grid. ⋮ The reconstruction of boundary contours and surfaces in arbitrary unstructured triangular and tetrahedral grids ⋮ High-order discontinuous Galerkin method for time-domain electromagnetics on non-conforming hybrid meshes ⋮ Automatic, unstructured mesh generation for tidal calculations in a large domain ⋮ A novel energy-based approach for merging finite elements ⋮ Variational surface reconstruction based on Delaunay triangulation and graph cut ⋮ 3D boundary recovery by constrained Delaunay tetrahedralization ⋮ A domain decomposition method for solving the three-dimensional time-harmonic Maxwell equations discretized by discontinuous Galerkin methods ⋮ Delaunay triangulation in computational fluid dynamics ⋮ H-Morph: an indirect approach to advancing front hex meshing ⋮ Tetrahedral mesh optimisation and adaptivity for steady-state and transient finite element calculations ⋮ Boundary recovery for three dimensional conforming Delaunay triangulation ⋮ Generation of non-isotropic unstructured grids via directional enrichment ⋮ 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 ⋮ An advancing front point generation technique ⋮ Parallel discontinuous Galerkin unstructured mesh solvers for the calculation of three-dimen\-sion\-al wave propagation problems ⋮ Adjoint a posteriori error measures for anisotropic mesh optimisation ⋮ Improved boundary constrained tetrahedral mesh generation by shell transformation ⋮ Universal software packages to model the distributed-parameter systems ⋮ An advancing front technique for filling space with arbitrary separated objects ⋮ An automatic strategy for adaptive tetrahedral mesh generation ⋮ Gmsh: A 3-D finite element mesh generator with built-in pre- and post-processing facilities ⋮ Fast Delaunay triangulation in three dimensions ⋮ Breakthrough `workarounds' in unstructured mesh generation ⋮ Fast dynamic grid deformation based on Delaunay graph mapping ⋮ Unnamed Item ⋮ Mesh generation over curved surfaces with explicit control on discretization error ⋮ TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator
Uses Software
Cites Work
- Unnamed Item
- Complementary error bounds for foolproof finite element mesh generation
- The reconstruction of boundary contours and surfaces in arbitrary unstructured triangular and tetrahedral grids
- Triangulation automatique d’un polyèdre en dimension $N$
- Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra
- Fully automatic mesh generator for 3D domains of any shape
This page was built for publication: Automatic mesh generator with specified boundary