Breakthrough `workarounds' in unstructured mesh generation
From MaRDI portal
Publication:2090700
DOI10.1007/978-3-030-92540-6_12OpenAlexW4285113090MaRDI QIDQ2090700FDOQ2090700
Authors: Rainald Löhner 
Publication date: 31 October 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92540-6_12
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Two algorithms for constructing a Delaunay triangulation
- Adaptive remeshing for three-dimensional compressible flow computations
- Delaunay triangulation in computational fluid dynamics
- Adaptive remeshing for compressible flow computations
- Tailoring unstructured meshes for use with a 3D time domain co-volume algorithm for computational electromagnetics
- Automatic three-dimensional mesh generation by the modified-octree technique
- Automatic three‐dimensional mesh generation by the finite octree technique
- Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
- Developments and trends in three-dimensional mesh generation
- Parallel unstructured grid generation
- Automatic mesh generator with specified boundary
- An advancing front Delaunay triangulation algorithm designed for robustness
- Generation of viscous grids at ridges and corners
- An apporach to automatic three-dimensional finite element mesh generation
- Finite element Euler computations in three dimensions
- Generation of three‐dimensional unstructured grids by the advancing‐front method
- Unstructured grid generation using iterative point insertion and local reconnection
- Generation of unstructured tetrahedral meshes by advancing front technique
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient unstructured mesh generation by means of Delaunay triangulation and Bowyer-Watson algorithm
- Adaptive h‐refinement on 3D unstructured grids for transient problems
- Title not available (Why is that?)
- Mesh generation. Application to finite elements. Transl. from the 1999 French original by the authors
- A new algorithm for three-dimensional Voronoi tessellation
- A new mesh generation scheme for arbitrary planar domains
- Construction of three-dimensional Delaunay triangulations using local transformations
- Fully automatic mesh generator for 3D domains of any shape
- Selective refinement: A new strategy for automatic node placement in graded triangular meshes
- Delaunay versus max-min solid angle triangulations for three-dimensional mesh generation
- Automatic triangulation of arbitrary planar domains for the finite element method
- Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra
- Finite element mesh generation over curved surfaces
- Automatic unstructured grid generators
- Enhanced remeshing from STL files with applications to surface grid generation
- Automatic mesh generation with tetrahedron elements
- Triangulation of scattered data in 3D space
- Reliable Delaunay‐based mesh generation and mesh improvement
- Improved boundary constrained tetrahedral mesh generation by shell transformation
- An advancing front technique for filling space with arbitrary separated objects
- Mesh generation and adaptivity for the solution of compressible viscous high speed flows
Cited In (1)
This page was built for publication: Breakthrough `workarounds' in unstructured mesh generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2090700)
