Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time
DOI10.1002/NME.5752zbMATH Open1548.6538MaRDI QIDQ6569247FDOQ6569247
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)
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
Steiner pointsdiscrete fracture networkclosed conetriangulation of polyhedrapolygon of adjacent vertices
Computational aspects related to convexity (52B55) Polyhedral manifolds (52B70) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Cites Work
- Triangulating a simple polygon in linear time
- Triangulating a nonconvex polytope
- Construction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations
- An algorithm for three-dimensional mesh generation for arbitrary regions with cracks
- A novel scheme to generate meshes with hexahedral elements and poly-pyramid elements: the carving technique
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- Fast Delaunay triangulation in three dimensions
- A combined octree/delaunay method for fully automatic 3‐D mesh generation
- Title not available (Why is that?)
- Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation
- Constrained boundary recovery for three dimensional Delaunay triangulations
- Convex Decomposition of Polyhedra and Robustness
- 3D Delaunay mesh generation coupled with an advancing-front approach
- On the difficulty of triangulating three-dimensional nonconvex polyhedra
- Approximate convex decomposition of polyhedra and its applications
- Erased arrangements of linear and convex decompositions of polyhedra
- 3D mesh adaptation. Optimization of tetrahedral meshes by advancing front technique
- Three-dimensional unstructured mesh generation. III: Volume meshes
- Ü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)
