Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time
type: Item
instance of: scholarly article
title: Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time
zbMATH Open document ID: 1548.6538
author: Qihua Zhang
author: Shao-Zhong Lin
author: Xiuli Ding
author: Aiqing Wu
published in: International Journal for Numerical Methods in Engineering
publication date: 2024-07-08T00:00:00Z
Mathematics Subject Classification ID: 65N50
Mathematics Subject Classification ID: 52B55
Mathematics Subject Classification ID: 52B70
zbMATH DE Number: 7878345
zbMATH Keywords: closed cone
zbMATH Keywords: discrete fracture network
zbMATH Keywords: polygon of adjacent vertices
zbMATH Keywords: Steiner points
zbMATH Keywords: triangulation of polyhedra
MaRDI profile type: Publication
cites work: On the difficulty of triangulating three-dimensional nonconvex polyhedra
cites work: Triangulating a simple polygon in linear time
cites work: Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
cites work: Triangulating a nonconvex polytope
cites work: Convex Decomposition of Polyhedra and Robustness
cites work: Über die Zerlegung von Dreieckspolyedern in Tetraeder.
cites work: Erased arrangements of linear and convex decompositions of polyhedra
cites work: Approximate convex decomposition of polyhedra and its applications
cites work: 3D mesh adaptation. Optimization of tetrahedral meshes by advancing front technique
cites work: An algorithm for three-dimensional mesh generation for arbitrary regions with cracks
cites work: A combined octree/delaunay method for fully automatic 3‐D mesh generation
cites work: Fast Delaunay triangulation in three dimensions
cites work: Three-dimensional unstructured mesh generation. III: Volume meshes
cites work: Construction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations
cites work: Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation
cites work: Constrained boundary recovery for three dimensional Delaunay triangulations
cites work: 3D Delaunay mesh generation coupled with an advancing-front approach
cites work: A novel scheme to generate meshes with hexahedral elements and poly-pyramid elements: the carving technique
cites work: Q2776782
DOI: 10.1002/NME.5752
description: scientific article; zbMATH DE number 7878345