Fiber web generation method

Abstract

The invention discloses a fiber web generation method, which comprises the following steps of: randomly setting a square space in a limited space, and generating a polyline in the square space; performing polynomial interpolation processing on the polyline to form a fiber segment with a smooth track; circulating setting of the random square space is continued, fiber segments are generated in the space, a certain number of fiber segments exist in the limited space, and a fiber net is formed by the multiple fiber segments in the limited space; and numbering fiber segments and marking track points of the fiber segments to form a track coordinate data list of a virtual fiber web for digital modeling of various non-woven fiber webs. According to the method, parameters such as the fiber density, the fiber bending type and spatial distribution, the fiber web size and the like in the fiber web can be adjusted, fiber web data can be rapidly generated, and the method is suitable for parameterized modeling research of various fiber webs.

Description

Technical Field

[0001] The present invention relates to the technical field of nonwoven digitalization, and particularly relates to a method for generating a fiber web. Background Art

[0002] Nonwoven fabric, also known as non-woven cloth or non-woven fabric, is a subdivision product formed in the innovative industrial application of the traditional textile industry. Its principle is to form a non-woven fabric through air flow or mechanical web formation and then through processes such as hydroentangling, needling, or hot rolling. It is a new type of fiber product with softness, breathability, and a planar structure, and has been widely used in the fields of medical and health, civil engineering, gardening, agriculture, and composites.

[0003] Nonwoven fabrics have a complex fiber interlacing structure and pore distribution. At present, researchers are still unable to conduct performance analysis and parametric research through digital modeling. Summary of the Invention

[0004] In view of this, the purpose of the present invention is to provide a method for generating a fiber web, which is applicable to digital modeling of nonwoven fiber webs such as spunbonded fabrics, meltblown fabrics, carbon fiber or glass fiber webs.

[0005] To solve the above technical problems, the technical solution of the present invention is: a method for generating a fiber web, randomly setting a square space in a finite space, generating a polyline in the square space; performing polynomial interpolation processing on the polyline to form a fiber segment with a smooth trajectory; continuing to perform cyclic setting of the random square space and generating fiber segments in the space, so that there are a certain number of fiber segments in the finite space, and the numerous fiber segments in the finite space form a fiber web; performing numbering of the fiber segments and marking of their trajectory points to form a list of trajectory coordinate data of the virtual fiber web.

[0006] As a preferred solution of the present invention, the finite space uses a Cartesian coordinate system, and the length, width, and height values of the finite space are in the same proportion as the target fiber web.

[0007] As a preferred solution of the present invention, the square space uses a Cartesian coordinate system, and the length, width, and height values of the square space are controllable variables.

[0008] As a preferred solution of the present invention, the relationship between the position and size between the finite space and the square space is as follows, where A n and B n are the coordinates of the diagonal vertices of the finite space, a f and b f are the coordinates of the diagonal vertices of the square space, ΔF and ΔN represent the sizes of the two regions, and ΔV represents the distance between the positions of the two regions. It is necessary to ensure that V f is less than V n , and V f is within Vn Inside.

[0009] ΔN = diag(B n 11 -A n 11 B n 21 -A n 21 B n 31 -A n 31 );

[0010] ΔF = diag(b f 11 -a f 11 , b f 21 -a f 21 , b f 31 -a f 31 );

[0011] ΔV = diag(B n 11 -b f 11 , B n 21 -b f 21 , B n 31 -b f 31 );

[0012]

[0013] As a preferred embodiment of the present invention, the polyline randomly generates the coordinates of the first point and the second point in a square space. The distance between the coordinates of the first point and the second point is a controllable variable. Then, it continues to randomly generate the coordinates of the third point, and determines whether the coordinates of the third point satisfy the local deflection angle condition of the bending type. Subsequently, it continues to randomly generate the coordinates of the fourth point, the fifth point, and the sixth point. The number of randomly generated points is a controllable variable.

[0014] As a preferred embodiment of the present invention, the relational expression of the local deflection angle is as follows:

[0015] α N is the local deflection angle at the (N - 1)th node in the virtual fiber. The value of α is determined according to the fiber trajectory type. l N is taken, and l (N-2，N)is the distance between the (N - 2)th node and the Nth node;

[0016] α N = cos -1 ((l (N-2，N-1) 2 + l (N-1，N) 2 - l (N-2，N ) 2 ) / (2l (N-2，N-1) l (N-1，N) ).

[0017] As a preferred embodiment of the present invention, the bending types preferably include nearly straight, large bend, and wavy. The local deflection angle of the nearly straight type is ≤α, the local deflection angle of the large bend type is ≥β, and the wavy type has multiple local deflection angles ≥α.

[0018] As a preferred embodiment of the present invention, the fiber segments are sequentially connected in series by trajectory points, and the trajectory points include master control points and interpolation points.

[0019] As a preferred embodiment of the present invention, the fiber segments include fiber clusters with proportions, and the proportion of the fiber clusters is a controllable variable; the fiber clusters include dominant fibers and subsidiary fibers, C i，j = (x, y, z) T is the coordinate of the jth node on the ith fiber, C 0，j is the coordinate of the jth node on the dominant fiber, and a1, a2, and a3 are the position parameters of the subsidiary fibers. Their relationship is as follows:

[0020]

[0021] As a preferred embodiment of the present invention, the position coordinates of the cyclic set square space are random, and the number of cycles is a controllable variable. The trajectory coordinate data list includes fiber segment number, bending type, number of master control points, number of interpolation points, master control point coordinates, interpolation point coordinates, local deflection angle of adjacent master control point line segments, and proportion of each bending type. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] Figure 1 is the flowchart of the fiber web;

[0023] Figure 2 is the definition schematic diagram of the finite space and the square space;

[0024] Figure 3 is the fiber bending type of the specific embodiment of the present invention;

[0025] Figure 4 is the virtual fiber web of the specific embodiment of the present invention. DETAILED DESCRIPTION OF THE INVENTION

[0026] The following further details the specific embodiments of the present invention in conjunction with the accompanying drawings, so that the technical solutions of the present invention are easier to understand and master.

[0027] The present invention patent provides a method for generating a fiber web, including the following steps:

[0028] Step 1, refer to Figure 1 , randomly set a square space in a limited space, and generate a polyline in the square space; the limited space preferably adopts a Cartesian coordinate system, and its length, width, and height values are similar to those of the target fiber web. The square space preferably adopts a Cartesian coordinate system, and its length, width, and height values are controllable variables, and preferably adopt probability random numbers within a set range.

[0029] The limited space and the square space are as Figure 2 shown, and the relational expressions of the positions and sizes between the two are as follows, where A n and B n are the coordinates of the diagonal vertices of the limited space, a f and b f are the coordinates of the diagonal vertices of the square space, ΔF and ΔN represent the sizes of the two regions, and ΔV represents the distance between the positions of the two regions. It is necessary to ensure that V f is less than V n , and V f is inside V n .

[0030] ΔN = diag(B n 11 - A n 11 , B n 21 - A n 21 , B n 31 - A n 31 );

[0031] ΔF = diag(b f 11 - a f 11 , b f 21 - 21 , b f 31 - a f 31 );

[0032] ΔV = diag(B n 11 - b f11 , B n 21 -b f 21 , B n 31 -b f 31 );

[0033]

[0034] Step 2: Perform polynomial interpolation on the polyline to form fiber segments with a smooth trajectory. The polyline is characterized by randomly generating the coordinates of the first and second points in a square space, and the distance between the two points is a controllable variable. Continue to randomly generate the coordinates of the third point, and determine whether the coordinates of the third point satisfy the local deflection angle condition of the bending type. Continue to randomly generate the coordinates of the fourth, fifth, and sixth points. The number of randomly generated points is a controllable variable.

[0035] The bending types are as Figure 3 shown, and preferably include near-linear (local deflection angle ≤ α), large-bending (local deflection angle ≥ β), and wavy (having multiple local deflection angles ≥ α). The relationship of the local deflection angle is as follows, α N is the local deflection angle at the (N - 1)th node in the virtual fiber, and the value of α N is taken according to the fiber trajectory type. l (N-2，N) is the distance between the (N - 2)th node and the Nth node, l (N-2，N-1) and l (N-1，N) and so on.

[0036] α N = cos -1 ((l (N-2，N-1) 2 + l (N-1，N) 2 - l (N-2，N) 2 ) / (2l (N-2，N-1) l (N-1，N) ))).

[0037] Step 3: Continue to set the loop of the random square space, and generate fiber segments in the space so that there are a certain number of fiber segments in the finite space. The numerous fiber segments in the finite space form a fiber network. The fiber segment is characterized by being serially connected by trajectory points, and its trajectory points include master control points and interpolation points. The fiber segment is characterized by having a certain proportion of fiber clusters, and the proportion of fiber clusters is a controllable variable.

[0038] Step 4: Number the fiber segments and mark their trajectory points to form a list of trajectory coordinate data of the virtual fiber network for digital modeling of various non-woven fiber networks.

[0039] In step 3, the characteristics of the fiber cluster are divided into dominant fibers and accessory fibers, C i，j =(x, y, z) T is the coordinate of the j-th node on the i-th fiber, C 0，j is the coordinate of the j-th node on the dominant fiber, and a1, a2, and a3 are the position parameters of the accessory fibers. The relational expressions are as follows:

[0040]

[0041] In step 4, the characteristics of the loop setting are that the position coordinates of the square space are random, and the number of loops is a controllable variable.

[0042] The trajectory coordinate data list in step 4 preferably includes fiber segment numbers, bending types, the number of master control points, the number of interpolation points, master control point coordinates, interpolation point coordinates, the local deflection angle of adjacent master control point line segments, and the proportion of each bending type.

[0043] Please refer to Figure 4 , the embodiments of this invention patent provide three types of virtual fiber meshes, all with dimensions of 10mm * 10mm * 2mm. For example, in the melt-blown cloth, there are 150 fibers. The probability of selecting a straight fiber is 10%, the probability of selecting a large-bending fiber is 70%, and the probability of selecting a wavy fiber is 20%; in the spunbond cloth, there are 150 fibers. The probability of selecting a straight fiber is 20%, the probability of selecting a large-bending fiber is 60%, and the probability of selecting a wavy fiber is 20%; in the carbon fiber web tire, there are 243 fibers. The probability of selecting a straight fiber is 40%, the probability of selecting a large-bending fiber is 50%, and the probability of selecting a wavy fiber is 10%; other parameter settings of the embodiments are not listed.

[0044] Of course, the above are only typical examples of the present invention. In addition, the present invention can also have many other specific implementation manners. Any technical solutions formed by equivalent replacement or equivalent transformation fall within the scope of protection required by the present invention.

Claims

1. A fiber web generation method, characterized in that: A square space is randomly set in a finite space, and a polyline is generated in the square space; polynomial interpolation processing of the polyline is performed to form a fiber segment with a smooth trajectory; the random square space is continuously set in a loop, and fiber segments are generated in the space, so that there are a certain number of fiber segments in the finite space, and the numerous fiber segments in the finite space form a fiber network; the fiber segments are numbered and their trajectory points are marked to form a trajectory coordinate data list of the virtual fiber network.

2. A fiber web generation method according to claim 1, characterized in that: The limited space adopts a Cartesian coordinate system, and the length, width and height of the limited space are proportional to the target fiber web.

3. A fiber web generation method according to claim 1, characterized in that: The square space adopts a Cartesian coordinate system, and the length, width and height values ​​of the square space are controllable variables.

4. A fiber web generation method according to claim 1, characterized in that: The relationship between the position and size of the finite space and the square space is as follows, where A n With B n is the coordinate of the diagonal vertex in the finite space, a f With b f are the coordinates of the diagonal vertices of the square space, ΔF and ΔN represent the sizes of the two regions, and ΔV represents the distance between the two regions. It is necessary to ensure that V f Less than V n , and V f In V n internal. ΔN=diag(B n 11 -A n 11 ,B n 21 -A n 21 ,B n 31 -A n 31 ); ΔF=diag(b f 11 -a f 11 ,b f 21 -a f 21 ,b f 31 -a f 31 ); ΔV=diag(B n 11 -b f 11 ,B n 21 -b f 21 ,B n 31 -b f 31 ); 5. A fiber web generation method according to claim 1, characterized in that: The polyline randomly generates the first point coordinates and the second point coordinates in a square space, the distance between the first point coordinates and the second point coordinates is a controllable variable, and continues to randomly generate the third point coordinates, determines whether the third point coordinates meet the local deflection angle condition of the bending type, and continues to randomly generate the fourth point coordinates, the fifth point coordinates, and the sixth point coordinates, and the number of randomly generated points is a controllable variable.

6. A fiber web generation method according to claim 5, characterized in that: The relationship between the local deflection angle is as follows: α N is the local deflection angle at the (N-1)th node in the virtual fiber, and α is N To obtain the value, (N-2，N) is the distance between the (N-2)th node and the Nth node; alpha N cos -1 ((L (N-2，N-1) 2 +l (N-1，N) 2 -L (N-2，N) 2 ) / (2l (N-2，N-1) L (N-1，N) )).

7. A fiber web generation method according to claim 5, characterized in that: The curvature types preferably include nearly straight line, large curvature, and wavy shape, wherein the local deflection angle of the nearly straight line is ≤α, the local deflection angle of the large curvature is ≥β, and the wavy shape has multiple local deflection angles ≥α.

8. A fiber web generation method according to claim 1, characterized in that: The fiber segment is formed by sequentially connecting trajectory points, and the trajectory points include main control points and interpolation points.

9. A fiber web generation method according to claim 1, characterized in that: The fiber segment includes a fiber cluster with a ratio, and the ratio of the fiber cluster is a controllable variable; the fiber cluster includes a dominant fiber and an auxiliary fiber, C i，j =(x, y, z) T is the coordinate of the jth node on the i-th fiber, C 0，j is the jth node coordinate on the dominant fiber, a1, a2 and a3 are the position parameters of the subsidiary fibers, and the relationship is as follows:

10. A fiber web generation method according to claim 1, characterized in that: The position coordinates of the square space set by the loop are random, and the number of loops is a controllable variable. The trajectory coordinate data list includes the fiber segment number, bending type, the number of main control points, the number of interpolation points, the main control point coordinates, the interpolation point coordinates, the local deflection angle of adjacent main control point segments, and the proportion of each bending type.

Images