Abstract:

The port section intersecting lines of circular tubes are always mutational and complicated space curves in multi-pipe intersecting structures. Aiming at solving the packing problem of circular tubes in multi-pipe intersecting structures, this paper introduced a nodal translational tentative packing algorithm after analyzing development drawing which was based on analytic geometry and the principle of numerical integration. It gave the best packing scheme by using multipoint subdivision which was independent variable and integral area of waste tubes in development drawing. The packing problem of circular tubes that have port section intersecting lines in arbitrary shape can be solved effectively. Through examples, it can be seen that the algorithm is universal and efficient.

Key words: multi-pipe intersection, packing problem, nodal translation, integral area

摘要：

在多管相贯的桁架结构中,圆管端口截面相贯线通常为突变多、形状复杂的空间曲线。针对传统排料算法难以处理多管相贯模型下圆管排料的问题,利用空间解析几何知识和数值积分原理,在分析相贯线平面展开的基础上,提出了多管相贯结构中圆管的分点平移试探排料算法。该算法以细分点为自变量,通过对细分点位置进行平移,循环比较展开图中管件废料的积分面积,从而找出最优排料方案。该算法能有效处理端口截面相贯线为任意形状的圆管排料问题。对以该算法为基础的排料模型进行了仿真试验,验证了该算法的通用性和可靠性。

关键词: 多管相贯, 排料, 分点平移, 积分面积