期刊文献+

有限元网格全自动生成中的初始三角化新方法 被引量:3

A New Initial Triangulation Approach of Fully Automatic Mesh Generation for Computation with FEM
下载PDF
导出
摘要 基于Delaunay三角化技术提出了一种快速可靠的全自动初始三角化新方法,给出了一种简单有效的边界约束施加方法,所给出的实例表明了所提出的初始三角化方法的性能. A fully automatic initial mesh generating algorithm based on the Delaunay triangulation technique is presented. A simple but effective method for imposing the boundary constraint is given. Examples are provided to show the performance of the algorithm. As an important part of a geometrybased, fast, effective, automatic and adaptive mesh generating scheme proposed by the authors, the initial mesh generating algorithm requires only the characteristic venices of the objective boundary and the boundary line segments as the original input data. The algorithm is suitable for any complex planar domain.
出处 《华中理工大学学报》 CSCD 北大核心 1996年第5期19-22,共4页 Journal of Huazhong University of Science and Technology
关键词 全自动网格生成 初始三角化 有限元 fully automatic mesh generation initial triangulation Delaunay triangulation finite element
  • 相关文献

参考文献1

  • 1Ho L K,Computer.Aided Design,1988年,20卷,27页

同被引文献6

  • 1胡恩球,陈贤珍,周克定,张新访.有限元网格自动生成中的网格加密新方法[J].华中理工大学学报,1996,24(5):23-26. 被引量:3
  • 2[1]Baker B,Grosse E and Rafferty C S.Nonobtuse triangulation of polygons[J],Discrete Comput Geom,1988,3:147~168
  • 3[2]Bern M,Eppstein D and Gilbert J R.Provably good mesh generation[A],In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science[C],IEEE,1990:231~241
  • 4[3]Ruppert J.A Delaunay refinement algorithm for quality 2-dimensional mesh generation[J],J Algorithms,1995,18(3):548~585
  • 5[5]Shewchuk J R.Delaunay refinement algorithms for triangular mesh generation[J],Comput Geom,2002,22:21~74
  • 6Jin H,Int J Num Meth Eng,1990年,29卷,1501页

引证文献3

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部