Curve grid edge sharing method based on nesting software edge sharing strategy
Through the curve grid co-edge strategy of nesting software, the co-edge situation between parts is handled, and the part layout and cutting path are optimized, which solves the problems of low material utilization and difficult processing in traditional methods, and achieves efficient material utilization and Accurate processing effect.
Patent Information
- Application Number
- CN202411032971.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-30
- Publication Date
- 2024-11-22
AI Technical Summary
Traditional nesting software fails to make full use of the spatial relationship when processing parts collections with common edge characteristics, resulting in low material utilization, high processing difficulty, and redundant cutting paths, increasing production cycle and cost.
Using curve grid co-edge strategy based on nesting software, the graphical information of parts is obtained by receiving the original drawings imported by the user and the set co-edge strategy, the distance between parts is judged, the boundaries are decomposed, the common edges and remaining edges are processed, and the merging is merged. And add process parameters and layer information to generate new parts and complete grid common edge operation.
It realizes automatic identification and optimization of the layout of common edge parts, reduces material waste, reduces processing time and tool wear, improves part accuracy and surface quality, and improves material utilization and production efficiency.
Smart Images

Figure CN119007887A_ABST
Abstract
Description
Technical Field
[0001] The invention relates to the technical field of laser cutting, and in particular to a curve grid co-edging method based on a nesting software co-edging strategy. Background Art
[0002] As the complexity of manufacturing increases, traditional nesting software faces increasing challenges in handling complex part arrangements. Specifically, when faced with a collection of parts with common edges, that is, two or more parts share the same boundary, traditional nesting software often fails to fully utilize this spatial relationship for optimized arrangement. Common edges are particularly common in sheet metal processing, but due to the limitations of software algorithms, these common edges are often ignored, resulting in a layout that does not achieve optimal material utilization, which in turn increases material costs and processing difficulties.
[0003] In addition, as an important part of the manufacturing process, the efficiency of cutting operations directly affects the overall production cycle and cost. After the nesting software completes the part layout, if the adjacent parts fail to effectively share the cutting path, the cutting system needs to stop and start frequently between the parts, which not only prolongs the cutting time, but also increases tool wear and energy consumption. At the same time, when processing common edge parts, traditional meshing methods often generate redundant cutting paths due to improper boundary processing, which further aggravates the waste of processing time and may have an adverse effect on the quality of the parts.
[0004] In view of the above problems, it is particularly important to develop a nesting software method that can intelligently identify and efficiently handle the common edge situation between parts. Summary of the invention
[0005] When processing co-edged parts, traditional meshing methods often generate redundant cutting paths due to improper boundary processing. The present invention provides a curve mesh co-edging method based on the co-edging strategy of nesting software.
[0006] The technical solution of the present invention provides a method for sharing edges of curved meshes based on a nesting software sharing edge strategy, comprising the following steps: Receive the original drawings imported by the user and the set common edge strategy; Based on the common edge strategy, a set of parts that need to be meshed are obtained; Get the graphic information of the parts, determine the distance between two parts, and if the distance between two parts is 0, decompose the graphics corresponding to all parts in the set into edges; Process the set of edges decomposed from every two parts; Based on the processing results, a common edge set and a remaining edge set are obtained; The common edge set and the remaining edge set are merged and the direction is modified to generate graphics, and process parameters and layer information are added to generate new parts to complete the mesh common edge operation.
[0007] As a further limitation of the technical solution of the present invention, the step of obtaining a set of parts that need to be meshed based on the co-edge strategy includes: Get the set of parts that need to be meshed; Based on the set common edge strategy, it is determined that common edges between different layers are not supported. The parts in the part set are grouped by layer. For each group of parts, the following steps are performed: the graphic information of the parts is obtained, and the distance between the two parts is determined. If the distance between the two parts is 0, the graphics corresponding to all the parts in the set are decomposed into edges; Based on the set common edge strategy, it is determined whether common edges between different layers are supported. The steps are executed based on the part collection: obtaining the graphic information of the parts, judging the distance between the two parts, and if the distance between the two parts is 0, decomposing the graphics corresponding to all the parts in the collection into edges.
[0008] As a further limitation of the technical solution of the present invention, the step of processing the set of edges decomposed from every two parts includes: If the edge types of the two parts are both line segments; Determine whether two edges are parallel; If the two edges are not parallel, they are not processed; If two edges are parallel, have the same direction, and overlap each other, set the flags of both edges to 1 and insert the first edge into the common edge set. If two edges are parallel and in the same direction, and their starting points coincide but their end points do not, if the length of the first edge is less than that of the second edge, set the flag of the first edge to 1, and set the starting point of the second edge to the end point of the first edge; at the same time, insert the edge set to 1 into the common edge set; If the length of the first edge is greater than that of the second edge, set the flag of the second edge to 1, and set the starting point of the first edge to the end point of the second edge; at the same time, insert the edge set to 1 into the common edge set; As a further limitation of the technical solution of the present invention, the step of processing the set of edges decomposed from every two parts further includes: If two edges are parallel and in the same direction, and their endpoints coincide but their starting points do not, if the endpoint of the first edge is on the second edge, the length of the first edge is less than that of the second edge, and the flag of the first edge is set to 1, and the starting point of the second edge is set to the endpoint of the first edge; determine whether the first edge exists in the common edge set, and if not, insert the first edge into the common edge set; If the end point of the second edge is on the first edge, the length of the first edge is greater than that of the second edge. Set the flag of the second edge to 1, and set the starting point of the first edge to the end point of the first edge. Determine whether the second edge exists in the common edge set. If not, insert the second edge into the common edge set.
[0009] As a further limitation of the technical solution of the present invention, the step of processing the set of edges decomposed from every two parts further includes: If two edges are parallel, in the same direction, and the beginning and end of the two edges do not overlap, if the starting point and end point of the first edge are both on the second edge, then the first edge is surrounded by the second edge, and the flag of the first edge is set to 1; determine whether the first edge exists in the common edge set, if not, insert the first edge into the common edge set; replace the second edge with two new edges, where one edge is set as a line with the starting point of the second edge and the end point of the first edge; the other edge is set as a line with the starting point of the first edge and the end point of the second edge; If the starting point and end point of the second edge are both on the first edge, the second edge is surrounded by the first edge, and the flag of the second edge is set to 1; determine whether the second edge exists in the common edge set, if not, insert the second edge into the common edge set; replace the first edge with two new edges, one of which is set as a line with the starting point of the first edge and the end point of the second edge; the other edge is a line with the starting point of the second edge and the end point of the first edge.
[0010] As a further limitation of the technical solution of the present invention, the step of processing the set of edges decomposed from every two parts further includes: If two edges are parallel and have the same direction, the beginning and the end of the two edges do not overlap and the two edges partially overlap, if the first edge is before the second edge, set the common edge as a line with the starting point being the starting point of the second edge and the end point being the end point of the first edge; determine whether the set common edge exists in the common edge set, if not, insert the edge into the common edge set; set the end point of the first edge to the starting point of the original second edge, and set the starting point of the second edge to the end point of the original first edge; If the first edge is after the second edge, set the common edge as a line with the starting point being the starting point of the first edge and the end point being the end point of the second edge; determine whether the set common edge exists in the common edge set, if not, insert the edge into the common edge set; set the starting point of the first edge to the end point of the original second edge, and set the end point of the second edge to the starting point of the original first edge.
[0011] As a further limitation of the technical solution of the present invention, the step of processing the set of edges decomposed from every two parts further includes: Two edges are parallel and in opposite directions. If the starting point of the first edge coincides with the end point of the second edge, and the end point of the first edge coincides with the starting point of the second edge, set the flags of both edges to 1 and insert the first edge into the common edge set. When two edges are parallel and in opposite directions, and the end point of the first edge coincides with the starting point of the second edge, if the length of the first edge is less than that of the second edge, set the flag of the first edge to 1, set the starting point of the second edge to the starting point of the first edge, and determine whether the first edge exists in the common edge set. If not, insert the first edge into the common edge set. If the length of the first edge is greater than that of the second edge, set the flag of the second edge to 1, and set the end point of the first edge to the end point of the second edge; at the same time, determine whether the second edge exists in the common edge set. If not, insert the second edge into the common edge set; When two edges are parallel and in opposite directions, and the starting point of the first edge coincides with the end point of the second edge, if the length of the first edge is less than that of the second edge, set the flag of the first edge to 1, set the end point of the second edge to the end point of the first edge, and determine whether the first edge exists in the common edge set. If not, insert the first edge into the common edge set. If the length of the first edge is greater than that of the second edge, set the flag of the second edge to 1, set the starting point of the first edge to the starting point of the second edge, and determine whether the second edge exists in the common edge set. If not, insert the first edge into the common edge set.
[0012] As a further limitation of the technical solution of the present invention, the step of processing the set of edges decomposed from every two parts further includes: When two edges are parallel and in opposite directions, and the starting and ending points of the two edges do not overlap, if the first edge is surrounded by the second edge, set the flag of the first edge to 1, and determine whether the first edge exists in the common edge set. If not, insert the first edge into the common edge set; replace the second edge with two new edges, one of which is a line with the starting point of the second edge and the end point of the first edge, and the other is a line with the starting point of the first edge and the end point of the second edge; If the second edge is surrounded by the first edge, set the flag of the second edge to 1, determine whether the second edge exists in the common edge set, if not, insert the second edge into the common edge set; replace the first edge with two new edges, one of which is a line with the starting point of the first edge and the end point of the second edge; the other edge is a line with the starting point of the second edge and the end point of the first edge.
[0013] As a further limitation of the technical solution of the present invention, the step of processing the set of edges decomposed from every two parts further includes: When two edges are parallel and in opposite directions, and the first and last points of the two edges do not overlap, and the two edges partially overlap, if the end points of the two edges are on each other's edges, set the common edge as a line with the start point being the end point of the first edge and the end point being the end point of the second edge, and determine whether the set common edge exists in the common edge set. If not, insert the common edge into the common edge set; set the end point of the first edge to the end point of the original second edge, and set the end point of the second edge to the end point of the original first edge; If the starting points of the two edges are on each other's edges, set the common edge as a line with the starting point of the first edge and the end point of the second edge. Determine whether the set common edge exists in the common edge set. If not, insert the common edge into the common edge set. At the same time, set the starting point of the first edge to the starting point of the original second edge, and the starting point of the second edge to the starting point of the original first edge.
[0014] As a further limitation of the technical solution of the present invention, the step of obtaining the common edge set and the remaining edge set based on the processing result includes: Obtain a common edge set based on the processing results; Delete the edges with flag set to 1 in the edge set to obtain the remaining edge set.
[0015] As a further limitation of the technical solution of the present invention, the steps of merging the common edge set and the remaining edge set, modifying the direction to generate a graphic, adding process parameters and layer information to generate a new part, and completing the mesh common edge operation include: Call the merge connected line algorithm combined with the direction priority strategy to merge the common edges of the common edge set; Call the merge connected line algorithm to merge the outer frames with the outer frame priority strategy; The merged common edge set is combined with the remaining edge set to generate a graphic, and process parameters and layer information are added to generate a new part to complete the mesh common edge operation.
[0016] It can be seen from the above technical solutions that the present invention has the following advantages: the common edge strategy based on the nesting software can automatically identify and optimize the layout of parts with common edge characteristics, reduce material waste caused by the traditional method of ignoring common edges, and significantly improve material utilization. By accurately identifying and processing common edges, unnecessary cutting paths can be reduced, processing time and tool wear can be reduced, thereby effectively reducing processing costs. Common edge processing reduces errors and defects that may be caused by multiple cutting of the same area, improves the accuracy and surface quality of parts, and is conducive to improving overall product quality. Automated and intelligent common edge processing reduces manual intervention, improves the efficiency of nesting and cutting, helps shorten production cycles, and meets the ability to quickly respond to market demands.
[0017] This method can not only improve material utilization and reduce unnecessary material waste, but also shorten processing time and reduce production costs by optimizing cutting paths. At the same time, accurate boundary processing will reduce redundant cutting, improve the processing accuracy and surface quality of parts, and thus improve product quality in an all-round way. Therefore, in response to the actual needs of the manufacturing industry, the development of nesting software with common edge processing capabilities is of great significance for promoting the intelligent and efficient transformation of the manufacturing industry.
[0018] In addition, the invention has a reliable design principle, a simple structure and a very broad application prospect. BRIEF DESCRIPTION OF THE DRAWINGS
[0019] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.
[0020] Figure 1 is a schematic flow chart of a method according to an embodiment of the present invention. DETAILED DESCRIPTION
[0021] In order to enable those skilled in the art to better understand the technical solutions in the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present invention.
[0022] like Figure 1 As shown, an embodiment of the present invention provides a method for sharing edges of curved meshes based on a nesting software sharing edge strategy, comprising the following steps: Step 1: Receive the original drawing imported by the user and the set common edge strategy; Step 2: Obtain a set of parts that need to be meshed based on the common edge strategy; Step 3: Get the graphic information of the parts, determine the distance between two parts, and if the distance between two parts is 0, decompose the graphics corresponding to all parts in the set into edges; Step 4: Process the set of edges decomposed from every two parts; Step 5: Obtain the common edge set and the remaining edge set based on the processing results; Step 6: Merge the common edge set and the remaining edge set, modify the direction to generate graphics, add process parameters and layer information to generate new parts, and complete the mesh common edge operation.
[0023] In some embodiments, the step of obtaining a set of parts that need to be meshed based on the edge sharing strategy includes: Step 21: Get the set of parts that need to be meshed; Step 22: Based on the set co-edge strategy, it is determined that co-edges between different layers are not supported, and the parts in the part set are grouped by layer. For each group of parts, the following steps are performed: obtaining the graphic information of the parts, determining the distance between the two parts, and if the distance between the two parts is 0, decomposing the graphics corresponding to all the parts in the set into edges; Step 23: Based on the set common edge strategy, determine whether common edges between different layers are supported, and execute steps based on the part collection: obtain the graphic information of the parts, determine the distance between the two parts, and if the distance between the two parts is 0, decompose the graphics corresponding to all parts of the collection into edges.
[0024] It should be noted that, in the embodiment of the present invention, the original drawing is imported into the nesting software. When performing operations such as nesting that require grid co-edging, click on co-edging to set the co-edging strategy, such as whether to support co-edging between different layers and whether to support point co-edging, etc., and select the set of parts that need to perform grid co-edging. If it is selected that co-edging between different layers is not supported, the parts are grouped by layer, and the following processing is performed on each group of parts. If it is selected that co-edging between different layers is supported, the parts are not grouped by layer.
[0025] Get the graphics information of the parts, determine the distance between the two parts, if the distance between the two parts is 0, decompose the graphics corresponding to all the parts in the set into edges, process the edge sets decomposed from each two parts, if the edge categories of the two parts are both line segments, process them according to the situation; after processing, find the common edge set and the remaining edge set, then merge the common edge set and the remaining edge set, modify the direction, etc. Get the common edge graphics and the remaining graphics, then add process, layer and other information to the processed graphics to form a new part.
[0026] For some cases, it is excluded in advance. If the distance between the corresponding graphics of the parts is directly calculated, it may take a long time. You can use the AABB bounding box method or the BVH bounding box method to exclude some cases in advance. If the AABB bounding box or BVH bounding box of two parts, or the distance between the parts is greater than 0, they can be directly excluded. Among them, the performance of the AABB bounding box method is higher than that of the BVH bounding box method, and the performance of the BVH bounding box method is higher than that of directly judging the distance between the parts, but the exclusion range of directly judging the distance between the parts is the widest, followed by the BVH bounding box method, and then the AABB bounding box method.
[0027] First, use the AABB bounding box method to exclude some cases. If the AABB bounding boxes have overlapping parts, exclude them; then use the BVH bounding box method to exclude some cases. If the BVH bounding boxes have overlapping parts, exclude them; then use the direct part distance judgment method to exclude some cases and reduce the number of parts that need to be processed.
[0028] In some embodiments, the step of processing the set of edges decomposed from every two parts includes: If the edge types of the two parts are both line segments; Determine whether two edges are parallel; if the two edges are parallel and the distance is 0, then the two edges are divided into two cases: the directions are the same and the directions are opposite. Other cases are not processed; If the two edges are not parallel, they are not processed; If two edges are parallel, have the same direction, and overlap each other, set the flags of both edges to 1 and insert the first edge into the common edge set. If two edges are parallel and in the same direction, and their starting points coincide but their end points do not, if the length of the first edge is less than that of the second edge, set the flag of the first edge to 1, and set the starting point of the second edge to the end point of the first edge; at the same time, insert the edge set to 1 into the common edge set; If the length of the first edge is greater than that of the second edge, set the flag of the second edge to 1, and set the starting point of the first edge to the end point of the second edge; at the same time, insert the edge set to 1 into the common edge set; In some embodiments, the step of processing the set of edges decomposed from every two parts further includes: If two edges are parallel and in the same direction, and their endpoints coincide but their starting points do not, if the endpoint of the first edge is on the second edge, the length of the first edge is less than that of the second edge, and the flag of the first edge is set to 1, and the starting point of the second edge is set to the endpoint of the first edge; determine whether the first edge exists in the common edge set, and if not, insert the first edge into the common edge set; If the end point of the second edge is on the first edge, the length of the first edge is greater than that of the second edge. Set the flag of the second edge to 1, and set the starting point of the first edge to the end point of the first edge. Determine whether the second edge exists in the common edge set. If not, insert the second edge into the common edge set.
[0029] In some embodiments, the step of processing the set of edges decomposed from every two parts further includes: If two edges are parallel, in the same direction, and the beginning and end of the two edges do not overlap, if the starting point and end point of the first edge are both on the second edge, then the first edge is surrounded by the second edge, and the flag of the first edge is set to 1; determine whether the first edge exists in the common edge set, if not, insert the first edge into the common edge set; replace the second edge with two new edges, where one edge is set as a line with the starting point of the second edge and the end point of the first edge; the other edge is set as a line with the starting point of the first edge and the end point of the second edge; If the starting point and end point of the second edge are both on the first edge, the second edge is surrounded by the first edge, and the flag of the second edge is set to 1; determine whether the second edge exists in the common edge set, if not, insert the second edge into the common edge set; replace the first edge with two new edges, one of which is set as a line with the starting point of the first edge and the end point of the second edge; the other edge is a line with the starting point of the second edge and the end point of the first edge.
[0030] In some embodiments, the step of processing the set of edges decomposed from every two parts further includes: If two edges are parallel and have the same direction, the beginning and the end of the two edges do not overlap and the two edges partially overlap, if the first edge is before the second edge, set the common edge as a line with the starting point being the starting point of the second edge and the end point being the end point of the first edge; determine whether the set common edge exists in the common edge set, if not, insert the edge into the common edge set; set the end point of the first edge to the starting point of the original second edge, and set the starting point of the second edge to the end point of the original first edge; If the first edge is after the second edge, set the common edge as a line with the starting point being the starting point of the first edge and the end point being the end point of the second edge; determine whether the set common edge exists in the common edge set, if not, insert the edge into the common edge set; set the starting point of the first edge to the end point of the original second edge, and set the end point of the second edge to the starting point of the original first edge.
[0031] In some embodiments, the step of processing the set of edges decomposed from every two parts further includes: Two edges are parallel and in opposite directions. If the starting point of the first edge coincides with the end point of the second edge, and the end point of the first edge coincides with the starting point of the second edge, set the flags of both edges to 1 and insert the first edge into the common edge set. When two edges are parallel and in opposite directions, and the end point of the first edge coincides with the starting point of the second edge, if the length of the first edge is less than that of the second edge, set the flag of the first edge to 1, set the starting point of the second edge to the starting point of the first edge, and determine whether the first edge exists in the common edge set. If not, insert the first edge into the common edge set. If the length of the first edge is greater than that of the second edge, set the flag of the second edge to 1, and set the end point of the first edge to the end point of the second edge; at the same time, determine whether the second edge exists in the common edge set. If not, insert the second edge into the common edge set; When two edges are parallel and in opposite directions, and the starting point of the first edge coincides with the end point of the second edge, if the length of the first edge is less than that of the second edge, set the flag of the first edge to 1, set the end point of the second edge to the end point of the first edge, and determine whether the first edge exists in the common edge set. If not, insert the first edge into the common edge set. If the length of the first edge is greater than that of the second edge, set the flag of the second edge to 1, set the starting point of the first edge to the starting point of the second edge, and determine whether the second edge exists in the common edge set. If not, insert the first edge into the common edge set.
[0032] In some embodiments, the step of processing the set of edges decomposed from every two parts further includes: When two edges are parallel and in opposite directions, and the starting and ending points of the two edges do not overlap, if the first edge is surrounded by the second edge, set the flag of the first edge to 1, and determine whether the first edge exists in the common edge set. If not, insert the first edge into the common edge set; replace the second edge with two new edges, one of which is a line with the starting point of the second edge and the end point of the first edge, and the other is a line with the starting point of the first edge and the end point of the second edge; If the second edge is surrounded by the first edge, set the flag of the second edge to 1, determine whether the second edge exists in the common edge set, if not, insert the second edge into the common edge set; replace the first edge with two new edges, one of which is a line with the starting point of the first edge and the end point of the second edge; the other edge is a line with the starting point of the second edge and the end point of the first edge.
[0033] In some embodiments, the step of processing the set of edges decomposed from every two parts further includes: When two edges are parallel and in opposite directions, and the first and last points of the two edges do not overlap, and the two edges partially overlap, if the end points of the two edges are on each other's edges, set the common edge as a line with the start point being the end point of the first edge and the end point being the end point of the second edge, and determine whether the set common edge exists in the common edge set. If not, insert the common edge into the common edge set; set the end point of the first edge to the end point of the original second edge, and set the end point of the second edge to the end point of the original first edge; If the starting points of the two edges are on each other's edges, set the common edge as a line with the starting point of the first edge and the end point of the second edge. Determine whether the set common edge exists in the common edge set. If not, insert the common edge into the common edge set. At the same time, set the starting point of the first edge to the starting point of the original second edge, and the starting point of the second edge to the starting point of the original first edge.
[0034] In some embodiments, the step of obtaining the common edge set and the remaining edge set based on the processing result includes: Obtain a common edge set based on the processing results; Delete the edges with flag set to 1 in the edge set to obtain the remaining edge set.
[0035] It should be noted that after processing, a common edge set and a remaining edge set are obtained. For the common edge set, the merge connected line algorithm is called, the direction priority strategy is selected, and the common edges are merged; for the remaining edge set, the merge connected line algorithm is called, the outer frame priority strategy is selected, the outer frame is merged, and then the common edge set and the remaining edge set are combined to generate graphics, add process parameters, layers and other information, generate new parts, complete the mesh common edge operation, combine the parts after the mesh common edge operation into groups, complete subsequent automatic nesting, manual nesting and other tasks, and then export the part dxf or dwg drawing for processing and cutting, thereby improving the cutting efficiency, reducing the wear of cutting tools, and reducing production costs.
[0036] In some embodiments, the common edge set and the remaining edge set are merged, the directions are modified to generate a graphic, and process parameters and layer information are added to generate a new part. The steps of completing the mesh common edge operation include: Call the merge connected line algorithm combined with the direction priority strategy to merge the common edges of the common edge set; Call the merge connected line algorithm to merge the outer frames with the outer frame priority strategy; The merged common edge set is combined with the remaining edge set to generate a graphic, and process parameters and layer information are added to generate a new part to complete the mesh common edge operation.
[0037] It should be understood that the order of execution of the steps in the above embodiment does not necessarily mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiment of the present invention.
[0038] Although the present invention has been described in detail with reference to the accompanying drawings and in combination with the preferred embodiments, the present invention is not limited thereto. Without departing from the spirit and essence of the present invention, a person of ordinary skill in the art may make various equivalent modifications or substitutions to the embodiments of the present invention, and these modifications or substitutions shall be within the scope of the present invention. Any person of ordinary skill in the art may easily think of changes or substitutions within the technical scope disclosed by the present invention, and these shall be within the scope of protection of the present invention.
Claims
1. A method for sharing edges of curved meshes based on the sharing edge strategy of nesting software, characterized in that: The steps include: Receive the original drawings imported by the user and the set common edge strategy; Based on the common edge strategy, a set of parts that need to be meshed are obtained; Get the graphic information of the parts, determine the distance between two parts, and if the distance between two parts is 0, decompose the graphics corresponding to all parts in the set into edges; Process the set of edges decomposed from every two parts; Based on the processing results, a common edge set and a remaining edge set are obtained; The common edge set and the remaining edge set are merged and the direction is modified to generate graphics, and process parameters and layer information are added to generate new parts to complete the mesh common edge operation.
2. The method for sharing edges of curved meshes based on the sharing edge strategy of nesting software according to claim 1, characterized in that: The steps for processing the set of edges decomposed from each two parts include: If the edge types of the two parts are both line segments; Determine whether two edges are parallel; If the two edges are not parallel, they are not processed; If two edges are parallel, have the same direction, and overlap each other, set the flags of both edges to 1 and insert the first edge into the common edge set. If two edges are parallel and in the same direction, and their starting points coincide but their end points do not, if the length of the first edge is less than that of the second edge, set the flag of the first edge to 1, and set the starting point of the second edge to the end point of the first edge; at the same time, insert the edge set to 1 into the common edge set; If the length of the first edge is greater than that of the second edge, set the flag of the second edge to 1, and set the starting point of the first edge to the end point of the second edge; at the same time, insert the edge set to 1 into the common edge set.
3. The method for sharing edges of curved meshes based on the sharing edge strategy of nesting software according to claim 2, characterized in that: The step of processing the set of edges decomposed from each two parts also includes: If two edges are parallel and in the same direction, and their endpoints coincide but their starting points do not, if the endpoint of the first edge is on the second edge, the length of the first edge is less than that of the second edge, and the flag of the first edge is set to 1, and the starting point of the second edge is set to the endpoint of the first edge; determine whether the first edge exists in the common edge set, and if not, insert the first edge into the common edge set; If the end point of the second edge is on the first edge, the length of the first edge is greater than that of the second edge. Set the flag of the second edge to 1, and set the starting point of the first edge to the end point of the first edge. Determine whether the second edge exists in the common edge set. If not, insert the second edge into the common edge set.
4. The method for sharing edges of curved meshes based on the sharing edge strategy of nesting software according to claim 3, characterized in that: The step of processing the set of edges decomposed from each two parts also includes: If two edges are parallel, in the same direction, and the beginning and end of the two edges do not overlap, if the starting point and end point of the first edge are both on the second edge, then the first edge is surrounded by the second edge, and the flag of the first edge is set to 1; determine whether the first edge exists in the common edge set, if not, insert the first edge into the common edge set; replace the second edge with two new edges, where one edge is set as a line with the starting point of the second edge and the end point of the first edge; the other edge is set as a line with the starting point of the first edge and the end point of the second edge; If the starting point and end point of the second edge are both on the first edge, the second edge is surrounded by the first edge, and the flag of the second edge is set to 1; determine whether the second edge exists in the common edge set, if not, insert the second edge into the common edge set; replace the first edge with two new edges, one of which is set as a line with the starting point of the first edge and the end point of the second edge; the other edge is a line with the starting point of the second edge and the end point of the first edge.
5. The method for sharing edges of curved meshes based on the sharing edge strategy of nesting software according to claim 4, characterized in that: The step of processing the set of edges decomposed from each two parts also includes: If two edges are parallel and have the same direction, the beginning and the end of the two edges do not overlap and the two edges partially overlap, if the first edge is before the second edge, set the common edge as a line with the starting point being the starting point of the second edge and the end point being the end point of the first edge; determine whether the set common edge exists in the common edge set, if not, insert the edge into the common edge set; set the end point of the first edge to the starting point of the original second edge, and set the starting point of the second edge to the end point of the original first edge; If the first edge is after the second edge, set the common edge as a line with the starting point being the starting point of the first edge and the end point being the end point of the second edge; determine whether the set common edge exists in the common edge set, if not, insert the edge into the common edge set; set the starting point of the first edge to the end point of the original second edge, and set the end point of the second edge to the starting point of the original first edge.
6. The method for sharing edges of curved meshes based on the sharing edge strategy of nesting software according to claim 5, characterized in that: The step of processing the set of edges decomposed from each two parts also includes: Two edges are parallel and in opposite directions. If the starting point of the first edge coincides with the end point of the second edge, and the end point of the first edge coincides with the starting point of the second edge, set the flags of both edges to 1 and insert the first edge into the common edge set. When two edges are parallel and in opposite directions, and the end point of the first edge coincides with the starting point of the second edge, if the length of the first edge is less than that of the second edge, set the flag of the first edge to 1, set the starting point of the second edge to the starting point of the first edge, and determine whether the first edge exists in the common edge set. If not, insert the first edge into the common edge set. If the length of the first edge is greater than that of the second edge, set the flag of the second edge to 1, and set the end point of the first edge to the end point of the second edge; at the same time, determine whether the second edge exists in the common edge set. If not, insert the second edge into the common edge set; When two edges are parallel and in opposite directions, and the starting point of the first edge coincides with the end point of the second edge, if the length of the first edge is less than that of the second edge, set the flag of the first edge to 1, set the end point of the second edge to the end point of the first edge, and determine whether the first edge exists in the common edge set. If not, insert the first edge into the common edge set. If the length of the first edge is greater than that of the second edge, set the flag of the second edge to 1, set the starting point of the first edge to the starting point of the second edge, and determine whether the second edge exists in the common edge set. If not, insert the first edge into the common edge set.
7. The method for sharing edges of curved meshes based on the sharing edge strategy of nesting software according to claim 6, characterized in that: The step of processing the set of edges decomposed from each two parts also includes: When two edges are parallel and in opposite directions, and the starting and ending points of the two edges do not overlap, if the first edge is surrounded by the second edge, set the flag of the first edge to 1, and determine whether the first edge exists in the common edge set. If not, insert the first edge into the common edge set; replace the second edge with two new edges, one of which is a line with the starting point of the second edge and the end point of the first edge, and the other is a line with the starting point of the first edge and the end point of the second edge; If the second edge is surrounded by the first edge, set the flag of the second edge to 1, determine whether the second edge exists in the common edge set, if not, insert the second edge into the common edge set; replace the first edge with two new edges, one of which is a line with the starting point of the first edge and the end point of the second edge; the other edge is a line with the starting point of the second edge and the end point of the first edge.
8. The method for sharing edges of curved meshes based on the sharing edge strategy of nesting software according to claim 7, characterized in that: The step of processing the set of edges decomposed from each two parts also includes: When two edges are parallel and in opposite directions, and the first and last points of the two edges do not overlap, and the two edges partially overlap, if the end points of the two edges are on each other's edges, set the common edge as a line with the start point being the end point of the first edge and the end point being the end point of the second edge, and determine whether the set common edge exists in the common edge set. If not, insert the common edge into the common edge set; set the end point of the first edge to the end point of the original second edge, and set the end point of the second edge to the end point of the original first edge; If the starting points of the two edges are on each other's edges, set the common edge as a line with the starting point of the first edge and the end point of the second edge. Determine whether the set common edge exists in the common edge set. If not, insert the common edge into the common edge set. At the same time, set the starting point of the first edge to the starting point of the original second edge, and the starting point of the second edge to the starting point of the original first edge.
9. The method for sharing edges of curved meshes based on the sharing edge strategy of nesting software according to claim 8, characterized in that: The steps of obtaining the common edge set and the remaining edge set based on the processing results include: Obtain a common edge set based on the processing results; Delete the edges with flag set to 1 in the edge set to obtain the remaining edge set.
10. The method for sharing edges of curved meshes based on the sharing edge strategy of nesting software according to any one of claims 1 to 9, characterized in that: The common edge set and the remaining edge set are merged, the direction is modified to generate graphics, and process parameters and layer information are added to generate new parts. The steps to complete the mesh common edge operation include: Call the merge connected line algorithm combined with the direction priority strategy to merge the common edges of the common edge set; Call the merge connected line algorithm to merge the outer frames with the outer frame priority strategy; The merged common edge set is combined with the remaining edge set to generate a graphic, and process parameters and layer information are added to generate a new part to complete the mesh common edge operation.
Citation Information
Patent Citations
Method for efficiently extracting public edges of large-data-volume topology-vector-free polygon
CN110704550A
Laser common-edge cutting processing path generation method
CN115781043A
Method and device for achieving groove path edge sharing treatment in plane laser cutting machining, processor and computer readable storage medium of processor
CN117583747A
Common-edge cutting trepanning method
CN118060627A
