Irregular structure metal grid pattern generation method

Abstract

The invention relates to the technical field of metal grid pattern design, in particular to an irregular structure metal grid pattern generation method which comprises the following steps: S1, initializing metal grid pattern design parameters; s2, generating a first row of irregular convex polygons; s3, counting starting vertexes and ending vertexes of all polygons to be generated in the ith column; generating an ith row of irregular convex polygons; and judging whether a metal grid pattern generation termination condition is met or not. The generated metal grid pattern is formed by splicing irregular convex polygons, and due to the irregular characteristic of the generated grid pattern, compared with a metal grid manufactured according to a regular grid pattern, the metal grid pattern has the advantages that the generation efficiency is improved; the metal grid manufactured according to the grid pattern can eliminate the moire phenomenon caused by the metal grid pattern in the display device.

Description

Technical Field

[0001] The present invention relates to the technical field of metal grid pattern design, and particularly to a method for generating an irregular structure metal grid pattern. Background Art

[0002] Interference will occur between the grid structure of the optical component and the pixels in the touch display screen, forming a moiré phenomenon, which greatly reduces the viewing experience of the touch display screen. The metal grid is a commonly used touch conductive layer in the touch display screen. The traditional metal grid adopts a regular structure pattern, which is very likely to cause the moiré phenomenon of the touch display screen. Using an irregular structure metal grid can effectively eliminate the moiré phenomenon of the touch display screen. Therefore, it is of great practical significance to propose an algorithm for generating an irregular structure metal grid pattern.

[0003] At the same time, the size parameters such as the side length and area of the unit pattern in the metal grid are closely related to the specific performance indicators of the metal grid, such as the optical transmittance. In order to design a metal grid that meets specific performance indicators, it is necessary to set constraints on the size parameters of the unit pattern in the metal grid pattern. Summary of the Invention

[0004] The purpose of the present invention is to provide a method for generating an irregular structure metal grid pattern to solve the problems proposed in the above background art.

[0005] To achieve the above purpose, the present invention provides the following technical solution: A method for generating an irregular structure metal grid pattern, including the following steps: S1: Initialize the design parameters of the metal grid pattern. The design parameters to be initialized include the total length L of the metal grid, the total width W, and the minimum value l and the maximum value l of the distance between any two points in the convex polygon. min and the maximum value l max ;

[0006] S2: Generate the first column of irregular convex polygons. Generate the adjacent columns of irregular convex polygons in the metal grid pattern one by one from left to right. First, generate the first column of irregular convex polygons. In the first column, generate the adjacent irregular convex polygons one by one from bottom to top. First, generate the first polygon, and then select a side from the first polygon as the starting side of the second polygon to generate the second polygon, and so on. When the difference between the minimum value of the vertex ordinate in the current polygon and the maximum value of the vertex ordinate in the first polygon is greater than or equal to W, retain the current polygon to complete the generation of the first column of polygons.

[0007] S3: Count the starting vertices and ending vertices of all polygons to be generated in the i-th column. When i is set to 2, it means that the current step is used to count the starting vertices and ending vertices of all polygons to be generated in the 2nd column. Since the polygons in the 2nd column are adjacent to those in the 1st column, only the positions of all vertices on the right side of the polygons in the 1st column need to be counted and combined with the characteristics of the interior angles of convex polygons to determine the starting vertices and ending vertices of each polygon in the 2nd column, as well as the set of shared points with the adjacent polygons in the 1st column. And so on. When i is equal to other values, the starting vertices and ending vertices of all polygons to be generated in the i-th column can be determined according to the positions of all points in the polygons in the (i - 1)-th column;

[0008] Generate irregular convex polygons in the i-th column. When i is set to 2, it means that the current step is used to generate irregular convex polygons in the 2nd column. According to the starting vertices and ending vertices of each polygon in the 2nd column determined in S3, generate each polygon one by one from top to bottom. In the generation of each polygon, random sampling and counterclockwise rotation are used to find the polygon vertices that satisfy the distance constraint between two points and the angle constraint between adjacent sides one by one, and finally close at the ending vertex to complete the construction of a polygon. When the termination condition for generating polygons in the 2nd column is reached, terminate the current step to complete the generation of polygons in the 2nd column. And so on. When i is equal to other values, the polygons in the i-th column can be generated according to the results of S3;

[0009] Judge whether the termination condition for generating the metal grid pattern is reached. Calculate the difference between the minimum value of the abscissas of all vertices of the convex polygons in the i-th column and the maximum value of the abscissas of the convex polygons in the 1st column. If it is greater than or equal to the total length L of the metal grid, terminate the program and output the generated metal grid pattern; otherwise, continue to generate the irregular convex polygons in the next column and execute the judgment program.

[0010] Preferably, the specific steps of S2 are as follows:

[0011] S2-1: First, generate the 1st convex polygon, using the coordinate zero point [0, 0] as both the starting vertex and the ending vertex of the 1st polygon. Then, based on the principles of random sampling and counterclockwise rotation of adjacent points within the polygon, calculate the coordinates of the 2nd point that satisfy the distance and angle constraints according to the coordinates of the 1st point. Then, use the recursive strategy to generate the coordinates of the remaining vertices that satisfy the distance and angle constraints one by one to complete the generation of the 1st convex polygon;

[0012] S2-2: Generate the other polygons in the 1st column, determine the coordinates of the starting vertex and the ending vertex of the 2nd polygon, and generate the coordinates of the remaining vertices in the 2nd polygon by referring to the generation method of the vertex coordinates in step 2-1. And so on, and complete the generation of the polygons in the 2nd column by referring to the termination condition for generating the polygons in the 1st column.

[0013] Preferably, in S3, the starting vertex and the ending vertex of all the convex polygons to be generated in the i-th column are determined by judging the number of connections between the right vertex of the polygon in the (i - 1)-th column and its adjacent vertices.

[0014] Regarding each polygon as a directed graph, the vertices in each polygon are arranged in counterclockwise order. The vertex with the largest ordinate value in the polygon in the (i - 1)-th column is counted as the starting vertex of the first convex polygon to be generated in the i-th column. Starting from top to bottom, the first vertex with the connection number equal to 2 on the right side of the polygon in the (i - 1)-th column is the ending vertex of the first convex polygon to be generated in the i-th column, and at the same time, this point is also the starting vertex of the second convex polygon to be generated in the i-th column. And so on, the starting vertices and ending vertices of all the convex polygons to be generated in the i-th column can be determined.

[0015] Preferably, in S3, according to the starting vertices and ending vertices of all the convex polygons to be generated in the i-th column, referring to S2, the irregular convex polygons in the i-th column are generated from top to bottom. It should be noted that when generating the first point of each polygon, if this point and the points in the upper polygon can form the side of the convex polygon in the (i + 1)-th column, then it is necessary to additionally judge whether the distance between this point and the points in the upper polygon satisfies the distance constraint between any two points in the convex polygon. Similarly, when generating the last point of each polygon, it is also necessary to note whether it should be judged that the distance between this point and the points in the lower polygon should satisfy the distance constraint between any two points in the convex polygon.

[0016] Preferably, in S3, the irregular convex polygons in each column are generated one by one from left to right. When the difference between the minimum value of the abscissas of all the vertices in the convex polygon in the i-th column and the maximum value of the abscissas of all the vertices in the convex polygon in the first column is greater than or equal to the total length L of the metal grid, the program is terminated; otherwise, execute i = i + 1 and go to S3.

[0017] Compared with the prior art, the beneficial effects of the present invention are as follows:

[0018] The metal grid pattern generated by the present invention is composed of irregular convex polygons spliced together. Due to the irregular characteristics of the grid pattern generated by the present invention, compared with the metal grid manufactured according to the regular grid pattern, the metal grid manufactured according to the grid pattern in the present invention can eliminate the moiré phenomenon caused by the metal grid pattern in the display device. By setting constraints on the size parameters of the unit pattern in the metal grid pattern, it can be ensured that the metal grid manufactured according to this metal grid pattern meets specific performance indicators. Since each polygon in the metal grid pattern is a convex polygon, during the metal grid etching process, it can avoid the redundant metal residue at the angle caused by the acute angle between adjacent grid lines, thereby improving the quality of the metal grid product. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] Figure 1This is the schematic diagram of the process of the present invention. Detailed implementation manners

[0020] Next, the technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts shall fall within the protection scope of the present invention.

[0021] Please refer to Figure 1 , the present invention provides a technical solution: a method for generating an irregular structure metal grid pattern. The present invention regards the irregular structure metal grid pattern as a combination of several irregular convex polygons, and there is no overlap between the irregular convex polygons; the present invention generates a complete irregular structure metal grid pattern by generating irregular convex polygons one by one, and the present invention generates an irregular convex polygon by determining the coordinates of all vertices. In each irregular convex polygon generated by the present invention, the range of each interior angle must be, and the distance between any two vertices can meet specific constraint settings.

[0022] This method includes the following steps: S1: Initialize the design parameters of the metal grid pattern. The design parameters to be initialized include the total length L of the metal grid, the total width W, and the minimum value l of the distance between any two points in the convex polygon min and the maximum value l max , l min and l max The values of are between dozens of micrometers and hundreds of micrometers;

[0023] S2: Generate the first column of irregular convex polygons. Generate adjacent columns of irregular convex polygons in the metal grid pattern one by one from left to right. First, generate the first column of irregular convex polygons. In the first column, generate adjacent irregular convex polygons one by one from bottom to top. First, generate the first polygon, and then select one side from the first polygon as the starting side of the second polygon to generate the second polygon, and so on. When the difference between the minimum value of the vertex ordinate in the current polygon and the maximum value of the vertex ordinate in the first polygon is greater than or equal to W, retain the current polygon to complete the generation of the first column of polygons. During the generation of each polygon, according to the starting vertex and the ending vertex of the polygon, use random sampling and counterclockwise rotation to find the polygon vertices that meet the distance constraint between two points in the polygon and the angle constraint between adjacent sides one by one, and finally close at the ending vertex to complete the construction of a polygon;

[0024] S3: Count the starting and ending vertices of all polygons to be generated in the i-th column. When i is set to 2, it means that the current step is used to count the starting and ending vertices of all polygons to be generated in the 2nd column. Since the polygons in the 2nd column are adjacent to those in the 1st column, only the positions of all vertices on the right side of the polygons in the 1st column need to be counted and combined with the characteristics of the interior angles of convex polygons to determine the starting and ending vertices of each polygon in the 2nd column, as well as the set of shared points with the adjacent polygons in the 1st column. And so on. When i is equal to other values, the starting and ending vertices of all polygons to be generated in the i-th column can be determined based on the positions of all points in the polygons in the (i - 1)-th column;

[0025] Generate irregular convex polygons in the i-th column. When i is set to 2, it means that the current step is used to generate irregular convex polygons in the 2nd column. According to the starting and ending vertices of each polygon in the 2nd column determined in S3, generate each polygon one by one from top to bottom. In the generation of each polygon, random sampling and counterclockwise rotation are used to find polygon vertices that satisfy the distance constraint between two points and the angle constraint between adjacent sides one by one, and finally close at the ending vertex to complete the construction of a polygon. When the termination condition for generating polygons in the 2nd column is reached, terminate the current step to complete the generation of polygons in the 2nd column. And so on. When i is equal to other values, polygons in the i-th column can be generated according to the results of S3;

[0026] Judge whether the termination condition for generating the metal grid pattern is reached. Calculate the difference between the minimum value of the abscissas of all vertices of the convex polygons in the i-th column and the maximum value of the abscissas of the convex polygons in the 1st column. If it is greater than or equal to the total length L of the metal grid, terminate the program and output the generated metal grid pattern; otherwise, continue to generate irregular convex polygons in the next column and execute the judgment program.

[0027] The specific steps of S2 are as follows:

[0028] S2-1: First, generate the 1st convex polygon, using the coordinate origin [0, 0] as both the starting vertex and the ending vertex of the 1st polygon. Then, based on the principle of random sampling and counterclockwise rotation of adjacent points within the polygon, calculate the coordinates of the 2nd point that satisfy the distance and angle constraints according to the coordinates of the 1st point. Then, use the recursive strategy to generate the coordinates of the remaining vertices that satisfy the distance and angle constraints one by one to complete the generation of the 1st convex polygon;

[0029] S2-2: Generate other polygons in the 1st column, determine the coordinates of the starting and ending vertices of the 2nd polygon, and generate the coordinates of the remaining vertices in the 2nd polygon by referring to the generation method of vertex coordinates in step 2-1. And so on, and complete the generation of polygons in the 2nd column by referring to the termination condition for generating polygons in the 1st column.

[0030] In S3, the starting and ending vertices of all convex polygons to be generated in the \(i\)-th column are determined by judging the number of connections between the right vertices of the polygon in the \((i - 1)\)-th column and adjacent vertices.

[0031] Regarding each polygon as a directed graph, with vertices arranged in counterclockwise order within each polygon, the vertex with the largest ordinate value in the polygon of the \((i - 1)\)-th column is counted as the starting vertex of the first convex polygon to be generated in the \(i\)-th column. Starting from top to bottom, the first vertex with a connection number equal to 2 on the right side of the polygon in the \((i - 1)\)-th column is the ending vertex of the first convex polygon to be generated in the \(i\)-th column. At the same time, this point is also the starting vertex of the second convex polygon to be generated in the \(i\)-th column, and so on. In this way, the starting and ending vertices of all convex polygons to be generated in the \(i\)-th column can be determined.

[0032] In S3, according to the starting and ending vertices of all convex polygons to be generated in the \(i\)-th column, referring to S2, the irregular convex polygons in the \(i\)-th column are generated from top to bottom. It should be noted that when generating the first point of each polygon, if this point can form the side of the convex polygon in the \((i + 1)\)-th column with the points in the upper polygon, then it is necessary to additionally judge whether the distance between this point and the points in the upper polygon satisfies the distance constraint between any two points in the convex polygon. Similarly, when generating the last point of each polygon, it is also necessary to note whether it should be judged that the distance between this point and the points in the lower polygon should satisfy the distance constraint between any two points in the convex polygon.

[0033] In S3, the irregular convex polygons of each column are generated one by one from left to right. When the difference between the minimum value of the abscissas of all vertices in the convex polygon of the \(i\)-th column and the maximum value of the abscissas of all vertices in the convex polygon of the first column is greater than or equal to the total length \(L\) of the metal grid, the program is terminated. Otherwise, execute \(i = i + 1\) and go to S3. Specific embodiments:

[0035] S1: Initialize the metal grid pattern design parameters. According to the overall dimensions of the metal grid, the values of the total length \(L\) and the total width \(W\) are set to be between several centimeters and more than one hundred centimeters. \(l\) min and \(l\) max The values are between several tens of micrometers and several hundreds of micrometers.

[0036] S2: Generate the irregular convex polygons in the first column;

[0037] S2 - 1: Generate the first polygon;

[0038] S2 - 1 - 1: Determine the position of the first point of the first polygon

[0039] First, generate the first polygon. Select the coordinate origin \([0, 0]\) as the starting and ending vertices of the first polygon, and represent this point with \(P[1]\);

[0040] S2-1-2: Determine the position of the second point of the first polygon.

[0041] Based on the principles of random sampling and counterclockwise rotation of adjacent points within the polygon, according to the coordinates of P[1], the distance len between P[1] and P[2], and the angle z between the vector [P[1], P[2]] and the horizontal line, the coordinates of the second point P[2] are generated. The specific formulas are as follows:

[0042] len = l min +(l max -l min )*rand;

[0043] z = (zmax - zmin)*rand;

[0044] P[2].x = P[1].x + len*Cos(z);

[0045] P[2].y = P[1].y + len*Sin(z);

[0046] where l min and l max are set in S1, z min and zmax are the minimum and maximum values of z, which are 0 and respectively in the current step, rand is a random real number between (0, 1] that conforms to the uniform distribution, and each time rand appears, its value is newly generated by the random number generator. The value of len is randomly generated according to l min and l max . The value of z is randomly generated according to z min and z max . P[1].x and P[1].y represent the abscissa and ordinate values of P[1], and P[2].x and P[2].y represent the abscissa and ordinate values of P[2]. Then, the following recursive steps are used to generate all the remaining vertices in the first polygon;

[0047] S2-1-3: Generate the coordinates of the j-th vertex P[j]. First, calculate the angle zj of the vector [P[j - 1], P[j - 2]], where the range of zj is [-π, π]. The z max required to generate the point P[j] is zj, and z min is The coordinates of P[j] are calculated according to the following formula:

[0048] len = l min +(l max -l min )*rand;

[0049] z = (z max -z min)*rand;

[0050] P[j].x = P[1].x + len * Cos(z);

[0051] P[j].y = P[1].y + len * Sin(z);

[0052] Then check whether the distance from P[j] to other points P[1], P[2], … P[j-1] inside the polygon satisfies the distance constraint between any two points inside the polygon. If the constraint is satisfied, retain the current coordinates of P[j]; otherwise, repeat the above formula and check whether the newly generated coordinates of P[j] satisfy the distance constraint until the coordinates of P[j] that satisfy the constraint are generated.

[0053] S2-1-4: Determine whether the current j is less than or equal to 4. If it is, execute j = j + 1 and go to step S2-1-3; if j is greater than 4, go to step S2-1-5.

[0054] S2-1-5: Determine whether P[j] can be directly connected to the termination vertex P[1] according to the following conditions to complete the construction of the first polygon. Condition 1: Whether both ∠P[j-1]P[j]P[0] and ∠P[j]P[0]P[1] are within the range; if P[j] satisfies Condition 1, connect P[j] to P[1] to complete the construction of the first polygon. Otherwise, execute j = j + 1 and go to step S2-1-3. When step S2-1-5 is repeatedly executed more than n max times, return to step S2-1-1 to regenerate the first polygon until the construction of the first polygon is finally completed.

[0055] S2-2: Generate other polygons in the first column;

[0056] S2-2-1: Determine the starting vertex and termination vertex coordinates of the second polygon. Determine the point with the largest ordinate value in the first polygon as P[m]. Calculate the absolute values of the sine values of the angles between the line segments P[m-1]P[m] and P[m]P[m+1] and the horizontal line respectively, and select the set of line segments with the smaller result as the starting side of the second polygon. If the starting side is P[m-1]P[m], then the starting vertex and termination vertex coordinates of the second polygon are the coordinates of P[m-1] and P[m] respectively; otherwise, they are the coordinates of P[m] and P[m+1] respectively.

[0057] S2-2-2: Generate the coordinates of all other vertices in the second polygon with reference to steps S2-1-2 to S2-1-5. It should be noted that when determining whether the last vertex P[j] in the second polygon is connected to the termination vertex, it is necessary to determine the vertex P[n] in the first polygon that is connected counterclockwise to the termination vertex of the second polygon, and then determine whether the distance between P[j] and P[n] satisfies the distance constraint between any two points in the convex polygon.

[0058] S2-2-3: And so on, repeat steps S2-2-1 and S2-2-2 until the ordinate values of all vertices of the current polygon are greater than or equal to W, then the construction of the first column of convex polygons can be completed.

[0059] S3: Generate the second column of irregular convex polygons;

[0060] S3-1: Determine the starting vertices and termination vertices of all convex polygons to be generated in the second column. In the present invention, the starting vertices and termination vertices of all convex polygons to be generated in the second column are determined by judging the number of connections between the right vertices and adjacent vertices of the first column of polygons.

[0061] In the present invention, each polygon is regarded as a directed graph, and the adjacency matrix MAJ is used to represent the connection information between each vertex. The vertices in each polygon are arranged in counterclockwise order. If P[1] is connected counterclockwise to P[2], then MAJ[1][2]=1. If MAJ[1][2]=1 and MAJ[2][1]=1, then P[1] and P[2] exist in two adjacent polygons. The vertex with the largest ordinate value in the first column of polygons is counted as the starting vertex of the first convex polygon to be generated in the second column. According to the adjacency matrix of the first column of polygons, the first vertex with a connection number equal to 2 on the right side of the first column of polygons from top to bottom is determined as the termination vertex of the first convex polygon to be generated in the second column, and at the same time, this point is also the starting vertex of the second convex polygon to be generated in the second column. And so on, the starting vertices and termination vertices of all convex polygons to be generated in the second column can be determined.

[0062]

[0063] S3-2: Generate the second column of irregular convex polygons. According to the starting vertices and ending vertices of all the convex polygons to be generated in the second column, refer to steps S2-1-2 to S2-1-5 to generate the second column of irregular convex polygons from top to bottom. It should be noted that when generating the first point of each polygon, if this point and the points in the upper polygon can form the side of the convex polygon in the third column, then it is necessary to additionally determine whether the distance between this point and the points in the upper polygon meets the distance constraint between any two points in the convex polygon. Similarly, when generating the last point of each polygon, it is also necessary to note whether it should be determined that the distance between this point and the points in the lower polygon meets the distance constraint between any two points in the convex polygon.

[0064] S3-3: Determine whether the program reaches the termination condition. By analogy, generate the third, fourth,..., i-th column of irregular convex polygons one by one. When the difference between the minimum value of the abscissas of all vertices in the i-th column of convex polygons and the maximum value of the abscissas of all vertices in the first column of convex polygons is greater than or equal to the total length L of the metal grid, terminate the program; otherwise, continue to generate the next column of irregular convex polygons and execute the determination program.

[0065] Although the embodiments of the present invention have been shown and described, those of ordinary skill in the art can understand that various changes, modifications, substitutions, and variations can be made to these embodiments without departing from the principles and spirit of the present invention. The scope of the present invention is defined by the appended claims and their equivalents.

Claims

1. A method for generating a metal grid pattern with an irregular structure, characterized in that: The following steps are included: S1: Initialize the metal grid pattern design parameters, the design parameters to be initialized include the total length L of the metal grid, the total width W, the minimum distance between any two points in the convex polygon l min and the maximum value l max ; S2: Generate the first column of irregular convex polygons, generate adjacent columns of irregular convex polygons in the metal grid pattern from left to right, first generate the first column of irregular convex polygons, in the first column, generate adjacent irregular convex polygons one by one from bottom to top, first generate the first polygon, then select an edge from the first polygon as the starting edge of the second polygon to generate the second polygon, and so on, when the difference between the minimum value of the vertical coordinate of the vertex in the current polygon and the maximum value of the vertical coordinate of the vertex in the first polygon is greater than or equal to W, retain the current polygon and complete the generation of the first column of polygons; S3: Count the starting and ending vertices of all the polygons to be generated in the i-th column. When i is set to 2, it means that the current step is used to count the starting and ending vertices of all the polygons to be generated in the second column. Since the polygons in the second column are adjacent to the polygons in the first column, it is only necessary to count the positions of all vertices on the right side of the polygons in the first column and combine the internal angle value characteristics of the convex polygon to determine the starting and ending vertices of each polygon in the second column, as well as the set of shared points with the adjacent polygons in the first column. Similarly, when i is equal to other values, the starting and ending vertices of all the polygons to be generated in the i-th column can be determined according to the positions of all points in the polygons in the i-1th column. Generate the i-th column of irregular convex polygons. When i is set to 2, it means that the current step is used to generate the second column of irregular convex polygons. According to the starting vertex and the ending vertex of each polygon in the second column determined in S3, each polygon is generated one by one from top to bottom. In the generation of each polygon, random sampling and counterclockwise rotation are used to find the polygon vertices that meet the distance constraint between two points in the polygon and the angle constraint between two adjacent sides, and finally close at the ending vertex to complete the construction of a polygon. When the termination condition of the second column polygon generation is met, the current step is terminated and the second column polygon generation is completed. Similarly, when i is equal to other values, the i-th column polygon can be generated according to the result of S3; Determine whether the termination condition for metal mesh pattern generation is met, calculate the difference between the minimum value of the horizontal coordinates of all vertices of the convex polygon in the i-th column and the maximum value of the horizontal coordinates of the convex polygon in the first column. If it is greater than or equal to the total length L of the metal mesh, terminate the program and output the generated metal mesh pattern; otherwise, continue to generate the next column of irregular convex polygons and execute the judgment procedure.

2. The method for generating a metal grid pattern with an irregular structure according to claim 1, characterized in that: The specific steps of S2 are: S2-1: First, generate the first convex polygon, use the coordinate zero point [0,0] as both the starting vertex and the ending vertex of the first polygon, then calculate the coordinates of the second point that meets the distance and angle constraints based on the coordinates of the first point based on the principle of random sampling and counterclockwise rotation of adjacent points in the polygon, and then use a recursive strategy to generate the coordinates of the remaining vertices that meet the distance and angle constraints one by one to complete the generation of the first convex polygon; S2-2: Generate other polygons in the first column, determine the starting vertex and ending vertex coordinates of the second polygon, generate the coordinates of the remaining vertices in the second polygon by referring to the vertex coordinate generation method in step 2-1, and so on, and complete the generation of the second column of polygons by referring to the termination conditions of the generation of the first column of polygons.

3. The method for generating a metal grid pattern with an irregular structure according to claim 1, characterized in that: In S3, the starting vertex and the ending vertex of all the convex polygons to be generated in the i-th column are determined by judging the number of connections between the right vertices of the polygon in the i-1th column and the adjacent vertices; Consider each polygon as a directed graph, and arrange the vertices in each polygon in counterclockwise order. Count the vertex with the largest ordinate value in the polygon in the i-1th column as the starting vertex of the first convex polygon to be generated in the i-th column. From top to bottom, determine the first vertex on the right side of the polygon in the i-1th column with 2 connections equal to the terminating vertex of the first convex polygon to be generated in the i-th column. At the same time, this point is also the starting vertex of the second convex polygon to be generated in the i-th column. Similarly, the starting and terminating vertices of all convex polygons to be generated in the i-th column can be determined.

4. The method for generating a metal grid pattern with an irregular structure according to claim 1, characterized in that: The S3 generates the irregular convex polygons in the i-th column from top to bottom according to the starting and ending vertices of all the convex polygons to be generated in the i-th column, referring to S2. It should be noted that when generating the first point of each polygon, if the point and the point in the upper polygon can constitute the edge of the convex polygon in the i+1-th column, then it is necessary to additionally judge whether the distance between the point and the point in the upper polygon satisfies the distance constraint between any two points in the convex polygon. Similarly, when generating the last point of each polygon, it is also necessary to pay attention to whether it should be judged that the point and the point in the lower polygon should satisfy the distance constraint between any two points in the convex polygon.

5. The method for generating a metal grid pattern with an irregular structure according to claim 1, characterized in that: The S3 generates each column of irregular convex polygons one by one from left to right. When the difference between the minimum value of the horizontal coordinates of all vertices in the i-th column of convex polygons and the maximum value of the horizontal coordinates of all vertices in the first column of convex polygons is greater than or equal to the total length L of the metal mesh, the program is terminated, otherwise execute i=i+1 and go to S3.

Images