Partitioning of triangulated multiply connected domain into subdomains without branching of inner boundaries
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 dom...
Saved in:
Main Authors: | I.R. Kadyrov, S.P. Kopysov, A.K. Novikov |
---|---|
Format: | Article |
Language: | English |
Published: |
Kazan Federal University
2018-09-01
|
Series: | Учёные записки Казанского университета: Серия Физико-математические науки |
Subjects: | |
Online Access: | https://kpfu.ru/partitioning-of-triangulated-multiply-connected.html |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Machine Learning Model for Gas–Liquid Interface Reconstruction in CFD Numerical Simulations
by: Tamon Nakano, et al.
Published: (2025-01-01) -
Homomorphisms of complete n-partite graphs
by: Robert D. Girse
Published: (1986-01-01) -
Inter-frame image coding scheme of color video based on Delaunay triangulation mesh
by: JIAO Wei-dong, et al.
Published: (2007-01-01) -
The Quick Measure of a Nurbs Surface Curvature for Accurate Triangular Meshing
by: Kniat Aleksander
Published: (2014-04-01) -
Graph partition based mapping algorithm on multiprocessors for streaming applications
by: Qi TANG, et al.
Published: (2016-06-01)