Delaunay versus max‐min solid angle triangulations for three‐dimensional mesh generation
暂无分享,去创建一个
[1] William H. Frey,et al. An apporach to automatic three‐dimensional finite element mesh generation , 1985 .
[2] Bernard Chazelle,et al. Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm , 1984, SIAM J. Comput..
[3] Charles L. Lawson,et al. Properties of n-dimensional triangulations , 1986, Comput. Aided Geom. Des..
[4] Paresh Parikh,et al. Generation of three-dimensional unstructured grids by the advancing-front method , 1988 .
[5] C. Lawson. Software for C1 Surface Interpolation , 1977 .
[6] T. J. Baker,et al. Developments and trends in three-dimensional mesh generation , 1989 .
[7] A. Jameson,et al. Improvements to the aircraft Euler method , 1987 .
[8] R. B. Simpson,et al. Triangular meshes for regions of complicated shape , 1986 .
[9] D. F. Watson. Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..
[10] Günter Ewald,et al. Geometry: an introduction , 1971 .
[11] B. Joe. Delaunay Triangular Meshes in Convex Polygons , 1986 .
[12] B. Joe. Three-dimensional triangulations from local transformations , 1989 .