Neck copper area processing method, device and equipment in EDA design and medium
By identifying and cutting the neck copper area in the copper skin in the EDA design tool, the problem of lack of effective processing methods in the prior art is solved, the quality and efficiency of the circuit are improved, and signal interference and loss are reduced.
Patent Information
- Application Number
- CN202510350959.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-03-24
- Publication Date
- 2025-06-17
AI Technical Summary
There is a lack of effective methods in existing EDA design tools to handle the neck copper area in the copper skin, resulting in reduced circuit quality and efficiency and may cause signal reflections, interference and loss.
By obtaining the avoided copper skin, identify whether there is a neck copper area with a width smaller than the preset narrowest spacing, and cut it to obtain the cut copper skin. The method includes steps such as external processing, external expansion processing and intersection solution to accurately identify and cut the neck copper area.
By removing the neck copper area, the concentrated current flow is reduced, the formation of high current density areas is reduced, the resistance to current passing through is reduced, and the current conduction efficiency is improved, thereby improving the reliability and stability of the circuit.
Smart Images

Figure CN120163112A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of EDA design, and in particular, to a method, device, equipment and medium for processing the neck copper area in EDA design. Background Art
[0002] In the design of electronic circuits, the design of copper clads is crucial. With the continuous development of electronic technology, the requirements for the performance and reliability of circuits are getting higher and higher. However, in the design of copper clads, overly thin copper clads often bring a series of problems. These problems not only affect the quality and efficiency of the circuits, but also pose potential risks to the performance and reliability of electronic devices.
[0003] Although various technologies are constantly developing in the field of electronic circuit design, there is currently no mature and perfect method for dealing with neck copper in the copper clad design of current Electronic Design Automation (EDA) design tools. Here, neck copper refers to the area of overly thin copper clads that do not meet the design requirements in the copper clad. Overly thin copper clads may cause the current to flow concentratedly in the copper layer, forming a high current density area, reducing the reliability and stability of the design; at the same time, it will increase the resistance to the flow of current, resulting in an increase in the resistance value and a decrease in the current conduction efficiency; it may also cause voltage fluctuations or the generation of local potential differences, and in the design of high-speed circuits, it may cause signal reflection, interference and loss, affecting signal integrity and transmission quality.
[0004] Therefore, it is necessary to propose a method, device, equipment and medium for processing the neck copper area in EDA design to solve the above problems. Summary of the Invention
[0005] The purpose of the present invention is to provide a method, device, equipment and medium for processing the neck copper area in EDA design to improve the problem that there is no processing solution for neck copper in EDA design tools.
[0006] In a first aspect, the present invention provides a method for processing the neck copper area in EDA design, and the method includes: S110: Obtain the copper clad after avoidance; S120: Identify whether there is a neck copper area in the copper clad after avoidance with a width less than the preset narrowest spacing; S130: If there is a neck copper area, cut the neck copper area in the copper clad after avoidance to obtain the copper clad after cutting.
[0007] In a possible embodiment, the outer contour of the copper clad after avoidance includes a plurality of sequentially connected contour line segments, and the contour line segments include first straight line segments and / or first arc line segments; Before step S120, it further includes: performing circumscribing processing on each contour line segment according to a set distance to obtain a circumscribed figure of each contour line segment, and performing expanding processing on each circumscribed figure according to a preset minimum distance to obtain an expanded-edge figure corresponding to each circumscribed figure, where the set distance is less than the preset minimum distance.
[0008] In a possible embodiment, the step of identifying the neck copper region includes: Judging whether there are two target circumscribed figures that meet the first condition. If so, determining the region obtained by performing convex hull processing on all the end points of the two target circumscribed figures as the neck copper region; if not, judging the included angle between each two contour line segments, excluding the pairs of contour line segments with an obtuse included angle and the pairs of contour line segments with an acute included angle and the included angle region not configured with a circular chamfer, to obtain the remaining pairs of contour line segments, and performing the following processing on each remaining pair of contour line segments: if there is a first intersection point between the circumscribed figure of one contour line segment and the expanded-edge figure corresponding to the other contour line segment and there is a second intersection point between the expanded-edge figure corresponding to one contour line segment and the circumscribed figure of the other contour line segment, determining the region obtained by performing convex hull processing on all the first intersection points and the second intersection points as the neck copper region, where the first condition includes that there is no intersection point between the expanded-edge figures of the two target circumscribed figures and the expanded-edge figure of one target circumscribed figure contains the other target circumscribed figure and the expanded-edge figure of the other target circumscribed figure contains one target circumscribed figure.
[0009] In a possible embodiment, the step of identifying the neck copper region further includes: Determining the hollowed-out region on the copper foil after avoidance that meets the third condition as the edge hollowed-out region, where the third condition includes that the minimum distance between the edge hollowed-out region and the outer contour of the copper foil after avoidance is less than or equal to the set distance; If the edge hollowed-out region is a concave polygon, decomposing the edge hollowed-out region into at least two convex polygon sub-edge regions, performing expanding processing on each sub-edge region according to the preset minimum distance to obtain a sub-edge expanded figure of each sub-edge region, if there is a third intersection point between a sub-edge region and the expanded-edge figure of a circumscribed figure and there is a fourth intersection point between the sub-edge expanded figure of a sub-edge region and a circumscribed figure, determining the region obtained by performing convex hull processing on all the third intersection points and the fourth intersection points as the neck copper region; If the edge hollowed-out region is a convex polygon, performing expanding processing on the edge hollowed-out region according to the preset minimum distance to obtain an edge expanded figure, if there is a fifth intersection point between the edge hollowed-out region and the expanded-edge figure of a circumscribed figure and there is a sixth intersection point between the edge expanded figure of the edge hollowed-out region and a circumscribed figure, determining the region obtained by performing convex hull processing on all the fifth intersection points and the sixth intersection points as the neck copper region.
[0010] In a possible embodiment, the step of identifying the neck copper region further includes: making the following judgment and processing for every two hollowed-out regions on the copper foil after avoidance: If at least one of the two hollowed-out regions is a concave polygon, decompose the hollowed-out region of the concave polygon into at least two convex polygon sub-regions, perform an outward expansion process on each sub-region according to a preset minimum distance to obtain a sub-expanded figure for each sub-region. When both of the two hollowed-out regions are concave polygons, if there is a seventh intersection point between the sub-expanded figure of a sub-region of one hollowed-out region and the sub-region of the other hollowed-out region and there is an eighth intersection point between the sub-expanded figure of a sub-region of one hollowed-out region and the sub-region of the other hollowed-out region, determine the region obtained by performing a convex hull process based on all the seventh intersection points and the eighth intersection points as the neck copper region; when one of the two hollowed-out regions is a concave polygon and the other is a convex polygon, perform an outward expansion process on the hollowed-out region of the convex polygon according to a preset minimum distance to obtain an expanded figure. If there is a ninth intersection point between a sub-region and the expanded figure and there is a tenth intersection point between the sub-expanded figure of a sub-region and the hollowed-out region of the convex polygon, determine the region obtained by performing a convex hull process based on all the ninth intersection points and the tenth intersection points as the neck copper region; If both of the two hollowed-out regions are convex polygons, perform an outward expansion process on the two hollowed-out regions according to a preset minimum distance to obtain two expanded figures. If there is an eleventh intersection point between one hollowed-out region and the expanded figure of the other hollowed-out region and there is a twelfth intersection point between the expanded figure of one hollowed-out region and the other hollowed-out region, determine the region obtained by performing a convex hull process based on all the eleventh intersection points and the twelfth intersection points as the neck copper region; Wherein, the concave polygon and the convex polygon include second straight line segments and / or second arc line segments.
[0011] In a possible embodiment, decomposing the hollowed-out region of the concave polygon into at least two convex polygon sub-regions includes: Traverse each endpoint of the hollowed-out region of the concave polygon and determine whether it is a concave point, obtain a concave point of the hollowed-out region of the concave polygon, make a ray from the concave point to the previous endpoint of the concave point, and decompose the hollowed-out region of the concave polygon into two parts through the ray. If both parts are convex polygons, determine the two parts as sub-regions; if the outer contour of at least one part is a concave polygon, continue to decompose the part with the outer contour being a concave polygon until the decomposed parts are all convex polygons, and determine the parts obtained as convex polygons during the decomposition process as sub-regions.
[0012] In a possible embodiment, the step of identifying the neck copper region further includes: Determine the hollowed-out area of the concave polygon on the copper foil after avoidance as the target hollowed-out area, decompose the target hollowed-out area into at least two decomposed areas of convex polygons, and perform the following judgment processing on every two decomposed areas: Expand the two decomposed areas according to the preset minimum distance to obtain two expanded figures. If there is a thirteenth intersection point between the expanded figure of one decomposed area and the other decomposed area and there is a fourteenth intersection point between the expanded figure of one decomposed area and the other decomposed area, determine the area obtained by performing convex hull processing based on all the thirteenth intersection points and the fourteenth intersection points as the neck copper area, where the thirteenth intersection point and the fourteenth intersection point are intersection points or included endpoints.
[0013] In a second aspect, an apparatus for processing the neck copper area in EDA design according to an embodiment of the present invention is further provided. The apparatus includes modules / units for executing the method of any possible design in the first aspect described above. These modules / units can be implemented by hardware or by hardware executing corresponding software.
[0014] In a third aspect, an electronic device according to an embodiment of the present invention is further provided, including a processor and a memory. Among them, the memory is used to store one or more computer programs; when the one or more computer programs stored in the memory are executed by the processor, the electronic device can implement the method of any possible design in the first aspect described above.
[0015] In a fourth aspect, a computer-readable storage medium according to an embodiment of the present invention is further provided. The computer-readable storage medium includes a computer program. When the computer program runs on an electronic device, the electronic device executes the method of any possible design in the first aspect described above.
[0016] In a fifth aspect, a computer program product is further provided according to an embodiment of the present invention. When the computer program product runs on an electronic device, the electronic device executes the method of any possible design in any of the above aspects.
[0017] The beneficial effects of the present invention are as follows: By expanding convex polygons to find intersection points to identify the too-thin areas of the copper foil after avoidance, and combining certain design detail requirements to screen out the neck copper area, and then cutting off the neck copper area through the operation function of the polygon with holes, thereby ensuring the quality and efficiency of the circuit. BRIEF DESCRIPTION OF THE DRAWINGS
[0018] Figure 1 It is a schematic flow chart of the method for processing the neck copper area in the EDA design of the present invention.
[0019] Figure 2 It is a schematic diagram of the copper foil after avoidance obtained in the method for processing the neck copper area in the EDA design of the present invention.
[0020] Figure 3Schematic diagram of identifying the neck copper area in the method for processing the neck copper area in the EDA design of the present invention.
[0021] Figure 4 Schematic diagram after cutting the neck copper area in the method for processing the neck copper area in the EDA design of the present invention.
[0022] Figure 5 Schematic diagram of four neck copper areas in the method for processing the neck copper area in the EDA design of the present invention.
[0023] Figure 6 Schematic diagram of generating circumscribed figures for each contour line segment in the method for processing the neck copper area in the EDA design of the present invention.
[0024] Figure 7 Schematic diagram of two target circumscribed figures in the method for processing the neck copper area in the EDA design of the present invention.
[0025] Figure 8 Schematic diagram of avoiding the rear copper skin in a specific example of the method for processing the neck copper area in the EDA design of the present invention.
[0026] Figure 9 Schematic diagram of generating a circumscribed rectangle by the circumscription of a straight line segment in the method for processing the neck copper area in the EDA design of the present invention.
[0027] Figure 10 Schematic diagram of generating a circumscribed arc strip by the circumscription of a concave arc line segment in the method for processing the neck copper area in the EDA design of the present invention.
[0028] Figure 11 Schematic diagram of generating a circumscribed arc strip by the circumscription of a convex arc line segment in the method for processing the neck copper area in the EDA design of the present invention.
[0029] Figure 12 Schematic diagram of generating circumscribed figures for each contour line segment in an embodiment of the method for processing the neck copper area in the EDA design of the present invention.
[0030] Figure 13 Schematic diagram of a chamfer setting parameter in the method for processing the neck copper area in the EDA design of the present invention.
[0031] Figure 14 Schematic diagram of another chamfer setting parameter in the method for processing the neck copper area in the EDA design of the present invention.
[0032] Figure 15 Schematic diagram of an acute angle between included angles in the method for processing the neck copper area in the EDA design of the present invention.
[0033] Figure 16 Schematic diagram of determining the neck copper area according to the contour line segment, circumscribed figure, and edge-expanded figure in an embodiment of the method for processing the neck copper area in the EDA design of the present invention.
[0034] Figure 17 This is a schematic diagram of the neck copper area of the copper skin after avoidance in an embodiment of the method for processing the neck copper area in the EDA design of the present invention.
[0035] Figure 18 This is a schematic diagram of the neck copper area pinched out by the outer contour of the hollowed-out area and the copper skin after avoidance in the method for processing the neck copper area in the EDA design of the present invention.
[0036] Figure 19 This is a schematic diagram of the hollowed-out area in the copper skin after avoidance in the method for processing the neck copper area in the EDA design of the present invention.
[0037] Figure 20 This is a schematic diagram of the neck copper area between two hollowed-out areas in the method for processing the neck copper area in the EDA design of the present invention.
[0038] Figure 21 This is a schematic diagram of the copper skin after avoidance in another specific example of the method for processing the neck copper area in the EDA design of the present invention.
[0039] Figure 22 This is a schematic diagram of the copper skin after avoidance after the first decomposition in the method for processing the neck copper area in the EDA design of the present invention.
[0040] Figure 23 This is a schematic diagram of the copper skin after avoidance after the second decomposition in the method for processing the neck copper area in the EDA design of the present invention.
[0041] Figure 24 This is a schematic diagram of the copper skin after avoidance after the third decomposition in the method for processing the neck copper area in the EDA design of the present invention.
[0042] Figure 25 This is a schematic diagram of each part obtained after the copper skin after avoidance is decomposed in the method for processing the neck copper area in the EDA design of the present invention.
[0043] Figure 26 This is a schematic diagram of the neck copper area pinched out by the self-profile of the hollowed-out area in the method for processing the neck copper area in the EDA design of the present invention.
[0044] Figure 27 This is a schematic diagram of the device for processing the neck copper area in the EDA design of the present invention.
[0045] Figure 28 This is a schematic diagram of the structure of the electronic device of the present invention. Detailed implementation manners
[0046] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the following will clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are some, but not all, of the embodiments of the present invention.
[0047] In view of the problems existing in the above technologies, embodiments of the present invention provide a method for processing the neck copper area in EDA design. Refer to Figure 1 , the method includes: S110: Obtain the copper skin after avoidance, as Figure 2 shown; S120: Identify whether there is a neck copper area in the copper skin after avoidance with a width less than the preset minimum spacing, as Figure 3 the area framed by the frame line shown; S130: If there is a neck copper area, cut the neck copper area in the copper skin after avoidance to obtain the copper skin after cutting, as Figure 4 shown.
[0048] Identify the area on the copper skin after avoidance according to the preset minimum spacing to identify the neck copper area in the copper skin after avoidance with a width less than the preset minimum spacing, and then cut off the neck copper area from the copper skin after avoidance to obtain the copper skin after cutting. This solution can avoid the concentrated flow of current in the copper layer, reduce the formation of high current density areas, reduce the resistance of current passing, lower the resistance value, improve the current conduction efficiency, and thus improve the reliability and stability of the circuit.
[0049] In one embodiment, the outer contour of the copper skin after avoidance includes a plurality of sequentially connected contour line segments, and the contour line segments include first straight line segments and / or first arc line segments; Before step S120, it further includes: performing circumscribing processing on each contour line segment according to the set distance to obtain the circumscribed figure of each contour line segment, and performing outward expansion processing on each circumscribed figure according to the preset minimum spacing to obtain the expanded border figure corresponding to each circumscribed figure, where the set distance is less than the preset minimum spacing.
[0050] Specifically, the set distance is much less than the preset minimum spacing. It can be understood that in this application, only a very small set distance is used to perform circumscribing processing on the contour line segments. Based on the preset minimum spacing, outward expansion processing is performed on each circumscribed figure to obtain the corresponding expanded border figure. The preset minimum spacing defines the minimum width allowed in the copper skin. The outward expansion processing is performed to facilitate the subsequent identification and judgment of the neck copper area.
[0051] In a specific embodiment, each contour line segment is circumscribed according to a set distance to obtain a circumscribed figure of each contour line segment, including: for a contour line segment that is a first straight line segment, a circumscribed rectangle of the contour line segment is generated according to the set distance; for a contour line segment that is a first arc segment, a circumscribed arc strip of the contour line segment is generated according to the set distance.
[0052] The present invention proposes a method for identifying and judging the neck copper region for four cases. The first case: the neck copper region pinched out by the outer contour of the copper skin itself after avoidance, such as Figure 5 region 1 in Figure 5 ; the second case: the neck copper region pinched out by the hollowed-out region inside the copper skin after avoidance and the outer contour of the copper skin after avoidance, such as Figure 5 region 2 in Figure 5 ; the third case: the neck copper region pinched out by the outer contours of two hollowed-out regions on the copper skin after avoidance, such as
[0053] region 3 in
[0054] ; the fourth case: the neck copper region pinched out by the self-contour of the hollowed-out region inside the copper skin after avoidance, such as
[0055] region 4 in 。
[0053] In one embodiment, for the first case where the neck copper region is pinched out by the outer contour of the copper skin itself after avoidance, the steps for identifying the neck copper region include: judging whether there are two target circumscribed figures that meet the first condition. If so, the region obtained by performing a convex hull process on all the end points of the two target circumscribed figures is determined as the neck copper region; if not, the included angle between each two contour line segments is judged, and the pairs of contour line segments with an obtuse included angle and pairs of contour line segments with an acute included angle and the included angle region not configured with a round chamfer are excluded to obtain the remaining pairs of contour line segments. The following processing is performed on each remaining pair of contour line segments: if there is a first intersection point between the circumscribed figure of one contour line segment and the extended edge figure corresponding to the other contour line segment and there is a second intersection point between the extended edge figure corresponding to one contour line segment and the circumscribed figure of the other contour line segment, the region obtained by performing a convex hull process on all the first intersection points and the second intersection points is determined as the neck copper region, where the first condition includes that there is no intersection point between the extended edge figures of the two target circumscribed figures and the extended edge figure of one target circumscribed figure contains the other target circumscribed figure and the extended edge figure of the other target circumscribed figure contains the one target circumscribed figure.
[0054] Through the steps in this embodiment, the neck copper region pinched out by the outer contour of the copper skin itself can be accurately identified, avoiding misidentification and missed identification. By excluding the pairs of contour line segments with an obtuse included angle and pairs of contour line segments with an acute included angle and the included angle region not configured with a round chamfer, errors in the design can be reduced and the design quality can be improved.
[0055] It should be noted that in the above definition, the circumscribed figure of one contour line segment and the extended edge figure corresponding to one contour line segment correspond to the same contour line segment, and the extended edge figure corresponding to the other contour line segment and the circumscribed figure of the other contour line segment correspond to the same other circumscribed figure.
[0056] The determination of the neck copper area of two target circumscribed figures satisfying the first condition will be explained below with specific examples.
[0057] Refer to Figure 6 , an outer peripheral area is produced around the outer contour ABCD of the copper skin after avoidance. The contour line segment BA generates a circumscribed rectangle BAEF, the contour line segment AC generates a circumscribed rectangle ACKL, the contour line segment CD generates a circumscribed rectangle CDIJ, and the contour line segment DB generates a circumscribed rectangle DBGH. Refer to Figure 7 , when expanding the circumscribed rectangle DBGH and the circumscribed rectangle ACKL to find the intersection points, it is found that there are no intersection points between them. The expanded figure QMNP of the circumscribed rectangle DBGH contains the four points A, C, K, and L of the circumscribed rectangle ACKL, and A, C, K, and L are added to the intersection point set. The expanded figure URST of the circumscribed rectangle ACKL contains the four points D, B, G, and H of the circumscribed rectangle DBGH, and D, B, G, and H are added to the intersection point set. The neck copper area HGLK is obtained by finding the convex hull according to the intersection point set.
[0058] The determination of the neck copper area between two contour line segments will be explained below with specific examples.
[0059] Refer to Figure 8 , for the outer contour DCBFE of the copper skin after avoidance, refer to Figure 9 , the straight line segment DC in generates a circumscribed rectangle Figure 10 , refer to Figure 11 , the radius of the concave arc segment CB in is reduced by a set distance to generate a circumscribed arc strip CBPQ. Refer to Figure 12 , the radius of the convex arc segment BF in Figure 13 is enlarged by a set distance to generate a circumscribed arc strip BFUT, the straight line segment FE generates a circumscribed rectangle FEWV, and the straight line segment ED generates a circumscribed rectangle Figure 14 . Refer to Figure 15The acute angle region between two contour line segments, perform outward expansion on the circumscribed figure of each remaining pair of contour line segments to obtain two neck copper regions, as shown in Figure 16 and Figure 17 the gray box regions in.
[0060] In one embodiment, for the case of the hollowed-out region inside the copper foil after the second avoidance and the neck copper region pinched out by the outer contour of the copper foil after avoidance, the steps of identifying the neck copper region further include: determining the hollowed-out region on the copper foil after avoidance that satisfies the third condition as the edge hollowed-out region, and the third condition includes that the minimum distance between the edge hollowed-out region and the outer contour of the copper foil after avoidance is less than or equal to the set distance; if the edge hollowed-out region is a concave polygon, decompose the edge hollowed-out region into at least two sub-edge regions with a convex polygon as the outer contour, perform outward expansion processing on each sub-edge region according to the preset narrowest distance to obtain the sub-edge expansion figure of each sub-edge region. If there is a third intersection point between a sub-edge region and the expansion edge figure of a circumscribed figure and there is a fourth intersection point between the sub-edge expansion figure of a sub-edge region and a circumscribed figure, determine the region obtained by performing convex hull processing based on all the third intersection points and the fourth intersection points as the neck copper region; if the edge hollowed-out region is a convex polygon, perform outward expansion processing on the edge hollowed-out region according to the preset narrowest distance to obtain the edge expansion figure. If there is a fifth intersection point between the edge hollowed-out region and the expansion edge figure of a circumscribed figure and there is a sixth intersection point between the edge expansion figure of the edge hollowed-out region and a circumscribed figure, determine the region obtained by performing convex hull processing based on all the fifth intersection points and the sixth intersection points as the neck copper region.
[0061] Through the steps in this embodiment, the neck copper region pinched out by the hollowed-out region inside the copper foil and the outer contour can be effectively identified and processed. By decomposing a concave polygon into at least two convex polygons, the neck copper region can be more accurately identified, avoiding misidentification and missed identification. Through outward expansion processing and intersection point judgment, the boundary of the neck copper region can be accurately determined.
[0062] The following combines specific examples to explain and illustrate the judgment of the neck copper region pinched out by the hollowed-out region and the outer contour of the copper foil after avoidance.
[0063] See Figure 18 , for each contour line segment of the outer contour TUVW of the copper foil after avoidance, the circumscribed figure and the expansion edge figure are obtained through processing. The edge hollowed-out region ABCDE is contained inside the copper foil after avoidance. Decompose the edge hollowed-out region ABCDE to obtain the sub-edge region ABFE and the sub-edge region CDEF. The sub-edge region ABFE is respectively judged with each circumscribed figure to perform outward expansion to find the intersection points, and the sub-edge region CDEF is respectively judged with each circumscribed figure to perform outward expansion to find the intersection points, so as to obtain Figure 18 the neck copper region 1801 in.
[0064] In one embodiment, for the case of the neck copper region pinched out by the outer contours of two hollowed-out regions on the copper foil after the third avoidance, the steps of identifying the neck copper region further include: making the following judgment and processing for every two hollowed-out regions on the copper foil after the avoidance: If at least one of the outer contours of the two hollowed-out regions is a concave polygon, decompose the hollowed-out region with a concave polygon into at least two sub-regions with outer contours being convex polygons, perform an outward expansion process on each sub-region according to a preset minimum distance to obtain a sub-expanded graph of each sub-region. When both of the two hollowed-out regions are concave polygons, if there is a seventh intersection point between the sub-expanded graph of a sub-region of one hollowed-out region and the sub-region of the other hollowed-out region and there is an eighth intersection point between the sub-expanded graph of a sub-region of one hollowed-out region and the sub-region of the other hollowed-out region, determine the region obtained by performing a convex hull process based on all the seventh intersection points and the eighth intersection points as the neck copper region; when one of the two hollowed-out regions is a concave polygon and the other is a convex polygon, perform an outward expansion process on the hollowed-out region with a convex polygon according to a preset minimum distance to obtain an expanded graph. If there is a ninth intersection point between a sub-region and the expanded graph and there is a tenth intersection point between the sub-expanded graph of a sub-region and the hollowed-out region with a convex polygon, determine the region obtained by performing a convex hull process based on all the ninth intersection points and the tenth intersection points as the neck copper region; if the outer contours of both of the two hollowed-out regions are convex polygons, perform an outward expansion process on the two hollowed-out regions according to a preset minimum distance to obtain two expanded graphs. If there is an eleventh intersection point between one hollowed-out region and the expanded graph of the other hollowed-out region and there is a twelfth intersection point between the expanded graph of one hollowed-out region and the other hollowed-out region, determine the region obtained by performing a convex hull process based on all the eleventh intersection points and the twelfth intersection points as the neck copper region; wherein, the concave polygon and the convex polygon include second straight line segments and / or second arc line segments.
[0065] Through the steps in this embodiment, the neck copper region pinched out by the outer contours of two hollowed-out regions on the copper foil can be effectively identified and processed. By decomposing the concave polygon into convex polygons, the neck copper region can be more accurately identified, avoiding misidentification and missed identification. Through the outward expansion process and intersection point judgment, the boundary of the neck copper region can be accurately determined.
[0066] It should be noted that in the above definitions, the sub-region of one hollowed-out region and the sub-expanded graph of the sub-region of one hollowed-out region correspond to the same sub-region of the same hollowed-out region, and the sub-expanded graph of the sub-region of the other hollowed-out region and the sub-region of the other hollowed-out region correspond to the same sub-region of the same other hollowed-out region. One hollowed-out region and the expanded graph of one hollowed-out region correspond to the same hollowed-out region, and the expanded graph of the other hollowed-out region and the other hollowed-out region correspond to the same other hollowed-out region.
[0067] The following explains and illustrates the judgment of the neck copper region pinched out by the outer contours of two hollowed-out regions with specific examples.
[0068] See Figure 19, for the outer contour of the copper foil after avoidance It contains a hollowed-out area ABCDE and a hollowed-out area GFPJIH, see Figure 20 , decomposing the hollowed-out area ABCDE to obtain sub-areas 、sub-areas , decomposing the hollowed-out area GFPJIH to obtain sub-areas 、sub-areas , sub-area expands outwards to obtain a sub-expanded figure KLO, sub-area expands outwards to obtain a sub-expanded figure , sub-area expands outwards to obtain a sub-expanded figure , sub-area expands outwards to obtain a sub-expanded figure , according to the intersection point of sub-area and sub-area 's sub-expanded figure , the intersection point of sub-area 's sub-expanded figure KLO and sub-area , obtain the neck copper area ; according to the intersection point of sub-area and sub-area 's sub-expanded figure , the intersection point of sub-area 's sub-expanded figure and sub-area , obtain the neck copper area .
[0069] In a specific embodiment, decomposing the hollowed-out area of the concave polygon into at least two sub-areas with a convex polygon outer contour includes: traversing each endpoint of the hollowed-out area of the concave polygon and determining whether it is a concave point, obtaining a concave point of the hollowed-out area of the concave polygon, making a ray according to the concave point and the previous endpoint of the concave point, and decomposing the hollowed-out area of the concave polygon into two parts through the ray. If the outer contours of both parts are convex polygons, then determine the two parts as sub-areas; if the outer contour of at least one part is a concave polygon, continue to decompose the part with the concave polygon outer contour until the outer contours of the decomposed parts are all convex polygons, and determine the parts with convex polygon outer contours obtained during the decomposition process as sub-areas. Through multiple step-by-step decomposition methods, the concave polygon is decomposed into several convex polygons to more accurately identify the neck copper area and avoid misidentification and missed identification.
[0070] The following explains the decomposition process of the hollowed-out area of the concave polygon with specific examples.
[0071] See Figure 21 , the hollowed-out area ABCDEFG of the concave polygon, see Figure 22, traverse each point in the hollowed-out area ABCDEFG. It is found that B is a concave point. Draw the first ray from B to the previous point A. The first ray intersects the first line segment CD at point H. At this time, there are two parts to be decomposed, namely AHDEFG and BCH. See Figure 23 , traverse each point in AHDEFG. It is found that D is a concave point. Draw the second ray from D to the previous point H. The second ray intersects the first line segment CD at point I. At this time, there are three parts to be decomposed, namely BCH, AHIFG, and DEI. Traverse each point in BCH. It is found that there are no concave points, that is, they are all convex polygons. Add them to the convex polygon array. At this time, there are two parts to be decomposed, namely AHIFG and DEI. See Figure 24 , traverse each point in AHIFG. It is found that G is a concave point. Draw the third ray from G to the previous point F. The third ray intersects the first line segment AB at point J. At this time, there are three parts to be decomposed, namely DEI, AJG, and FJHI. Traverse each point in DEI. It is found that there are no concave points, so it is a convex polygon. Add it to the convex polygon array. At this time, there are two parts to be decomposed, namely AJG and FJHI. Traverse each point in AJG. It is found that there are no concave points, so it is a convex polygon. Add it to the convex polygon array. At this time, there is one part to be decomposed, namely FJHI. Traverse each point in FJHI. It is found that there are no concave points, so it is a convex polygon. Add it to the convex polygon array. At this time, there are no parts to be decomposed, and the decomposition is completed. At this time, see Figure 25 , the convex polygon array includes BCH, DEI, AJG, and FJHI, that is, the parts with convex polygon outer contours obtained during the decomposition process are determined as sub-regions.
[0072] In one embodiment, for the case of the neck copper region pinched out by the self-contour of the hollowed-out area inside the copper foil after the fourth avoidance, the steps of identifying the neck copper region further include: determining the hollowed-out area with a concave polygon outer contour on the copper foil after avoidance as the target hollowed-out area, decomposing the target hollowed-out area into at least two decomposed areas with convex polygon outer contours, and performing the following judgment processing on every two decomposed areas: obtaining two expanded figures by expanding the two decomposed areas according to a preset minimum distance. If there is a thirteenth intersection point between the expanded figure of one decomposed area and the other decomposed area and there is a fourteenth intersection point between the expanded figure of one decomposed area and the other decomposed area, the area obtained by performing a convex hull process based on all the thirteenth intersection points and fourteenth intersection points is determined as the neck copper region, where the thirteenth intersection point and the fourteenth intersection point are intersection points or included endpoints, and the included endpoints can be understood as the endpoints of one decomposed area being included in the expanded figure of the other decomposed area.
[0073] The following explains and illustrates the judgment of the neck copper region pinched out by the self-contour of the hollowed-out area with specific examples.
[0074] See Figure 26, for the hollowed-out area ABCDE with concave polygons inside the outer contour FGHI of the copper foil after avoidance, decompose the hollowed-out area ABCDE to obtain the decomposed area ABJ and the decomposed area EJCD, and perform outer expansion on the decomposed area ABJ and the decomposed area EJCD to find the intersection points. The intersection points of the outer-expanded figure QRS of the decomposed area ABJ and the decomposed area EJCD are E, J, Z, , here, E and J are included points and are also regarded as intersection points. The intersection points of the outer-expanded figure TUVW of the decomposed area EJCD and the decomposed area ABJ are , , J. Here, J is an included point and is also regarded as an intersection point. For the intersection points E, J, Z, , , perform convex hull processing, and the neck copper area .
[0075] In a specific embodiment, cut the neck copper area in the copper foil after avoidance to obtain the cut copper foil, including: using a polygon operation function with holes to cut the neck copper area in the copper foil after avoidance to obtain the cut copper foil.
[0076] In addition, the present invention also proposes a device for processing the neck copper area in EDA design. Refer to Figure 27 , the device includes: an acquisition module 2701 for acquiring the copper foil after avoidance; an identification module 2702 for identifying whether there is a neck copper area with a width less than a preset minimum spacing in the copper foil after avoidance; a cutting module 2703 for cutting the neck copper area in the copper foil after avoidance to obtain the cut copper foil if there is a neck copper area. All relevant contents of each step involved in the above method embodiment can be cited in the function description of the corresponding functional module, and will not be elaborated here.
[0077] In some other embodiments of the present invention, the present invention discloses an electronic device. Refer to Figure 28 , the electronic device may include: one or more processors 2801; a memory 2802; a display 2803; one or more applications (not shown); and one or more computer programs 2804. The above components can be connected through one or more communication buses 2805. Among them, the one or more computer programs 2804 are stored in the above memory 2802 and are configured to be executed by the one or more processors 2801. The one or more computer programs 2804 include instructions, and the above instructions can be used to execute as Figure 1 and Figure 27 and the respective steps in the corresponding embodiments.
[0078] Through the description of the above embodiments, those skilled in the art can clearly understand that for the convenience and brevity of description, only the division of the above functional modules is used as an example. In actual applications, the above functions can be assigned to different functional modules according to needs, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above. The specific working processes of the systems, devices, and units described above can refer to the corresponding processes in the foregoing method embodiments and will not be elaborated here.
[0079] In each of the embodiments of the present invention, the functional units can be integrated into one processing unit, or each unit can exist physically alone, or two or more units can be integrated into one unit. The above integrated unit can be implemented in the form of hardware or in the form of a software functional unit.
[0080] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiments of the present invention, in essence, or the part that contributes to the prior art, or all or part of this technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor to execute all or part of the steps of the methods of the various embodiments of the present invention. The foregoing storage medium includes: various media that can store program codes, such as flash memory, mobile hard disk, read-only memory, random access memory, magnetic disk, or optical disk.
[0081] Although the embodiments of the present invention have been described in detail above, it is obvious to those skilled in the art that various modifications and changes can be made to these embodiments. However, it should be understood that such modifications and changes are all within the scope and spirit of the present invention as defined in the claims.
Claims
1. A method for processing neck copper area in EDA design, characterized in that: The method comprises: S110: Get the copper skin after avoidance; S120: Identify whether there is a neck copper area whose width is smaller than a preset narrowest spacing in the copper sheet after the avoidance; S130: If the neck copper area exists, cutting the neck copper area in the avoided copper sheet to obtain the cut copper sheet.
2. The method according to claim 1, characterized in that The outer contour of the avoided copper sheet includes a plurality of contour line segments connected in sequence, and the contour line segments include a first straight line segment and / or a first arc segment; Before step S120, it also includes: performing circumscription processing on each of the contour line segments according to the set distance to obtain a circumscribed graphic of each of the contour line segments, and performing outward expansion processing on each of the circumscribed graphics according to the preset narrowest spacing to obtain an expanded edge graphic corresponding to each of the circumscribed graphics, wherein the set distance is less than the preset narrowest spacing.
3. The method according to claim 2, characterized in that The steps to identify the neck copper area include: Determine whether there are two target circumscribed graphics that meet the first condition. If so, determine the area obtained by performing convex hull processing on all endpoints of the two target circumscribed graphics as the neck copper area; if not, determine the angle between each two contour line segments, exclude the contour line segment pairs whose angles are obtuse angles and whose angles are acute angles and whose angle areas are not configured as round chamfers, and obtain the remaining contour line segment pairs. Perform the following processing on each remaining pair of contour line segments: if there is a first intersection between the circumscribed graphics of one contour line segment and the expanded edge graphics corresponding to the other contour line segment, and there is a second intersection between the expanded edge graphics corresponding to the one contour line segment and the circumscribed graphics of the other contour line segment, determine the area obtained by performing convex hull processing on all the first intersections and the second intersections as the neck copper area, wherein the first condition includes that the expanded edge graphics of the two target circumscribed graphics have no intersection, and the expanded edge graphics of the one target circumscribed graphics contain the other target circumscribed graphics, and the expanded edge graphics of the other target circumscribed graphics contain the one target circumscribed graphics.
4. The method according to claim 2, characterized in that: The step of identifying the neck copper area also includes: Determine the hollowed-out area on the copper sheet after avoidance that meets the third condition as the edge hollowed-out area, wherein the third condition includes that the minimum spacing between the edge hollowed-out area and the outer contour of the copper sheet after avoidance is less than or equal to a set spacing; If the edge hollowing area is a concave polygon, the edge hollowing area is decomposed into at least two sub-edge areas of convex polygons, each of the sub-edge areas is expanded according to the preset narrowest spacing to obtain a sub-edge expansion figure of each sub-edge area, if there is a third intersection between a sub-edge area and an expansion figure of a circumscribed figure and there is a fourth intersection between the sub-edge expansion figure of the sub-edge area and the circumscribed figure, an area obtained by performing convex hull processing according to all the third intersections and the fourth intersections is determined as a neck copper area; If the edge hollowing area is a convex polygon, the edge hollowing area is expanded according to the preset narrowest spacing to obtain an edge extension figure. If there is a fifth intersection between the edge hollowing area and an expanded edge figure of an external figure and there is a sixth intersection between the edge extension figure of the edge hollowing area and the external figure, an area obtained by performing convex hull processing based on all the fifth intersections and the sixth intersections is determined as the neck copper area.
5. The method according to claim 1, characterized in that The step of identifying the neck copper area also includes: performing the following judgment processing on every two hollowed-out areas on the copper sheet after the avoidance: If at least one of the two hollowed-out areas is a concave polygon, the hollowed-out area of the concave polygon is decomposed into at least two sub-areas of convex polygons, and each of the sub-areas is expanded according to the preset narrowest spacing to obtain a sub-expanded figure of each sub-area. When both hollowed-out areas are concave polygons, if there is a seventh intersection between a sub-area of one hollowed-out area and a sub-expanded figure of a sub-area of the other hollowed-out area, and there is an eighth intersection between the sub-expanded figure of the sub-area of the one hollowed-out area and the sub-area of the other hollowed-out area, a region obtained by performing convex hull processing based on all the seventh intersection points and the eighth intersection points is determined as a neck copper region; when one of the two hollowed-out areas is a concave polygon and the other is a convex polygon, the hollowed-out area of the convex polygon is expanded according to the preset narrowest spacing to obtain an expanded figure, and if there is a ninth intersection between one sub-area and the expanded figure, and there is a tenth intersection between the sub-expanded figure of the one sub-area and the hollowed-out area of the convex polygon, a region obtained by performing convex hull processing based on all the ninth intersection points and the tenth intersection points is determined as a neck copper region; If both hollowed-out areas are convex polygons, two hollowed-out areas are expanded according to the preset narrowest spacing to obtain two expanded graphics, and if there is an eleventh intersection between one hollowed-out area and the expanded graphics of another hollowed-out area and there is a twelfth intersection between the expanded graphics of one hollowed-out area and the other hollowed-out area, an area obtained by performing convex hull processing according to all the eleventh intersection and the twelfth intersection is determined as the neck copper area; Wherein, the concave polygon and the convex polygon include a second straight line segment and / or a second arc segment.
6. The method according to claim 5, characterized in that Decompose the hollowed-out region of the concave polygon into at least two convex polygonal sub-regions, including: Traverse each endpoint of the hollowed-out area of the concave polygon and determine whether it is a concave point, obtain a concave point of the hollowed-out area of the concave polygon, make a ray based on the concave point and the previous endpoint of the concave point, and decompose the hollowed-out area of the concave polygon into two parts through the ray. If both parts are convex polygons, the two parts are determined as sub-areas; if the outer contour of at least one part is a concave polygon, continue to decompose the part with the outer contour of the concave polygon until the decomposed parts are all convex polygons, and determine the part of the convex polygon obtained in the decomposition process as a sub-area.
7. The method according to any one of claims 1 to 6, characterized in that The step of identifying the neck copper area also includes: The hollowed-out area of the concave polygon on the copper sheet after the avoidance is determined as the target hollowed-out area, and the target hollowed-out area is decomposed into at least two decomposition areas of convex polygons, and the following judgment processing is performed on each two of the decomposition areas: the two decomposition areas are expanded according to the preset narrowest spacing to obtain two expansion figures, if there is a thirteenth intersection between the expansion figures of one decomposition area and another decomposition area and there is a fourteenth intersection between the expansion figure of the one decomposition area and the other decomposition area, the area obtained by performing convex hull processing based on all the thirteenth intersection points and the fourteenth intersection points is determined as the neck copper area, wherein the thirteenth intersection point and the fourteenth intersection point are intersection points or included endpoints.
8. A neck copper area processing device in EDA design, characterized in that: The device comprises: Acquisition module, used to obtain the copper skin after avoidance; An identification module, used for identifying whether there is a neck copper area whose width is less than a preset narrowest spacing in the copper sheet after the avoidance; The cutting module is used to cut the neck copper area in the avoided copper skin if the neck copper area exists, so as to obtain the cut copper skin.
9. An electronic device, characterized in that: include: A processor and a memory, wherein the memory is used to store a computer program; The processor is configured to execute the computer program stored in the memory so as to enable the electronic device to perform the method according to any one of claims 1 to 7.
10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 7 is implemented.
Citation Information
Cited By
Copper laying method and program for printed circuit board
CN121262737A
