BMSweep: Locating Interior Nodes During Sweeping

Staten, Matthew L.; Canann, Scott A.; Owen, Steven J.

doi:10.1007/s003660050016

Cited by 72 publications

(51 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Since this is not a true extrusion, we regard this a an unsweepable volume. Indeed, none of the sweeping algorithms in [6], [9] and [10] are capable of sweeping a volume like this.…”

Section: Lemma 1: a Swept Mesh Is Bounded By One Or More Non-intersecmentioning

confidence: 99%

“…Finally, the available sweep algorithm may determine additional constraints on the topology of surfaces in S or L. The "standard" sweep algorithm allows the extrusion of one surface (the "source" surface) onto a single "target" surface of identical topology; this is often referred to as a one-to-one sweep [9] [15]. There also exist other varieties of sweeping which have fewer constraints on source and target topology, e.g.…”

Section: Traversing Over All E-type or C-type Edges Bounding The Set mentioning

confidence: 99%

See 1 more Smart Citation

Automatic scheme selection for toolkit hex meshing

White

Tautges

2000

Int. J. Numer. Meth. Engng.

View full text Add to dashboard Cite

Current hexahedral mesh generation techniques rely on a set of meshing tools, which when combined with geometry decomposition leads to an adequate mesh generation process. Of these tools, sweeping tends to be the workhorse algorithm, accounting for at least 50 per cent of most meshing applications. Constraints which must be met for a volume to be sweepable are derived, and it is proven that these constraints are necessary but not sufficient conditions for sweepability. This paper also describes a new algorithm for detecting extruded or sweepable geometries. This algorithm, based on these constraints, uses topological and local geometric information, and is more robust than feature recognition‐based algorithms. A method for computing sweep dependencies in volume assemblies is also given. The auto sweep detect and sweep grouping algorithms have been used to reduce interactive user time required to generate all‐hexahedral meshes by filtering out non‐sweepable volumes needing further decomposition and by allowing concurrent meshing of independent sweep groups. Parts of the auto sweep detect algorithm have also been used to identify independent sweep paths, for use in volume‐based interval assignment. Published in 2000 by John Wiley & Sons, Ltd.

show abstract

“…Since this is not a true extrusion, we regard this a an unsweepable volume. Indeed, none of the sweeping algorithms in [6], [9] and [10] are capable of sweeping a volume like this.…”

Section: Lemma 1: a Swept Mesh Is Bounded By One Or More Non-intersecmentioning

confidence: 99%

Section: Traversing Over All E-type or C-type Edges Bounding The Set mentioning

confidence: 99%

Automatic scheme selection for toolkit hex meshing

White

Tautges

2000

Int. J. Numer. Meth. Engng.

View full text Add to dashboard Cite

show abstract

“…Fully automatic methods for hex meshing solid models with good quality elements have been under investigation for many years [2][3][4][5][6][7][8]. Although significant research has been carried out, the complexity of the models that can be automatically processed is very restricted.…”

Section: Introductionmentioning

confidence: 99%

An enhanced approach to automatic decomposition of thin-walled components for hexahedral-dominant meshing

Sun

Tierney

Armstrong

et al. 2017

Engineering with Computers

View full text Add to dashboard Cite

Hexahedral (hex) meshes can be generated for CAD models of complex thin-walled components by isolating thin-sheet and long-slender regions, quad meshing one of the bounding faces, and sweeping the quad mesh through the volume to create hex elements. Continuing the work in Sun et al. (Proc Eng 163:225-237, 2016), where an improved approach to thin-sheet identification was presented, an enhanced automatic method for long-slender region identification is proposed in this paper. The objective is to improve the efficiency and decomposition quality compared to existing long-slender region identification processes. Geometric measures such as the edge length and the face width are employed to generate sizing measures, which are in turn used to identify candidate long-slender regions. Careful consideration is given to the generation and positioning of the cutting faces required to isolate the long-slender regions by assessing a priori quad mesh quality on the wall faces. It is shown that a significant reduction in the number of degrees of freedom (DOF) can be achieved by applying anisotropic hex elements on the identified regions.

show abstract

“…This is also the case in three dimensions with Unconstrained Plastering. The two light gray surfaces on the top of the model surfaces can be meshed with quadrilaterals and swept [16,17,18] through tion, the topology of connecting tubes in three dimensions has only a single source and a single target, which simplifies the sweeping process to 1-1 sweeping. Figure 9 Illustrates a seaming case in Unconstrained Plastering which is a result of the merge operation performed in Figure 7.…”

Section: Seamingmentioning

confidence: 99%

“…After the seaming Figure 9c. This sheet advancement creates an additional seaming case meshed with traditional paving and sweeping [16,17,18].…”

Section: Seamingmentioning

confidence: 99%