Geodesic
Partitioning of triangulated multiply connected domain into subdomains without branching of inner boundaries
Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, Tome 160 (2018) no. 3, pp. 544-560

Voir la notice du chapitre de livre provenant de la source Math-Net.Ru

This paper considers two approaches to partitioning of a triangulated multiply connected domain into connected subdomains without branching of internal boundaries. A modified algorithm for constructing the Reeb graph for the topology determining of the triangulated surface of a three-dimensional domain has been proposed. On the basis of the partition of the Reeb graph, formation of subdomains of triangulation without branching of internal boundaries has been performed. Another approach is based on the formation of an ordered set of layers — subsets of 3-simplexes of triangulation using its topological properties, such as vertex and face connectivity. By construction, the layers do not contain branches of internal boundaries. At the same time, for multiply connected computational domains it is characteristic to obtain disconnected layers. The algorithm for combining layers into connected subdomains of triangulation has been developed based on the graph of sublayers, its vertices corresponding to the connected components of each layer. Thus, the union of layers reduces to the union of vertices and edges of the graph of sublayers — a problem with much smaller dimension, and the mapping of the partition of the graph of sublayers into triangulation. The proposed algorithms have been compared following the partitioning of triangulated multiply connected domains with surfaces of different types and genus. The complexity estimates of the algorithms have been given and the quality of the partitions by the number of 2-simplexes common for the obtained subregions of the triangulation has been compared.
Keywords: unstructured mesh, multiply connected domain, shape description, Reeb graph, graph connectivity layers, mesh partitioning without branching.
Mots-clés : triangulation 
@article{UZKU_2018_160_3_a9,
     author = {I. R. Kadyrov and S. P. Kopysov and A. K. Novikov},
     title = {Partitioning of triangulated multiply connected domain into subdomains without branching of inner boundaries},
     journal = {U\v{c}\"enye zapiski Kazanskogo universiteta. Seri\^a Fiziko-matemati\v{c}eskie nauki},
     pages = {544--560},
     publisher = {mathdoc},
     volume = {160},
     number = {3},
     year = {2018},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/UZKU_2018_160_3_a9/}
}
TY  - JOUR
AU  - I. R. Kadyrov
AU  - S. P. Kopysov
AU  - A. K. Novikov
TI  - Partitioning of triangulated multiply connected domain into subdomains without branching of inner boundaries
JO  - Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki
PY  - 2018
SP  - 544
EP  - 560
VL  - 160
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/UZKU_2018_160_3_a9/
LA  - ru
ID  - UZKU_2018_160_3_a9
ER  - 
%0 Journal Article
%A I. R. Kadyrov
%A S. P. Kopysov
%A A. K. Novikov
%T Partitioning of triangulated multiply connected domain into subdomains without branching of inner boundaries
%J Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki
%D 2018
%P 544-560
%V 160
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/UZKU_2018_160_3_a9/
%G ru
%F UZKU_2018_160_3_a9
I. R. Kadyrov; S. P. Kopysov; A. K. Novikov. Partitioning of triangulated multiply connected domain into subdomains without branching of inner boundaries. Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, Tome 160 (2018) no. 3, pp. 544-560. http://geodesic.mathdoc.fr/item/UZKU_2018_160_3_a9/