A recent local grid refinement algorithm for simplicial grids is shown to be suitable for symbolic implementation in the 3 -dimensional case. An addressing scheme stores all the geometric information about the tetrahedra in the refinement tree. Location of vertices and the addresses of physically ne
β¦ LIBER β¦
Parallel Multilevel Tetrahedral Grid Refinement
β Scribed by Gross, Sven; Reusken, Arnold
- Book ID
- 118190503
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 2005
- Tongue
- English
- Weight
- 344 KB
- Volume
- 26
- Category
- Article
- ISSN
- 1064-8275
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Symbolic Local Refinement of Tetrahedral
β
D.J. Hebert
π
Article
π
1994
π
Elsevier Science
π
English
β 421 KB
Mesh quality control for multiply-refine
β
Rupak Biswas; Roger C. Strawn
π
Article
π
1996
π
Elsevier Science
π
English
β 823 KB
Parallel multilevel methods with adaptiv
β
Xing Cai; Klas Samuelsson
π
Article
π
2000
π
Springer-Verlag
π
English
β 282 KB
Some parallel iterative methods for solv
β
O. Yu. Milyukova; I. V. Popov
π
Article
π
2010
π
SP MAIK Nauka/Interperiodica
π
English
β 331 KB
Automatic parallel generation of tetrahe
β
H. AndrΓ€; O. N. Gluchshenko; E. G. Ivanov; A. N. Kudryavtsev
π
Article
π
2008
π
SP MAIK Nauka/Interperiodica
π
English
β 487 KB
Parallel re-initialization of level set
β
Oliver Fortmeier; H. Martin BΓΌcker
π
Article
π
2011
π
Elsevier Science
π
English
β 784 KB
Level set functions are employed to track interfaces in various application areas including simulation of two-phase flows and image segmentation. Often, a re-initializing algorithm is incorporated to transform a numerically instable level set function to a signed distance function. In this note, we