Method, device and processor for realizing groove path co-edge processing in plane laser cutting processing and computer readable storage medium thereof

Abstract

The present application relates to a kind of methods for realizing groove path common edge processing in plane laser cutting processing, comprising the following steps: enabling groove cutting, import groove part;Groove part is laid out with common edge;Calculate upper surface repeat edge, and record mapping relationship;According to repeat edge and its belonging part, grouping is carried out;Generate the path of each group common edge;The graphic element belonging to the part inside in this group and other graphic elements not forming common edge are added to the generated path;Sort the inner hole, groove and other graphic elements in path;Import G code processing file and process.The present application also relates to a kind of device for realizing groove path common edge processing in plane laser cutting processing, processor and its computer readable storage medium.The method for realizing groove path common edge processing in plane laser cutting processing, device, processor and its computer readable storage medium of the present application can effectively improve plate utilization, reduce material and energy loss, improve groove part cutting efficiency, reduce operator requirement.

Description

Technical Field

[0001] This invention relates to the field of planar CNC laser processing, and more particularly to the field of bevel cutting. Specifically, it relates to a method, apparatus, processor, and computer-readable storage medium for realizing bevel path common edge processing in planar laser cutting. Background Technology

[0002] In the laser cutting process, for vertical parts with the same characteristics, such as rectangular parts, using common-edge cutting can greatly improve cutting efficiency and material utilization.

[0003] In the fabrication and production of sheet metal components for shipbuilding, steel structures, and other engineering projects, many parts require beveling along their edges. However, common-edge cutting technology is not currently being used; individual parts are still being cut. Compared to straight-cut common-edge cutting, this method results in higher material and energy consumption and lower sheet metal utilization.

[0004] Therefore, it is essential to design a method for generating common-edge cutting paths for beveled parts. Summary of the Invention

[0005] The purpose of this invention is to overcome the shortcomings of the prior art and provide a method, apparatus, processor and computer-readable storage medium for achieving bevel path common edge processing in planar laser cutting, which is characterized by low energy consumption, simple operation and wide applicability.

[0006] To achieve the above objectives, the method, apparatus, processor, and computer-readable storage medium for realizing bevel path common edge processing in planar laser cutting of the present invention are as follows:

[0007] The method, apparatus, processor, and computer-readable storage medium for achieving common edge processing of bevel paths in planar laser cutting are characterized in that the method includes the following steps:

[0008] (1) Enable beveling and import beveled parts;

[0009] (2) Arrange the beveled parts with common edges;

[0010] (3) Calculate the repeated edges on the upper surface and record the mapping relationship;

[0011] (4) Group according to the repeated edges and their corresponding parts;

[0012] (5) Generate the path for each group of shared edges and add the corresponding bevel information;

[0013] (6) Add the primitives that belong to the part inside the group and other primitives that do not form a common edge to the generation path;

[0014] (7) Sort the internal holes, bevels and other graphic elements in the path;

[0015] (8) Convert the graph data into G-code processing files in sequence according to the common edge path, import the G-code processing files and process them.

[0016] Preferably, step (3) specifically includes the following steps:

[0017] (3.1) Determine whether the current shared edge segment being processed is the last one. If it is, continue to step (4); otherwise, continue to step (3.2).

[0018] (3.2) Determine whether the two sides contained in the current shared edge segment contain bevel information and the bevel angles match. If so, continue to step (3.1) and determine the next shared edge segment until the last shared edge segment is processed and proceed to step (4); otherwise, proceed to step (3.3).

[0019] (3.3) Remove the common edge data that does not meet the common edge condition of the bevel in the common edge segment.

[0020] Preferably, step (4) specifically includes the following steps:

[0021] (4.1) Obtain the primitives contained in the current shared edge segment;

[0022] (4.2) Based on the mapping relationship in (3), the parts to which the common edge segment belongs are obtained. If the part exists in the set of parts to which other common edge segments belong, the current common edge segment is placed in the same group as it. Otherwise, a new set is added.

[0023] Preferably, step (7) specifically includes the following steps:

[0024] (7.1) Starting from the lower left corner of the internal hole element, sort them in order according to the nearest priority principle;

[0025] (7.2) Using the last point of the inner hole element as the starting point, sort the bevel paths according to the nearest priority principle;

[0026] (7.3) Using the last point of the bevel element as the starting point, sort the paths of other elements according to the nearest priority principle.

[0027] Preferably, step (7.1) specifically includes the following steps:

[0028] (7.0.1) Traverse all remaining primitives. If a primitive exists, continue with step (7.0.2); otherwise, end the traversal.

[0029] (7.0.2) Select the element closest to the starting point as the current element;

[0030] (7.0.3) If the current element is closest to the starting point as the ending point, then reverse the current element; otherwise, do nothing and continue to step (7.0.4).

[0031] (7.0.4) Set the current primitive's tail point as the new starting point, remove the current primitive from the traversal queue, and proceed to step (7.0.1).

[0032] Preferably, step (7.0.3) specifically includes the following steps:

[0033] If the current graphic element is closest to the starting point and the ending point, then the current graphic element is reversed, and if it carries bevel information, then it is synchronized.

[0034] The device used in planar laser cutting to achieve common edge processing of bevel paths is characterized by the following:

[0035] A processor is configured to execute computer-executable instructions;

[0036] The memory stores one or more computer-executable instructions, which, when executed by the processor, implement the various steps of the method for achieving common edge processing of bevel paths in planar laser cutting.

[0037] The processor used in this planar laser cutting process to achieve bevel path common edge processing is characterized in that the processor is configured to execute computer-executable instructions, and when the computer-executable instructions are executed by the processor, the various steps of the above-mentioned method for achieving bevel path common edge processing in planar laser cutting are implemented.

[0038] The computer-readable storage medium is characterized in that it stores a computer program that can be executed by a processor to implement the various steps of the method for achieving common edge processing of bevel paths in the above-described planar laser cutting process.

[0039] The method, apparatus, processor, and computer-readable storage medium for achieving common edge processing of bevel paths in planar laser cutting using the present invention can be applied to planar laser cutting CAM software, which can effectively improve the utilization rate of sheet metal, reduce material and energy consumption, improve the cutting efficiency of beveled parts, reduce operator requirements, and reduce idle movement. Attached Figure Description

[0040] Figure 1 This is a flowchart of a method for achieving common edge processing of bevel paths in planar laser cutting of the present invention.

[0041] Figure 2This is a schematic diagram illustrating an application embodiment of the method for achieving common edge processing of bevel paths in planar laser cutting of the present invention. Detailed Implementation

[0042] To more clearly describe the technical content of the present invention, the following description is provided in conjunction with specific embodiments.

[0043] The method for achieving common edge processing of bevel paths in planar laser cutting of the present invention includes the following steps:

[0044] (1) Enable beveling and import beveled parts;

[0045] (2) Arrange the beveled parts with common edges;

[0046] (3) Calculate the repeated edges on the upper surface and record the mapping relationship;

[0047] (4) Group according to the repeated edges and their corresponding parts;

[0048] (5) Generate the path for each group of shared edges and add the corresponding bevel information;

[0049] (6) Add the primitives that belong to the part inside the group and other primitives that do not form a common edge to the generation path;

[0050] (7) Sort the internal holes, bevels and other graphic elements in the path;

[0051] (8) Convert the graph data into G-code processing files in sequence according to the common edge path, import the G-code processing files and process them.

[0052] In a preferred embodiment of the present invention, step (3) specifically includes the following steps:

[0053] (3.1) Determine whether the current shared edge segment being processed is the last one. If it is, continue to step (4); otherwise, continue to step (3.2).

[0054] (3.2) Determine whether the two sides contained in the current shared edge segment contain bevel information and the bevel angles match. If so, continue to step (3.1) and determine the next shared edge segment until the last shared edge segment is processed and proceed to step (4); otherwise, proceed to step (3.3).

[0055] (3.3) Remove the common edge data that does not meet the common edge condition of the bevel in the common edge segment.

[0056] In a preferred embodiment of the present invention, step (4) specifically includes the following steps:

[0057] (4.1) Obtain the primitives contained in the current shared edge segment;

[0058] (4.2) Based on the mapping relationship in (3), the parts to which the common edge segment belongs are obtained. If the part exists in the set of parts to which other common edge segments belong, the current common edge segment is placed in the same group as it. Otherwise, a new set is added.

[0059] In a preferred embodiment of the present invention, step (7) specifically includes the following steps:

[0060] (7.1) Starting from the lower left corner of the internal hole element, sort them in order according to the nearest priority principle;

[0061] (7.2) Using the last point of the inner hole element as the starting point, sort the bevel paths according to the nearest priority principle;

[0062] (7.3) Using the last point of the bevel element as the starting point, sort the paths of other elements according to the nearest priority principle.

[0063] In a preferred embodiment of the present invention, step (7.1) specifically includes the following steps:

[0064] (7.0.1) Traverse all remaining primitives. If a primitive exists, continue with step (7.0.2); otherwise, end the traversal.

[0065] (7.0.2) Select the element closest to the starting point as the current element;

[0066] (7.0.3) If the current element is closest to the starting point as the ending point, then reverse the current element; otherwise, do nothing and continue to step (7.0.4).

[0067] (7.0.4) Set the current primitive's tail point as the new starting point, remove the current primitive from the traversal queue, and proceed to step (7.0.1).

[0068] In a preferred embodiment of the present invention, step (7.0.3) specifically includes the following steps:

[0069] If the current graphic element is closest to the starting point and the ending point, then the current graphic element is reversed, and if it carries bevel information, then it is synchronized.

[0070] The apparatus for achieving common edge processing of bevel paths in planar laser cutting of the present invention includes:

[0071] A processor is configured to execute computer-executable instructions;

[0072] The memory stores one or more computer-executable instructions, which, when executed by the processor, implement the various steps of the method for achieving common edge processing of bevel paths in planar laser cutting.

[0073] The present invention provides a processor for implementing bevel path common edge processing in planar laser cutting, wherein the processor is configured to execute computer-executable instructions, and when the computer-executable instructions are executed by the processor, the various steps of the above-described method for implementing bevel path common edge processing in planar laser cutting are implemented.

[0074] The computer-readable storage medium of the present invention stores a computer program that can be executed by a processor to implement the various steps of the method for achieving common edge processing of bevel paths in the above-described planar laser cutting process.

[0075] The present invention adopts the following technical solution:

[0076] Step 1: Open the laser cutting CAM software, enable beveling, and import the beveled parts;

[0077] Step 2: Arrange the beveled parts with common edges;

[0078] Step 3: Calculate the repeating edges on the upper surface and record the mapping relationship;

[0079] Step 4: Group the parts according to the repeating edges and their corresponding parts;

[0080] Step 5: Generate the paths for each group sharing a common edge, and add the corresponding bevel information;

[0081] Step 6: Add the elements (internal holes) that belong to the interior of the part in this group and other elements that do not share an edge to the generation path;

[0082] Step 7: Sort the internal holes, bevels and other elements in the path;

[0083] Step 8: Convert the graph data into G-code processing files sequentially according to the shared edge path, import the G-code processing files and process them.

[0084] In step 3, it is necessary to filter the data on shared edges of the bevel. For each shared edge segment, the filtering steps are as follows:

[0085] Step 3.1: Determine if the currently processed shared edge segment is the last one. If not, proceed to step 3.2; if so, proceed to step 4.

[0086] Step 3.2: Determine whether the two edges contained in the current shared edge segment contain bevel information and whether the bevel angles match. If yes, return to step 3.1 to determine the next shared edge segment until the last one is processed and proceed to step 4. If not, proceed to step 3.3.

[0087] Step 3.3: Remove the data that shares the edge from the segment with the edge, as it does not meet the condition for a common edge at the bevel.

[0088] In step 4, the purpose of grouping is to allow parts that can be cut along a common edge to be placed as a whole anywhere the sheet metal allows, and the cutting of the common edge bevel in different groups does not affect each other. For each common edge segment, the grouping method includes the following steps:

[0089] Step 4.1: Obtain the primitives contained in the current shared edge segment;

[0090] Step 4.2: Based on the mapping relationship in Step 3, find which parts the common edge segment belongs to. If these parts exist in the set of parts to which other common edge segments belong, then place the current common edge segment in the same group as it; otherwise, add a new set.

[0091] In step 7, the sorting steps for the inner hole, bevel, and other graphic elements are as follows:

[0092] Step 7.1: Starting from the lower left corner of the internal hole element, sort them sequentially according to the nearest priority principle in Step 7.0.1;

[0093] Step 7.2: Using the last point of the inner hole element as the starting point, sort the bevel paths according to the nearest priority principle;

[0094] Step 7.3: Using the last point of the bevel element as the starting point, sort the paths of other elements according to the nearest priority principle.

[0095] The nearest priority principle here applies, and the steps are as follows:

[0096] Step 7.0.1: Traverse all remaining primitives. If no primitives are found, end the traversal. If primitives are found, proceed to step 7.0.2.

[0097] Step 7.0.2: Find the element closest to the starting point and designate it as the current element;

[0098] Step 7.0.2: If the current element is closest to the starting point as the ending point, then reverse the current element. Note that if bevel information is included, it needs to be processed synchronously. If the current element is closest to the starting point as the starting point, do not process it and proceed to the next step.

[0099] Step 7.0.3: Set the current primitive's end point as the new starting point, remove the current primitive from the traversal queue, and proceed to step 7.0.1.

[0100] In specific embodiments of the present invention, such as Figure 1 As shown, the process begins by laying out the beveled parts, collecting the primitives carrying bevel information that need to share bevel edges, and calculating the repeated edge information on the upper surface. Illegal shared edge segments, i.e., those that do not meet the conditions for shared bevel edges, are then filtered out based on the bevel information. The criteria for determining a shared edge segment are that the two edges forming the segment are bevels, and the angles of the bevel paths must match; only then can it be considered a shared edge bevel.

[0101] When collecting primitives, for V-shaped bevels, it's sufficient to ensure that the angles of the bevel paths sharing the same edge are consistent. For X-shaped, Y-shaped, and K-shaped bevels, which have 2 to 3 bevel edge paths, it's not enough to simply perform edge sharing operations on the upper surface primitives. It's necessary to determine the lines where the cross-sections of these paths intersect the upper surface of the part. Thus, an X-shaped bevel is equivalent to two V-shaped bevels, a Y-shaped bevel is equivalent to one V-shaped bevel and one straight-cut bevel, and a K-shaped bevel is equivalent to two V-shaped bevels and one straight-cut bevel. This allows the same processing method used for V-shaped bevels to handle other types of bevels. For example, for a straight bevel path, a V-shaped bevel collects one primitive with an angle, while an X-shaped bevel collects two straight lines with angles. A Y-shaped bevel also has two primitives, but one is a straight line with an angle, and the other is a straight line without an angle or with 0 degrees. Similarly, a K-shaped bevel collects two straight lines with angles and one straight line without an angle.

[0102] Based on the above information, to determine the angle for screening shared edge segments, it is only necessary to determine that the angles of the two sides forming the shared edge segment are consistent, which can identify it as a shared edge bevel and reduce the number of cutting paths. For a matching V-shaped bevel, one path can be reduced; for an X-shaped bevel, ideally two paths can be reduced, or one path can be reduced; for a Y-shaped bevel, only the oblique cutting edge can reduce one path; for a K-shaped bevel, it is similar to the X-shaped bevel because straight cutting paths cannot share an edge at the bevel edge.

[0103] After generating common edge segments, the order of these paths needs to be planned. Generally, to prevent premature cutting, the internal holes of the parts are sorted first, then the bevel edges are sorted, and the bevel edges are cut uniformly. Most of these bevel edges are common edge segments, and a small portion are the borders of common edge groups. Finally, the other edges are cut, which are mostly straight cut edges. For example... Figure 2 As shown, since there is no inner hole, the vertical bevel edges are cut sequentially from left to right. After cutting the rightmost bevel edge, the top and bottom straight edges are cut off.

[0104] The key difference between this solution and the compared technical solutions lies in the fact that this solution describes a method for cutting multiple paths with the same bevel characteristics using a shared edge, applicable to CAD drafting software. When cutting parts with similar bevel characteristics, where different parts with the same bevel characteristic would normally require two cuts, this solution can achieve a single cut. Using this solution can reduce the number of cutting paths, improve material utilization, reduce material and energy consumption, and lower costs.

[0105] For the specific implementation scheme of this embodiment, please refer to the relevant descriptions in the above embodiments, which will not be repeated here.

[0106] It is understood that the same or similar parts in the above embodiments can be referred to each other, and the contents not described in detail in some embodiments can be referred to the same or similar contents in other embodiments.

[0107] It should be noted that in the description of this invention, the terms "first," "second," etc., are used for descriptive purposes only and should not be construed as indicating or implying relative importance. Furthermore, in the description of this invention, unless otherwise stated, "a plurality of" means at least two.

[0108] Any process or method description in the flowchart or otherwise herein can be understood as representing a module, segment, or portion of code comprising one or more executable instructions for implementing a particular logical function or process, and the scope of the preferred embodiments of the invention includes additional implementations in which functions may be performed not in the order shown or discussed, including substantially simultaneously or in reverse order depending on the functions involved, as will be understood by those skilled in the art to which embodiments of the invention pertain.

[0109] It should be understood that various parts of the present invention can be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, multiple steps or methods can be implemented in software or firmware stored in memory and executed by a suitable instruction execution device. For example, if implemented in hardware, as in another embodiment, it can be implemented using any one or a combination of the following techniques known in the art: discrete logic circuits having logic gates for implementing logical functions on data signals, application-specific integrated circuits (ASICs) having suitable combinational logic gates, programmable gate arrays (PGAs), field-programmable gate arrays (FPGAs), etc.

[0110] Those skilled in the art will understand that all or part of the steps of the methods in the above embodiments can be implemented by a program instructing related hardware. The corresponding program can be stored in a computer-readable storage medium. When the program is executed, it includes one or a combination of the steps of the method embodiments.

[0111] Furthermore, the functional units in the various embodiments of the present invention can be integrated into a processing module, or each unit can exist physically separately, or two or more units can be integrated into a module. The integrated module can be implemented in hardware or as a software functional module. If the integrated module is implemented as a software functional module and sold or used as an independent product, it can also be stored in a computer-readable storage medium.

[0112] The storage media mentioned above can be read-only memory, disk, or optical disk, etc.

[0113] In the description of this specification, references to terms such as "one embodiment," "some embodiments," "example," "specific example," or "some examples," etc., indicate that a specific feature, structure, material, or characteristic described in connection with that embodiment or example is included in at least one embodiment or example of the invention. In this specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments or examples.

[0114] The method, apparatus, processor, and computer-readable storage medium for achieving common edge processing of bevel paths in planar laser cutting using the present invention can be applied to planar laser cutting CAM software, which can effectively improve the utilization rate of sheet metal, reduce material and energy consumption, improve the cutting efficiency of beveled parts, reduce operator requirements, and reduce idle movement.

[0115] In this specification, the invention has been described with reference to specific embodiments thereof. However, it will be apparent that various modifications and variations can be made without departing from the spirit and scope of the invention. Therefore, the specification and drawings should be considered illustrative rather than restrictive.

Claims

1. A method for achieving common edge processing of bevel paths in planar laser cutting, characterized in that, The method includes the following steps: (1) Open the laser cutting CAM software, enable bevel cutting, and import the beveled parts; (2) Arrange the beveled parts with common edges; (3) Collect the graphic elements that need to be bevel and carry bevel information, calculate the repeated edges on the upper surface, and record the mapping relationship between the graphic elements and their respective parts; (4) Determine the part to which the repeated edge of the upper surface belongs according to the mapping relationship, and group them according to the repeated edge of the upper surface and the part to which it belongs; (5) Generate the path for each group of shared edges and add the corresponding bevel information; (6) Add the internal hole elements that belong to the parts within the current common edge group and other elements that do not form a common edge to the generation path of the current common edge group; (7) Sort the internal hole elements, bevel elements and other elements in the generated path; (8) Convert the graph data into G-code processing files sequentially according to the common edge path, import the G-code processing files and process them; Step (3) requires filtering the bevel-shared edge data; for each shared edge segment, the filtering steps are as follows: (3.1) Determine whether the current shared edge segment being processed is the last one. If it is, continue to step (4); otherwise, continue to step (3.2). (3.2) Determine whether the two sides contained in the current shared edge segment contain bevel information and the bevel angles match. If so, return to step (3.1) and perform the judgment of the next shared edge segment until the last shared edge segment is processed and enter step (4); otherwise, enter step (3.3). (3.3) Remove the common edge data of the current common edge segment that does not meet the common edge condition of the bevel in the common edge segment; In step (4), for each shared edge segment, the grouping method includes the following steps: (4.1) Obtain the primitives contained in the current shared edge segment; (4.2) Based on the mapping relationship in step (3), find the part to which the common edge segment belongs. If the part exists in the set of other parts to which the common edge segment belongs, then place the current common edge segment in the same group as it; otherwise, add a new set. In step (7), the process of sorting the internal hole elements, bevel elements, and other elements in the generated path is as follows: (7.1) Starting from the lower left corner of the internal hole element, sort them in order according to the nearest priority principle; (7.2) Using the last point of the sorted inner hole elements as the starting point, sort the bevel paths according to the nearest priority principle; (7.3) Using the last end point of the sorted bevel element as the starting point, sort the paths of other elements according to the nearest priority principle; Step (7.1) specifically includes the following steps: (7.0.1) Traverse all remaining primitives. If a primitive exists, continue to step (7.0.2); otherwise, end the traversal. (7.0.2) Select the element closest to the starting point as the current element; (7.0.3) If the current graphic element is closest to the starting point as the ending point, then reverse the current graphic element, and if it carries bevel information, then perform synchronization processing; otherwise, do not process, and continue to step (7.0.4). (7.0.4) Set the current primitive's tail point as the new starting point, remove the current primitive from the traversal queue, and proceed to step (7.0.1).

2. A device for achieving common edge processing of bevel paths in planar laser cutting, characterized in that, The device includes: A processor is configured to execute computer-executable instructions; The memory stores one or more computer-executable instructions, which, when executed by the processor, implement the method for common edge processing of bevel paths in planar laser cutting as described in claim 1.

3. A processor for achieving common edge processing of bevel paths in planar laser cutting, characterized in that, The processor is configured to execute computer-executable instructions, which, when executed by the processor, implement the method for common edge processing of bevel paths in planar laser cutting as described in claim 1.

4. A computer-readable storage medium, characterized in that, It stores a computer program that can be executed by a processor to implement the method for achieving common edge processing of bevel path in planar laser cutting as described in claim 1.

Images