Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time

DOI10.1002/NME.5752MaRDI QIDQ6569247zbMATH OpenFDO

Authors Qihua Zhang, Shao-Zhong Lin, Xiuli Ding, Aiqing Wu

Publication date 8 July 2024

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

zbMATH Keywords

Steiner pointsdiscrete fracture networkclosed conetriangulation of polyhedrapolygon of adjacent vertices

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Polyhedral manifolds (52B70) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Recommendations

• Simplicial mesh of an arbitrary polyhedron.
• scientific article; zbMATH DE number 2123350
• Convex polyhedra with triangular faces and cone triangulation
• Consistent Subdivision of Convex Polyhedra into Tetrahedra
• A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points

Cites work

• scientific article; zbMATH DE number 1716503 (Why is no real title available?)
• 3D Delaunay mesh generation coupled with an advancing-front approach
• 3D mesh adaptation. Optimization of tetrahedral meshes by advancing front technique
• A combined octree/delaunay method for fully automatic 3‐D mesh generation
• A novel scheme to generate meshes with hexahedral elements and poly-pyramid elements: the carving technique
• An algorithm for three-dimensional mesh generation for arbitrary regions with cracks
• Approximate convex decomposition of polyhedra and its applications
• Constrained boundary recovery for three dimensional Delaunay triangulations
• Construction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations
• Convex Decomposition of Polyhedra and Robustness
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• Erased arrangements of linear and convex decompositions of polyhedra
• Fast Delaunay triangulation in three dimensions
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation
• Three-dimensional unstructured mesh generation. III: Volume meshes
• Triangulating a nonconvex polytope
• Triangulating a simple polygon in linear time
• Über die Zerlegung von Dreieckspolyedern in Tetraeder.

This page was built for publication: Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time

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