A boundary recovery algorithm for Delaunay tetrahedral meshing
Conference
·
OSTI ID:416545
- Tohoku Univ., Sendai (Japan)
A method for automatic generation of unstructured grids comprised of tetrahedra is discussed. Delaunay approach for tetrahedral grid generation is used. Particular attention is given to the boundary constraining problem. A simple and robust algorithm for the boundary constraining by successive use of boundary edge swapping, tetrahedral edge swapping and direct subdivision of tetrahedra is used. Small modifications allow to apply the method for viscous grid generation as well. Grid examples demonstrate efficiency of the method.
- OSTI ID:
- 416545
- Report Number(s):
- CONF-960489-; TRN: 96:006130-0024
- Resource Relation:
- Conference: 5. international conference on numerical grid generation in computational fluid dynamics and related fields, Starkville, MS (United States), 1-5 Apr 1996; Other Information: PBD: 1996; Related Information: Is Part Of Numerical grid generation in computational field simulations. Volume 1; Soni, B.K.; Thompson, J.F.; Haeuser, J.; Eiseman, P.R. [eds.]; PB: 1144 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
A three-dimensional electrostatic particle-in-cell methodology on unstructured Delaunay-Voronoi grids
Automated Geometry Blocking Using an Adaptive Mesh Refinement Algorithm
A mesh generator for tetrahedral elements using Delaunay triangulation
Journal Article
·
Mon Jun 01 00:00:00 EDT 2009
· Journal of Computational Physics
·
OSTI ID:416545
Automated Geometry Blocking Using an Adaptive Mesh Refinement Algorithm
Conference
·
Fri Sep 01 00:00:00 EDT 2000
·
OSTI ID:416545
+1 more
A mesh generator for tetrahedral elements using Delaunay triangulation
Journal Article
·
Mon Mar 01 00:00:00 EST 1993
· IEEE Transactions on Magnetics (Institute of Electrical and Electronics Engineers); (United States)
·
OSTI ID:416545