Effects of Multi‐Scale Patterning on the Run‐In Behavior of Steel–Alumina Pairings under Lubricated Conditions

In nature, many examples of multi‐scale surfaces with outstanding tribological properties such as reduced friction and wear under dry friction and lubricated conditions can be found. To determine whether multi‐scale surfaces positively affect the frictional and wear performance, tests are performed on a ball‐on‐disk tribometer under lubricated conditions using an additive‐free poly‐alpha‐olefine oil under a contact pressure of around 1.29 GPa. For this purpose, stainless steel specimens (AISI 304) are modified by micro‐coining (hemispherical structures with a structural depth of either 50 or 95 μm) and subsequently by direct laser interference patterning (cross‐like pattern with 9 μm periodicity) to create a multi‐scale pattern. The comparison of different sample states (polished reference, laser‐patterned, micro‐coined, and multi‐scale) shows a clear influence of the fabrication technique. In terms of the multi‐scale structures, the structural depth of the coarser micro‐coining plays an important role. In case of lower coining depths (50 μm), the multi‐scale specimens show an increased coefficient of friction compared to the purely micro‐coined surfaces, whereas larger coining depths (95 μm) result in stable and lower friction values for the multi‐scale patterns.     

面向大型复杂焊接结构仿真的组合式自适应四面体网格生成算法

目的 研究高质量、高效率的网格生成技术以实现大型复杂结构的焊接工艺仿真优化。方法 提出一种组合式的自适应四面体网格划分算法,即在高效生成各个零部件四面体网格的基础上,根据焊缝中心面的几何信息自动对焊缝附近网格进行细分,再缝合成高质量的大型复杂焊接结构的整体四面体网格,并集成到自主可控的商用网格划分软件Vision Mesh中。提出了摄动几何边界的方法,解决了大型复杂结构STL几何体在存在几何错误时网格难以生成的问题。提出了基于BVH树结构表达的背景网格表达方法,解决了多条焊缝同时高效、自动细分的难题,并通过“四面体分割–四面体合并–四面体翻转–点平滑优化”方法,实现了四面体网格的高质量优化。结果 算法网格效率可以达到200万个/h,生成的四面体99%以上均接近正四面体。可以由多个零部件一步组合生成大型结构的整体网格,并可对焊缝区域进行自动细分,大幅度简化了划分流程。将生成的网格导入国产焊接仿真软件InteWeld中进行测试,验证算法可用于大型复杂焊接结构整体应力变形的计算中。结论 实现了大型复杂焊接结构的高质量自适应四面体网格划分,使用简便操作得到了高质量网格,为焊接结构件工艺仿真优化...     

Tetrahedral mesh generation in convex primitives

This paper presents a method for generating tetrahedral meshes in three-dimensional primitives. Given a set of closed and convex polyhedra having non-zero volume and some mesh controlling parameters, the polyhedra are automatically split to tetrahedra satisfying the criteria of standard finite element meshes. The algorithm tries to generate elements close to regular tetrahedra by maximizing locally the minimum solid angles associated to a set of a few neighbouring tetrahedra. The input parameters define the size of the tetrahedra and they can be used to increase or decrease the discretization locally. All the new nodes, which are not needed to describe the geometry, are generated automatically.     

Automatic three-dimensional finite element mesh generation via modified ray casting

Three-dimensional (3-D) finite element mesh generation has been the target of automation due to the complexities associated with generating and visualizing the mesh. A fully automatic 3-D mesh generation method is developed. The method is capable of meshing CSG solid models. It is based on modifying the classical ray-casting technique to meet the requirements of mesh generation. The modifications include the utilization of the element size in the casting process, the utilization of 3-D space box enclosures, and the casting of ray segments (rays with finite length). The method begins by casting ray segments into the solid. Based on the intersections between the segments and the solid boundary, the solid is discretized into cells arranged in a structure. The cell structure stores neighbourhood relations between its cells. Each cell is meshed with valid finite elements. Mesh continuity between cells is achieved via the neighbourhood relations. The last step is to process the boundary elements to represent closely the boundary. The method has been tested and applied to a number of solid models. Sample examples are presented.     

四边形网格生成的基区拼合法

提出了一种新的四边形有限元网格的生成方法——基区拼合法。在基区划分的基础上,先进行基区内部的网格生成,然后把各个基区缝合起来,形成完整的有限元网格。该方法简单且行之有效,特别适用于解决轮廓形状不太复杂的二维问题。