Triangulation of arbitrary polyhedra to support automatic mesh generators

From MaRDI portal





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)].











This page was built for publication: Triangulation of arbitrary polyhedra to support automatic mesh generators

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