|
Article information
2000 , Volume 5, ¹ 2, p.82-91
Nemirovskii Y.V., Pyataev S.F.
Automated triangulation of multiply connected domains with concentration and rarefaction of nodes
Algorithms of fragmentation of arbitrary piecewise smooth closed boundary contours of multiply connected domain and its triangulation are developed. In the course of fragmentation of the boundary of domain and its triangulation a function of steps is used, which adjusts the sizes of one-dimensional and triangular finite elements according to their position in the domain. Any positive function can appear as the function of steps. The process of triangulation is a consecutive filling of domain with triangular elements. The process of filling starts from the boundary that is preliminarily fragmented into one-dimensional finite elements. Samples of grids for some domains are presented.
[full text] Classificator Msc2000:- *65D18 Computer graphics and computational geometry
- 65N30 Finite elements, Rayleigh-Ritz and Galerkin methods, finite methods
- 65N50 Mesh generation and refinement
- 65N55 Multigrid methods; domain decomposition
Classificator Computer Science:- *G.1.8 Partial Differential Equations
- I.3.5 Computational Geometry and Object Modeling
Keywords: triangulation, algorithm, multiply connected domain, finite elements, domain decomposition, numerical examples
Author(s):
Nemirovskii Yurii Vladimirovich
Office: Institute of Theoretical and Applied Mechanics of SB RAS
Address: 630090, Russia, Novosibirsk, 4/1 Institutskaya str.
Phone Office: 354273
E-mail: fomin@icans.nsk.su
Pyataev Sergei Fedorovich
PhD.
Position: Scientific Secretary
Office: Institute of computational modelling SB RAS
Address: 660036, Russia, Krasnoyarsk, 4/1 Institutskaya str.
E-mail: psf@icm.krasn.ru
Bibliography link:
Nemirovskii Y.V., Pyataev S.F. Automated triangulation of multiply connected domains with concentration and rarefaction of nodes // Computational technologies. 2000. V. 5. ¹ 2. P. 82-91
|
|
|
|
