Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions

DOI10.1002/NME.1620370409zbMATH Open0800.73472OpenAlexW2020018820MaRDI QIDQ4285100FDOQ4285100

Authors: Barry Joe 

Publication date: 24 March 1994

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nme.1620370409

Mathematics Subject Classification ID

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) Finite element methods applied to problems in solid mechanics (74S05)

Cites Work

• Construction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations

Cited In (9)

• Remeshing for metal forming simulations?Part II: Three-dimensional hexahedral mesh generation
• Approximate convex decomposition of polyhedra and its applications
• 3D boundary recovery by constrained Delaunay tetrahedralization
• Erased arrangements of linear and convex decompositions of polyhedra
• UNSTRUCTURED MESH GENERATION: THEORY, PRACTICE, AND PERSPECTIVES
• Geometry update driven by material forces for simulation of brittle crack growth in functionally graded materials
• Relationship between tetrahedron shape measures
• 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
• Tetrahedral meshes from planar cross-sections

This page was built for publication: Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions

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