Construction of Unknotted and Knotted Symmetric Developable Bands

We describe a method for constructing developable bands with N ≥ 3 half twists. Each band is formed by threading a flat rectangular strip through a scaffold made from identical circular cylinders and smoothly connecting its short ends. The N cylinders in a scaffold are arranged with N-fold rotational symmetry. The number of half twists in a band is equal to the number N of cylinders in its scaffold and each band inherits the symmetry of its scaffold. Each scaffold admits a family of bands of the same length but variable width up to a maximum value determined by the features of the scaffold. Apart from orientable and nonorientable unknots, our method allows for the construction of bands with the topology of torus knots. We detail the geometric properties of the construction, discuss certain fundamental restrictions that must be met to ensure constructability, and calculate the elastic bending energy of each band. The rotational symmetry underlying the construction is essential for obtaining the presented bands, as the general non-symmetric problem is even more complex and has not yet been investigated. The bands and their corresponding scaffolds can be used as structural elements in practical applications, one of which we describe and analyze. The construction serves as a basis for a general framework for building a large variety of scaffolds and the corresponding unstretchable bands. Together, these assemblies can be used in architectural, interior, and machine design. They also open new avenues for the layout of conveyor belts in factories, airports, and other settings.

Solution of the Rectangular Strip Packing Problem Considering a 3-Stage Guillotine Cutting Constraint with Finite Slitter Blades

In this study, we propose a new algorithm to solve the rectangular strip packing problem (RSPP), a variant of the cutting stock problem in which the mother materials have a common fixed width and infinite length. Based on the column-generation technique with three improvements, the proposed algorithm can solve large-scale problems involving tens of thousands of materials within a reasonable time, considering practical cutting constraints, i.e., the three-stage guillotine cutting constraint and the limitations of slitter blades. The proposed algorithm is evaluated in terms of its packing efficiency and calculation time.