Geodesic
The Algorithm for Generation of Two-Dimensional Embedded Grids
Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika, Tome 2 (2009) no. 1, pp. 83-90 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The paper proposes an algorithm for constructing a sequence of embedded grids for two-dimensional areas.
Keywords: embedded grid, two-dimensional areas. 
@article{JSFU_2009_2_1_a7,
     author = {Anton V. Ishenko and Igor' V. Kireev},
     title = {The {Algorithm} for {Generation} of {Two-Dimensional} {Embedded} {Grids}},
     journal = {\v{Z}urnal Sibirskogo federalʹnogo universiteta. Matematika i fizika},
     pages = {83--90},
     year = {2009},
     volume = {2},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/JSFU_2009_2_1_a7/}
}
TY  - JOUR
AU  - Anton V. Ishenko
AU  - Igor' V. Kireev
TI  - The Algorithm for Generation of Two-Dimensional Embedded Grids
JO  - Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika
PY  - 2009
SP  - 83
EP  - 90
VL  - 2
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/JSFU_2009_2_1_a7/
LA  - ru
ID  - JSFU_2009_2_1_a7
ER  - 
%0 Journal Article
%A Anton V. Ishenko
%A Igor' V. Kireev
%T The Algorithm for Generation of Two-Dimensional Embedded Grids
%J Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika
%D 2009
%P 83-90
%V 2
%N 1
%U http://geodesic.mathdoc.fr/item/JSFU_2009_2_1_a7/
%G ru
%F JSFU_2009_2_1_a7
Anton V. Ishenko; Igor' V. Kireev. The Algorithm for Generation of Two-Dimensional Embedded Grids. Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika, Tome 2 (2009) no. 1, pp. 83-90. http://geodesic.mathdoc.fr/item/JSFU_2009_2_1_a7/

[1] V. V. Shaidurov, Mnogosetochnye metody konechnykh elementov, Nauka, M., 1989 | MR

[2] P. J. Frey, P. L. Geotge, Mesh Generation. Application to Finite Elements, Hermes Science Publishing, Oxford–Paris, 2000 | MR | Zbl

[3] M. P. Galanin, I. A. Scheglov, Razrabotka i realizatsiya algoritmov trekhmernoi triangulyatsii slozhnykh prostranstvennykh oblastei: iteratsionnye metody, Preprint No 9, IPM im. M. V. Keldysha RAN, M., 2006, 32 pp.

[4] M. P. Galanin, I. A. Scheglov, Razrabotka i realizatsiya algoritmov trekhmernoi triangulyatsii slozhnykh prostranstvennykh oblastei: pryamye metody, Preprint No 10, IPM im. M. V. Keldysha RAN, M., 2006, 32 pp.

[5] S. J. Owen, “A Survey of Unstructured Mesh Generation Technology”, Proceedings of 7th International Meshing Roundtable, Dearborn, MI, 1998, 239–269

[6] M. C. Rivara, M. M. Vemere, “Cost analysis of the longest-side (triangle bisection) refinement algorithm for triangulations”, Engineering with Computers, 12:3–4 (1996), 224–234 | DOI

[7] S. F. Pyataev, Yu. V. Nemirovskii, “Avtomatizirovannaya triangulyatsiya mnogosvyaznykh oblastei so sguscheniem i razrezheniem uzlov”, Vychislitelnye tekhnologii, 5:2 (2000), 82–91 | MR | Zbl

[8] V. I. Krylov, L. V. Shulgina, Spravochnaya kniga po chislennomu integrirovaniyu, Nauka, M., 1966

[9] V. V. Voevodin, Yu. A. Kuznetsov, Matritsy i vychisleniya, Nauka, M., 1984 | MR | Zbl

[10] A. V. Ischenko, “Algoritm postroeniya treugolnykh vlozhennykh setok dlya dvumernykh mnogosvyaznykh oblastei”, Materialy VII Vseros. konf. molodykh uchënykh po mat. modelirovaniyu i informatsionnym tekhnologiyam, IVT SO RAN, Krasnoyarsk, 2006, 21