Constrained Triangulation: Application to Hex-Dominant Mesh Generation
暂无分享,去创建一个
[1] R. Gadh,et al. Basic LOgical Bulk Shapes (BLOBs) for Finite Element Hexahedral Mesh Generation to Support Virtual Prototyping , 1998 .
[2] P. George,et al. Automatic mesh generator with specified boundary , 1991 .
[3] Timothy J. Tautges,et al. Feature recognition applications in mesh generation , 1997 .
[4] Paul-Louis George,et al. Delaunay triangulation and meshing : application to finite elements , 1998 .
[5] Matthew L. Staten,et al. Advancing Front Quadrilateral Meshing Using Triangle Transformations , 1998, IMR.
[6] N. Weatherill,et al. Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints , 1994 .
[7] S. Owen,et al. H-Morph: an indirect approach to advancing front hex meshing , 1999 .
[8] Steven J. Owen,et al. A Survey of Unstructured Mesh Generation Technology , 1998, IMR.
[9] Steven J. Owen. Nonsimplicial unstructured mesh generation , 1999 .
[10] D. F. Watson. Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..
[11] Timothy J. Tautges,et al. The "Hex-Tet" Hex-Dominant Meshing Algorithm as Implemented in CUBIT , 1998, IMR.
[12] Barry Joe,et al. Construction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations , 1995, SIAM J. Sci. Comput..
[14] Matthew L. Staten,et al. BMSweep: Locating Interior Nodes During Sweeping , 1999, Engineering with Computers.