Skip to main content
Erschienen in: Engineering with Computers 3/2004

01.09.2004 | Original article

CCSweep: automatic decomposition of multi-sweep volumes

verfasst von: David R. White, Sunil Saigal, Steven J. Owen

Erschienen in: Engineering with Computers | Ausgabe 3/2004

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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.
Zurück zum Zitat Blacker T (1996) The Cooper tool. In: Proceedings of the 5th international meshing roundtable, Pittsburgh, Pennsylvania, October 1996, pp 13–30 Blacker T (1996) The Cooper tool. In: Proceedings of the 5th international meshing roundtable, Pittsburgh, Pennsylvania, October 1996, pp 13–30
4.
Zurück zum Zitat 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–275CrossRefMATH 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–275CrossRefMATH
5.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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–3349CrossRefMathSciNetMATH 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–3349CrossRefMathSciNetMATH
8.
Zurück zum Zitat Blacker T, Meyers R (1993) Seams and wedges in plastering: a 3D hexahedral mesh generation algorithm. Eng Comput 2:83–93 Blacker T, Meyers R (1993) Seams and wedges in plastering: a 3D hexahedral mesh generation algorithm. Eng Comput 2:83–93
9.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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.
Zurück zum Zitat Cook W, Oaks W (1983) Mapping methods for generating three-dimensional meshing. Comput Mech Eng 1:67–72MATH Cook W, Oaks W (1983) Mapping methods for generating three-dimensional meshing. Comput Mech Eng 1:67–72MATH
12.
Zurück zum Zitat Whiteley M, White D, Benzley S, Blacker T (1996) Two and three-quarter dimensional meshing facilitators. Eng Comput 12:155–167 Whiteley M, White D, Benzley S, Blacker T (1996) Two and three-quarter dimensional meshing facilitators. Eng Comput 12:155–167
13.
Zurück zum Zitat Blacker T (1991) Paving: a new approach to automated quadrilateral mesh generation. Int J Num Methods Eng 32:811–847MATH Blacker T (1991) Paving: a new approach to automated quadrilateral mesh generation. Int J Num Methods Eng 32:811–847MATH
14.
Zurück zum Zitat 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–1340CrossRefMATH 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–1340CrossRefMATH
15.
Zurück zum Zitat O‘Rourke J (1998) Computational geometry in C. Cambridge University Press, Cambridge O‘Rourke J (1998) Computational geometry in C. Cambridge University Press, Cambridge
16.
Zurück zum Zitat Kraftcheck J (2000) Virtual geometry: a mechanism for modification of cad model topology for improved meshability. PhD thesis, University of Wisconsin, Madison Kraftcheck J (2000) Virtual geometry: a mechanism for modification of cad model topology for improved meshability. PhD thesis, University of Wisconsin, Madison
17.
Zurück zum Zitat 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 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.
Zurück zum Zitat White D, Tautges T (2000) Automatic scheme selection for Toolkit hex meshing. Int J Methods Eng 49:127–144CrossRefMATH White D, Tautges T (2000) Automatic scheme selection for Toolkit hex meshing. Int J Methods Eng 49:127–144CrossRefMATH
19.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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.
Zurück zum Zitat Pratt V (1987) Direct least-squares fitting of algebraic surfaces. Comput Graphics 21:145–152MathSciNet Pratt V (1987) Direct least-squares fitting of algebraic surfaces. Comput Graphics 21:145–152MathSciNet
23.
24.
Zurück zum Zitat Watson D (1981) Computing the Delaunay tesselation with application to Voronoi polytopes. Comput J 24:167–172MathSciNet Watson D (1981) Computing the Delaunay tesselation with application to Voronoi polytopes. Comput J 24:167–172MathSciNet
25.
Zurück zum Zitat George P, Hecht F, Saltel E (1991) Automatic mesh generator with specified boundary. Comput Methods Appl Mech Eng 92:269–288CrossRefMathSciNetMATH George P, Hecht F, Saltel E (1991) Automatic mesh generator with specified boundary. Comput Methods Appl Mech Eng 92:269–288CrossRefMathSciNetMATH
26.
Zurück zum Zitat 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 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
Metadaten
Titel
CCSweep: automatic decomposition of multi-sweep volumes
verfasst von
David R. White
Sunil Saigal
Steven J. Owen
Publikationsdatum
01.09.2004
Erschienen in
Engineering with Computers / Ausgabe 3/2004
Print ISSN: 0177-0667
Elektronische ISSN: 1435-5663
DOI
https://doi.org/10.1007/s00366-004-0290-6

Weitere Artikel der Ausgabe 3/2004

Engineering with Computers 3/2004 Zur Ausgabe

Neuer Inhalt