Interface handling for three‐dimensional higher‐order XFEM‐computations in fluid–structure interaction

Three‐dimensional higher‐order eXtended finite element method (XFEM)‐computations still pose challenging computational geometry problems especially for moving interfaces. This paper provides a method for the localization of a higher‐order interface finite element (FE) mesh in an underlying three‐dimensional higher‐order FE mesh. Additionally, it demonstrates, how a subtetrahedralization of an intersected element can be obtained, which preserves the possibly curved interface and allows therefore exact numerical integration. The proposed interface algorithm collects initially a set of possibly intersecting elements by comparing their ‘eXtended axis‐aligned bounding boxes’. The intersection method is applied to a highly reduced number of intersection candidates. The resulting linearized interface is used as input for an elementwise constrained Delaunay tetrahedralization, which computes an appropriate subdivision for each intersected element. The curved interface is recovered from the linearized interface in the last step. The output comprises triangular integration cells representing the interface and tetrahedral integration cells for each intersected element. Application of the interface algorithm currently concentrates on fluid–structure interaction problems on low‐order and higher‐order FE meshes, which may be composed of any arbitrary element types such as hexahedra, tetrahedra, wedges, etc. Nevertheless, other XFEM‐problems with explicitly given interfaces or discontinuities may be tackled in addition. Multiple structures and interfaces per intersected element can be handled without any additional difficulties. Several parallelization strategies exist depending on the desired domain decomposition approach. Numerical test cases including various geometrical exceptions demonstrate the accuracy, robustness and efficiency of the interface handling. Copyright © 2009 John Wiley & Sons, Ltd.     

基于主成分分析及连通性分析的建筑物LiDAR点云提取技术

为更有效分离LiDAR点云中的建筑物和高大植被,该文提出了主成分分析和连通性分析相结合的算法.利用滤波后的点云数据,基于主成分分析法初步提取建筑物点云,然后构建并优化Delaunay三角网进行连通性分析,可提取完整的建筑物信息.实验表明:该方法不仅能正确、有效地分离建筑物点和高大植被点,还可以去除建筑物噪声点(天线、烟囱、空调主机等).     

视觉测量系统中一种独立的畸变校正算法

针对视觉测量系统中畸变校正的计算过程复杂、 操作调整繁琐等问题,提出一种 基于虚拟模板的逐点畸变校正方法。首先基于交比不变性原理、镜头畸变特点和双线 性插值法,求解单幅虚拟平面模板内特征光点所对应成像点的理想坐标及其畸变修正量; 再通过单幅虚拟模板运行轨迹的小幅度旋转与平移,逐步构成一块包含密集校正光点的虚拟 畸变校正模板,为镜头畸变修正提供足够的插值节点;而后采用Delaunay三角剖分(DT)技术 ,最 终在整个像平面内逐点地校正各类镜头畸变,形成包含全部像素点理想坐标及畸变修正 量的畸变修正数据表。实验表明,经独立畸变校正的视觉系统,其测点反投位置偏差的标准 差达0.015mm、最大值仅0.068mm;本文方法 能有效地修正畸变,有助于提高视觉系统的测量精度。     

一种基于改进PointNet++网络的三维手姿估计方法

针对PointNet++网络处理点云局部特征时因分组范围区过大导致计算量较大的问题,提出一种改进的PointNet++网络的三维手姿估计方法。首先对手势点云进行基于Delaunay三角剖分算法与K中位数聚类算法相结合的三角剖分,得到手势点云的三角网格模型,并计算三角网格模型的边长均值;然后以三角网格模型边长均值为半径,对最远点采样(FPS)的采样点进行球查询搜索,再根据搜索到的采样点个数极值对采样点云进行K近邻分组,并最终输入PointNet网络,完成三维手姿的位置估计。改进后的PointNet++网络可以根据不同的点云密度自动调整网络分组区域的局部提取点个数。实验结果表明,在不影响三维手姿估计精度的情况下,该方法提高了PointNet++网络的模型训练速度,并在三维手姿估计中可有效减少特征提取的计算量,使计算机能够更快地捕捉手姿状态。     

Mesh Simplification

Mesh simplification is an important stage after surface reconstruction since the models produced can contain a large number of polygons making them difficult to manipulate. In this paper we present a mesh simplification algorithm to reduce the number of vertices in a dense mesh of triangles. The algorithm is based on edge operations that are performed in the inside of independent clusters distributed over the entire mesh. The clusters are well-characterized regions that can successfully accept simplification operations. The simplification operations produce only local transformations on the mesh. This region-based, distributed approach permits to easily track and control the changes in the triangulation and avoids the appearance of particular cases that would require a special handling. The algorithm uses two user-specified parameters to guide the operations. These parameters allow various simplification strategies that are illustrated on several dense triangulations.     

以三角形网格分割正球面三角形最优法探讨

本文基于正球面三角形,对其进行三角形网格再分格,以国外提出的优化结论式[1][3]为对象,提出了与该结论式完全相符的一种优化理论。本理论数学模型简明,适用于1/4球面,1/8球面和1/20球面等球面正三角形     

空间散乱点集Delaunay四面体剖分切割算法

提出最大空圆凸多边形和最大空球凸多面体的概念 .在此基础上 ,提出一种空间散乱点集 Delaunay四面体剖分算法 ,即对空间散乱点集首先进行最大空球凸多面体剖分 ,然后在多面体内部作 Delaunay四面体剖分 .这种方法消除了“退化”现象 (平面 3个以上点共圆或空间 4个以上点共球面 )引起的潜在错误 .最后分析了一类常见的 De-launay四面体剖分算法的潜在错误     

平面散乱点线集三角剖分的算法

利用平面扫描的思想，即利用从右到左移动的y-轴扫描点线集．当扫描线达到某个给定点或给定线段端点时，将该点或端点与其上下相邻线段端点连接．新连线与已三角剖分的边只能在其端点处相交．该算法的时间复杂性为O(N log N)，其中N是点线集中点的数目与线段端点数之和．     

液压破碎器在挖掘机上的使用

文章通过对大宇ＤＨ５０型挖掘机液压系统的分析,提出相应的改进措施以适应ＳＴＡＮＬＥＹ公司生产的ＭＢ６６型破碎器的性能要求,为在中小型挖掘机上安装较大马力的破碎器提供参考。     

Improvements in the reliability and element quality of parallel tetrahedral mesh generation

The paper presents a parallel tetrahedral mesh generation approach based on recursive bidivisions using triangular surfaces. Research was conducted for addressing issues concerning mesh generation reliability and element quality. A novel procedure employing local modification techniques is proposed for repairing the intersecting interdomain mesh instead of directly repeating the bidivision procedure, which improves the robustness of the complete meshing procedure significantly. In addition, a new parallel quality improvement scheme is suggested for optimizing the distributed volume meshes. The scheme is free of any communication cost and highly efficient. Finally, mesh experiments of hundreds of millions of elements are performed to demonstrate the reliability, effectiveness and efficiency of the proposed method and its potential applications to large‐scale simulations of complex aerodynamics models. Copyright © 2012 John Wiley & Sons, Ltd.