Geodesic
Triangulation of spatial elementary domains
Matematičeskaâ fizika i kompʹûternoe modelirovanie, no. 4 (2015), pp. 6-12.

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider a domain $\Omega \subset {\mathbf{R}}^3$ that has the form $$ \Omega=\left\{(x,y,z): a,\ c,\ \varphi(x,y)\psi(x,y)\right\}, $$ where $\varphi(x,y)$ and $\psi(x,y)$ are given functions in rectangle $[a,b]\times [c,d]$ which satisfy Lipschitz condition. Let $a=x_0$ be a partition of the segment $[a,b]$ and $c=y_0$ be a partition of the segment $[c,d]$. We put $$ f_{\tau}(x,y)=\tau\psi(x,y)+(1-\tau)\varphi(x,y), \ \tau\in[0,1]. $$ We divide the segment $[0,1]$ by points $0=\tau_0\tau_1\tau_2...\tau_k=1$ and consider the grid in the domain $\Omega$ defined points $$ A_{ijl}(x_i,y_j,z_{ijl})=(x_i,y_j,f_{\tau_l}(x_i,y_j)), \ i=0,...,n,\ j=0,...,m,\ l=0,...,k. $$ In this paper we built a triangulation of the region $\Omega$ of nodes $A_ {ijl}$ such that a decrease in the fineness of the partition, and under certain conditions, the dihedral angles are separated from zero to some positive constant.
Mots-clés : triangulation, tetrahedron, partition of domain
Keywords: dihedral angle, elementary domain, Lipschitz condition. 
@article{VVGUM_2015_4_a1,
     author = {A. A. Klyachin and A. Yu. B{\cyre}l{\cyre}nikina},
     title = {Triangulation of spatial elementary domains},
     journal = {Matemati\v{c}eska\^a fizika i kompʹ\^uternoe modelirovanie},
     pages = {6--12},
     publisher = {mathdoc},
     number = {4},
     year = {2015},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VVGUM_2015_4_a1/}
}
TY  - JOUR
AU  - A. A. Klyachin
AU  - A. Yu. Bеlеnikina
TI  - Triangulation of spatial elementary domains
JO  - Matematičeskaâ fizika i kompʹûternoe modelirovanie
PY  - 2015
SP  - 6
EP  - 12
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VVGUM_2015_4_a1/
LA  - ru
ID  - VVGUM_2015_4_a1
ER  - 
%0 Journal Article
%A A. A. Klyachin
%A A. Yu. Bеlеnikina
%T Triangulation of spatial elementary domains
%J Matematičeskaâ fizika i kompʹûternoe modelirovanie
%D 2015
%P 6-12
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VVGUM_2015_4_a1/
%G ru
%F VVGUM_2015_4_a1
A. A. Klyachin; A. Yu. Bеlеnikina. Triangulation of spatial elementary domains. Matematičeskaâ fizika i kompʹûternoe modelirovanie, no. 4 (2015), pp. 6-12. http://geodesic.mathdoc.fr/item/VVGUM_2015_4_a1/

[1] S.\;M. Aleynikov, A.\;A. Sedaev, “Algorithm of mesh formation in the boundary element method for plane domains”, Mathematical Models and Computer Simulations, 7:7 (1995), 81–93 | MR

[2] M.\;P. Galanin, I.\;A. Shcheglov, “Development and implementation of algorithms for three-dimensional triangulation of complex spatial domains: iterative methods”, Keldysh Institute preprints, 2006, 009, 32 pp.

[3] M.\;P. Galanin, I.\;A. Shcheglov, “Development and implementation of algorithms for three-dimensional triangulation of complex spatial domains: direct methods”, Keldysh Institute preprints, 2006, 010, 32 pp.

[4] M.\;A. Gatsunaev, A.\;A. Klyachin, “On uniform convergence of piecewise linear solutions of the minimal surface equation”, Ufa Mathematical Journal, 6:3 (2014), 3–16

[5] A.\;A. Klyachin, “Uniform triangulation of planar domains”, Science Journal of Volgograd State University. Mathematics. Physics, 2011, no. 2 (15), 43–49

[6] V.\;A. Klyachin, “A multidimensional analogue of Schwartz example”, Izvestiya: Mathematics, 76:4 (2012), 41–48 | DOI | MR | Zbl

[7] V.\;A. Klyachin, A.\;A. Shirokiy, “Delaunay triangulation of multidimensional surfaces and its approximation properties”, Russian Mathematics, 2012, no. 1, 31–39 | MR | Zbl

[8] Yu.\;V. Nemirovskiy, S.\;F. Pyataev, “Automated triangulation of multiply connected domains with concentration and rarefaction of nodes”, Computational Technologies, 5:2 (2000), 82–91 | MR

[9] A.\;V. Skvortsov, “Algorithms for constructing a triangulation with restrictions”, Vychislitelnye metody i programmirovanie, 3 (2002), 82–92

[10] A.\;V. Skvortsov, “Review of algorithms for constructing Delaunay triangulation”, Vychislitelnye metody i programmirovanie, 3 (2002), 14–39