Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms (Q654384): Difference between revisions

From MaRDI portal
Normalize DOI.
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/J.ADVENGSOFT.2011.05.006 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.ADVENGSOFT.2011.05.006 / rank
 
Normal rank

Latest revision as of 23:56, 9 December 2024

scientific article
Language Label Description Also known as
English
Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms
scientific article

    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 references
    0 references

    Identifiers