Skip to main content
SpringerLink
Log in

Adaptive sweeping techniques

  • Original Article
  • Published:
Engineering with Computers Aims and scope Submit manuscript

Abstract

This paper presents an adaptive approach to sweeping one-to-one and many-to-one geometry. The automatic decomposition of many-to-one geometry into one-to-one “blocks” and the selection of an appropriate node projection scheme are vital steps in the efficient generation of high-quality swept meshes. This paper identifies two node projection schemes which are used in tandem to robustly sweep each block of a one-to-one geometry. Methods are also presented for the characterization of one-to-one geometry and the automatic assignment of the most appropriate node projection scheme. These capabilities allow the sweeper to adapt to the requirements of the sweep block being processed. The identification of the two node projection schemes was made after an extensive analysis of existing schemes was completed. One of the node projection schemes implemented in this work, BoundaryError, was selected from traditional node placement algorithms. The second node projection scheme, SmartAffine, is an extension of simple affine transformations and is capable of efficiently sweeping geometry with source and/or target curvature while approximating the speed of a simple transform. These two schemes, when used in this adaptive setting, optimize mesh quality and the speed that swept meshes can be generated while minimizing required user interaction.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. White D, Tautges T, Timothy J (2000) Automatic scheme selection for toolkit hex meshing. Int J Numer Methods Eng 49:127–144

    Article  MATH  Google Scholar 

  2. Blacker T (1991) A new approach to automated quadrilateral mesh generation. Int J Numer Methods Eng 32:811–847

    Article  MATH  Google Scholar 

  3. Cook W, Oakes W (1982) Mapped methods for generating three dimensional meshes. In: Computers in mechanical engineering, CIME research supplement, pp 67–72

  4. White D, Mingwu L, Benzley S, Sjaardema G (1995) Automated hexahedral mesh generation by virtual decomposition. In: Proceedings 4th international meshing roundtable. Sandia National Laboratories, USA, pp 165–176

  5. Blacker T (1996) The cooper tool. In: Proceedings 5th international meshing roundtable. Sandia National Laboratories, USA, pp 13–29

  6. Mingwu L, Benzley S, Sjaardema G, Tautges T (1996) A multiple source and target sweeping method for generating all hexahedral finite element meshes. In: Proceedings 5th international meshing roundtable. Sandia National Laboratories, USA, pp 217–225

  7. Shepherd J, Mitchell S, Knupp P, White D (2000) Methods for MultiSweep automation. In: Proceedings 9th international meshing roundtable. Sandia National Laboratories, USA, pp 77–87

  8. Knupp P (1998) Next-generation Sweep Tool: a method for generating all–hex meshes on two–and–one–half dimensional geometries. In: Proceedings 7th international meshing roundtable. Sandia National Laboratories, USA, pp 505–513

  9. Scott M, Benzley S, Owen S (2009) Improved many-to-one sweeping (submitted)

  10. White D, Saigal S, Owen S (2004) CCSweep: automatic decomposition of multi-sweep volumes. Eng Comput 20:222–236

    Article  Google Scholar 

  11. Staten M, Canaan S, Owen S (1998) BMSweep: locating interior nodes during sweeping. In: Proceedings 7th international meshing roundtable. Sandia National Laboratories, USA, pp 7–18

  12. Knupp P (1999) Applications of mesh smoothing: copy, morph, and sweep on unstructured quadrilateral meshes. Int J Numer Methods Eng 45:37–45

    Article  MATH  MathSciNet  Google Scholar 

  13. Knupp P (1998) Winslow smoothing on two–dimensional unstructured meshes. In: Proceedings 7th international meshing roundtable. Sandia National Laboratories, USA, pp 449–457

  14. Knupp P (2003) Algebraic mesh quality metrics for unstructured initial meshes. Finite Elem Anal Des 39:217–241

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Brigham Young University, Provo, UT, USA

    Michael A. Scott, Matthew N. Earp & Steven E. Benzley

Authors
  1. Michael A. Scott
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthew N. Earp
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Steven E. Benzley
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michael A. Scott.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Scott, M.A., Earp, M.N. & Benzley, S.E. Adaptive sweeping techniques. Engineering with Computers 26, 317–325 (2010). https://doi.org/10.1007/s00366-009-0160-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00366-009-0160-3

Keywords

Search

Navigation