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
-
About Some Localization Problems in Delaunay Triangulations
by: N. F. Dyshkant
Published: (2015-03-01) -
A community partitioning algorithm based on network enhancement
by: Junjie Hu, et al.
Published: (2021-01-01) -
The Quick Measure of a Nurbs Surface Curvature for Accurate Triangular Meshing
by: Kniat Aleksander
Published: (2014-04-01) -
Inter-frame image coding scheme of color video based on Delaunay triangulation mesh
by: JIAO Wei-dong, et al.
Published: (2007-01-01) -
Interpolation by multipliers on certain spaces of analytic functions
by: K. Mosaleheh, et al.
Published: (2000-01-01)