Computer embroidery machine plate making method, device, equipment and medium

Abstract

The present invention discloses a plate making method, device, equipment and medium for a computer embroidery machine, the method comprising the following steps: a preparation process: obtaining all colors of the plate making pattern, determining the embroidery order of the plate making pattern colors from P1 to P according to a preset embroidery color sequence, n , P i P1 to P n‑1 Any one of them; Block sequence process: from P1 to P n The order of P in the plate making pattern is sequentially determined to form an embroidery chain of all the blocks of the same color in the plate making pattern; wherein, for P in the plate making pattern i Color all the blocks, determine P according to the preset method i Color of the picture block embroidery chain, and according to the picture block embroidery chain P i All the tiles are embroidered in the same color as the P i+1 To P n Generate P on the block of the corresponding color i Color the connecting line to connect the two separated P i The plate making method of the computer embroidery machine of the present application can reduce the thread cutting operation in the embroidery process while ensuring the embroidery effect, thereby improving the embroidery efficiency.

Description

Technical Field

[0001] The present invention relates to the field of computer embroidery machines, and in particular to a plate making method, device, equipment and medium for a computer embroidery machine. Background Art

[0002] Patterns are the basis for automated production on computer embroidery machines. A plate-making pattern consists of multiple blocks, and the total number of colors corresponding to the plate-making pattern is multiple.

[0003] For example, Figure 1 As shown, block 1a and block 1b are separated by block 2, and blocks 1a and 1b are the same color, while block 2 is a different color from blocks 1a and 1b. In the related art, blocks 1a and 1b require thread trimming for embroidery, that is, after embroidering block 1a, the thread is trimmed before embroidering block 1b.

[0004] The above method has low embroidery efficiency, which affects the production cost. Summary of the Invention

[0005] The present invention aims to solve at least one of the technical problems existing in the prior art. To this end, the present invention provides a plate making method, device, equipment and medium for a computer embroidery machine.

[0006] The plate making method of a computer embroidery machine according to an embodiment of the present invention comprises the following steps:

[0007] Preparation process: Get all the colors of the plate-making pattern, and determine the embroidery order of the plate-making pattern colors from P1 to P according to the preset embroidery color order. n , n is a natural number greater than or equal to 2, P i P1 to P n-1 Any one of;

[0008] Tile sequence confirmation process:

[0009] Follow the steps from P1 to P n The order of P in the plate making pattern is sequentially determined to form an embroidery chain of all the blocks of the same color in the plate making pattern; wherein, for P in the plate making pattern i Color all the blocks, determine P according to the preset method i Color of the picture block embroidery chain, and according to the picture block embroidery chain P i All the tiles are embroidered in the same color as the P i+1 To P n Generate P on the block of the corresponding color i Color the connecting line to connect the two separated P i Color of said tile.

[0010] According to the plate-making method for a computerized embroidery machine according to an embodiment of the present invention, different colors are embroidered in the order of P1 to Pn. When embroidering the color Pi, the interval color blocks of the color Pi can be connected by embroidering connecting lines within the color blocks Pi to Pn. When embroidering the color blocks after Pi, the connecting lines formed when embroidering the color Pi can be covered by the subsequent embroidery color, so that the connecting lines can be hidden and the embroidery effect can be guaranteed. Thus, while maintaining the embroidery effect, the thread cutting operation during the embroidery process can be reduced, thereby improving embroidery efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] The above and / or additional aspects and advantages of the present invention will become apparent and readily understood from the following description of the embodiments with reference to the accompanying drawings, in which:

[0012] Figure 1 It is a schematic diagram of the plate making pattern of the prior art;

[0013] Figure 2 This is a schematic diagram of a plate-making pattern according to an embodiment of the present invention;

[0014] Figure 3 1 is a schematic flow chart of a plate-making method according to an embodiment of the present invention;

[0015] Figure 4 This is another schematic diagram of a plate-making pattern according to an embodiment of the present invention;

[0016] Figure 5 This is a schematic diagram of another object of a plate-making pattern according to an embodiment of the present invention;

[0017] Figure 6 yes Figure 5 Schematic diagram of the plate making pattern corresponding to step S4 of the embodiment;

[0018] Figure 7 yes Figure 5 Schematic diagram of the plate making pattern corresponding to step S7 of the embodiment;

[0019] Figure 8 is a schematic diagram of a plate-making pattern corresponding to step S8 of an embodiment of the present invention;

[0020] Figure 9 Schematic diagram of needle drop points of a pattern according to an embodiment of the present invention;

[0021] Figure 10 1 is a schematic diagram of needle drop points of another pattern according to an embodiment of the present invention;

[0022] Figure 11 It is a structural diagram of a computer system of a terminal device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0023] The following describes embodiments of the present invention in detail. Examples of the embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are intended only to explain the present invention and are not to be construed as limiting the present invention.

[0024] According to the plate making method of the computer embroidery machine of the embodiment of the present invention, Figure 3 As shown, the following steps are included:

[0025] Preparation process:

[0026] Get all the colors of the plate-making pattern, and determine the embroidery order of the plate-making pattern colors from P1 to P according to the preset embroidery color order. n , n is a natural number greater than or equal to 2, P i P1 to P n-1 Any one of;

[0027] Tile sequence confirmation process:

[0028] Follow the steps from P1 to P n The order of the blocks is used to determine the block embroidery chain of all blocks of the same color in the plate making pattern;

[0029] Among them, for the P in the plate making pattern i Color all blocks and determine P according to the preset method i Color block embroidery chain, and according to the block embroidery chain P i All the tiles embroidered in the color, in P i+1 To P n Generate P on the corresponding color block i Color the connecting line to connect the two separated P i Color tiles.

[0030] It is understood that the plate-making pattern includes a plurality of connected blocks, the blocks include at least two colors, and each block is a single color. Figure 1 As shown, the plate-making pattern includes blocks 1a, 1b, and 2. Blocks 1a and 1b are the same color, while block 2 is a different color from blocks 1a and 1b. In the related art, after embroidering block 1a, the thread needs to be trimmed. Then, after embroidering block 1b, the thread needs to be trimmed again. Finally, block 2 needs to be embroidered.

[0031] Based on this, this application proposes a plate making method, such as Figure 2 As shown, a connecting line L of the same color as blocks 1a and 1b is generated to connect blocks 1a and 1b, and then the embroidery thread of block 2 covers the connecting line L, so that the connecting line L can be hidden. In this way, thread cutting is avoided, embroidery efficiency is improved, and production costs are reduced.

[0032] Therefore, the plate making method of the computer embroidery machine of the present application can reduce the thread cutting operation during the embroidery process while ensuring the embroidery effect, thereby improving the embroidery efficiency.

[0033] It should be noted that the preset embroidery color sequence is the order in which the colors are arranged according to the embroidery effect by those skilled in the art. For example, the blocks of the plate-making pattern correspond to four colors (red, yellow, green, and blue) and are arranged in the following order: first color (red), second color (yellow), third color (green), and fourth color (blue).

[0034] When embroidering all red tiles, a red tile embroidery chain is determined according to a preset method, and all red tiles are embroidered according to the red tile embroidery chain. Red connecting lines are generated on the tiles corresponding to the second to fourth colors to connect the two separated red tiles.

[0035] When embroidering all yellow tiles, a yellow tile embroidery chain is determined according to a preset method, and all yellow tiles are embroidered according to the yellow tile embroidery chain. Yellow connecting lines are generated on the tiles corresponding to the third color to the fourth color to connect the two separated yellow tiles. At least a portion of the red connecting line can be covered by the yellow embroidery thread.

[0036] When embroidering all green tiles, a green tile embroidery chain is determined according to a preset method, and all green tiles are embroidered according to the green tile embroidery chain. A green connecting thread is generated on the tiles corresponding to the fourth color to connect the two separated green tiles. At least a portion of the red and yellow connecting threads can be covered by the green embroidery thread.

[0037] When embroidering all blue tiles, for two separated blue tiles, after embroidering one of them, trimming the thread, and then embroidering the other, that is, embroidering according to the existing technology. Among them, at least part of the red, yellow, and green connecting threads can be covered by the blue embroidery thread.

[0038] In some embodiments, the preparation process further includes the following steps:

[0039] Number each tile;

[0040] The connected objects of each tile are obtained. The connected objects are the numbers of any tiles whose distance from the needle drop point of the tile is less than or equal to a threshold. The connected objects of all tiles are summarized to obtain a connected object table.

[0041] It should be noted that, if the needle drop point distance between the first block and the second block is less than a threshold, it is considered that the second block is connected to the first block.

[0042] For example, Figure 9As shown in FIG, when embroidering a circular pattern, the embroidery thread can be zigzag (or other shapes), forming multiple needle drop points in the edge area of the circular pattern, such as Figure 9 Shown in small and medium circles.

[0043] like Figure 10 As shown, it is assumed that blocks 10, 20, 30, 40, and 50 are all of the same color (the colors can also be different), and whether block 10 is connected to blocks 20, 30, 40, and 50 is determined based on the needle drop point distances between block 10 and blocks 20, 30, 40, and 50 respectively.

[0044] exist Figure 10 In the figure, the needle points of block 10 are numbered 11 to 19 corresponding to the circle. The needle points of block 20 are numbered 21 corresponding to the triangle. The needle points of block 30 are numbered 31-33 corresponding to the regular pentagon. The needle points of block 40 are numbered 41-45 corresponding to the positive direction. The needle points of block 50 are numbered 51-52 corresponding to the ellipse.

[0045] Calculate the needle drop point distance between block 10 and block 20: select one of the needle drop points in block 10 and one of the needle drop points in block 20, and calculate the distance between them. According to the above method, a needle drop point distance set is formed, and the minimum value in the needle drop point distance set is selected as the needle drop point distance between block 10 and block 20. Figure 10 As shown, the first distance between the needle drop point 16 and the needle drop point 21 is calculated, and the second distance between the needle drop point 17 and the needle drop point 21 is calculated. The first and second distances are compared and the minimum value is selected as the needle drop point distance between the block 10 and the block 20, that is, Figure 10 Middle L1.

[0046] Calculate the needle drop point distance between block 10 and block 30, as Figure 10 As shown, the distance L2 between the needle drop point 14 and the needle drop point 32 is the needle drop point distance between the block 10 and the block 30.

[0047] Calculate the needle drop point distance between block 10 and block 40, as Figure 10 As shown, the distance L3 between the needle drop point 12 and the needle drop point 41 is the needle drop point distance between the block 10 and the block 40.

[0048] Calculate the needle drop point distance between block 10 and block 50, as Figure 10 As shown, the distance L4 between the needle drop point 18 and the needle drop point 52 is the needle drop point distance between the block 10 and the block 50.

[0049] Compare L1, L2, L3, L4 with the threshold. If L1, L2, L3 are all smaller than the threshold, block 10 is connected to blocks 20, 30, and 40. If L4 is larger than the threshold, block 10 is not connected to block 50.

[0050] In addition, for example, the blocks of the plate-making pattern correspond to four colors (red, yellow, green, and blue) and are arranged in the following order: first color (red), second color (yellow), third color (green), and fourth color (blue).

[0051] The connected object table includes horizontal table headers, which are, from left to right, the first color, the first connected object corresponding to the first color, the second color, the second connected object corresponding to the second color, the third color, and the third connected object corresponding to the third color.

[0052] Furthermore, in the connected object table, the connected objects of the block with color Pi are sorted according to the following rules:

[0053] Rule 1: Sort from color Pi to color not Pi;

[0054] Rule 2: Among the connected objects whose color is not Pi, sort them in color order from P1 to Pn, skipping Pi.

[0055] Rule 3: Multiple connected objects of the same color are sorted in order of the distance between each connected object and the tile from shortest to longest.

[0056] For example, the green block G1 is connected to red blocks R3, R4, and R6, green blocks G2 and G3, and yellow blocks Y3 and Y4. The default embroidery color sequence is red, green, and yellow.

[0057] According to rules one and two: first arrange the connected objects of the green tiles (G2, G3, or G3, G2), secondly, arrange the connected objects of the red tiles (R3, R4, R6, or R4, R6, R3, etc.), and finally arrange the connected objects of the yellow tiles (Y3, Y4, or Y4, Y3).

[0058] According to rule three: among the connected objects of the red blocks, the green block G1 is arranged from short to long according to the distance between its needle drop points and blocks R3, R4, and R6 respectively, i.e. R3, R4, and R6; among the connected objects of the green blocks, the green block G1 is arranged from short to long according to the distance between its needle drop points and blocks G2 and G3 respectively, i.e. G2 and G3; among the connected objects of the yellow blocks, the green block G1 is arranged from short to long according to the distance between its needle drop points and blocks Y3 and Y4 respectively, i.e. Y4 and Y3.

[0059] In this way, the connected object spaces of the green block G1 should be filled with G2, G3, R3, R4, R6, Y4, and Y3.

[0060] Further, according to the preset method, P is determined i In the color block embroidery chain, the preset method used includes the following steps:

[0061] Set the color to P i Group all tiles to obtain groups from 1 to m, where m is a natural number greater than or equal to 1, wherein each tile and all its connected objects belong to the same group, and when a tile has no connected objects, it belongs to a separate group;

[0062] According to the connected object table, the color is P i+1 To P n The tiles of are connected in series from the 1st to the mth groups in sequence, and all the tiles from the 1st to the jth groups are sorted in sequence to obtain the tile embroidery chain of Pi color.

[0063] Specifically: all blocks in the first group are sorted in sequence to obtain a first temporary block sequence, in which two blocks are connected to each other;

[0064] When there is a second group, the jth group represents any one of the groups from the second group to the mth group (2≤j≤m), when the jth group and any of the previous groups are connected by a color P i+1 When the blocks from group 1 to group j are connected, select the blocks with the color P from the connected object table. i+1 To P n The tiles, P i+1 To P n The blocks of group 1 to group j are connected in series. At this time, the order of all blocks from group 1 to group j constitutes the jth temporary graph order;

[0065] And so on, to the mth group, P i+1 To P n The blocks of are connected in series from the 1st group to the mth group, and the order of all blocks from the 1st group to the mth group constitutes the mth temporary image sequence;

[0066] The final Pi-color tile embroidery chain is obtained according to the m-th temporary image sequence.

[0067] For example, the blocks of the plate-making pattern correspond to four colors (red, yellow, green, and blue) and are arranged in the following order: first color (red), second color (yellow), third color (green), and fourth color (blue).

[0068] All tiles of the first color are grouped to obtain Group 1, Group 2, and Group 3. The tiles of the first color in Group 1 are sequentially sorted to obtain a first temporary image sequence.

[0069] A second temporary pattern sequence is generated based on the first temporary pattern sequence and the second group. The separated first and second groups are connected in series through the second, third, and fourth color tiles to form the second temporary pattern sequence. This can be understood as generating a connecting line of the first color on the second, third, and fourth color tiles to connect the first and second groups.

[0070] Based on the second temporary pattern sequence and the third group, the third temporary pattern sequence is obtained. Like this, the third temporary pattern sequence is also the pattern piece embroidery chain of the first color.

[0071] It should be noted that when obtaining the second color block embroidery chain, the separated groups are connected in series through the third and fourth color blocks. No connecting lines can be generated on the completed first color blocks to avoid contaminating the first color embroidery.

[0072] Specifically, all the tiles in the first group are sorted in sequence to obtain the first temporary tile sequence, including the following steps:

[0073] Select a block in the first group as the first node in the first temporary graph sequence, and find the top-ranked block from the connected objects of the first node in the connected object table as the second node;

[0074] From the connected objects of the second node in the connected object table, find the top-ranked tile as the temporary third point;

[0075] And so on, until all the tiles in the first group are listed, and each tile in the first group contains only one node;

[0076] Multiple nodes constitute the first temporary graph sequence.

[0077] In some embodiments, the obtained j-th temporary image sequence satisfies the following conditions:

[0078] When there are multiple orderings of all tiles from group 1 to group j, the ordering with the shortest connecting line is selected as the final j-th temporary tile order.

[0079] Reference Figures 4-10 As shown, a specific embodiment of the present application is given below.

[0080] in, Figure 4 Shows a plate-making pattern in actual application. Figure 4 The plate-making pattern shown in the figure includes three colors and multiple blocks. Figure 4 The corresponding plate-making pattern describes the plate-making method in detail:

[0081] S1. Create a connected object table, which is about the object and the objects connected to it.

[0082] like Figure 4 As shown, Figure 4Three colors are shown: green (P1), yellow (P2), and red (P3). Embroidery is performed in a preset order: green, yellow, and red. The preset order is arranged by those skilled in the art based on the embroidery effect to ensure the quality of the embroidery.

[0083] Green is the first color, yellow is the second color, and red is the third color. All tiles of the first color are numbered starting with G1; all tiles of the second color are numbered starting with Y1; and all tiles of the third color are numbered starting with R1.

[0084] Table 1 lists objects connected to the first color tile, objects adjacent to the second color tile, and objects connected to the third color tile. It should be noted that the term "connected" here means that if the distance between the needle drop points of two tiles is less than or equal to a threshold, the two tiles are considered connected. Conversely, if the distance between the needle drop points of two tiles is greater than the threshold, the two tiles are considered disconnected.

[0085] First Color First connected object Secondary Color Second connected object tertiary color Third connected object G1 G2, G3, G4, Y7 Y1 R1 R1 R2, R3, R4, Y1, Y2 G2 G1, G3 Y2 Y3, R1 R2 R3, R1 G3 G1, G2, G4 Y3 Y2 R3 R2, R1 G4 G1, G3, Y6, Y7 Y4 Y5, R5 R4 R1, R8, G8 G5 G6, R11 Y5 Y4, R11 R5 R8, R11, R6, Y4, G7 G6 G5 Y6 G4, R11, R12 R6 R5, R7 G7 G8, R5 Y7 G1, G4, R12 R7 R6 G8 G7, R4 R8 R4, R5 R9 R11 R10 R11 R11 R5, R9, R10, R12, G5, Y5, Y6 R12 R11, R13, R14, Y6, Y7 R13 R12 R14 R12

[0086] Table 1

[0087] S2. According to Table 1, for the first color (green), group the tiles corresponding to the first color according to whether they are connected. That is, among the eight objects corresponding to green, group connected objects into one group and isolated objects into another group. Number these groups, such as the first green group, the second green group, and the third green group.

[0088] Specifically:

[0089] S21 , selecting the G1 object to form a first green group with G1, that is, the first green group includes G1, and selecting other objects of the same color from G2 to G8 that are grouped with G1.

[0090] The detailed steps are as follows:

[0091] S211. Starting with G1, according to the first connected objects G2, G3, G4, and Y7 corresponding to G1 in Table 1, G1 can access (equivalently connect to) any of G2, G3, G4, and G7. Assume that G1 can access objects of the same color among its connected objects. Then, select the object of the same color that is closest to G1 (with the smallest needle drop distance), and this object is G2. Thus, at this moment, the temporary first green group includes G1 and G2.

[0092] S212: For the temporary first green group in S211, which includes G1 and G2, select G2. According to the first connected objects G1 and G3 corresponding to G2 in Table 1, G2 can access either G1 or G3. According to the above settings, G2 can access G3. Thus, at this moment, the temporary first green group includes G1, G2, and G3.

[0093] It should be noted that G2 can access either G1 or G3. Since G1 has already accessed G1, it is assumed that the accessed object does not need to be accessed again. Therefore, only G3 is closest to G2, and thus G2 can access G3.

[0094] S213. For the temporary first green group in S212, which includes G1-G2-G3, select object G3. According to the first connected objects G1, G2, and G4 corresponding to G3 in Table 1, it can be seen that G3 can access any of G1, G2, and G4. According to the above settings, it can be seen that G3 can access G4. Therefore, at this moment, the temporary first green group includes G1-G2-G3-G4.

[0095] S214. For the temporary first green group G1-G2-G3-G4 in S213, select object G4. According to G4's corresponding first connected objects G1, G3, Y6, and Y7 in Table 1, G4 can access any of G1, G3, Y6, and Y7. Based on the above settings, G4 can access objects G1 and G3 of the same color. Since G1 and G3 have already been accessed, there are no more objects to access, and the access ends.

[0096] S215. According to S211-S214, the temporary first green group includes G1-G2-G3-G4, which is the final first green group. This first green group includes G1-G2-G3-G4, which means starting from G1, accessing G2, G3, G4 in sequence, or starting from G4, accessing G3, G2, G1 in sequence. The first green group can be called the first temporary green graph sequence.

[0097] S22 , selecting the G5 object to form a second green group with G5, that is, the second green group includes G5, and selecting other objects of the same color from G5 to G8 that are grouped with G5.

[0098] The detailed steps are as follows:

[0099] S221. Based on G5's connected objects G6 and R11 in Table 1, G5 can access (equivalently connect to) either G6 or R11. Assume that G5 can access the same-colored objects among its connected objects. Next, select the object closest to G5 among the same-colored objects. This object is G6. Thus, at this moment, the temporary second green group includes G5 and G6.

[0100] S222 : For the temporary second green group including G5 and G6 in S221 , select the G6 object. According to the connected object G5 corresponding to G6 in Table 1 , it can be seen that there is no accessible object, and thus the access is terminated.

[0101] S223. According to S221-S222, the temporary second green group includes G5-G6, which is the final second green group.

[0102] S23 , selecting object G7 to form a third green group with G7, that is, the third green group includes G7, and selecting other objects of the same color from G7 to G8 that are grouped with G7.

[0103] With reference to the above description, no further details will be given. The third green group includes G7-G8.

[0104] S3. Generate a first color connecting line on the second and third color objects. Use the first color connecting line to connect the first green group and the second green group in S2 in series to form a second temporary green pattern sequence. Use the first color connecting line again to connect the second temporary green pattern sequence and the third green group in series to form a third temporary green pattern sequence. This third temporary green pattern sequence is the final green pattern chain.

[0105] S31, the first green group G1-G2-G3-G4 and the second green group G5-G6 form a second temporary green sequence:

[0106]

[0107] Specifically:

[0108] S311. The first green group includes G1-G2-G3-G4. Select the G1 object and select the object of the different color (second color or third color) from the connected objects G2, G3, G4, and Y7 corresponding to G1 to access. Thus, at the current moment, the temporary second temporary green graph sequence is:

[0109]

[0110] S312. Select object Y7 and search the connected objects G1 and R12 corresponding to Y7 to see if there are objects G5 and G6 in the second green group that can be accessed. If not, select the object of the opposite color (second or third color) closest to the G object to access. Thus, at this moment, the second temporary green image sequence is:

[0111]

[0112] S313. Select object R12 and search among the connected objects R11, R13, R14, Y6, and Y7 corresponding to R12 to see if objects G5 and G6 in the second green group are accessible. If not, select the closest object G of a different color (second or third color) to access. Thus, at this moment, the second temporary green graph sequence is:

[0113]

[0114] S314. Select object R11 and search among the connected objects R5, R6, R9, R10, R12, G5, Y5, and Y6 corresponding to R11 to see if objects G5 and G6 in the second green group are accessible. If not, select the closest object of the different color to access. Thus, at this moment, the second temporary green graph sequence is:

[0115]

[0116] S315. Therefore, the first green group G1-G2-G3-G4 and the second green group G5-G6 form the second temporary green pattern sequence of the first type:

[0117]

[0118] S32. The first green group includes G1-G2-G3-G4. Select the G2 object and select different-color objects from the connected objects G1 and G3 corresponding to G2 for access. Since there are no different-color objects, a temporary green chain cannot be formed.

[0119] S33. The first green group includes G1-G2-G3-G4. The G3 object is selected. A different-color object is selected from the connected objects G1, G2, and G4 corresponding to G3 for access. Since there is no different-color object, a temporary green chain cannot be formed.

[0120] S34: The first green group includes G1-G2-G3-G4. Select object G4 and select a different-color object from G4's connected objects G1, G3, Y6, and Y7 for access. Accessing Y7 is similar to the description of S311-S314 above, so this description is omitted. Thus, the first green group G1-G2-G3-G4 and the second green group G5-G6 form a second temporary green graph sequence:

[0121]

[0122] S35: The first green group includes G1-G2-G3-G4. Select object G4 and select a different-color object from G4's connected objects G1, G3, Y6, and Y7 for access. Accessing Y6 is similar to the description of S311-S314 above, so this description is omitted. Thus, the first green group G1-G2-G3-G4 and the second green group G5-G6 form a third type of second temporary green graph sequence:

[0123]

[0124] S36. Compare the length values of the above three second temporary green pattern sequences, that is, the total length of the green connecting lines corresponding to the first type of second temporary green pattern sequence, the total length of the green connecting lines corresponding to the second type of second temporary green pattern sequence, and the total length of the green connecting lines corresponding to the third type of second temporary green pattern sequence. The minimum value corresponds to the shortest green connecting line, and then the second temporary green pattern sequence corresponding to the minimum value is selected as the preferred second temporary green pattern sequence.

[0125] Assume that the second temporary green graph order of the third type, G1-G2-G3-G4-Y6-R11-G5-G6 is optimal.

[0126] S37, concatenating the second temporary green pattern sequence and the third green group.

[0127] S38. Referring to the description of S31-S36 above, no further details are given. The third temporary green image sequence of the first type is obtained as follows:

[0128]

[0129] The third temporary green sequence of the second type is:

[0130]

[0131] The third temporary green diagram sequence of the third type is:

[0132]

[0133] The third temporary green diagram sequence of the fourth type is:

[0134]

[0135] S39. Compare the length values of the first, second, third and fourth third temporary green pattern sequences mentioned above. The minimum value corresponds to the shortest green connecting line, and then select the third temporary green pattern sequence corresponding to the minimum value as the preferred third temporary green pattern sequence. The third temporary green pattern sequence is also the green pattern block embroidery chain.

[0136] Assume that the third temporary green graph order of the fourth type is For the best,

[0137] That is The third temporary green pattern sequence is also a green pattern block embroidery chain.

[0138] S4, according to the green block embroidery chain in S3, embroider the object corresponding to the first color (green), such as Figure 6 shown.

[0139] According to the green block embroidery chain, we can know that object G1 is the starting point and object G8 is the end point, or object G8 is the starting point and object G1 is the end point.

[0140] For example, starting with object G1 and ending with object G8, embroider objects G2, G3, and G4 in sequence. Then, create a green connecting line on objects Y6 and R11. Next, embroider objects G5 and G6, using either the insertion method or the non-insertion method. Next, create a green connecting line again on objects R11 and R5. Finally, embroider objects G7 and G8.

[0141] It should be noted that G6 can be considered a branch of the main chain. When encountering a branch chain, embroider the branch chain before continuing with the rest of the main chain. G5 and G6 are the same color and can be embroidered using the insertion method or without the insertion method. If G5 is connected to an object of a different color, a connecting line can be used.

[0142] S5. According to Table 1, for the second color (yellow), the objects corresponding to the second color are generated according to a preset method to form a yellow block chain.

[0143] It should be noted that when forming a yellow block chain according to Table 1, all objects of the first color in Table 1 are not considered. At this time, Table 1 is as shown below, which is equivalent to removing blocks G1-G8. There are no G1-G8 objects in Mark 1.

[0144]

[0145] Table 1

[0146] S6. According to the yellow block chain in S5, embroidery is performed on the object corresponding to the second color (yellow), such as Figure 7 shown.

[0147] S7, embroider the object corresponding to the third color (red) according to the existing technology, such as Figure 8 shown.

[0148] In this embodiment, the first color connecting thread is covered with second and third color embroidery threads, and the second color connecting thread is covered with third color embroidery thread, to ensure the embroidery effect of the pattern. This platemaking method avoids thread cutting, which helps improve embroidery efficiency. It also automatically generates the shortest connecting thread, which connects isolated objects of the same color in series, further improving embroidery efficiency and replacing manual work by the platemaker, reducing the platemaker's workload and job difficulty. If the platemaker adds, moves, or deletes additional objects, the corresponding modification workload can be reduced, thereby improving platemaking efficiency.

[0149] In another embodiment of the present application, according to P i Select the starting point for the colored block embroidery chain. Refer to the green block embroidery chain in the above example:

[0150]

[0151] You can select any of the green blocks G1-G8 as the starting point. For example, take G4 as the starting point.

[0152]

[0153] Then the new main chain is G4-Y6-R11-G5-R11-R5-G7-G8, and G3-G2-G1 and G6 are branch chains.

[0154] For example, green tiles G1-G8, red tiles R1-R5. The embroidery order is green, red. The embroidery chain of the green tiles is:

[0155]

[0156] R1-R2-R3-R4-G6 is the branch chain of the main chain. If G4 is the starting point of the green block embroidery chain,

[0157]

[0158] Compare the lengths of the connecting lines of each branch chain starting from G4. The branch chain with the longest connecting line is considered the main chain, and the other branches are branches of this main chain. Set G4-R1-R2-R3-R4-G6 as the main chain, and G3-G2-G1 and G5-R5-R7-R8 as branches.

[0159] In this way, you can choose P according to user needs. i Color block embroidery chain allows customers to choose the embroidery starting point for their convenience.

[0160] In another embodiment of the present application, according to P i Select the starting and ending points for the colored block embroidery chain. Refer to the green block embroidery chain in the above example:

[0161]

[0162] You can select any of the green blocks G1-G8 as the starting point and end point, which is different from the starting point and end point of the green block embroidery chain mentioned above. For example, take G2 as the starting point and G5 as the end point.

[0163]

[0164] The new main chain is G2-G3-G4-Y6-R11-G5, and the side chains are G1, G6, and R11-R5-G7-G8. In other words, the remaining main chain between the starting point and the end point is the new main chain.

[0165] In this way, you can choose P according to user needs. i Color block embroidery chain selects the embroidery starting point and end point, which is convenient for customers to use.

[0166] The embodiment of the present application provides a plate making device, wherein the preparation module is configured to obtain all colors of the plate making pattern, and determine the embroidery order of the plate making pattern colors from P1 to P according to the preset embroidery color order. n , n is a natural number greater than or equal to 2, P i P1 to P n-1 The block sequence module is configured to follow the sequence from P1 to P n The order of the blocks is used to determine the block embroidery chain of all blocks of the same color in the plate making pattern;

[0167] Among them, for the P in the plate making pattern i Color all blocks and determine P according to the preset method i Color block embroidery chain, and according to the block embroidery chain P i All the tiles embroidered in the color, in P i+1 To P n Generate P on the corresponding color block i Color the connecting line to connect the two separated P i Color tiles.

[0168] On the other hand, an embodiment of the present application further provides a terminal device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above navigation path updating method when executing the program.

[0169] Reference below Figure 11 , which shows a structural diagram of a computer system 900 suitable for implementing the device of the embodiment of the present application.

[0170] like Figure 11As shown, the computer system 900 includes a central processing unit (CPU) 901, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 902 or a program loaded from a storage unit 903 into a random access memory (RAM) 903. Various programs and data required for the operation of the system 900 are also stored in the RAM 903. The CPU 901, the ROM 902, and the RAM 903 are connected to each other via a bus 904. An input / output (I / O) interface 905 is also connected to the bus 904.

[0171] The following components are connected to the I / O interface 905: an input section 906 including a keyboard, a mouse, and the like; an output section 907 including devices such as a cathode ray tube (CRT), a liquid crystal display (LCD), and a speaker; a storage section 908 including a hard disk and the like; and a communication section 909 including a network interface card such as a LAN card or a modem. The communication section 909 performs communication processing via a network such as the Internet. A drive 910 is also connected to the I / O interface 905 as needed. A removable medium 911, such as a magnetic disk, an optical disk, a magneto-optical disk, or a semiconductor memory, is installed in the drive 910 as needed, so that computer programs read therefrom can be installed into the storage section 908 as needed.

[0172] In particular, according to the embodiment of the navigation path update disclosed in the present application, the process described above with reference to the diagram can be implemented as a computer software program. For example, the embodiment of the navigation path update disclosed in the present application includes a computer program product, which includes a computer program tangibly contained on a machine-readable medium, and the computer program includes program code for performing the method shown in the diagram. In such an embodiment, the computer program can be downloaded and installed from a network via the communication portion 909 and / or installed from the removable medium 911.

[0173] It should be noted that the computer-readable medium shown in the present invention can be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or component, or any combination of the above. More specific examples of computer-readable storage media can include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present application, a computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device.

[0174] In the present application, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0175] The flow charts and block diagrams in the accompanying drawings illustrate the possible implementation architecture, functions and operations of the system, method and computer program product according to the various navigation path update embodiments of the present application. In this regard, each box in the flow chart or block diagram can represent a module, program segment or a part of code, and the aforementioned module, program segment or a part of code includes one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a sequence different from that marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flow chart, and the combination of the boxes in the block diagram and / or flow chart can be implemented by a dedicated hardware-based system that performs the specified function or operation, or can be implemented by a combination of dedicated hardware and computer instructions.

[0176] The units or modules involved in the embodiments described in the present application may be implemented by software or by hardware. The units or modules described may also be provided in a processor. For example, they may be described as: a processor including a preparation module and a block sequence module. The names of these units or modules do not, in some cases, constitute a limitation on the units or modules themselves. For example, the preparation module may also be described as "used to obtain all colors of the plate-making pattern, and determine the embroidery order of the plate-making pattern colors from P1 to P according to the preset embroidery color order." n ”.

[0177] As another aspect, the present application further provides a computer-readable storage medium, which may be the computer-readable storage medium included in the aforementioned apparatus in the above-mentioned embodiment; or a computer-readable storage medium that exists independently and is not incorporated into the apparatus. The computer-readable storage medium stores one or more programs, which are used by one or more processors to execute the platemaking method described in the present application, specifically performing the following steps:

[0178] Preparation process:

[0179] Get all the colors of the plate-making pattern, and determine the embroidery order of the plate-making pattern colors from P1 to P according to the preset embroidery color order. n , n is a natural number greater than or equal to 2, P i P1 to P n-1 Any one of;

[0180] Tile sequence confirmation process:

[0181] Follow the steps from P1 to P n The order of the blocks in the same color in the plate making pattern is determined in turn.

[0182] Among them, for the P in the plate making pattern i Color all blocks and determine P according to the preset method i Color block embroidery chain, and according to the block embroidery chain P i All the tiles embroidered in the color, in P i+1 To P n Generate P on the corresponding color block i Color the connecting line to connect the two separated P i Color tiles.

[0183] The plate-making method, device, equipment, and medium provided in the embodiments of the present application, and the plate-making method for a computerized embroidery machine according to the embodiments of the present invention, embroider different colors in the order of P1 to Pn. When embroidering the color Pi, the interval color blocks of the color Pi can be connected by embroidering connecting lines within the color blocks Pi to Pn. When embroidering the color blocks after Pi, the connecting lines formed when embroidering the color Pi can be covered by the subsequent embroidery color, so that the connecting lines can be hidden, ensuring the embroidery effect. Thus, while ensuring the embroidery effect, it is possible to reduce the thread cutting operation during the embroidery process and improve embroidery efficiency.

[0184] The above description is merely a preferred embodiment of the present application and an illustration of the technical principles employed. Those skilled in the art should understand that the scope of the invention herein is not limited to the technical solutions formed by the specific combination of the above-mentioned technical features, but also encompasses other technical solutions formed by any combination of the above-mentioned technical features or their equivalents without departing from the inventive concept. For example, a technical solution formed by replacing the above-mentioned features with (but not limited to) technical features having similar functions disclosed in this application.

Claims

1. A plate making method for a computer embroidery machine, characterized in that: The steps include: Preparation process: Obtain all the colors of the plate-making pattern, and determine the embroidery order of the plate-making pattern colors from P1 to P according to the preset embroidery color order. n , n is a natural number greater than or equal to 2, P i P1 to P n-1 Any one of; Tile sequence confirmation process: Follow the steps from P1 to P n determining the block embroidery chain of all the blocks of the same color in the plate-making pattern in order; Among them, for the P in the plate making pattern i Color all the blocks, determine P according to the preset method i Color of the picture block embroidery chain, and according to the picture block embroidery chain P i All the tiles are embroidered in the same color as the ones in P i+1 To P n Generate P on the block of the corresponding color i Color the connecting line to connect the two separated P i Color the tiles, The preparation process also includes the following steps: numbering each of the tiles; judging whether the two tiles are connected based on the relationship between the needle drop point distance between the two tiles and a threshold value, thereby obtaining a connected object for each tile, wherein the connected object is the number of any tile whose needle drop point distance from the tile is less than or equal to the threshold value, and the connected objects of all the tiles are summarized to obtain a connected object table, wherein the needle drop point is located in the edge area of the tile.

2. The plate making method for a computer embroidery machine according to claim 1, characterized in that: In the block embroidery chain in which the color Pi is determined according to a preset method, the preset method adopted includes the following steps: Grouping all the tiles with color Pi to obtain groups from 1 to m, where m is a natural number greater than or equal to 1, wherein each tile and all its connected objects belong to the same group, and when the tile has no connected objects, it belongs to a separate group; According to the connected object table, all the blocks in the first group are sequentially sorted to obtain a first temporary block sequence, wherein two consecutive blocks in the first temporary block sequence are connected objects to each other; When there is a second group, the jth group represents any one of the groups from the second to the mth group. When the jth group and any of the previous groups are connected by a color P i+1 To P n When the blocks are connected, select the blocks with the color P from the first group to the jth group according to the connected object table. i+1 To P n The block, P i+1 To P n The blocks are connected in series from the 1st group to the jth group, and the order of all the blocks from the 1st group to the jth group constitutes the jth temporary block sequence; And so on, to the mth group, the order of all the image blocks from the 1st group to the mth group constitutes the mth temporary image sequence; The final embroidery chain of the picture blocks of the Pi color is obtained according to the mth temporary picture sequence.

3. The plate making method for a computer embroidery machine according to claim 2, characterized in that: In the connected object table, the connected objects of the block with color Pi are sorted according to the following rules: Rule 1: Sort from color Pi to color not Pi; Rule 2: Among the connected objects whose color is not Pi, sort them in color order from P1 to Pn, skipping Pi. Rule 3: multiple connected objects of the same color are sorted in order of the distance between the needle drop point of each connected object and the block from short to long.

4. The plate making method for a computer embroidery machine according to claim 3, characterized in that: The step of sequentially sorting all the image blocks in the first group to obtain a first temporary image sequence includes the following steps: Selecting a block of the first group as the first node of the first temporary graph sequence, and finding the block with the highest ranking among the connected objects of the first node in the connected object table as the second node; Find the top-ranked tile from the connected objects of the second node in the connected object table as the temporary third point; This process is deduced in this way until all the blocks in the first group are listed, and each block in the first group is only one node; A plurality of the nodes constitute the first temporary graph sequence.

5. The plate making method for a computer embroidery machine according to claim 3, characterized in that: The obtained j-th temporary image sequence satisfies the following conditions: When there are multiple orderings of all the image blocks from the 1st group to the jth group, the one with the shortest connection line is selected as the final jth temporary image order.

6. The plate making method for a computer embroidery machine according to any one of claims 1 to 5, characterized in that: According to the embroidery chain of the picture blocks of color Pi, all the embroidery starting points of the picture blocks of color Pi are selected.

7. The plate making method for a computer embroidery machine according to any one of claims 1 to 5, characterized in that: According to the embroidery chain of the picture blocks of Pi color, select the starting points and end points of all the embroidery blocks of Pi color.

8. A plate-making device, characterized in that: include: A preparation module is used to obtain all colors of the plate-making pattern and determine the embroidery order of the plate-making pattern colors from P1 to Pn according to a preset embroidery color order, where n is a natural number greater than or equal to 2, and Pi is any one of P1 to Pn-1; A block sequence determination module is used to determine the block embroidery chain of all the blocks of the same color in the plate-making pattern in order from P1 to Pn; For all the blocks of color Pi in the plate-making pattern, the block embroidery chain of color Pi is determined according to a preset method, and all the blocks of color Pi are embroidered according to the block embroidery chain, and connecting lines of color Pi are generated on the blocks of colors corresponding to Pi+1 to Pn to connect two separated blocks of color Pi. The preparation module also includes: numbering each of the tiles; judging whether the two tiles are connected based on the relationship between the needle drop point distance between the two tiles and a threshold value, thereby obtaining a connected object of each tile, wherein the connected object is the number of any tile whose needle drop point distance from the tile is less than or equal to the threshold value, and the connected objects of all the tiles are summarized to obtain a connected object table, wherein the needle drop point is located in the edge area of the tile.

9. A terminal device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the method according to any one of claims 1 to 7 when executing the program.

10. A computer-readable storage medium having a computer program stored thereon, wherein the computer program is configured to implement the method according to any one of claims 1 to 7.

Images