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

DOI10.1016/J.ADVENGSOFT.2011.05.006zbMATH Open1231.65045OpenAlexW2042201968WikidataQ61735911 ScholiaQ61735911MaRDI QIDQ654384FDOQ654384

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

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

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

zbMATH Keywords

algorithmsimprintingmesh 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)

Cites Work

• Title not available (Why is that?)
• Computational Geometry in C
• Mesh Generation
• Algebraic mesh quality metrics for unstructured initial meshes.
• Handbook of grid generation
• Efficient unstructured quadrilateral mesh generation
• BMSweep: Locating interior nodes during sweeping
• Generation of structured meshes in multiply connected surfaces using submapping
• Local dual contributions: representing dual surfaces for block meshing
• Mesh projection between parametric surfaces
• Improved many-to-one sweeping
• Automatic scheme selection for toolkit hex meshing
• Automated hexahedral mesh generation by generalized multiple source to multiple target sweeping

Cited In (4)

• A dual geometry-topology constraint approach for determination of pseudo-swept shapes as applied to hexahedral mesh generation.
• Improved many-to-one sweeping
• Automated hexahedral mesh generation by generalized multiple source to multiple target sweeping
• Curving for Viscous Meshes

Uses Software

• lp_solve

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)