CN117829081A - Concave polygon region generation method and device of EDA model device - Google Patents
Concave polygon region generation method and device of EDA model device Download PDFInfo
- Publication number
- CN117829081A CN117829081A CN202410064965.0A CN202410064965A CN117829081A CN 117829081 A CN117829081 A CN 117829081A CN 202410064965 A CN202410064965 A CN 202410064965A CN 117829081 A CN117829081 A CN 117829081A
- Authority
- CN
- China
- Prior art keywords
- concave
- area
- line segment
- point line
- bags
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 38
- 238000005520 cutting process Methods 0.000 claims abstract description 61
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 24
- 238000004590 computer program Methods 0.000 claims abstract description 12
- 238000003860 storage Methods 0.000 claims abstract description 5
- 238000013507 mapping Methods 0.000 claims description 12
- 238000009499 grossing Methods 0.000 claims description 3
- 238000004088 simulation Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000005096 rolling process Methods 0.000 description 1
Abstract
The invention discloses a method and a device for generating a concave polygon area of an EDA model device, and relates to the technical field of circuit design; the method comprises the steps of grouping the concave bags of all selected networks in an intersecting relation manner, obtaining concave bags after combination, generating convex bags of all networks based on a Graham algorithm, subtracting the concave bags from the convex bags, and obtaining a plurality of cutting areas; the device is a storage medium containing a computer program and can realize corresponding steps in the concave polygon area generating method; based on Graham algorithm and cutting algorithm, obtaining a plurality of selected networks, sequentially obtaining two center point line segments of concave bags from all concave bags of the selected networks, judging whether each center point line segment is intersected with each cutting area, adding the cutting area into a reserved area if the center point line segment is intersected with each cutting area, obtaining a reserved area of a concave polygon area, merging the reserved area with the concave bags of all selected networks, rapidly generating a complete concave polygon area, and improving user experience.
Description
Technical Field
The invention relates to the technical field of circuit design, in particular to a method and a device for generating a concave polygon area of an EDA model device.
Background
In EDA software for integrated circuit design, cutting a PCB before simulating a part of devices on the PCB is a common operation, because it is very time-consuming to directly simulate the whole PCB, especially when the PCB is very large in size, the simulation time is greatly increased.
The PCB board cutting operation is generally divided into cutting according to areas and cutting according to networks, wherein the cutting areas are manually drawn by a user according to the area cutting, and after the PCB board is divided into networks according to the network cutting, the network is selected to be cut. The network cutting is divided into automatic convex polygon area cutting and automatic concave polygon area cutting, and the two network cutting modes are to automatically generate cutting areas according to a network selected by a user.
Generally, the automatic concave polygon area cutting can better show the outline of the device on the PCB, and is the most cutting mode selected by the user. The concave polygon area generation algorithm is always a difficulty of EDA software, and at present, when some software in the industry generates a concave polygon area, the time complexity and the precision cannot be considered.
In the prior art, when the concave polygon area is generated, the concave polygon area is directly calculated according to the geometric data of all devices contained in the selected network, and a binding method, a rolling ball method, a convex hull concavity method and the like are generally adopted, so that the calculation speed is low, and the user experience is very influenced. When a user selects a plurality of unconnected networks, the concave polygon area generated by some PCB models contains a plurality of redundant devices, so that the actual production requirements of the user cannot be met, and the user is required to manually adjust the concave polygon area, which is very inconvenient.
Disclosure of Invention
The invention provides a method and a device for generating a concave polygon area of an EDA model device, which solve the technical problems of low generating speed and low accuracy of the concave polygon area of the device.
In order to solve the technical problems, the technical scheme adopted by the invention is as follows:
the concave polygon area generating method of EDA model device includes the following steps, S3, obtaining a selected network, and obtaining geometric point data of the device from a mapping table through a network database of the device based on the selected network; s4, respectively merging geometric point data of all devices on the same selected network to obtain concave packets of each selected network; s5, grouping the cross relation of all the concave packets of the selected network, respectively obtaining each combined concave packet, and skipping step S9 if the combined concave packet is a single group; s6, generating and obtaining convex hulls of all selected networks based on a Graham algorithm; s7, subtracting the concave bags after combining each combination from the convex bags of all the selected networks to obtain a plurality of cutting areas; s8, sequentially obtaining two center point line segments of concave bags from all concave bags of the selected network, judging whether each center point line segment is intersected with each cutting area, and adding the cutting areas into the reserved areas if the center point line segments are intersected with each cutting area to obtain reserved areas of concave polygon areas; s9, combining the reserved area and the concave packets of all the selected networks to obtain concave polygon areas of devices in all the selected networks.
The further technical proposal is that: the method further comprises the following steps before the step S3, S1 obtains network data of devices in the integrated circuit design EDA, and builds and obtains a network database of the devices; s2, based on a network database of the device, establishing and obtaining a mapping table of the ID and the geometric point data of the device.
The further technical proposal is that: further comprising the following step after step S9, step S10 performs a small-side removing and smoothing process on the obtained concave-polygonal region to obtain a processed concave-polygonal region.
The further technical proposal is that: in step S5, performing spatial relationship judgment on all the concave packets of the selected network obtained in step S4, dividing the concave packets which are intersected with each other and indirectly intersected into the same group, performing Unite operation on the concave packets of each group, and if the number of the final groups is 1, directly skipping step S9; if a plurality of packets are obtained, the operation of step S6 is performed.
The further technical proposal is that: in step S6, geometric point data of devices contained in all selected networks are taken, and a convex hull is generated by using a Graham algorithm; in step S7, using a clipping algorithm, subtracting the concave packets obtained in step S5 after the plurality of Unite operations from the convex packets of all the networks obtained in step S6, to obtain a plurality of clipping regions to be dug, where the clipping regions are concave polygon regions.
The further technical proposal is that: the specific division of the step S8 comprises the following steps:
s801, sequentially taking two concave bags from all concave bags of the selected network each time;
s802, calculating to obtain the center points of the two concave bags and obtaining a center point line segment;
s803, judging whether the line segment of the central point is intersected with each cutting area or not;
s804, the central point line segment is intersected with the clipping region, and the clipping region is added into the reserved region;
s805 judges whether all concave packets are traversed;
and repeating the step S801 until all concave bags are traversed, obtaining all cutting areas needing to be reserved and forming a reserved area of a final concave polygon.
The further technical proposal is that: in step S801, two packets are taken in sequence from all the network packets obtained in step S5 each time;
in step S802, calculating the center points of the two concave packets, and connecting the two concave packets into a line segment to obtain a center point line segment;
in step S803, it is sequentially determined whether the center point line segment intersects with each of the clipping regions obtained in step S7; taking each side of a cutting area, checking whether the side is intersected with a central point line segment, and if the central point line segment is intersected with any side of the cutting area, intersecting the central point line segment with the cutting area; the method for judging whether the edge and the central point line segment intersect comprises the steps of firstly judging whether the edge and the central point line segment are collinear through vector cross multiplication, and judging whether the edge and the central point line segment have an intersection point through line segment endpoint coordinates if the edge and the central point line segment are collinear; if the line segment does not intersect any side of the clipping region, the center point line segment does not intersect the polygonal region;
in step S804, if the center point line segment formed by the center point line of the two pockets intersects the clipping region, it is proved that the region is sandwiched between the two disjoint pockets, and the region is reserved, and if it does not intersect, the region is discarded.
The further technical proposal is that: in step S9, the concave packet obtained in step S5 and the reserved area obtained in step S8 are subjected to Unite operation, so as to obtain a concave polygon area of the selected network.
The concave-polygon-area generating apparatus of the EDA model device comprises a memory, a processor and a computer program stored in the memory and executable on the processor, which processor implements the respective steps of the above-described concave-polygon-area generating method when executing the computer program.
The concave-polygon-area generating apparatus of an EDA model device comprises a computer-readable storage medium storing a computer program which, when executed by a processor, implements the respective steps of the concave-polygon-area generating method described above.
The beneficial effects of adopting above-mentioned technical scheme to produce lie in:
the concave polygon area generating method of EDA model device includes the following steps, S3, obtaining a selected network, and obtaining geometric point data of the device from a mapping table through a network database of the device based on the selected network; s4, respectively merging geometric point data of all devices on the same selected network to obtain concave packets of each selected network; s5, grouping the cross relation of all the concave packets of the selected network, respectively obtaining each combined concave packet, and skipping step S9 if the combined concave packet is a single group; s6, generating and obtaining convex hulls of all selected networks based on a Graham algorithm; s7, subtracting the concave bags after combining each combination from the convex bags of all the selected networks to obtain a plurality of cutting areas; s8, sequentially obtaining two center point line segments of concave bags from all concave bags of the selected network, judging whether each center point line segment is intersected with each cutting area, and adding the cutting areas into the reserved areas if the center point line segments are intersected with each cutting area to obtain reserved areas of concave polygon areas; s9, combining the reserved area and the concave packets of all the selected networks to obtain concave polygon areas of devices in all the selected networks. According to the technical scheme, based on a Graham algorithm and a cutting algorithm, a plurality of selected networks are obtained, two concave center point line segments are sequentially obtained from all the concave bags of the selected networks, whether each center point line segment is intersected with each cutting area or not is judged, if so, the cutting area is added into a reserved area to obtain a reserved area of a concave polygon area, the reserved area and all the concave bags of the selected networks are combined, a complete concave polygon area is quickly generated, and user experience is improved.
The concave-polygon-area generating apparatus of an EDA model device comprises a computer-readable storage medium storing a computer program which, when executed by a processor, implements the respective steps of the concave-polygon-area generating method described above. According to the technical scheme, based on a Graham algorithm and a cutting algorithm, a plurality of selected networks are obtained, two concave center point line segments are sequentially obtained from all the concave bags of the selected networks, whether each center point line segment is intersected with each cutting area or not is judged, if so, the cutting area is added into a reserved area to obtain a reserved area of a concave polygon area, the reserved area and all the concave bags of the selected networks are combined, a complete concave polygon area is quickly generated, and user experience is improved.
See the description of the detailed description section.
Drawings
FIG. 1 is a flow chart of a method of generating a concave polygon area of the present invention;
FIG. 2 is a flow chart of the present invention for computing a concave polygon reserved area.
Detailed Description
It is an object of the present application to provide a concave polygon area generation method based on the contour of an EDA model part network device. By constructing a mapping relation table of a network and a device, and a mapping relation table of the device and self geometric data, based on a device self contour, a Graham algorithm and a clipping algorithm, under the condition that concave bags of a plurality of networks are not intersected, a concave polygon area is rapidly generated.
The method has the advantages that the concave polygon area is generated rapidly and accurately, the concave polygon area is a precondition of an automatic concave polygon area cutting function of EDA simulation software, and the user experience of the simulation software can be improved.
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all, of the embodiments of the present application. The following description of at least one exemplary embodiment is merely exemplary in nature and is in no way intended to limit the application, its application, or uses. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present application, but the present application may be practiced in other ways other than those described herein, and persons skilled in the art will readily appreciate that the present application is not limited to the specific embodiments disclosed below.
Example 1:
as shown in fig. 1, the invention discloses a concave polygon area generating method of an EDA model device, which comprises the following steps:
s1, obtaining network data of devices in the integrated circuit design EDA, and constructing and obtaining a network database of the devices.
And reading EDA model network data and constructing a network database.
The network corresponding electronic devices, such as Trace, pin, pad, drill, via and Shape, can be supported to quickly search the ID of the device corresponding to the network through the NetID.
S2, based on a network database of the device, establishing and obtaining a mapping table of the ID and the geometric point data of the device.
And reading the device data, and establishing a mapping table of the ID and the geometric point.
And for the model device, establishing a mapping table of the ID and the model geometric point.
S3, obtaining the selected network, and obtaining geometric point data of the device from the mapping table through a network database of the device based on the selected network.
And reading the selected network NetID to obtain the geometric data.
And (3) reading the net IDs of all the selected networks for generating the concave polygon area, reading the IDs of all the devices contained in each network through the network database constructed in the step (S1), and acquiring the geometric data of all the devices according to the device IDs and the geometric point mapping table.
S4, respectively merging the geometric point data of all devices on the same selected network to obtain the concave packet of each selected network.
The geometric point data of the device forms the outline of the device.
The geometric outline of Trace in the PCB is usually a concave polygon, the outline of Trace device contained in each selected network is directly taken, and the outline is integrated with concave bags of other devices on the network to obtain the concave bags of the network.
S5, grouping the cross relation of all the concave packets of the selected network, respectively obtaining the concave packets after combination, and executing the step S10 if the concave packets are single.
Performing spatial relationship judgment on all the concave packets of the selected network obtained in the step S4, dividing the concave packets which are intersected with each other and indirectly intersected into the same group, performing Unite operation on the concave packets of each group, and directly performing the step S10 operation if the final grouping number is 1; if a plurality of packets are obtained, the operation of step S6 is performed.
The grouping of the mutually intersecting and indirectly intersecting pockets into the same group is described as follows:
for example, if the first polygon a intersects the second polygon B and the second polygon B intersects the third polygon C, the first polygon a, the second polygon B, and the third polygon C are divided into the same group.
S6, generating and obtaining convex hulls of all selected networks based on a Graham algorithm.
And taking the geometric data of all devices contained in the selected network, and generating a convex hull by using a Graham algorithm.
S7, subtracting the concave bags after combining each group from the convex bags of all the selected networks to obtain a plurality of clipping areas.
And (3) subtracting the concave bags obtained after the plurality of Unite operations obtained in the step (S5) from the convex bags of all the networks obtained in the step (S6) by using a clipping algorithm to obtain a plurality of clipping areas needing to be dug, wherein the clipping areas are concave polygon areas.
S8, sequentially obtaining two center point line segments of concave bags from all concave bags of the selected network, judging whether each center point line segment is intersected with each cutting area, and adding the cutting areas into the reserved areas if the center point line segments are intersected with each cutting area to obtain reserved areas of concave polygon areas.
As shown in fig. 2, a flowchart for computing a concave polygon reserved area is provided. The step of obtaining a concave polygon reserved area specifically comprises the following steps:
s801 takes two pockets one at a time in turn from all pockets of the selected network.
And (5) taking two concave bags from all network concave bags obtained in the step (S5) in sequence.
S802, calculating to obtain the center points of the two concave pockets and obtaining a center point line segment.
And calculating the central points of the two concave bags, and connecting the two concave bags into a line segment to obtain a central point line segment.
S803 judges whether the central point line segment intersects each clipping region.
And judging whether the central point line segment is intersected with each cutting area obtained in the step S7. The specific method is to take each side of the cutting area, check whether the side intersects with the central point line segment, if the central point line segment intersects with any side of the cutting area, then the central point line segment intersects with the cutting area. The method for judging whether the edge and the central point line segment are intersected is that firstly, whether the edge and the central point line segment are collinear is judged through vector cross multiplication, and if the edge and the central point line segment are collinear, whether the edge and the central point line segment are intersected is judged through line segment endpoint coordinates. If the line segment does not intersect any of the edges of the clipping region, then the center point line segment does not intersect the polygonal region.
S804, intersecting the central point line segment with the clipping region, and adding the clipping region into the reserved region.
Therefore, if the central point line segment formed by the central point connecting line of the two concave bags is intersected with the cutting area, the area is proved to be clamped between the two disjoint concave bags, the area is reserved, and if the two disjoint concave bags are not intersected, the area is discarded.
S805 determines whether all the concave packets have been traversed.
And repeating the step S801 until all concave bags are traversed, obtaining all cutting areas needing to be reserved and forming a reserved area of a final concave polygon.
S9, combining the reserved area and the concave packets of all the selected networks to obtain concave polygon areas of devices in all the selected networks.
And (3) performing Unite operation on the concave packet obtained in the step (S5) and the reserved area obtained in the step (S8) to obtain a concave polygon area of the selected network.
S10, removing small edges and flattening the obtained concave polygon area, and obtaining the processed concave polygon area.
And removing fine edges and smoothing the obtained concave polygon area to obtain the final result of the processed concave polygon area.
Technical contribution:
based on Graham algorithm and cutting algorithm, under the condition of supporting to select a plurality of networks, combining a plurality of concave polygon areas of disjoint networks, and rapidly generating a complete scheme of concave polygon cutting areas which accords with simulation flow.
The technical effects are as follows:
according to the method, based on the self contour of the electronic device on the PCB, and Graham algorithm and cutting algorithm, under the condition that a plurality of networks are selected by a user, concave polygon areas of the selected networks which are not intersected are combined, a complete concave polygon cutting area which accords with a simulation flow is rapidly generated, and user experience is improved.
Example 2:
the invention discloses a concave polygon area generating device of an EDA model device, comprising a memory, a processor and a computer program stored in the memory and executable on the processor, the memory and the processor forming an electronic terminal, the processor implementing the steps of embodiment 1 when executing the computer program.
Example 3:
the present invention discloses a computer-readable storage medium storing a computer program which, when executed by a processor, implements the steps of embodiment 1.
Claims (10)
1. A method for generating concave polygon area of EDA model device, which is characterized in that: s3, obtaining a selected network, and obtaining geometric point data of a device from a mapping table through a network database of the device based on the selected network; s4, respectively merging geometric point data of all devices on the same selected network to obtain concave packets of each selected network; s5, grouping the cross relation of all the concave packets of the selected network, respectively obtaining each combined concave packet, and skipping step S9 if the combined concave packet is a single group; s6, generating and obtaining convex hulls of all selected networks based on a Graham algorithm; s7, subtracting the concave bags after combining each combination from the convex bags of all the selected networks to obtain a plurality of cutting areas; s8, sequentially obtaining two center point line segments of concave bags from all concave bags of the selected network, judging whether each center point line segment is intersected with each cutting area, and adding the cutting areas into the reserved areas if the center point line segments are intersected with each cutting area to obtain reserved areas of concave polygon areas; s9, combining the reserved area and the concave packets of all the selected networks to obtain concave polygon areas of devices in all the selected networks.
2. The method for generating concave polygon area of an EDA model device of claim 1, wherein: the method further comprises the following steps before the step S3, S1 obtains network data of devices in the integrated circuit design EDA, and builds and obtains a network database of the devices; s2, based on a network database of the device, establishing and obtaining a mapping table of the ID and the geometric point data of the device.
3. The method for generating concave polygon area of an EDA model device of claim 1, wherein: further comprising the following step after step S9, step S10 performs a small-side removing and smoothing process on the obtained concave-polygonal region to obtain a processed concave-polygonal region.
4. The method for generating concave polygon area of an EDA model device of claim 1, wherein: in step S5, performing spatial relationship judgment on all the concave packets of the selected network obtained in step S4, dividing the concave packets which are intersected with each other and indirectly intersected into the same group, performing Unite operation on the concave packets of each group, and if the number of the final groups is 1, directly skipping step S9; if a plurality of packets are obtained, the operation of step S6 is performed.
5. The method for generating concave polygon area of an EDA model device of claim 1, wherein: in step S6, geometric point data of devices contained in all selected networks are taken, and a convex hull is generated by using a Graham algorithm; in step S7, using a clipping algorithm, subtracting the concave packets obtained in step S5 after the plurality of Unite operations from the convex packets of all the networks obtained in step S6, to obtain a plurality of clipping regions to be dug, where the clipping regions are concave polygon regions.
6. The method for generating concave polygon area of an EDA model device of claim 1, wherein: the specific division of the step S8 comprises the following steps:
s801, sequentially taking two concave bags from all concave bags of the selected network each time;
s802, calculating to obtain the center points of the two concave bags and obtaining a center point line segment;
s803, judging whether the line segment of the central point is intersected with each cutting area or not;
s804, the central point line segment is intersected with the clipping region, and the clipping region is added into the reserved region;
s805 judges whether all concave packets are traversed;
and repeating the step S801 until all concave bags are traversed, obtaining all cutting areas needing to be reserved and forming a reserved area of a final concave polygon.
7. The method for generating concave polygon area of an EDA model device of claim 6 wherein: in step S801, two packets are taken in sequence from all the network packets obtained in step S5 each time;
in step S802, calculating the center points of the two concave packets, and connecting the two concave packets into a line segment to obtain a center point line segment;
in step S803, it is sequentially determined whether the center point line segment intersects with each of the clipping regions obtained in step S7; taking each side of a cutting area, checking whether the side is intersected with a central point line segment, and if the central point line segment is intersected with any side of the cutting area, intersecting the central point line segment with the cutting area; the method for judging whether the edge and the central point line segment intersect comprises the steps of firstly judging whether the edge and the central point line segment are collinear through vector cross multiplication, and judging whether the edge and the central point line segment have an intersection point through line segment endpoint coordinates if the edge and the central point line segment are collinear; if the line segment does not intersect any side of the clipping region, the center point line segment does not intersect the polygonal region;
in step S804, if the center point line segment formed by the center point line of the two pockets intersects the clipping region, it is proved that the region is sandwiched between the two disjoint pockets, and the region is reserved, and if it does not intersect, the region is discarded.
8. The method for generating concave polygon area of an EDA model device of claim 1, wherein: in step S9, the concave packet obtained in step S5 and the reserved area obtained in step S8 are subjected to Unite operation, so as to obtain a concave polygon area of the selected network.
9. A concave polygon area generating apparatus of an EDA model device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized by: the processor, when executing a computer program, implements the corresponding steps in the concave-polygonal region generation method of any one of claims 1 to 8.
10. A concave polygon area generating apparatus of an EDA model device comprising a computer readable storage medium storing a computer program, characterized in that: the computer program, when executed by a processor, carries out the respective steps of the concave-polygonal region generation method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410064965.0A CN117829081A (en) | 2024-01-16 | 2024-01-16 | Concave polygon region generation method and device of EDA model device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410064965.0A CN117829081A (en) | 2024-01-16 | 2024-01-16 | Concave polygon region generation method and device of EDA model device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117829081A true CN117829081A (en) | 2024-04-05 |
Family
ID=90524068
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410064965.0A Pending CN117829081A (en) | 2024-01-16 | 2024-01-16 | Concave polygon region generation method and device of EDA model device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117829081A (en) |
-
2024
- 2024-01-16 CN CN202410064965.0A patent/CN117829081A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101525054B1 (en) | Apparatus and method for simplifing three dimensional mesh data | |
| CN108052703A (en) | Fast Collision Detection Algorithm based on hybrid hierarchy bounding box | |
| CN109086546A (en) | Signal link signal quality evaluating method, device, equipment and readable storage medium storing program for executing | |
| CN111671518B (en) | Processing and generating method and device for hip joint femoral head spherical center and computer equipment | |
| CN115409755B (en) | Map processing method and device, storage medium and electronic equipment | |
| JP2014103308A5 (en) | ||
| CN107890674A (en) | AI behaviors call method and device | |
| CN112221145A (en) | Game face model generation method and device, storage medium and electronic equipment | |
| CN110516334B (en) | Convolution calculation simulation test method and device based on hardware environment and related equipment | |
| CN111598987A (en) | Bone processing method, device, equipment and storage medium of virtual object | |
| CN111475402A (en) | Program function testing method and related device | |
| CN111738423A (en) | Method and device for compiling neural network model, storage medium and electronic equipment | |
| CN108241322A (en) | A kind of FPGA interconnection resources distribute generation method rationally | |
| CN113127697B (en) | Method and system for optimizing graph layout, electronic device and readable storage medium | |
| CN117829081A (en) | Concave polygon region generation method and device of EDA model device | |
| CN112598611A (en) | Method and device for synthesizing and identifying embossed bank card number image | |
| US7865330B2 (en) | System and method for measuring a curve of an object | |
| CN106802970B (en) | Printed circuit board layout method and system | |
| CN111382834B (en) | Confidence degree comparison method and device | |
| US8365130B2 (en) | Computer program and method for generating wire routing pattern | |
| CN112669425A (en) | Hair rendering method, hair rendering device, electronic equipment and readable storage medium | |
| CN107203916A (en) | A kind of user credit method for establishing model and device | |
| US7412359B2 (en) | Mutual immittance calculation program, mutual immittance calculation apparatus and method, and electromagnetic-field strength calculation program | |
| CN110930290A (en) | Data processing method and device | |
| CN114358291B (en) | Quantum connectivity graph cross-connection processing method, device, terminal and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |