Partitioning of an arbitrary domain into subdomains without branching of inner boundaries

I.R. Kadyrov, Sergey Petrovich Kopysov, Alexandr K. Novikov · Journal of Physics Conference Series · 2019

In this paper we consider an approach to the partitioning of a arbitrary domain into connected subdomains without branching of internal boundaries. The Reeb graph is a simplified representation of the topology of the required domain. Algorithms are shown in this paper is a modification of the presented earlier algorithm of the formation of the plane Reeb graph. The algorithm for constructing the volume Reeb graph allows us to determine the internal topology of the domain. A new algorithm of the formation of the partitioning into subdomains without branching of internal boundaries is presented.

Read the paper · More papers on PaperTik