BMSweep: Locating interior nodes during sweeping

DOI10.1007/S003660050016MaRDI QIDQ1809109zbMATH OpenOpenAlexFDO

Authors M. L. Staten, S. J. Owen, Scott A. Canann

Publication date 14 February 2000

Published in Engineering with Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s003660050016

zbMATH Keywords

background mesh interpolationBMSweep algorithmmesh generationvolume sweeping method

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Review text

The authors derive a new algorithm for mesh generation. The BMSweep alogrithm is used to determine the location of interior nodes while generating hexahedral meshes using the volume sweeping method. Volume sweeping is performed on two and half-dimensional volumes by identifying a so-called source surface. These quadrilaterals are then swept through the volume towards a target surface generating layers of hexahedra along the way. BMSweep uses background mesh interpolation to locate the interior nodes during sweeping. BMSweep is orientation insensitive and meshes two and half-dimensional volumes without requiring flat or parallel faces. The cross-section of the sweep can twist, turn, and rotate freely. This algorithm has been tested extensively for complex problems. Together with volume decomposition it can be used to mesh a large class of three-dimensional domains.

Recommendations

• Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms
• 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.
• OCTREE-BASED HEXAHEDRAL MESH GENERATION
• Automatic scheme selection for toolkit hex meshing

Cited in

(19)

• A dual geometry-topology constraint approach for determination of pseudo-swept shapes as applied to hexahedral mesh generation.
• Adaptive stochastic morphology simulation and mesh generation of high-quality 3D particulate composite microstructures with complex surface texture
• A smoothed finite element method for octree-based polyhedral meshes with large number of hanging nodes and irregular elements
• Automatic polyhedral mesh generation and scaled boundary finite element analysis of STL models
• Quadrilateral and hexahedral mesh generation based on surface foliation theory
• 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
• Mesh projection between parametric surfaces
• Improved many-to-one sweeping
• Unconstrained plastering-Hexahedral mesh generation via advancing-front geometry decomposition
• Hexahedral mesh matching: converting non-conforming hexahedral-to-hexahedral interfaces into conforming interfaces
• A novel scheme to generate meshes with hexahedral elements and poly-pyramid elements: the carving technique
• 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
• A new least-squares approximation of affine mappings for sweep algorithms
• An automatic and general least-squares projection procedure for sweep meshing
• A comparison of mesh morphing methods for 3D shape optimization
• High quality mesh morphing using triharmonic radial basis functions
• Mesh matching -- creating conforming interfaces between hexahedral meshes
• A new procedure to compute imprints in multi-sweeping algorithms

This page was built for publication: BMSweep: Locating interior nodes during sweeping

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