Breakthrough `workarounds' in unstructured mesh generation
type: Item
instance of: scholarly article
title: Breakthrough `workarounds' in unstructured mesh generation
DOI: 10.1007/978-3-030-92540-6_12
author: Rainald Löhner
publication date: 2022-10-31T00:00:00Z
Mathematics Subject Classification ID: 65N50
Mathematics Subject Classification ID: 65M50
zbMATH DE Number: 7609732
MaRDI profile type: Publication
full work available at URL: 978-3-030-92540-6 12
OpenAlex ID: W4285113090
cites work: Q3999760
cites work: Generation of viscous grids at ridges and corners
cites work: Developments and trends in three-dimensional mesh generation
cites work: Reliable Delaunay‐based mesh generation and mesh improvement
cites work: Q4229816
cites work: Automatic triangulation of arbitrary planar domains for the finite element method
cites work: An apporach to automatic three-dimensional finite element mesh generation
cites work: Improved boundary constrained tetrahedral mesh generation by shell transformation
cites work: Triangulation of scattered data in 3D space
cites work: Selective refinement: A new strategy for automatic node placement in graded triangular meshes
cites work: Mesh generation. Application to finite elements. Transl. from the 1999 French original by the authors
cites work: Fully automatic mesh generator for 3D domains of any shape
cites work: Q4004085
cites work: Automatic mesh generator with specified boundary
cites work: Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra
cites work: Q3838008
cites work: Mesh generation and adaptivity for the solution of compressible viscous high speed flows
cites work: Q4871652
cites work: Generation of unstructured tetrahedral meshes by advancing front technique
cites work: Construction of three-dimensional Delaunay triangulations using local transformations
cites work: Delaunay versus max-min solid angle triangulations for three-dimensional mesh generation
cites work: Two algorithms for constructing a Delaunay triangulation
cites work: A new mesh generation scheme for arbitrary planar domains
cites work: Finite element mesh generation over curved surfaces
cites work: Generation of three‐dimensional unstructured grids by the advancing‐front method
cites work: Adaptive h‐refinement on 3D unstructured grids for transient problems
cites work: Parallel unstructured grid generation
cites work: Automatic unstructured grid generators
cites work: An advancing front technique for filling space with arbitrary separated objects
cites work: Unstructured grid generation using iterative point insertion and local reconnection
cites work: An advancing front Delaunay triangulation algorithm designed for robustness
cites work: Adaptive remeshing for compressible flow computations
cites work: Finite element Euler computations in three dimensions
cites work: Adaptive remeshing for three-dimensional compressible flow computations
cites work: Efficient unstructured mesh generation by means of Delaunay triangulation and Bowyer-Watson algorithm
cites work: Automatic three‐dimensional mesh generation by the finite octree technique
cites work: A new algorithm for three-dimensional Voronoi tessellation
cites work: Automatic mesh generation with tetrahedron elements
cites work: Enhanced remeshing from STL files with applications to surface grid generation
cites work: Delaunay triangulation in computational fluid dynamics
cites work: Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
cites work: Tailoring unstructured meshes for use with a 3D time domain co-volume algorithm for computational electromagnetics
cites work: Automatic three-dimensional mesh generation by the modified-octree technique
description: scientific article; zbMATH DE number 7609732