面向钣金折弯的GPU-CPU加速包围盒优化算法

GPU-CPU Accelerated Bounding Box Optimization Algorithm for Sheet Metal Bending

  • 摘要: 针对现有包围盒生成方法在处理钣金折弯数字化制造中的碰撞检测时存在无效空间大、假性碰撞率高及计算复杂度高等问题,提出一种面向钣金折弯的GPU-CPU加速包围盒优化算法。该算法利用钣金加工环境中拉伸体的几何特性,通过自适应栅格化、并行扫描合并及参数化拉伸机制生成紧凑高效的包围盒簇,并引入多分辨率策略和混合加速框架以平衡精度与计算效率。实验结果表明,与轴对齐包围盒(AABB)、有向包围盒(OBB)、凸包、AlphaShape和k离散有向多面体(k-DOP)方法相比,所提算法的包围盒贴合度得到大幅提升,计算时间缩短至毫秒级。

     

    Abstract: To address the problems of large invalid space, high false collision rate, and high computational complexity in existing bounding box generation methods for collision detection in digital manufacturing of sheet metal bending, a GPU-CPU accelerated bounding box optimization algorithm for sheet metal bending is proposed. The algorithm exploits the geometric characteristics of extruded bodies in sheet metal processing environments, generates compact and efficient bounding box clusters through adaptive rasterization, parallel scan merging, and a parametric extrusion mechanism, and introduces a multi-resolution strategy and a hybrid acceleration framework to balance accuracy and computational efficiency. Experimental results show that, compared with the axis-aligned bounding box (AABB), oriented bounding box (OBB), convex hull, AlphaShape, and k-discrete oriented polytope (k-DOP) methods, the proposed algorithm significantly improves bounding box tightness and reduces computation time to the millisecond level.

     

/

返回文章
返回