Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms
From MaRDI portal
(Redirected from Publication:654384)
Recommendations
- BMSweep: Locating interior nodes during sweeping
- Adaptive and quality quadrilateral/hexahedral meshing from volumetric data
- Automated hexahedral mesh generation by generalized multiple source to multiple target sweeping
- A dual geometry-topology constraint approach for determination of pseudo-swept shapes as applied to hexahedral mesh generation.
- Automatic scheme selection for toolkit hex meshing
Cites work
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- Algebraic mesh quality metrics for unstructured initial meshes.
- Automated hexahedral mesh generation by generalized multiple source to multiple target sweeping
- Automatic scheme selection for toolkit hex meshing
- BMSweep: Locating interior nodes during sweeping
- Computational Geometry in C
- Efficient unstructured quadrilateral mesh generation
- Generation of structured meshes in multiply connected surfaces using submapping
- Handbook of grid generation
- Improved many-to-one sweeping
- Local dual contributions: representing dual surfaces for block meshing
- Mesh Generation
- Mesh projection between parametric surfaces
Cited in
(4)
This page was built for publication: Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654384)