Generation of three‐dimensional unstructured grids by the advancing‐front method
Authors:
- 1 October 1988
- journal article
- research article
- Published by Wiley in International Journal for Numerical Methods in Fluids
- Vol. 8 (10) , 1135-1149
Abstract
The generation of three‐dimensional unstructured grids using the advancing‐front technique is described. This technique has been shown to be effective for the generation of unstructured grids in two dimensions.1,2 However, its extension to three‐dimensional regions required algorithms to define the surface and suitable data structures that avoid excessive CPU‐time overheads for the search operations involved. After obtaining an initial triangulation of the surfaces, tetrahedra are generated by successively deleting faces from the generation front. Details of the grid generation algorithm are given, together with examples and timings.Keywords
This publication has 11 references indexed in Scilit:
- Some useful data structures for the generation of unstructured gridsCommunications in Applied Numerical Methods, 1988
- Adaptive remeshing for compressible flow computationsJournal of Computational Physics, 1987
- Improvements to the aircraft Euler method1987
- Calculation of Inviscid Transonic Flow over a Complete Aircraft1986
- A new mesh generation scheme for arbitrary planar domainsInternational Journal for Numerical Methods in Engineering, 1985
- Automatic three‐dimensional mesh generation by the modified‐octree techniqueInternational Journal for Numerical Methods in Engineering, 1984
- An implementation of Watson's algorithm for computing 2-dimensional delaunay triangulationsAdvances in Engineering Software (1978), 1984
- The Quadtree and Related Hierarchical Data StructuresACM Computing Surveys, 1984
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Computing Dirichlet tessellationsThe Computer Journal, 1981