Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms

DOI10.1016/j.advengsoft.2011.05.006zbMath1231.65045OpenAlexW2042201968WikidataQ61735911 ScholiaQ61735911MaRDI QIDQ654384

Eloi Ruiz-Gironés, Josep Sarrate, Xevi Roca

Publication date: 28 December 2011

Published in: Advances in Engineering Software (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/14693

zbMATH Keywords

imprintingalgorithmsmesh generationhexahedral meshcomputational domaingeometry decompositionmulti-sweeping

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items

Curving for Viscous Meshes

Uses Software

• lp_solve

Cites Work

• Unnamed Item
• Unnamed Item
• BMSweep: Locating interior nodes during sweeping
• Algebraic mesh quality metrics for unstructured initial meshes.
• Generation of structured meshes in multiply connected surfaces using submapping
• Efficient unstructured quadrilateral mesh generation
• Local dual contributions: Representing dual surfaces for block meshing
• Mesh projection between parametric surfaces
• Improved many-to-one sweeping
• Mesh Generation
• Computational Geometry in C
• Automatic scheme selection for toolkit hex meshing
• Automated hexahedral mesh generation by generalized multiple source to multiple target sweeping

This page was built for publication: Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms