Triangulation of arbitrary polyhedra to support automatic mesh generators (Q4508071)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1515666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Triangulation of arbitrary polyhedra to support automatic mesh generators |
scientific article; zbMATH DE number 1515666 |
Statements
21 March 2002
0 references
Delaunay triangulation
0 references
unstructured mesh generation
0 references
algorithms
0 references
Triangulation of arbitrary polyhedra to support automatic mesh generators (English)
0 references
0.8188126683235168
0 references
0.8142908215522766
0 references
0.7812750339508057
0 references
0.7812750339508057
0 references
0.7780323624610901
0 references
The authors present an algorithm for the triangulation of arbitrary non-convex polyhedral regions starting with a prescribed boundary triangulation matching existing mesh entities in the remainder of the domain. Some interesting results on the unstructured mesh generation algorithms have been achieved, for instance by \textit{N. P. Weatherill} and \textit{O. Hassan} [ibid. 37, No. 12, 2005-2039 (1994; Zbl 0806.76073)] and by \textit{N. A. Golias} and \textit{T. D. Tsiboukis} [ibid. 37, No. 5, 793-812 (1994; Zbl 0796.73061)]. However, the open problem there is to guarantee the successful termination of the meshing process. The main difficulty typically appears when small meshing subdomains. This problem has been approached by Hecht [cf. \textit{F. Hecht}, \textit{P. L. George} and \textit{E. Saltel}, Comput. Methods Appl. Mech. Eng. 92, No. 3, 269-288 (1991; Zbl 0756.65133)] by the heuristic insertion of Steiner points as interior vertices. The method presented by the authors is robust and successful in meshing small subdomains. For this purpose, the authors start with the same base mesh generation method described by Hecht, that is based on Delaunay point insertions, but it takes an alternative point of view on how to produce a valid set tetrahedra within the small subdomain. See also: \textit{H. Borouchaki}, \textit{P. Laug} and \textit{P. L. George} [ibid. 49, No. 1-2, 233-259 (2000; reviewed below)].
0 references