BMSweep: Locating interior nodes during sweeping
DOI10.1007/S003660050016zbMATH Open0943.65141OpenAlexW2005229355MaRDI QIDQ1809109FDOQ1809109
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
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
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)
Cited In (13)
- Automatic polyhedral mesh generation and scaled boundary finite element analysis of STL models
- A dual geometry-topology constraint approach for determination of pseudo-swept shapes as applied to hexahedral mesh generation.
- Quadrilateral and hexahedral mesh generation based on surface foliation theory
- A novel scheme to generate meshes with hexahedral elements and poly-pyramid elements: the carving technique
- Unconstrained plastering-Hexahedral mesh generation via advancing-front geometry decomposition
- Adaptive stochastic morphology simulation and mesh generation of high-quality 3D particulate composite microstructures with complex surface texture
- Mesh projection between parametric surfaces
- Improved many-to-one sweeping
- A smoothed finite element method for octree-based polyhedral meshes with large number of hanging nodes and irregular elements
- Hexahedral mesh matching: converting non-conforming hexahedral-to-hexahedral interfaces into conforming interfaces
- 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
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
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)