Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms (Q654384)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms |
scientific article; zbMATH DE number 5992391
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms |
scientific article; zbMATH DE number 5992391 |
Statements
Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms (English)
0 references
28 December 2011
0 references
mesh generation
0 references
hexahedral mesh
0 references
multi-sweeping
0 references
computational domain
0 references
geometry decomposition
0 references
imprinting
0 references
algorithms
0 references
0 references
0.801905632019043
0 references
0.801905632019043
0 references
0.7517701387405396
0 references
0.7250739932060242
0 references
0.7005746960639954
0 references
