Abstract
This paper discusses the development of an automatic mesh generation technique designed to operate effectively on multiple instruction multiple data (MIMD) parallel computers. The meshing approach is hierarchical, that is, model entities are meshed after their boundaries have been meshed. Focus is on the region meshing step. An octree is constructed to serve as a localization tool and for efficiency. The tree is also key to the efficient parallelization of the meshing process since it supports the distribution of load to processors. The parallel mesh generation procedure repartitions the domain to be meshed and applies on processor face removals until all face removals with local data have been performed. The portion of the domain to be meshed remaining is dynamically repartitioned at the octant level using an Inertial Recursive Bisection method and local face removals are reperformed. Migration of a terminal octant involves migration of the octant data and the octant's mesh faces and/or mesh regions. Results show relatively good speed-ups for parallel face removals on small numbers of processors. Once the three-dimensional mesh has been generated, mesh regions may be scattered across processors. Therefore, a final dynamic repartitioning step is applied at the region level to produce a partition ready for finite element analysis.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
George, P. L. (1991) Automatic Mesh Generation, Chichester, John Wiley and Sons
Shephard, M. S.; Weatherill, N. P. (Editors) (1991) Int. J. Numer. Meth. Engng., Vol 32, Chichester, Wiley-Interscience
Weatherill, N. P.; Hassan, O. (1994) Efficient three-dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints, Int. J. Numer. Meth. Engng., 37, 2005–2039
de Cougny, H. L.; Devine, K. D.; Flaherty, J. E.; Loy, R. M.; Ozturan, C.; Shephard, M. S. (1994) Load balancing for the parallel solution of partial differential equations, Applied Numerical Mathematics, Vol 16, pp 157–182
Ozturan, C., de Cougny, H. L.; Shephard, M. S.; Flaherty, J. E. (1994) Parallel adaptive mesh refinement and redistribution on distributed memory machines, Comp. Meth. Appl. Mech. Engng., 119, 123–137
Shephard, M. S., Bottasso, C. L., de Cougny, H. L. ; Ozturan, C. (1994) Parallel adaptive finite element analysis of fluid flows on distributed memory computers. In Recent Developments in Finite Element Analysis, pp 205–214, Barcelona, Int. Center for Num. Meth. in Engng.
Ozturan, C. (1995) Dynamic load balancing for adaptive finite element methods, PhD Thesis, Rensselaer Polytechnic Institute, Troy NY
Löhner, R.; Camberos, J.; Merriam, M.; (1992) Parallel unstructured grid generation. Comp. Meth. Appl. Mech. Engng., 95, 343–357
Saxena, M.; Perucchio, R. (1992) Parallel FEM algorithms based on recursive spatial decompositions—I. Automatic mesh generation, Computers and Structures, 45, 817–831
Shephard, M. S.; Georges, M. K. (1991) Automatic three-dimensional mesh generation by the Finite Octree technique, Int. J. Numer. Meth. Engng., 32(4); 709–749
Schroeder, W. J.; Shephard, M. S. (1990) A combined octree/Delaunay method for fully automatic 3-D mesh generation, Int. J. Numer. Meth. Engng., 29, 37–55
Shephard, M. S.; Georges, M. K. (1992) Reliability of automatic 3-D mesh generation, Comp. Meth. Appl. Mech. Engng, 101; 443–462
de Cougny, H. L.; Shephard, M. S.; Ozturan, C. (1995) Parallel three-dimensional mesh generation, Computing Systems in Engineering, to appear
Schroeder, W. J.; Shephard, M. S. (1991) On rigorous conditions for automatically generated finite element meshes. In Product Modeling for Computer-Aided Design and Manufacturing, Turner, J.; Pegna, J.; Wozny, M. (Editors) Amsterdam, North-Holland
Yerry, M. A.; Shephard, M. S. (1984) Automatic three-dimensional mesh generation by the modified-octree technique, Int. J. Numer. Meth. Engng. 20, 1965–1990
Kernigham, B. W.; Ritchie, D. M. (1990) The C Programming Language, Englewood Cliffs, NJ 07632, Prentice Hall
Samet, H. (1984) The quadtree and related hierarchical data structures, Computing Surveys, 16, ACM Comput, Surveys, Vol 16, no 2, June 1984, pp 187–260
Weiler, K. J. (1988) The radial-edge structure: A topological representation for non-manifold geometric boundary representations. In Geometric Modeling for CAD Applications, Wozny, M. J.; McLaughlin, H. W.; Encarnacao, J. L. (Editors) pp. 3–36, North-Holland
Beall, M. W. (1993) Scorec mesh database users guide, version 2.2—draft, Technical Report SCOREC #26-1993, Scientific Computation Research Center, Rensselaer Polytechnic Institute, Troy, NY
Löhner, R.; Ramamurti, R. (1993) A parallelizable load balancing algorithm. In Proc. of the AIAA 31st Aerospace Sciences Meeting and Exhibit
Berger, M. J.; Bokhari, S. H. (1987) A partitioning strategy for nonuniform problems on multiprocessors, IEEE Transactions on Computers, C-36(5), 570–580
Leiss, E.; Reddy, H. (1989) Distributed load balancing: Design and performance analysis, Technical Report Vol. 5, W. M. Keck Research Computation Laboratory
Vidwans, A.; Kallinderis, Y.; Venkatakrishnan V. (1994) Parallel dynamic load-balancing algorithm for three-dimensional adaptive unstructured grids, AIAA Journal, 32(3), 497–505
Sedgewick, R. (1990) Algorithms in C, Reading MA, Addison-Wesley Publishing Company
Jaja, J. (1992) An Introduction to Parallel Algorithms, Reading MA, Addison-Wesley
Blelloch, G.; Leiserson, C.; Maggs, B.; Plaxton, C.; Smith, S.; Zagha, M. (1991) A comparison of sorting algorithms for the connection machine cm-2, ACM, 089791-438-4191, p 3–16
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
de Cougny, H.L., Shephard, M.S. & Özturan, C. Parallel three-dimensional mesh generation on distributed memory MIMD computers. Engineering with Computers 12, 94–106 (1996). https://doi.org/10.1007/BF01299395
Issue Date:
DOI: https://doi.org/10.1007/BF01299395