RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 General information Latest issue Archive Impact factor Search papers Search references RSS Latest issue Current issues Archive issues What is RSS

 Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki: Year: Volume: Issue: Page: Find

 Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 2018, Volume 160, Book 3, Pages 544–560 (Mi uzku1477)

Partitioning of triangulated multiply connected domain into subdomains without branching of inner boundaries

I. R. Kadyrov, S. P. Kopysov, A. K. Novikov

Udmurt Federal Research Center, Ural Branch, Russian Academy of Sciences, Izhevsk, 426067 Russia

Abstract: 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, triangulation, mesh partitioning without branching.

 Funding Agency Grant Number Russian Foundation for Basic Research 17-01-00402_a16-01-00129_a The study was partially supported by the Russian Foundation for Basic Research (projects nos. 16-01-00129-a, 17-01-00402-a).

Full text: PDF file (8151 kB)
References: PDF file   HTML file

Bibliographic databases:
UDC: 515.164:519.6

Citation: I. R. Kadyrov, S. P. Kopysov, A. K. Novikov, “Partitioning of triangulated multiply connected domain into subdomains without branching of inner boundaries”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 160, no. 3, Kazan University, Kazan, 2018, 544–560

Citation in format AMSBIB
\Bibitem{KadKopNov18} \by I.~R.~Kadyrov, S.~P.~Kopysov, A.~K.~Novikov \paper Partitioning of triangulated multiply connected domain into subdomains without branching of inner boundaries \serial Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki \yr 2018 \vol 160 \issue 3 \pages 544--560 \publ Kazan University \publaddr Kazan \mathnet{http://mi.mathnet.ru/uzku1477} 

• http://mi.mathnet.ru/eng/uzku1477
• http://mi.mathnet.ru/eng/uzku/v160/i3/p544

 SHARE:

Citing articles on Google Scholar: Russian citations, English citations
Related articles on Google Scholar: Russian articles, English articles

This publication is cited in the following articles:
1. S. P. Kopysov, I. R. Kadyrov, A. K. Novikov, “Resursno-effektivnye konechno-elementnye vychisleniya na mnogoyadernykh arkhitekturakh”, Izv. IMI UdGU, 53 (2019), 83–97
•  Number of views: This page: 63 Full text: 20 References: 9