Construction and shape optimization of simplicial meshes in \(d\)-dimensional space (Q1650798): Difference between revisions

Several tilings of a \(d\)-dimensional space have been introduced in the literature. For instance, tilings by congruent simplices were studied by \textit{H. E. Debrunner} [Ann. N.Y. Acad. Sci. 440, 230--261 (1985; Zbl 0572.51014)] and by \textit{J. Brandts} et al. [Appl. Math., Praha 52, No. 3, 251--265 (2007; Zbl 1164.65493)]. However, all partitions of the space do not need to use congruent simplices. In this article, a method for creating a \(d\)-parametric family of tilings is developed. The main result of this article is based on the construction introduced by \textit{D. M. Y. Sommerville} [``Space-filling tetrahedra in Euclidean space'', Proc. Edinb. Math. Soc. 41, 49--57 (1923; \url{doi:10.1017/S001309150007783X})], which uses a regular triangle as a base for building a one-parametric family of tetrahedral elements that tile the three-dimensional space. The tilings obtained in this article are not performed with congruent simplices, in addition they do not cover \(d\)-dimensional cubes and are distinct from those constructed by \textit{H. W. Kuhn} [IBM J. Res. Dev. 4, 518--524 (1960; Zbl 0109.15603)] and others. The author proves that a \(d\)-dimensional simplicial partion is parameterized by \(d\) parameters and shows that the shape optimal partition of a \(d\)-dimensional space is constructed over that of a \((d-1)\)-dimensional space.