BMSweep: Locating interior nodes during sweeping

Citation
Ml. Staten et al., BMSweep: Locating interior nodes during sweeping, ENG COMPUT, 15(3), 1999, pp. 212-218
Citations number
16
Categorie Soggetti
Computer Science & Engineering
Journal title
ENGINEERING WITH COMPUTERS
ISSN journal
01770667 → ACNP
Volume
15
Issue
3
Year of publication
1999
Pages
212 - 218
Database
ISI
SICI code
0177-0667(1999)15:3<212:BLINDS>2.0.ZU;2-X
Abstract
BMSweep is a new algorithm to determine the location of interior nodes whil e generating hexahedral meshes using the volume sweeping method. Volume swe eping is performed on two and one half-dimensional volumes by identifying a 'source' surface which is meshed with quadrilaterals. These quadrilaterals are then swept through the volume towards a 'target' surface generating la yers of hexahedra along the way. BMSweep uses background mesh interpolation to locate interior nodes during sweeping. The interpolation method provide s for quality element creation, while allowing the volume boundary to vary. The cross-section of the volume can vary along the length of the sweep, th e sweep path need nor be linear, and the source and target areas need not b e flat. Three dimensional volumes can be swept using BMSweep after being de composed into two and one half-dimensional sub-volumes.