Name
Abstract | ||
|---|---|---|
. BMSweep is a new algorithm to determine the location of interior nodes while generating hexahedral meshes using the volume
sweeping method. Volume sweeping 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
layers of hexahedra along the way. BMSweep uses background mesh interpolation to locate interior nodes during sweeping. The
interpolation method provides 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, the sweep path need not be linear, and the source and target areas need
not be flat. Three dimensional volumes can be swept using BMSweep after being decomposed into two and one half-dimensional
subvolumes. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/s003660050016 | Engineering With Computers |
Keywords | DocType | Volume |
mesh generation,hexahedra,mapped meshing,background mesh,2.5d.,. 2.5d,sweep,three dimensional | Conference | 15 |
Issue | ISSN | Citations |
3 | 0177-0667 | 44 |
PageRank | References | Authors |
5.00 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthew L. Staten | 1 | 219 | 37.46 |
| Scott A. Canann | 2 | 173 | 40.33 |
| Steven J. Owen | 3 | 440 | 49.16 |