A dual geometry-topology constraint approach for determination of pseudo-swept shapes as applied to hexahedral mesh generation.

DOI10.1016/S0010-4485(99)00040-8MaRDI QIDQ1401735zbMATH OpenWikidataFDO

Authors D. Massart

Publication date 1999

Published in CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0010-4485(99)00040-8

zbMATH Keywords

pseudo-sweep algorithm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Automated hexahedral mesh generation by generalized multiple source to multiple target sweeping
• BMSweep: Locating interior nodes during sweeping
• Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms
• Shelling hexahedral complexes for mesh generation
• Automatic scheme selection for toolkit hex meshing

Cited in

(5)

• BMSweep: Locating interior nodes during sweeping
• 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
• Automatic scheme selection for toolkit hex meshing
• Automated hexahedral mesh generation by generalized multiple source to multiple target sweeping
• Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms

This page was built for publication: A dual geometry-topology constraint approach for determination of pseudo-swept shapes as applied to hexahedral mesh generation.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401735)