A device for distinguishing inner and outer membranes of a group during plate cutting
By distinguishing the inner and outer membranes of the group during the cutting of the plate, building a tree-like structure and generating a laser cutting path, the processing displacement or collision machine problems caused by the cutting of the outer contour is solved, and a stable cutting process is achieved.
Patent Information
- Application Number
- CN202310735223.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2023-06-20
- Publication Date
- 2025-08-22
- Estimated Expiration
- 2043-06-20
AI Technical Summary
During the cutting of the plate, the inner and outer membranes of the group pattern are not distinguished, resulting in processing displacement or collision problems after cutting of the outer contour.
By obtaining the graphics to be grouped, setting the groups, and distinguishing the inner and outer membranes of each group, building a tree-like structure for graphic traversal, realizing the distinction between the inner and outer membranes, and generating laser cutting path information to ensure the processing order of the inner membrane first and then the outer membrane.
It solves the processing displacement or collision problem caused by inner contour processing after cutting the outer contour, ensuring the stability and safety of the cutting process.
Smart Images

Figure CN116786993B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of laser cutting technology, and in particular to a device for distinguishing inner and outer membranes of a group during a plate cutting process. Background Art
[0002] A group is a combination of a certain type of things with the same characteristics, and the group function is a very important function in CAM software.
[0003] Before the actual CNC cutting process, the operator or technician will process the entire board graphics. During this process, the technician will group some graphics with the same characteristics, or graphics that are cut together, to ensure the stability of the processing and the quality of the processed workpiece.
[0004] However, during the grouping process, the graphics to be grouped were not sorted, nor were the inner and outer molds distinguished. This resulted in an abnormal cutting order for the grouped graphics. For example, if the outer contour graphics were cut first, or if the outer contour graphics were cut afterward, the sheet metal would vibrate and become misaligned, leading to processing shift or collision.
[0005] Therefore, in the grouping process, it is very necessary to distinguish the inner and outer models of all the graphics in the group. Summary of the Invention
[0006] (1) Technical issues to be resolved
[0007] In view of the above-mentioned shortcomings and deficiencies of the prior art, the present invention provides a device for distinguishing the inner and outer membranes of a group during the plate cutting process, which solves the technical problem of processing displacement or collision caused by processing the inner contour only after the outer contour is cut off.
[0008] (2) Technical solution
[0009] In order to achieve the above objectives, the main technical solutions adopted by the present invention include:
[0010] In a first aspect, an embodiment of the present invention provides a device for distinguishing inner and outer membranes of a group during a plate cutting process, comprising: an acquisition module for acquiring a graphic to be grouped; a setting module for setting at least one group based on the graphic to be grouped; and a distinguishing module for distinguishing inner and outer membranes of the graphic of each group in at least one group to obtain each group after distinguishing inner and outer membranes.
[0011] In one possible embodiment, the differentiation module is specifically used to: construct at least one tree structure with an inner and outer membrane relationship based on the graph of each group; wherein each tree structure in the at least one tree structure corresponds to a group; and perform a graph traversal on each tree structure to obtain each group after distinguishing the inner and outer membranes.
[0012] In one possible embodiment, the distinguishing module is specifically used to: obtain the current graph from the current group and generate a node to be inserted including the current graph; determine whether the current graph is included in the first node pointed to by the first pointer of the current tree structure; if the current graph is not included in the first node, determine whether the first target graph in the first node is included in the current graph; if the first target graph in the first node is included in the current graph, add the first node to the child list of the node to be inserted, delete the first node from the child list of the second node pointed to by the second pointer of the current tree structure, add the node to be inserted to the child list of the second node, and return to the step of determining whether the current graph is included in the first node pointed to by the first pointer of the current tree structure; wherein, the second node pointed to by the second pointer is the parent node of the first node pointed to by the first pointer.
[0013] In one possible embodiment, the distinguishing module is specifically used to point the first pointer to the next node of the first node and the second pointer to the first node when the current graph is included in the first node, and return to the step of determining whether the current graph is included in the first node pointed to by the first pointer of the current tree structure.
[0014] In one possible embodiment, the distinguishing module is specifically used to: when the first target graph is not included in the current graph, determine whether the next child node of the second node is empty; when the next child node of the second node is empty, add the node to be inserted to the child list of the second node.
[0015] In one possible embodiment, the distinguishing module is specifically used to move the first pointer to the next child node of the second node when the next child node of the second node is not empty, and return to the step of determining whether the current graph is included in the first node pointed to by the first pointer of the current tree structure.
[0016] In a possible embodiment, the distinguishing module is specifically configured to: break up the first target figure into a plurality of first points of a first precision; and determine whether each of the plurality of first points is in the current figure.
[0017] In one possible embodiment, the distinguishing module is specifically used to: break up the current graphic into multiple second points of second precision; wherein the first precision and the second precision are the same precision; determine the angle between the current first point and any two adjacent second points among the multiple second points, and calculate the total angle sum of all the angles corresponding to the current first points; wherein the current first point is any first point among the multiple first points; based on the total angle sum, determine whether the current first point is in the current graphic.
[0018] In a possible embodiment, the distinguishing module is specifically configured to determine that the current graph is included in the first node when the sum of the total angles corresponding to each first point is 360°, and point the first pointer to the node in the next layer of the first node.
[0019] In a second aspect, an embodiment of the present invention provides a laser cutting system, comprising: an acquisition module for obtaining each group after distinguishing the inner and outer membranes; wherein each group after distinguishing the inner and outer membranes is obtained by any device for distinguishing the inner and outer membranes of a group during the plate cutting process according to the first aspect; a generation module for generating laser cutting path information based on the sequence of the inner and outer membranes contained in each group after distinguishing the inner and outer membranes; and a laser cutting module for performing laser cutting based on the laser cutting path information.
[0020] (3) Beneficial effects
[0021] The beneficial effects of the present invention are:
[0022] An embodiment of the present application provides a solution for achieving the distinction between inner and outer membranes of groups during the plate cutting process, by obtaining the graphics to be grouped, and setting at least one group based on the graphics to be grouped, and distinguishing the inner and outer membranes of the graphics of each group in at least one group, so as to obtain each group after the inner and outer membranes are distinguished, thereby achieving the distinction between the inner and outer membranes of the graphics of the group, and subsequently processing in the manner of first inner membrane and then outer membrane, thereby solving the problem of processing displacement or collision caused by the existing processing of the inner contour after the outer contour is cut off.
[0023] In order to make the above-mentioned objectives, features and advantages to be achieved by the embodiments of the present application more obvious and easy to understand, preferred embodiments are specifically cited below and described in detail with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS
[0024] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the following is a brief introduction to the drawings required for use in the embodiments of the present application. It should be understood that the following drawings only show certain embodiments of the present application and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other relevant drawings can be obtained based on these drawings without creative work.
[0025] Figure 1 A schematic structural diagram of a device for distinguishing inner and outer membranes of a group during plate cutting provided by an embodiment of the present application is shown;
[0026] Figure 2 A flowchart of a device for constructing a tree structure provided by an embodiment of the present application is shown;
[0027] Figure 3A schematic structural diagram of a laser cutting system provided in an embodiment of the present application is shown;
[0028] Figure 4 A schematic diagram showing a graph of a participating group provided in an embodiment of the present application is shown;
[0029] Figure 5 A schematic diagram showing the group results of an existing scheme that does not use the internal and external mode distinction;
[0030] Figure 6 A schematic diagram showing a group result of a solution for distinguishing inner and outer modules provided in an embodiment of the present application is shown. DETAILED DESCRIPTION
[0031] In order to better explain the present invention and facilitate understanding, the present invention is described in detail below through specific implementation methods in conjunction with the accompanying drawings.
[0032] In order to ensure the safety of the machine tool and the accuracy of the processed parts during the processing, an embodiment of the present application provides a solution for distinguishing the inner and outer membranes of groups during the plate cutting process, by obtaining the graphics to be grouped, and setting at least one group based on the graphics to be grouped, and distinguishing the inner and outer membranes of the graphics of each group in at least one group, so as to obtain each group after the inner and outer membranes are distinguished, thereby achieving the distinction between the inner and outer membranes of the group graphics, and subsequently processing in the manner of inner membrane first and outer membrane later, thereby solving the problem of processing displacement or collision caused by the existing outer contour being cut off before processing the inner contour.
[0033] To better understand the above technical solutions, exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings. Although exemplary embodiments of the present invention are shown in the accompanying drawings, it should be understood that the present invention can be implemented in various forms and should not be limited by the embodiments described herein. Instead, these embodiments are provided to enable a clearer and more thorough understanding of the present invention and to fully convey the scope of the present invention to those skilled in the art.
[0034] See Figure 1 , Figure 1 The schematic diagram of the structure of a device for distinguishing the inner and outer membranes of a group during the plate cutting process provided by an embodiment of the present application is shown. Figure 1 As shown, the device includes:
[0035] An acquisition module 110 is used to acquire graphics to be grouped;
[0036] A setting module 120, configured to set at least one group based on the graphics to be grouped;
[0037] The distinguishing module 130 is configured to distinguish the inner and outer membranes of the graphics of each group in the at least one group, so as to obtain each group after the inner and outer membranes are distinguished.
[0038] It should be understood that the specific process of the setting module 120 setting at least one group based on the graphics to be grouped can be set according to actual needs, and the embodiments of the present application are not limited thereto.
[0039] Optionally, the graphics to be grouped are selected (for example, they can be selected by box selection, by ctrl+click selection, or by a combination of the two), and the selected graphics can be displayed with dotted lines.
[0040] After selecting the graphics to be grouped, you can set a group object and add the graphics to the group object. You can also delete the original graphics to be grouped from the entire graphics list and add the newly generated group graphics to the entire graphics list.
[0041] It should also be understood that the specific process of the distinguishing module 130 distinguishing the inner and outer membranes of the graphics of each group in at least one group to obtain each group after the inner and outer membranes are distinguished can also be set according to actual needs, and the embodiments of the present application are not limited thereto.
[0042] Optionally, based on the graph of each group, at least one tree structure with inner and outer membrane relationships is constructed; wherein each tree structure in at least one tree structure corresponds to a group; and each tree structure is graph traversed to obtain each group after distinguishing inner and outer membranes.
[0043] It should also be understood that the process of creating a tree structure can also be set according to actual needs, and the embodiments of the present application are not limited to this.
[0044] It should be noted here that in the process of building a tree structure, a node structure Tree Node is defined, which includes its own graph (Node) and a list of all child nodes (Children)
[0045] Alternatively, see Figure 2 , Figure 2 A flowchart of a device for constructing a tree structure provided by an embodiment of the present application is shown. Figure 2 As shown, the device includes:
[0046] Step S211: Create an empty tree and wait for a node to be inserted.
[0047] Step S212: Set a first pointer and a second pointer, and both the first pointer and the second pointer point to the root of the tree, wherein the second node pointed to by the second pointer is the parent node of the first node pointed to by the first pointer.
[0048] Step S213: Obtain the current graph from the current group and generate a node to be inserted including the current graph. The node to be inserted may include not only the current graph but also related graph information (eg, graph size, etc.) of the current graph.
[0049] It should also be noted that after the node to be inserted is inserted into the tree structure, the inserted node may also include relevant information of its parent node and child nodes.
[0050] Step S214 , determining whether the current graph is included in the first node pointed to by the first pointer of the current tree structure.
[0051] If the current graph is included in the first node pointed to by the first pointer of the current tree structure, step S215 is executed; if the current graph is not included in the first node pointed to by the first pointer of the current tree structure, step S216 is executed.
[0052] It should be understood that the specific process of determining whether the current graphic is included in the first node pointed to by the first pointer of the current tree structure can also be set according to actual needs, and the embodiments of the present application are not limited thereto.
[0053] Optionally, when the first node includes a first target graph, a determination is made as to whether the first target graph is a closed graph. If the first target graph is a closed graph, the first target graph is broken up into a plurality of first points of a first precision, and the plurality of first points are stored in a first array. Furthermore, the current graph is broken up into a plurality of second points of a second precision, and the plurality of second points are stored in a second array. The specific precision of the first precision and the specific precision of the second precision can be set according to actual needs, and the embodiments of the present application are not limited thereto. For example, the first precision and the second precision are both 0.001.
[0054] Furthermore, a determination is made as to whether each second point in the second array is within the first target shape. Specifically, the angle between the current second point and any two adjacent first points among all first points can be calculated, and this angle can have positive or negative values. For example, if the current second point and the specified first point and its adjacent first point are determined according to the outline of the first target shape, the angle can be positive if it is clockwise and negative if it is counterclockwise. The current second point is any second point among all second points.
[0055] Furthermore, after obtaining all included angles corresponding to the current second point, the total included angle sum of all included angles corresponding to the current second point can be calculated. If the total included angle sum of all included angles corresponding to the current second point is 360°, it can be determined that the current second point is within the first target graph. Furthermore, if all second points are within the first target graph, it can be determined that the current graph is included within the first target graph; if at least one of all second points is not within the first target graph, it can be determined that the current graph is not within the first target graph.
[0056] It should be noted that the first target figure can be determined to be a closed figure by determining whether the starting point and the ending point of the first target figure are the same point. If the starting point and the ending point are the same point, the first target figure is a closed figure.
[0057] Step S215: point the first pointer to the node in the next layer of the first node, and point the second pointer to the first node, and return to step S214.
[0058] Step S216: Determine whether the first target graph in the first node is included in the current graph.
[0059] If the first target graphic is included in the current graphic, step S217 is executed; if the first target graphic is not included in the current graphic, step S218 is executed.
[0060] Specifically, the specific process of determining whether the first target graph in the first node is included in the current graph can also be set according to actual needs, and the embodiments of the present application are not limited thereto.
[0061] Optionally, if the first node includes a first target graph, determining whether the current graph is a closed graph. If the current graph is a closed graph, breaking the first target graph into a plurality of first points of a first precision and storing the plurality of first points in a first array. Furthermore, breaking the current graph into a plurality of second points of a second precision and storing the plurality of second points in a second array.
[0062] Furthermore, it is determined whether each first point in the first array is in the current graph. Specifically, the angle between the current first point and any two adjacent second points among all the second points can be calculated, and this angle can also have positive and negative values. For details, please refer to the relevant description above.
[0063] Furthermore, after obtaining all included angles corresponding to the current first point, the total included angle sum of all included angles corresponding to the current first point can be calculated. If the total included angle sum of all included angles corresponding to the current first point is 360°, it can be determined that the current first point is within the current graph. Furthermore, if all first points are within the current graph, it can be determined that the first target graph is included within the current graph; if at least one of all first points is not within the current graph, it can be determined that the first target graph is not included within the current graph.
[0064] Step S217, the first node is added to the child list of the node to be inserted, and the first node is deleted from the child list of the second node pointed to by the second pointer of the current tree structure, and the node to be inserted is added to the child list of the second node, and the process returns to step S214.
[0065] Step S218: Determine whether the next child node of the second node is empty.
[0066] If the next child node of the second node is empty, execute step S219; if the next child node of the second node is not empty, execute step S220.
[0067] Step S219: Add the node to be inserted into the child list of the second node.
[0068] Step S220: Move the first pointer to the next child node of the second node, and return to step S214.
[0069] It should also be understood that the specific process of performing a graphical traversal on each tree structure to obtain each group after distinguishing the inner and outer membranes can be set according to actual needs, and the embodiments of the present application are not limited thereto.
[0070] Optionally, a post-order traversal of the tree is used to traverse the graph, specifically: the pointer points to the root of the tree, and the child list of the node pointed to by the current pointer is judged in turn whether it is a leaf node: if it is a leaf node, it is output; if it is not a leaf node, the current pointer points to the node, and the step of "judging in turn whether the child list of the node pointed to by the current pointer is a leaf node" is repeated.
[0071] And, after the traversal of the child list is completed, the current node is output and the previous layer structure is returned until the root node is output.
[0072] It should also be noted that when the graphics of the current group are divided into inner and outer membranes and the graphics of the current group include multiple graphics, since the present application can save each group and its tree structure obtained after the inner and outer membranes are distinguished (that is, after saving, a historical group after the inner and outer membranes are distinguished is obtained, and the historical group includes the inner and outer membrane sequence of each graphic in the multiple graphics in the corresponding group and the position and size information of each graphic, etc.), when the number of graphics in the current group is greater than or equal to the preset number, the graphics of the current group can be matched with multiple historical groups after the inner and outer membranes are distinguished, so as to match the most matching historical group from the multiple historical groups after the inner and outer membranes are distinguished. Among them, the most matching historical group is the historical group in the multiple historical groups after the inner and outer membranes are distinguished that is closest in position and size to the multiple graphics of the current group; the specific number of the preset number can be set according to actual needs, and the embodiments of the present application are not limited to this.
[0073] For example, when the graphics of the current group include n graphics, the graphics of the current group can be matched with two historical groups after distinguishing the inner and outer membranes, and the first historical group includes m graphics, and m is less than n, and ma graphics among the m graphics are the same as some graphics among the n graphics, that is, the positions of the ma graphics on the plate are the same as the positions of some graphics among the n graphics on the plate, and the sizes of the ma graphics are close to the sizes of some graphics among the n graphics (for example, the sizes of the ma graphics are the same as the sizes of some graphics among the n graphics, or the size difference between the sizes of the ma graphics and the sizes of some graphics among the n graphics is within a preset range, and the specific value of the preset range can be set according to actual needs), and the second historical group includes p graphics, and p is less than m, and pb graphics among the p graphics are the same as some graphics among the n graphics, that is, the positions of the pb graphics on the plate are the same as the positions of some graphics among the n graphics on the plate, and the sizes of the pb graphics are close to the sizes of some graphics among the n graphics. Therefore, we can also compare ma and pb. If ma is greater than or equal to pb, the first history group is the most matching history group; if ma is less than pb, the second history group is the most matching history group. Where a and b are positive integers.
[0074] It should be noted here that although the above description is based on two historical groups, those skilled in the art should understand that it may also include more historical groups, and the matching process of any two historical groups among the multiple historical groups can refer to the relevant description above.
[0075] And, after determining the best matching historical group, determine the number of graphic matches between the best matching historical group and the current group (for example, ma or pb) and the size of the preset number. If the number of graphic matches is less than or equal to the preset number, you can directly follow Figure 2 The process establishes a tree structure for the current group to distinguish between the inner and outer membranes; if the number of matching patterns exceeds a preset number, the data of patterns that are different from the current group can be deleted from the history tree structure of the best matching history group (for example, if the first history group is the best matching history group, the patterns that are different from the current group are a patterns other than ma patterns) to obtain an updated history tree structure. Furthermore, the history tree structure is updated using the different patterns between the current group and the best matching history group (for example, if the number of different patterns between the current group and the best matching history group is n-m+a, the history tree structure can be updated using n-m+a patterns).
[0076] In addition, to avoid the problem of excessive resource usage caused by the saved history groups and their history structures, and taking into account the actual mass production scenario, the present application can also record the number of matches for each history group (for example, if the current history group is determined to be the most matched history group, the number of matches for the current history group can be increased by 1), so that all history groups can be sorted by the number of matches to obtain sorted history groups. Furthermore, after a preset time is reached, history groups and their history tree structures with fewer than the preset number of matches can be deleted, thereby enabling real-time updates of history groups and their tree structures.
[0077] It should be understood that the specific number of the preset quantity and the specific time of the preset time can be set according to actual needs, and the embodiments of the present application are not limited to this.
[0078] Therefore, with the help of the above-mentioned technical solution, the embodiment of the present application obtains the graphics to be grouped, and sets at least one group based on the graphics to be grouped, and distinguishes the inner and outer membranes of the graphics of each group in at least one group to obtain each group after the inner and outer membranes are distinguished, thereby realizing the distinction between the inner and outer membranes of the group graphics, and subsequently processing in the manner of first inner membrane and then outer membrane, thereby solving the problem of processing displacement or collision caused by the existing outer contour being cut off before processing the inner contour.
[0079] It should be understood that the above-mentioned device for distinguishing the inner and outer membranes of a group during the plate cutting process is only exemplary. Those skilled in the art can make various modifications to the above-mentioned device according to actual needs, and the modified scheme also falls within the scope of protection of this application.
[0080] See Figure 3 , Figure 3FIG. 3 shows a schematic structural diagram of a laser cutting system 300 provided in an embodiment of the present application. Figure 3 As shown, the laser cutting system includes:
[0081] An obtaining module 310 is used to obtain each group after the inner and outer membranes are distinguished; wherein each group after the inner and outer membranes are distinguished is obtained by the above-mentioned device for distinguishing the inner and outer membranes of the group during the plate cutting process, and the details can be found in the relevant description above;
[0082] A generating module 320 is configured to generate laser cutting path information based on the order of the inner and outer membranes contained in each group after the inner and outer membranes are distinguished; wherein the laser cutting path information may be a tool path file required to be run by the laser cutting system;
[0083] The laser cutting module 330 is configured to perform laser cutting based on the laser cutting path information.
[0084] Therefore, with the help of the above technical solution, the embodiment of the present application obtains the cutting order of the graphics after optimization grouping through the above device, and in the process of grouping, distinguishes the inner and outer molds of the graphics, and processes them in the order of first inside and then outside, so as to avoid processing the inner contour after cutting off the outer contour, causing unsafe factors such as processing displacement or collision.
[0085] In order to facilitate understanding of the embodiments of the present application, the following description is given through specific embodiments.
[0086] Specifically, if Figure 4 As shown, it shows the group front figure, and as Figure 5 As shown, it shows the graph after the group without distinguishing the inner and outer membranes, and as Figure 6 As shown, it shows a graph after differentiating the groups of inner and outer membranes.
[0087] And, for Figure 5 As shown, if the groups are not distinguished between inner and outer molds and are reordered, the outer contour may be cut first and the inner contour later, causing the cut parts to shift or even crash into the machine;
[0088] for Figure 6 As shown, with the inner and outer molds distinguished and reordered, the inner contour will be cut first and then the outer contour, ensuring that the relative positions of the cut parts are consistent and there is no risk of collision.
[0089] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working process of the device described above can refer to the corresponding process in the aforementioned device, and will not be described in detail here.
[0090] Those skilled in the art will appreciate that embodiments of the present invention may be provided as devices, systems, or computer program products. Thus, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.
[0091] The present invention is described with reference to flowcharts and / or block diagrams of apparatuses, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowcharts and / or block diagrams, as well as combinations of processes and / or blocks in the flowcharts and / or block diagrams, can be implemented by computer program instructions.
[0092] It should be noted that, in the claims, any reference signs placed between brackets shall not be construed as limiting the claims. The word "comprising" does not exclude the presence of components or steps not listed in the claims. The word "a" or "an" preceding a component does not exclude the presence of a plurality of such components. The invention may be implemented by means of hardware comprising several different components and by means of a suitably programmed computer. In claims enumerating several means, several of these means may be embodied by one and the same hardware. The use of the words first, second, third etc. is for convenience only and does not indicate any order. These words may be understood as part of the component name.
[0093] In addition, it should be noted that, in the description of this specification, the description of the terms "one embodiment", "some embodiments", "embodiment", "example", "specific example" or "some examples" means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic expressions of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any one or more embodiments or examples in a suitable manner. In addition, those skilled in the art can combine and combine different embodiments or examples described in this specification and the features of different embodiments or examples, unless they are contradictory.
[0094] Although the preferred embodiments of the present invention have been described, those skilled in the art may make additional changes and modifications to these embodiments after learning the basic creative concept. Therefore, the claims should be interpreted as including the preferred embodiments and all changes and modifications that fall within the scope of the present invention.
[0095] Obviously, those skilled in the art may make various modifications and variations to the present invention without departing from the spirit and scope of the present invention. Thus, if such modifications and variations fall within the scope of the claims and their equivalents, the present invention shall also include such modifications and variations.
Claims
1. A device for distinguishing the inner and outer membranes of a group during the plate cutting process, characterized in that: include: The acquisition module is used to obtain the graphics to be grouped; A setting module, configured to set at least one group based on the graphics to be grouped; a distinguishing module, configured to distinguish the inner and outer membranes of the graphics of each group in the at least one group, so as to obtain each group after the inner and outer membranes are distinguished; The differentiation module is specifically configured to: construct at least one tree structure with an inner and outer membrane relationship based on the graph of each group; wherein each of the at least one tree structure corresponds to one of the groups; and perform a graph traversal on each of the tree structures to obtain each group after differentiation between the inner and outer membranes; The distinguishing module is specifically used to: obtain the current graph from the current group and generate a node to be inserted including the current graph; determine whether the current graph is included in the first node pointed to by the first pointer of the current tree structure; if the current graph is not included in the first node, determine whether the first target graph in the first node is included in the current graph; if the first target graph in the first node is included in the current graph, add the first node to the child list of the node to be inserted, delete the first node from the child list of the second node pointed to by the second pointer of the current tree structure, add the node to be inserted to the child list of the second node, and return to the step of determining whether the current graph is included in the first node pointed to by the first pointer of the current tree structure; wherein, the second node pointed to by the second pointer is the parent node of the first node pointed to by the first pointer.
2. The device according to claim 1, characterized in that The distinguishing module is specifically used to point the first pointer to the next layer node of the first node and the second pointer to the first node when the current graph is included in the first node, and return to the step of determining whether the current graph is included in the first node pointed to by the first pointer of the current tree structure.
3. The device according to claim 1, characterized in that The distinguishing module is specifically used to: when the first target graph is not included in the current graph, determine whether the next child node of the second node is empty; when the next child node of the second node is empty, add the node to be inserted into the child list of the second node.
4. The device according to claim 3, characterized in that The distinguishing module is specifically used to move the first pointer to the next child node of the second node when the next child node of the second node is not empty, and return to the step of determining whether the current graph is included in the first node pointed to by the first pointer of the current tree structure.
5. The device according to claim 3, characterized in that The differentiation module is specifically configured to: break up the first target figure into a plurality of first points of a first precision; and determine whether each of the plurality of first points is within the current figure.
6. The device according to claim 5, characterized in that The distinguishing module is specifically used to: break up the current graphic into multiple second points of second precision; wherein the first precision and the second precision are the same precision; determine the angle from the current first point to any two adjacent second points among the multiple second points, and calculate the total angle sum of all the angles corresponding to the current first point; wherein the current first point is any first point among the multiple first points; based on the total angle sum, determine whether the current first point is in the current graphic.
7. The device according to claim 6, characterized in that The distinguishing module is specifically configured to determine that the current graph is included in the first node when the sum of the total angles corresponding to each first point is 360°, and point the first pointer to a node in a next layer of the first node.
8. A laser cutting system, characterized in that: include: an obtaining module, for obtaining each group after the inner and outer membranes are distinguished; wherein each group after the inner and outer membranes are distinguished is obtained by the device for distinguishing the inner and outer membranes of a group during the plate cutting process according to any one of claims 1 to 7; a generating module, configured to generate laser cutting path information based on the sequence of the inner and outer membranes contained in each group after the inner and outer membranes are distinguished; A laser cutting module is used to perform laser cutting based on the laser cutting path information.
Citation Information
Patent Citations
Laser cutting path optimizing method
CN102880113A