Some useful data structures for the generation of unstructured grids. (English) Zbl 0643.65075

The author discusses data structures for the generation of unstructured grids. Algorithmic steps of advancing the front generator are also presented. The important problem of interpolating information between unstructured grids is also solved.
Reviewer: P.K.Mahanti


65N50 Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs
Full Text: DOI


[1] Watson, Comput. J. 24 pp 167– (1981)
[2] Bowyer, Comput. J. 24 pp 162– (1981)
[3] Sloan, Adv. Eng. Software 6 pp 192– (1984)
[4] and , ’Calculation of inviscid transonic flow over a complete aircraft’, AIAA-86-0103 (1986).
[5] Frederick, Int. j. numer. methods eng. 2 pp 133– (1970)
[6] van Phai, Int. j. numer. methods eng. 18 pp 237– (1982)
[7] Lo, Int. j. numer. methods eng. 21 pp 1403– (1985)
[8] Yerry, Int. j. numer. methods eng. 20 pp 1965– (1984)
[9] Peraire, Int. j. numer methods eng.
[10] The Art of Computer Programming, vol. 3; Addison-Wesley, Reading, Mass., 1973.
[11] Algorithms, Addison-Wesley, Reading, Mass., 1983.
[12] Williams, Comm. ACM 7 pp 347– (1964)
[13] Floyd, Comm. ACM 7 pp 701– (1964)
[14] Löhner, Int. j. numer. methods eng. 24 pp 101– (1987)
[15] and , ’Multigrid solution of the two-dimensional Euler equations on unstructured triangular meshes’, AIAA-87-0353 (1987).
[16] , and . ’Adaptive remeshing for compressible flow computations’, INME Swansea Rep. CR/R/544/86;
[17] J. Comp. Phys.
[18] , and . ’Adaptive grid refinement for the compressible Euler equations’, In Accuracy Estimates and Adaptive Refinements in Finite Element Computations (Eds. et al.), Wiley, New York, 1986.
[19] and , Computer Simulation using Particles, McGraw-Hill, New York, 1981.
[20] Multiple-Target Tracking with Radar Applications, Artech House, Massachusetts, 1986.
[21] and . ’BEAST: a high-performance battle engagement area simulator/tracker’, NRL Memo Rep. 5908 (1986).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.