Improved boundary constrained tetrahedral mesh generation by shell transformation

DOI10.1016/J.APM.2017.07.011zbMATH Open1480.65360OpenAlexW2738883231MaRDI QIDQ2294804FDOQ2294804

Authors: Jianjing Zheng, Yao Zheng, Hang Si, Oubay Hassan, Kenneth Morgan, Jianjun Chen 

Publication date: 12 February 2020

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://cronfa.swan.ac.uk/Record/cronfa34757

Recommendations

• Robust and quality boundary constrained tetrahedral mesh generation
• Constrained boundary recovery for three dimensional Delaunay triangulations
• scientific article; zbMATH DE number 5239200
• CONSTRAINED QUADRILATERAL MESHES OF BOUNDED SIZE
• Boundary recovery after 3D Delaunay tetrahedralization without adding extra nodes

zbMATH Keywords

Delaunay triangulationSteiner pointsmesh generationtetrahedral meshesboundary recoveryshell transformation

Mathematics Subject Classification ID

Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Cites Work

• TetGen, a Delaunay-based quality tetrahedral mesh generator
• Enabling technologies in the problem solving environment HEDP
• Title not available (Why is that?)
• Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
• Automatic mesh generator with specified boundary
• Improvements on Delaunay-based three-dimensional automatic mesh generator
• Distributed parallel Delaunay mesh generation
• Parallel remeshing of unstructured volume grids for CFD applications
• Domain decomposition approach for parallel unstructured mesh generation
• Construction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations
• Unstructured mesh procedures for the simulation of three-dimensional transient compressible inviscid flows with moving boundary components
• Title not available (Why is that?)
• Minimal Triangulations of Polygonal Domains
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• ?Ultimate? robustness in meshing an arbitrary polyhedron
• Constrained boundary recovery for three dimensional Delaunay triangulations
• Boundary recovery for three dimensional conforming Delaunay triangulation
• Boundary recovery after 3D Delaunay tetrahedralization without adding extra nodes
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Three-dimensional unstructured mesh generation. III: Volume meshes
• Title not available (Why is that?)
• 3D boundary recovery by constrained Delaunay tetrahedralization
• Mesh generation and adaptivity for the solution of compressible viscous high speed flows
• Small polyhedron reconnection for mesh improvement and its implementation based on advancing front technique
• Redesign of a conformal boundary recovery algorithm for 3D Delaunay triangulation
• Improvements in the reliability and element quality of parallel tetrahedral mesh generation
• The boundary recovery and sliver elimination algorithms of three‐dimensional constrained Delaunay triangulation

Cited In (2)

• Constructing volumetric parameterization based on directed graph simplification of \(\ell_1\) polycube structure from complex shapes
• Breakthrough `workarounds' in unstructured mesh generation

Uses Software

• TetGen
• HEDP

This page was built for publication: Improved boundary constrained tetrahedral mesh generation by shell transformation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294804)