论文信息 - Some useful data structures for the generation of unstructured grids

Some useful data structures for the generation of unstructured grids

Several data structures for the generation of unstructured grids are described. Their usefulness stems from the fact that they enable the necessary search operations to be performed in an optimal way. In particular, we describe heap lists, quad- and octrees, and linked lists. Combining these data structures, the important problem of interpolating information between unstructured grids is also solved.

Rainald Löhner | R. Löhner

[1] Adrian Bowyer,et al. Computing Dirichlet Tessellations , 1981, Comput. J..

[2] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[3] C. O. Frederick,et al. Two-dimensional automatic mesh generation for structural analysis (ijnme 2 (1970)) , 1970 .

[4] D. Mavriplis. Multigrid solution of the two-dimensional Euler equations on unstructured triangular meshes , 1987 .

[5] R W Hockney,et al. Computer Simulation Using Particles , 1966 .

[6] Rainald Löhner,et al. An unstructured multigrid method for elliptic problems , 1987 .

[7] Scott W. Sloan,et al. An implementation of Watson's algorithm for computing 2-dimensional delaunay triangulations , 1984 .

[8] S. Lo. A NEW MESH GENERATION SCHEME FOR ARBITRARY PLANAR DOMAINS , 1985 .

[9] D. F. Watson. Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..

[10] A Jameson,et al. CALCULATION OF IN VISCID TRANSONIC FLOW OVER A COMPLETE AIRCRAFT , 1986 .