On finite element mesh reconstruction from nodal coordinates
暂无分享,去创建一个
[1] S. Sloan. A fast algorithm for constructing Delaunay triangulations in the plane , 1987 .
[2] Y. Correc,et al. Fast computation of Delaunay triangulations , 1987 .
[3] D. Ewing,et al. Rules governing the numbers of nodes and elements in a finite element mesh , 1970 .
[4] Alan George,et al. An Implementation of a Pseudoperipheral Node Finder , 1979, TOMS.
[5] Ove Skovgaard,et al. A scheme for automatic generation of boundary-fitted depth- and depth-gradient- dependent grids in arbitrary two-dimensional regions , 1990 .
[6] J. Pasciak,et al. Computer solution of large sparse positive definite systems , 1982 .
[7] S. H. Lo,et al. Delaunay triangulation of non‐convex planar domains , 1989 .
[8] James E. Vastyan,et al. Computer graphics: A programming approach , 1983 .
[9] John G. Lewis. Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms , 1982, TOMS.
[10] Scott W. Sloan,et al. A FORTRAN program for profile and wavefront reduction , 1989 .
[11] H. Fuhring,et al. The application of node-element rules for forecasting problems in the generation of finite element meshes , 1975 .
[12] M. Randolph,et al. Automatic element reordering for finite element analysis with frontal solution schemes , 1983 .