Skip to main content
SpringerLink
Log in

CCSweep: automatic decomposition of multi-sweep volumes

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

Abstract

CCSweep is a new method to automatically decompose multi-sweepable volumes into many-to-one sweepable volumes. Multi-sweepable volumes contain both multiple source and multiple target faces. In hexahedral mesh generation, most sweeping techniques handle many-to-one sweepable volumes that contain multiple source faces, but they are limited to volumes with only a single target face. Recent proposals to solve the multi-sweep problem have several disadvantages, including: indeterminate edge sizing or interval matching constraints, over-dependence on input mesh discretization, loop Boolean restrictions on creating only loops with even numbers of nodes, and unstable loop imprinting when interior holes exist. These problems are overcome through CCSweep. CCSweep decomposes multi-sweep volumes into many-to-one sweepable sub-volumes by projecting the target faces through the volume onto corresponding source faces. The projected faces are imprinted with the source faces to determine the decomposition of the solid. Interior faces are created to decompose the volume into separate new volumes. The new volumes have only single target faces and are represented in the meshing system as real, solid geometry, enabling them to be automatically meshed using existing many-to-one hexahedral sweeping approaches. The results of successful application of CCSweep to a number of problems are shown in this paper.

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. 2a, b
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8a–c
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

References

  1. Knupp P (1998) Next-generation sweep tool: a method for generating all-hex meshes on two-and-one-half dimensional geometries. In: Proceedings of the 7th international meshing roundtable, Dearborn, Michigan, October 1998, pp 505–513

  2. Lai M, Benzley S, Sjaardema G, Tautges T (1996) A multiple source and target sweeping method for generating all-hexahedral finite element meshes. In: Proceedings of the 5th international meshing roundtable, Pittsburgh, Pennsylvania, October 1996, pp 217–228

  3. Blacker T (1996) The Cooper tool. In: Proceedings of the 5th international meshing roundtable, Pittsburgh, Pennsylvania, October 1996, pp 13–30

  4. Lai M, Benzley S, White D (2000) Automated hexahedral mesh generation by generalized multiple source to multiple target sweeping. Int J Num Methods Eng 49:261–275

    Article  MATH  Google Scholar 

  5. Shepherd J, Mitchell S, Knupp P, White D (2000) Methods for multisweep automation. In: Proceedings of the 9th international meshing roundtable, New Orleans, Los Angeles, October 2000, pp 77–87

  6. Schneiders R, Schindler R, Weiler F (1996) Octree-based Generation of hexahedral element meshes. In: Proceedings of the 5th international roundtable, Pittsburgh, Pennsylvania, October 1996, pp 205–216

  7. Tautges T, Blacker T, Mitchell S (1996) The Whisker weaving algorithm: a connectivity-based method for constructing all-hexahedral finite element meshes. Int J Num Methods Eng 39:3327–3349

    Article  MathSciNet  MATH  Google Scholar 

  8. Blacker T, Meyers R (1993) Seams and wedges in plastering: a 3D hexahedral mesh generation algorithm. Eng Comput 2:83–93

    Google Scholar 

  9. Ymakawa S, Shimada K (2001) Hexhoop: modular templates for converting a hex-dominant mesh to an all-hex mesh. In: Proceedings of the 10th international meshing roundtable, Newport Beach, California, October 2001, pp 235–246

  10. Staten M, Canann S, Owen S (1998) BMSWEEP: locating interior nodes during sweeping. In: Proceedings of the 7th international meshing roundtable, Dearborn, Michigan, October 1998, pp 7–18

  11. Cook W, Oaks W (1983) Mapping methods for generating three-dimensional meshing. Comput Mech Eng 1:67–72

    MATH  Google Scholar 

  12. Whiteley M, White D, Benzley S, Blacker T (1996) Two and three-quarter dimensional meshing facilitators. Eng Comput 12:155–167

    Google Scholar 

  13. Blacker T (1991) Paving: a new approach to automated quadrilateral mesh generation. Int J Num Methods Eng 32:811–847

    MATH  Google Scholar 

  14. Owen S, Staten M, Canann S, Saigal S (1999) Q-morph: an indirect approach to advancing front quad meshing. Int J Num Methods Eng 9:1317–1340

    Article  MATH  Google Scholar 

  15. O‘Rourke J (1998) Computational geometry in C. Cambridge University Press, Cambridge

  16. Kraftcheck J (2000) Virtual geometry: a mechanism for modification of cad model topology for improved meshability. PhD thesis, University of Wisconsin, Madison

    Google Scholar 

  17. Sheffer A, Blacker T, Clements J, Bercovier M (1997) Virtual topology operators for meshing. In: Proceedings of the 6th international meshing roundtable, Park City, Utah, October 1997, pp 49–66

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

    Article  MATH  Google Scholar 

  19. Guttman A (1984) R-Trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM international conference on management of data (SIGMOD’84), Boston, Massachusetts, June 1984, pp 47–57

  20. Roussopoulos N, Kelley S, Frederic V (1995) Nearest neighbor queries. In: Proceedings of the ACM international conference on management of data (SIGMOD’95), San Jose, California, May 1995, pp 71–79

  21. White D, Saigal S (2002) Improved imprint and merge for conformal meshing. In: Proceedings of the 11th international meshing roundtable, Ithaca, New York, September 2002, pp 285–296

  22. Pratt V (1987) Direct least-squares fitting of algebraic surfaces. Comput Graphics 21:145–152

    MathSciNet  Google Scholar 

  23. Bowyer A (1981) Computing Dirichlet tessellations. Comput J 24(2):162–166

    MathSciNet  Google Scholar 

  24. Watson D (1981) Computing the Delaunay tesselation with application to Voronoi polytopes. Comput J 24:167–172

    MathSciNet  Google Scholar 

  25. George P, Hecht F, Saltel E (1991) Automatic mesh generator with specified boundary. Comput Methods Appl Mech Eng 92:269–288

    Article  MathSciNet  MATH  Google Scholar 

  26. Owen S, White D (2001) Mesh-based geometry: a systematic approach to constructing geometry from a finite element mesh. In: Proceedings of the 10th international meshing roundtable, Newport Beach, California, October 2001, pp 83–96

  27. Shepherd J (11/2003) CUBIT home page. Available at http://cubit.sandia.gov.

Download references

Author information

Authors and Affiliations

  1. Department of Civil and Environmental Engineering, Carnegie Mellon University, Pittsburgh, PA, 15213, USA

    David R. White, Sunil Saigal & Steven J. Owen

  2. Sandia National Laboratories, MS 0822, PO Box 5800, Albuquerque, NM, 87185-0847, USA

    David R. White & Steven J. Owen

  3. Department of Civil and Environmental Engineering, University of South Florida, Tampa, FL, 33620-5350, USA

    Sunil Saigal

Authors
  1. David R. White
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sunil Saigal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Steven J. Owen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to David R. White.

Additional information

Contract/grant sponsor: Sandia National Laboratories. Sandia National Laboratories is a multi-program laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy under contract DE-AC04-94-AL85000.

Rights and permissions

Reprints and permissions

About this article

Cite this article

White, D.R., Saigal, S. & Owen, S.J. CCSweep: automatic decomposition of multi-sweep volumes. Engineering with Computers 20, 222–236 (2004). https://doi.org/10.1007/s00366-004-0290-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00366-004-0290-6

Keywords

Search

Navigation