检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]扬州大学水利科学与工程学院,江苏扬州225009 [2]长江科学院,武汉430010
出 处:《长江科学院院报》2011年第11期96-99,109,共5页Journal of Changjiang River Scientific Research Institute
基 金:国家自然科学基金(51179014);江苏省自然科学基金(BK2011450)
摘 要:在高阶DDA用于连续结构的计算分析中,需要在块体之间的相邻面上设置刚性的"连接点对"将相互独立的块体连接成一个连续的整体。对于多构件的复杂结构,快速均匀布点是一个难点。基于Voronoi图理论,改进了几何法生成Voronoi图的算法,并基于质心法对点的位置进行优化。据此编制了相关程序,并采用算例进行了验证。计算结果表明:该方法可以快速在任意凸多边形内获得分布均匀的一系列点,能方便地应用于三维高阶DDA计算分析。In the analysis of applying high order Discontinuous Deformation Analysis(DDA) to continuous structures,some stiff junction pairs are required to be set on the adjacent faces between blocks to connect the discrete blocks into a whole.Nonetheless,it involves great difficulty to rapidly lay out these points for complex structureswith multiple structural members.In this paper,the geometric method algorithm to generate Voronoi tessellation is improved on the basis of Voronoi tessellation theory,and the locations of the points are optimized with centroid method.Program is compiled based on the above optimizations and is verified by several examples.The calculation results show that a series of points well distributed in an arbitrary convex polygon can be generated quickly with the suggested method,which thus could be applied in three-dimensional high order DDA analysis easily.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.138.106.12