SOME USEFUL DATA STRUCTURES FOR THE GENERATION OF UNSTRUCTURED GRIDS.

Communications in Applied Numerical Methods

Volumn 4, Issue 1, 1988, Pages 123-135

  Lohner, Rainald ^a  

^a Berkeley Research Associates   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AERODYNAMICS - WINGS AND AIRFOILS; COMPUTER PROGRAMMING - ALGORITHMS; COMPUTER SIMULATION; FLOW OF FLUIDS - BUBBLE FORMATION; MATHEMATICAL TECHNIQUES - FINITE ELEMENT METHOD;

FRONTAL GRID GENERATION SCHEMES; HEAP LISTS; OCTREES; QUADTREES; UNSTRUCTURED GRID GENERATION;

DATA PROCESSING;

EID: 0023847330     PISSN: 07488025     EISSN: None     Source Type: Journal    
DOI: 10.1002/cnm.1630040116     Document Type: Article

References (20)

1. 1 D. F. Watson. ‘ Computing the N‐dimensional Delaunay tesselation with application to Voronoi polytopes ’, Comput. J., 24 (2), 167–172 (1981).
2. 2 A. Bowyer. ‘ Computing Dirichlet tesselations ’, Comput. J., 24 (2), 162–167 (1981).
3. 3 S. W. Sloan and G. T. Houlsby. ‘ An implementation of Watson's algorithm for computing 2‐dimensional Delaunay triangulations ’, Adv. Eng. Software, 6 (4), 192–197 (1984).
4. 4 A. Jameson, T. J. Baker and N. P. Weatherhill, ‘ Calculation of inviscid transonic flow over a complete aircraft ’, AIAA‐86‐0103 (1986).
5. 5 C. O. Frederick, Y. C. Wong and F. W. Edge. ‘ Two‐dimensional automatic mesh generation for structural analysis ’, Int. j. numer. methods eng., 2, 133–144 (1970).
6. 6 N. van Phai. ‘ Automatic mesh generation with tetrahedron elements ’, Int. j. numer. methods eng., 18, 237–289 (1982).
7. 7 S. H. Lo. ‘ A new mesh generation scheme for arbitrary planar domains ’, Int. j. numer. methods eng., 21, 1403–1426 (1985).
8. 8 M. A. Yerry and M. S. Shepard. ‘ Automatic three‐dimensional mesh generation by the modified‐octree technique ’, Int. j. numer. methods eng., 20, 1965–1990 (1984).
9. 9 J. Peraire and K. Morgan. ‘ A general triangular mesh generator ’, Int. j. numer methods eng. (to appear).
10. 10 D. N. Knuth, The Art of Computer Programming, vol. 3 ; Addison‐Wesley, Reading, Mass., 1973.
11. 11 R. Sedgewick, Algorithms, Addison‐Wesley, Reading, Mass., 1983.
12. 12 J. W. J. Williams. ‘ Heapsort ’, Comm. ACM, 7, 347–348 (1964).
13. 13 R. W. Floyd. ‘ Treesort 3 ’. Comm. ACM, 7, 701 (1964).
14. 14 R. Löhner and K. Morgan. ‘ An unstructured multigrid method for elliptic problems ’, Int. j. numer. methods eng., 24, 101–115 (1987).
15. 15 D. Mavriplis and A. Jameson, ‘ Multigrid solution of the two‐dimensional Euler equations on unstructured triangular meshes ’, AIAA‐87‐0353 (1987).
16. 16 J. Peraire, M. Vahdati, K. Morgan and O. C. Zienkiewicz. ‘ Adaptive remeshing for compressible flow computations ’, INME Swansea Rep. CR/R/544/86; J. Comp. Phys. (to appear).
17. 17 R. Löhner, K. Morgan, and O. C. Zienkiewicz. ‘ Adaptive grid refinement for the compressible Euler equations ’, In Accuracy Estimates and Adaptive Refinements in Finite Element Computations (Eds. I. Babuska et al.), Wiley, New York, 1986.
18. 18 R. W. Hockney and J. W. Eastwood, Computer Simulation using Particles, McGraw‐Hill, New York, 1981.
19. 19 S. S. Blackman, Multiple‐Target Tracking with Radar Applications, Artech House, Massachusetts, 1986.
20. 20 J. P. Boris, J. M. Picone and S. G. Lambrakos. ‘BEAST: a high‐performance battle engagement area simulator/tracker’, NRL Memo Rep. 5908 (1986).