CN117291395B - Method, device and storage medium for processing and sorting filling lines based on annular filling - Google Patents
Method, device and storage medium for processing and sorting filling lines based on annular filling Download PDFInfo
- Publication number
- CN117291395B CN117291395B CN202311359826.2A CN202311359826A CN117291395B CN 117291395 B CN117291395 B CN 117291395B CN 202311359826 A CN202311359826 A CN 202311359826A CN 117291395 B CN117291395 B CN 117291395B
- Authority
- CN
- China
- Prior art keywords
- filling
- polygon
- outer ring
- inner ring
- line
- 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.)
- Active
Links
- 238000012545 processing Methods 0.000 title claims abstract description 105
- 238000000034 method Methods 0.000 title claims abstract description 63
- 238000003860 storage Methods 0.000 title claims abstract description 11
- 238000012163 sequencing technique Methods 0.000 claims abstract description 16
- 230000033001 locomotion Effects 0.000 claims abstract description 14
- 238000012856 packing Methods 0.000 claims abstract 11
- 238000000926 separation method Methods 0.000 claims description 12
- 230000008569 process Effects 0.000 claims description 6
- 238000004590 computer program Methods 0.000 claims description 3
- 238000012937 correction Methods 0.000 abstract description 4
- 230000000694 effects Effects 0.000 description 8
- 238000004364 calculation method Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 7
- 230000000007 visual effect Effects 0.000 description 5
- 238000005266 casting Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 230000007547 defect Effects 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000018109 developmental process Effects 0.000 description 2
- 238000010330 laser marking Methods 0.000 description 2
- 230000011218 segmentation Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 238000005429 filling process Methods 0.000 description 1
- 238000002347 injection Methods 0.000 description 1
- 239000007924 injection Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000003973 paint Substances 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06316—Sequencing of tasks or work
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B23—MACHINE TOOLS; METAL-WORKING NOT OTHERWISE PROVIDED FOR
- B23K—SOLDERING OR UNSOLDERING; WELDING; CLADDING OR PLATING BY SOLDERING OR WELDING; CUTTING BY APPLYING HEAT LOCALLY, e.g. FLAME CUTTING; WORKING BY LASER BEAM
- B23K26/00—Working by laser beam, e.g. welding, cutting or boring
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/04—Manufacturing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Economics (AREA)
- General Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Game Theory and Decision Science (AREA)
- Computer Hardware Design (AREA)
- Operations Research (AREA)
- Educational Administration (AREA)
- Development Economics (AREA)
- Manufacturing & Machinery (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Quality & Reliability (AREA)
- Evolutionary Computation (AREA)
- Geometry (AREA)
- General Engineering & Computer Science (AREA)
- Optics & Photonics (AREA)
- Plasma & Fusion (AREA)
- Mechanical Engineering (AREA)
- Image Generation (AREA)
Abstract
The invention discloses a packing line processing ordering method, a device and a storage medium based on annular packing, wherein the method comprises the following steps: obtaining a vector graph of a product pattern to be processed, and determining an outer ring of an outer ring polygon and an inner ring of an inner ring polygon in the vector graph; determining a filling center point inside the inner ring polygon; taking rays along a filling center point to the outer ring direction of the outer ring polygon according to the set filling interval to obtain virtual filling lines; acquiring a real filling line from the virtual filling line; acquiring the position relation between all the intermediate polygons between the outer ring and the inner ring, and grouping all the intermediate polygons according to the position relation; setting yin-yang carving modes of the inner ring polygon, the outer ring polygon and each middle polygon in each group, and dividing a real filling line according to the yin-yang carving modes to obtain a processing filling line; and sequencing the processing filling lines in the correction range of the vibrating mirror according to the principle that the movement path of the product to be processed is minimum.
Description
Technical Field
The invention relates to the technical field of laser processing, in particular to a filling line processing ordering method, a device and a storage medium based on annular filling.
Background
In the field of large-format linkage laser processing, there is often a problem of processing consistency, which refers to the effect of laser processing, such as that the processed color difference, filling pitch, filling line width and the like are kept consistent, and the difference of the processing effect is not seen from the visual effect, so that the processed pattern or content is distorted.
In large-format linkage laser processing, when a filling line is overlong and exceeds the correction range of a vibrating mirror, if the filling line is not cut off, and the length of the filling line is smaller than the correction range, each overlong filling line is realized by matching a platform moving axis with the vibrating mirror, but the performance of the platform moving axis is far worse than that of Yu Zhenjing, so that the processing efficiency is seriously affected; if the filling line is cut off, different processing forms are caused, a visual effect of 'seam' is generated, and the problem of processing consistency occurs.
Disclosure of Invention
In order to overcome the problems in the background art, the invention aims to provide a method, a device and a storage medium for processing and sorting filling lines based on annular filling, which are based on annular filling, so as to realize annular filling of all patterns among an inner ring, an outer ring and an inner ring of a vector pattern, fully ensure that the filling lines are as short as possible, namely, the filling speed of the filling lines is improved, the processing efficiency is improved, and the processing consistency problem of the annular filling patterns is effectively reduced or even avoided.
In order to achieve the above purpose, the invention adopts the following technical scheme:
in one aspect, a method for processing and sequencing a filling line based on annular filling is provided, which comprises the following steps:
obtaining a vector graph of a product pattern to be processed, and determining an outer ring of an outer ring polygon and an inner ring of an inner ring polygon in the vector graph;
determining a filling center point inside the inner ring polygon;
taking rays along the filling center point to the outer ring direction of the outer ring polygon according to the set filling interval to obtain a virtual filling line;
acquiring a real filling line from the virtual filling line;
acquiring the position relation between all the middle polygons between the outer ring and the inner ring, and grouping all the middle polygons according to the position relation;
setting a yin-yang carving mode of the inner ring polygon, the outer ring polygon and each middle polygon in each group, and dividing the real filling line according to the yin-yang carving mode to obtain a processing filling line;
and sequencing the processing filling lines according to the principle that the movement path of the product to be processed is minimum.
Compared with the prior art, the invention has the beneficial effects that: the method realizes annular filling of the vector graphics, namely the inner ring, the outer ring and all graphics between the inner ring and the outer ring, fully ensures that the filling line is as short as possible, improves the filling speed of the filling line and improves the processing efficiency; the independence of each pattern filling line in the vector graph is ensured, so that the respective processing forms of each pattern are consistent, the visual effect of 'seam' is avoided, the processing consistency problem of the annular filling graph is effectively reduced or even avoided, and the processing pattern or content is prevented from being distorted.
In a possible embodiment, the specific step of determining the filling center point inside the inner ring polygon comprises the following steps: establishing a minimum envelope box of the inner ring polygon; judging whether the center point of the minimum envelope box is positioned in the inner ring polygon; if the center point is positioned in the inner ring polygon, taking the center point as a filling center point; and if the center point is not positioned in the inner ring polygon, determining a filling center point according to the center point by adopting a ray-guiding method.
In one possible embodiment, the specific step of determining the filling center point according to the center point by adopting the ray-casting method comprises the following steps: radial is carried out along the central point to any axial direction; acquiring all intersection points of the ray and the inner ring polygon; selecting two intersection points closest to the central point from all the intersection points; taking the midpoint of the two closest intersection points as a filling center point.
In a possible embodiment, the specific step of obtaining the dummy fill line comprises the following steps: acquiring a termination intersection point of each ray and the outer ring; and connecting the filling center point and the termination intersection point to obtain a virtual filling line.
In a possible implementation manner, when the outer ring polygon is a convex polygon, the circumference of the outer ring contour of the convex polygon is equally divided according to the filling pitch by an equally dividing point on the outer ring, and rays are taken along the filling center point to the equally dividing point, and the equally dividing point is configured to terminate the intersection point. In this way, the distance between the outermost points of the filling lines can be kept consistent, so that a better processing effect can be obtained.
In a possible implementation manner, when the outer ring polygon is a concave polygon, the filling center point is taken as a center of a circle, and the filling interval is taken as a ray according to an equal angle theta.
In one possible implementation manner, the calculation formula of θ is as follows: θ=360 °/n; where n=l/D, n represents the number of fills, L represents the outer ring contour perimeter of the concave polygon, and D represents the fill pitch.
In a possible implementation manner, the specific step of acquiring the real filling line from the virtual filling line comprises the following steps: respectively acquiring a first group of intersection points of the ray intersecting the inner ring and a second group of intersection points of the ray intersecting the outer ring, and respectively sequencing the first group of intersection points and the second group of intersection points in a direction of filling the central point along the ray outwards; judging whether line segments formed by two adjacent intersection points in the ordered first group of intersection points are positioned outside the inner ring or not, and eliminating all virtual filling lines positioned inside the inner ring; judging whether line segments formed by two adjacent intersection points in the ordered second group of intersection points are positioned in the outer ring or not, and eliminating all virtual filling lines positioned outside the outer ring;
judging whether a plurality of virtual filling lines in the outer ring are connected and collinear, configuring the connected and collinear virtual filling lines as the same real filling line, and configuring a plurality of unconnected and collinear virtual filling lines as different real filling lines.
In a possible implementation manner, the specific step of obtaining the position relation between all the intermediate polygons between the outer ring and the inner ring includes the following steps: the minimum envelope boxes are built for each middle polygon, the position relation among all the minimum envelope boxes is judged, the position relation among the polygons can be quickly and preliminarily judged, and the filling efficiency is improved; if the minimum envelope boxes are separated, the position relationship of the corresponding middle polygons in the minimum envelope boxes is also separated; if the minimum envelope boxes are not in a separation relationship, judging whether the corresponding intermediate polygons in the minimum envelope boxes are in a separation, containing or intersecting position relationship.
In a possible embodiment, the following conditions should be satisfied when all intermediate polygons are grouped according to the positional relationship: when the position relation among the intermediate polygons is separation, each intermediate polygon is respectively configured into a group; when the position relation among the intermediate polygons is contained, the intermediate polygons containing the position relation are configured into a group.
In one aspect, there is provided a fill line tooling sequencing device based on annular filling, comprising:
an inner ring and outer ring determining module: the method comprises the steps of obtaining a vector graph of a product pattern to be processed, and determining an outer ring of an outer ring polygon and an inner ring of an inner ring polygon in the vector graph;
a filling central point determining module: for determining a filling center point inside the inner ring polygon;
virtual filling line acquisition module: the virtual filling line is used for taking rays along the filling center point to the outer ring direction of the outer ring polygon according to the set filling interval;
a real filling line acquisition module: for obtaining a real filling line from the virtual filling lines;
an intermediate polygon grouping module: the method comprises the steps of acquiring the position relation between all intermediate polygons between an outer ring and an inner ring, grouping all intermediate polygons according to the position relation, and preparing for acquiring real filling line reduction calculation;
processing filling line acquisition module: the method comprises the steps of setting yin-yang carving modes of an inner ring polygon, an outer ring polygon and each middle polygon in each group, and dividing the real filling line according to the yin-yang carving modes to obtain a processing filling line;
a processing filling line sequencing module: the processing filling lines are used for sorting according to the principle of minimum path, so that the movement paths of the platform are as few as possible in large-format linkage processing, and the laser marking efficiency is improved.
In another aspect, a computer readable storage medium is provided, on which a computer program is stored, which when executed by a processor, implements the steps of the above-described fill line tooling ordering method based on ring filling.
Drawings
FIG. 1 is a flowchart showing the overall steps of a fill line processing ordering method based on ring filling in accordance with a first embodiment of the present invention;
FIG. 2 is a flowchart illustrating steps for determining a filling center point according to a first embodiment of the present invention;
FIG. 3 is a flowchart showing steps for determining a filling center point according to the center point by the injection line method in accordance with the first embodiment of the present invention;
FIG. 4 is a flowchart illustrating a step of obtaining dummy fill lines according to a first embodiment of the present invention;
FIG. 5 is a flowchart showing the steps for acquiring a true fill line according to a first embodiment of the present invention;
FIG. 6 is a flowchart illustrating a calculation step of the positional relationship between the intermediate polygons according to the first embodiment of the present invention;
FIG. 7 is a vector graphic of a pattern of a product to be processed in an example of an embodiment of the invention;
FIG. 8 is a vector diagram of filling a product pattern to be processed in a male engraving mode according to an example of an embodiment of the present invention;
FIG. 9 is a diagram showing the effect of filling pattern 1 and pattern 2 in female and male engraving modes, respectively, according to an example of the present invention;
fig. 10 is a schematic structural diagram of a filling line processing and sorting device based on annular filling according to a second embodiment of the present invention.
Detailed Description
The preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings so that the advantages and features of the present invention can be more easily understood by those skilled in the art, thereby making clear and defining the scope of the present invention.
Example 1
Referring to fig. 1, the method for sorting the processing of the filling line based on the annular filling in the first embodiment includes the following steps:
s1: and obtaining a vector graph of a pattern of a product to be processed, and determining an outer ring of an outer ring polygon and an inner ring of an inner ring polygon in the vector graph. Referring to fig. 7, fig. 7 is a vector diagram of a pattern of a product to be processed in the present embodiment, where the number (1) is an outer ring polygon in the vector diagram of the present embodiment, and the outer ring is the largest outer contour of the vector diagram, that is, the contour of the outer ring polygon, and the number (2) is an inner ring polygon in the vector diagram of the present embodiment, where the inner ring polygon can be selected according to the calculation requirement, and the inner ring is the contour of the inner ring polygon.
S2: a filling center point is defined inside the inner ring polygon. When the vector graphics are subjected to annular filling, a filling center needs to be determined, and in order to ensure that all processing patterns in the vector graphics are filled synchronously, filling omission is prevented, and the filling center needs to be ensured to be positioned in the inner ring polygon.
In one embodiment, referring to FIG. 2, the specific steps for determining the center point of fill within the interior of the inner ring polygon include the following:
s21: a minimum envelope box of the inner ring polygon is established. The complex inner ring polygon is replaced by the envelope box with simple characteristics, so that the complexity of geometric operation is reduced, and the filling center point in the inner ring polygon can be rapidly determined.
S22: and judging whether the center point of the minimum envelope box is positioned inside the inner ring polygon.
S23: if the center point is located inside the inner ring polygon, the center point is taken as a filling center point. When filling a vector pattern of a product pattern to be processed, a center point of an inner ring polygon is generally required to be used as a filling center point to realize filling of all processing patterns in the whole vector pattern, but when the inner ring polygon is a complex polygon, a large amount of geometric operations are often required for determining the center point, so that a determination process of the filling center point is not only very complex but also time-consuming, and thus the filling speed of a filling line and the processing speed of the pattern are affected.
The complex inner ring polygon is replaced by the envelope box, and the central point of the envelope box is used as the central point of the inner ring polygon and is used as the filling central point of all the processing patterns in the whole vector graph, so that the uniformity filling of all the processing patterns in the whole vector graph is convenient.
S24: if the center point is not located inside the inner ring polygon, the filling center point is determined according to the center point by adopting a ray-guiding method. Referring to fig. 3, the specific steps for determining the filling center point according to the center point by adopting the ray-casting method include the following steps:
s241: radial is carried out along the central point to any axial direction;
s242: acquiring all intersection points of the ray and the inner ring polygon;
s243: selecting two intersection points closest to the center point from all the intersection points;
s244: the midpoint of the nearest two intersection points is taken as the filling center point.
The filling center point can be rapidly determined by an ignition method, and the filling efficiency is improved.
S3: and taking rays along the outer ring direction of the outer ring polygon from the filling center point according to the set filling interval to obtain a virtual filling line. The filling pitch is the distance between two adjacent filling lines, and the filling pitch and the filling center point are known, so that rays can intersect with the outer ring along the outer ring direction by taking the filling center point in the inner ring polygon as a starting point, thereby obtaining a rough virtual filling line.
Referring to fig. 4, the specific steps for obtaining the dummy fill line include the following: s31: a termination intersection point of each ray with the outer ring is obtained (termination intersection point refers to the last intersection point with the outer ring in the ray outward direction from the filling center point). S32: and connecting the filling center point with the termination intersection point to obtain a virtual filling line.
The termination intersection point is positioned on the outer ring, and the virtual filling line segment of the vector graph can be obtained quickly by connecting the filling center point and the termination intersection point.
In some embodiments, when the outer ring polygon is a convex polygon, the outer ring contour perimeter of the convex polygon is equally divided by the filling pitch along an equal division point on the outer ring, the equal division point being a ray along the filling center point to the equal division point, the equal division point being configured to terminate the intersection point. The spacing of the end points of the filling lines on the convex polygon outer ring is kept consistent through equal division, so that the filling lines are evenly distributed, the problem of uneven distribution of the filling lines at the beginning and the end of the filling pattern is solved, and the processing effect is ensured.
For example, the convex polygon is square with a side length of 10cm, and the filling space is set to be 1cm; the circumference of the outline of the outer ring of the convex polygon, namely the circumference of the square is 40cm; starting from the filling center point to the nearest vertex of the square, equally dividing the square according to the length of 1cm of the filling interval, and working out forty equal parts on the outline of the outer ring of the square to obtain 41 equal dividing points in total, and taking rays along the filling center point to each equal dividing point to obtain 41 virtual filling lines.
In some embodiments, when the outer ring polygon is a concave polygon, rays are taken at equal angles θ from the filling pitch with the filling center point as the center.
The calculation formula of θ is as follows: θ=360 °/n;
where n=l/D, n represents the number of fills, L represents the outer ring contour perimeter of the concave polygon, and D represents the fill pitch.
Because the included angle between the filling line and the horizontal direction is gradually changed according to theta, the processing efficiency is improved and the problem of processing consistency is avoided on the premise of not changing the actual processing effect, and the method can be widely applied to the laser processing fields of film removal, paint removal, intelligent mirrors and the like.
For example, n is set as the number of filling parts of the concave polygon, then n+1 virtual filling lines are shared, if the included angle between the first filling line and the positive direction of the X axis is set as 0, then the included angle between the second filling line and the positive direction of the X axis is set as θ, … …, the included angle between the n+1 filling line and the positive direction of the X axis is n X θ, the filling center point is taken as a circle center, the terminating intersection point of the ray and the outer ring is obtained according to the equal angle θ of the filling distance D, and the virtual filling line segment of the vector graphic can be obtained by connecting the filling center point and the terminating intersection point.
S4: the real fill line is obtained from the dummy fill line. For some complex processing patterns, there are cases where part of the dummy filling lines are located outside the outer ring, so it is necessary to extract the dummy filling lines located inside the outer ring from the rough dummy filling lines first, preventing the processing to the outside of the outer ring and the inside of the inner ring during laser processing, and making the processed patterns or contents "distorted". Referring to fig. 5, the specific steps include the following:
s41: and respectively acquiring a first group of intersection points of the ray and the inner ring and a second group of intersection points of the ray and the outer ring, and respectively sequencing the first group of intersection points and the second group of intersection points in the direction of filling the central point along the ray outwards.
S42: judging whether line segments formed by two adjacent intersection points in the ordered first group of intersection points are positioned outside the inner ring or not, and eliminating all virtual filling lines positioned inside the inner ring.
S43: judging whether line segments formed by two adjacent intersection points in the second ordered group of intersection points are positioned in the outer ring or not, and eliminating all virtual filling lines positioned outside the outer ring.
The method can rapidly judge whether the line segments formed by two adjacent intersection points are positioned outside the inner ring and inside the outer ring or not by the ray-guiding method, improves the processing efficiency, ensures that all virtual filling lines are positioned inside the outer ring and outside the inner ring simultaneously, and avoids the processing to the outside of the outer ring and the inside of the inner ring during laser processing, so that the processed patterns or contents are distorted.
S44: judging whether a plurality of virtual filling lines in the outer ring are connected and collinear or not, and configuring the connected and collinear virtual filling lines as a same real filling line; the plurality of dummy fill lines that are not connected in-line are configured as distinct real fill lines.
All real filling lines are mutually independent, and the situation that the same filling line is subjected to multiple segmentation processing due to subsequent processing sequencing, so that the processing path is overlong and the processing efficiency is influenced is avoided; meanwhile, the problem that the same filling line generates a seam between the sections due to multiple segmentation processing can be prevented.
S5: and acquiring the position relations between all the intermediate polygons between the outer ring and the inner ring, and grouping all the intermediate polygons according to the position relations. Since there are many processing patterns in the vector graphics, there are intermediate polygons between the outer ring and the inner ring, and in order to ensure that each intermediate polygon can be filled in the annular filling process, the positional relationship between all the intermediate polygons needs to be calculated, so that missing filling and incorrect filling are prevented.
In some embodiments, referring to fig. 6, the specific steps for obtaining the positional relationship between all the intermediate polygons between the outer ring and the inner ring include the following:
s51: a minimum envelope box is established for each intermediate polygon.
S52: and judging the position relation among all the minimum envelope boxes.
S53: if the minimum envelope boxes are separated, the position relationship of the corresponding middle polygons in the minimum envelope boxes is also separated.
S54: if the minimum envelope boxes are not in a separation relationship, judging whether the corresponding intermediate polygons in the minimum envelope boxes are in a separation, containing or intersecting position relationship.
Since the intermediate polygons are located inside the envelope box, when the position relationship between the envelope boxes is separated, the position relationship between the corresponding intermediate polygons inside the envelope box is also necessarily separated, and when the envelope box judges whether the intermediate polygons are separated, the calculation amount can be reduced, and the filling line can be further and rapidly determined. When the positional relationship between the envelope boxes is the case of inclusion or intersection, it is necessary to further judge the positional relationship between the corresponding intermediate polygons inside the envelope boxes. If the intersecting relation exists between the middle polygons, a user can be reminded, the user can process the intersecting part according to the processing requirement, or a prompt is directly given, and the pattern of the product to be processed has problems.
When all the intermediate polygons are grouped according to the position relationship, the following conditions should be satisfied at the same time: when the position relation among the intermediate polygons is separation, each intermediate polygon is respectively configured into a group; when the position relation among the intermediate polygons is contained, the intermediate polygons containing the position relation are configured into a group.
And setting a female and male engraving mode of the pattern of the product to be processed. The male and female engraving modes comprise male engraving (embossment) and female engraving (sinking engraving), and the male engraving is characterized in that one part of the pattern is highlighted, the other part is removed and engraved shallowly, and the three-dimensional texture is high; the intaglio is to let another part of the pattern be recessed and the rest not treated. Referring to fig. 9, fig. 9 is a graph showing the processing effects of pattern 1 and pattern 2 in the female and male engraving modes.
S6: setting yin-yang carving modes of the inner ring polygon, the outer ring polygon and each middle polygon in each group, and dividing the real filling line according to the yin-yang carving modes to obtain the processing filling line. When the pattern is set as the intaglio pattern, dividing a part of the real filling line into processing filling lines of the intaglio; when the pattern is set to the relief pattern, the other part of the real filling line is divided into a relief processing filling line, and the relief pattern processing filling line form the real filling line of the whole vector pattern.
S7: and sequencing the processing filling lines according to the principle that the movement path of the product to be processed is minimum. And during laser processing, the product to be processed is driven by the motion platform to perform axial motion of X and Y axes. All processing filling lines for vector graphic annular filling are obtained through the processing in the steps S1-S7, and the motion performance of the vibrating mirror is far better than that of the platform, so that the motion path of the platform needs to be considered as short as possible in the sorting process, namely the motion path of a processed product is minimum, each processing filling line is sorted in the dynamic range of vibration mirror correction, the pattern of the product to be processed can be completely processed according to the filling lines, the laser marking efficiency can be improved, the time is saved, and the cost is reduced.
The method realizes annular filling of all patterns among the inner ring, the outer ring and the inner ring of the vector pattern, fully ensures that the filling line is as short as possible, improves the filling speed of the filling line and improves the processing efficiency; the independence of each pattern filling line in the vector graph is ensured, so that the respective processing forms of each pattern are consistent, the visual effect of 'seam' is avoided, the processing consistency problem of the annular filling graph is effectively reduced or even avoided, and the processing pattern or content is prevented from being distorted.
Referring to fig. 7 and 8, specific examples are as follows: the sequence number (1) is an outer ring polygon, the sequence number (2) is an inner ring polygon, the sequence number (3) - (d) is a middle polygon, the middle polygons (3) - (d) are divided into two groups A and B by judging the position relation between the middle polygons, wherein the group A comprises middle polygons (3) - (8), and the group B comprises middle polygons (9) -r.
The coordinates of the filling center point are: (651.89232445569155, -151.24616068935364); because the inner ring polygon and the outer ring polygon are concave polygons, the filling center point is taken as the circle center, the ray is taken as the ray according to the equal angle theta of the filling interval, the termination intersection point of the ray and the outer ring is obtained, and the virtual filling line segment of the vector graph can be quickly obtained by connecting the filling center point and the termination intersection point.
In this example, the filling pitch D is set to 5mm, the outer ring outline perimeter L of the outer ring polygon is known to be 735mm, and the following formula is adopted: n=l/D, the number of filled copies is 147, and the number of dummy filled lines is 147+1=148.
Each virtual filling line intersects with each inner ring polygon (2), each outer ring polygon (1), each of the middle polygons (3) - (8) in group A and each of the middle polygons (9) -in group B, the real filling line is determined according to the method, the yin-yang carving mode is set, and the model is shown in fig. 8, wherein fig. 8 is a vector graph filled in the yang carving mode, finally the sequence is carried out according to the principle that the motion path of a product to be processed is minimum, the processing filling lines are ordered according to 0-113, the processing sequence and the corresponding coordinate values are shown in a first table, the processing sequence and the corresponding coordinate values of the processing filling lines are shown in a second table, and SPt_ X, SPt _ Y, EPt _X and EPt _Y respectively represent the transverse coordinate values of the starting point and the ending point of the processing filling lines.
/>
/>
/>
/>
/>
Example two
Referring to fig. 10, the filling line processing and sorting device based on annular filling in this embodiment includes:
an inner ring and outer ring determining module: and the vector graph is used for acquiring the pattern of the product to be processed, and determining the outer ring of the outer ring polygon and the inner ring of the inner ring polygon in the vector graph.
A filling central point determining module: for determining a filling center point inside the inner ring polygon.
Virtual filling line acquisition module: and the virtual filling lines are obtained by taking rays along the outer ring direction of the outer ring polygon from the filling center point according to the set filling interval.
A real filling line acquisition module: for deriving a true fill line from a virtual fill line located within the outer ring.
An intermediate polygon grouping module: the method comprises the steps of acquiring the position relation between all intermediate polygons between an outer ring and an inner ring, and grouping all intermediate polygons according to the position relation;
processing filling line acquisition module: and the method is used for setting yin-yang carving modes of the inner ring polygon, the outer ring polygon and each middle polygon in each group, and dividing the real filling line according to the yin-yang carving modes to obtain the processing filling line.
A processing filling line sequencing module: the processing filling lines are used for sorting according to the principle that the platform motion path of the product to be processed is minimum.
The method comprises the steps of obtaining a vector graph of a product pattern to be processed through an inner ring and outer ring determining module, and determining an outer ring of an outer ring polygon and an inner ring of an inner ring polygon in the vector graph; determining a filling center point inside the inner ring polygon by a filling center point determination module; the virtual filling line acquisition module is used for taking rays along the outer ring direction of the outer ring polygon from the filling center point according to the set filling interval to obtain a virtual filling line; the real filling line acquisition module acquires a real filling line from the virtual filling line; the middle polygon grouping module acquires the position relations among all the middle polygons between the outer ring and the inner ring, and groups all the middle polygons according to the position relations; the processing filling line acquisition module sets a female-male carving mode of the inner ring polygon, the outer ring polygon and each middle polygon in each group, and divides the real filling line according to the female-male carving mode to obtain a processing filling line; and the processing filling line sequencing module sequences the processing filling lines according to the principle that the platform motion path of the product to be processed is minimum.
The device realizes annular filling of all patterns among the inner ring, the outer ring and the inner ring of the vector pattern, fully ensures that the filling line is as short as possible, improves the filling speed of the filling line and improves the processing efficiency; the independence of each pattern filling line in the vector graph is ensured, so that the respective processing forms of each pattern are consistent, the visual effect of 'seam' is avoided, the processing consistency problem of the annular filling graph is effectively reduced or even avoided, and the processing pattern or content is prevented from being distorted.
On the basis of the second embodiment, the specific steps of determining the filling center point inside the inner ring polygon include the following steps: establishing a minimum envelope box of the inner ring polygon; judging whether the center point of the minimum envelope box is positioned in the inner ring polygon; if the center point is positioned in the inner ring polygon, taking the center point as a filling center point; if the center point is not located inside the inner ring polygon, the filling center point is determined according to the center point by adopting a ray-guiding method.
On the basis of the second embodiment, the specific steps of determining the filling center point according to the center point by adopting the ray-casting method include the following steps: radial is carried out along the central point to any axial direction; acquiring all intersection points of the ray and the inner ring polygon; selecting two intersection points closest to the center point from all the intersection points; the midpoint of the nearest two intersection points is taken as the filling center point.
On the basis of the second embodiment, the specific steps of obtaining the dummy fill line include the following steps: acquiring a termination intersection point of each ray and the outer ring; and connecting the filling center point with the termination intersection point to obtain a virtual filling line.
On the basis of the second embodiment, when the outer ring polygon is a convex polygon, the circumference of the outer ring contour of the convex polygon is equally divided according to the filling pitch by an equal division point on the outer ring, a ray is taken from the filling center point to the equal division point, and the equal division point is configured as a termination intersection point. In this way, the distance between the outermost points of the filling lines can be kept consistent, so that a better processing effect can be obtained.
On the basis of the second embodiment, when the outer ring polygon is a concave polygon, the filling center point is used as the center of the circle, and the rays are taken according to the filling interval equal angle θ.
On the basis of the second embodiment, the calculation formula of θ is as follows: θ=360 °/n; where n=l/D, n represents the number of fills, L represents the outer ring contour perimeter of the concave polygon, and D represents the fill pitch.
On the basis of the second embodiment, the specific steps of acquiring the real filling line from the virtual filling line include the following steps: respectively acquiring a first group of intersection points of the ray and the inner ring and a second group of intersection points of the ray and the outer ring, and respectively sequencing the first group of intersection points and the second group of intersection points in a direction of filling the central point along the ray outwards; judging whether line segments formed by two adjacent intersection points in the ordered first group of intersection points are positioned outside the inner ring or not, and eliminating all virtual filling lines positioned inside the inner ring; judging whether line segments formed by two adjacent intersection points in the ordered second group of intersection points are positioned in the outer ring or not, and eliminating all virtual filling lines positioned outside the outer ring; judging whether a plurality of virtual filling lines in an outer ring are connected and collinear, configuring the connected and collinear virtual filling lines as the same real filling line, and configuring a plurality of unconnected and collinear virtual filling lines as different real filling lines.
On the basis of the second embodiment, the specific steps of obtaining the positional relationship between all the intermediate polygons between the outer ring and the inner ring include the following steps: the minimum envelope boxes are built for each middle polygon, the position relation among all the minimum envelope boxes is judged, the position relation among the polygons can be quickly and preliminarily judged, and the filling efficiency is improved; if the minimum envelope boxes are separated, the position relationship of the corresponding middle polygons in the minimum envelope boxes is also separated; if the minimum envelope boxes are not in a separation relationship, judging whether the corresponding intermediate polygons in the minimum envelope boxes are in a separation, containing or intersecting position relationship.
On the basis of the second embodiment, when all the intermediate polygons are grouped according to the position relationship, the following conditions should be satisfied at the same time: when the position relation among the intermediate polygons is separation, each intermediate polygon is respectively configured into a group; when the position relation among the intermediate polygons is contained, the intermediate polygons containing the position relation are configured into a group.
Example III
There is provided a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the above-described fill line tooling ordering method based on ring filling.
The storage medium stores program instructions capable of implementing all the methods described above, wherein the program instructions may be stored in the storage medium in the form of a software product, and include several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (processor) to perform all or part of the steps of the methods described in the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, an optical disk, or other various media capable of storing program codes, or a terminal device such as a computer, a server, a mobile phone, a tablet, or the like.
The processor may also be referred to as a CPU (Central Processing Unit ). The processor may be an integrated circuit chip having signal processing capabilities. The processor may also be:
a DSP (digital signal processor), which is a processor composed of large-scale or very large-scale integrated circuit chips for accomplishing certain signal processing tasks. It is gradually developed to meet the requirements of high-speed real-time signal processing tasks. Along with the development of integrated circuit technology and digital signal processing algorithms, the implementation method of the digital signal processor is continuously changed, and the processing functions are continuously improved and expanded.
ASIC (Application Specific Integrated Circuit ), which refers to an integrated circuit designed and manufactured to meet the requirements of a particular user and the needs of a particular electronic system.
FPGAs (field programmable gate arrays, field Programmable Gate Array) are a product of further development on the basis of programmable devices such as PALs (Programmable Array Logic ), GAL (generic array logic, general array logic) and the like. The programmable device is used as a semi-custom circuit in the field of Application Specific Integrated Circuits (ASICs), which not only solves the defect of custom circuits, but also overcomes the defect of limited gate circuits of the original programmable device.
It should be appreciated that in the above description of exemplary embodiments of the invention, various features of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be construed as reflecting the intention that: i.e., the claimed invention requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this invention.
Those skilled in the art will appreciate that the modules or units or components of the devices in the examples disclosed herein may be arranged in a device as described in this embodiment, or alternatively may be located in one or more devices different from the devices in this example. The modules in the foregoing examples may be combined into one module or may be further divided into a plurality of sub-modules.
Those skilled in the art will appreciate that the modules in the apparatus of the embodiments may be adaptively changed and disposed in one or more apparatuses different from the embodiments. The modules or units or components of the embodiments may be combined into one module or unit or component and, furthermore, they may be divided into a plurality of sub-modules or sub-units or sub-components. Any combination of all features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or units of any method or apparatus so disclosed, may be used in combination, except insofar as at least some of such features and/or processes or units are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings), may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.
Furthermore, those skilled in the art will appreciate that while some embodiments described herein include some features but not others included in other embodiments, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments. For example, in the following claims, any of the claimed embodiments can be used in any combination.
Furthermore, some of the embodiments are described herein as methods or combinations of method elements that may be implemented by a processor of a computer system or by other means of performing the functions. Thus, a processor with the necessary instructions for implementing the described method or method element forms a means for implementing the method or method element. Furthermore, the elements of the apparatus embodiments described herein are examples of the following apparatus: the apparatus is for carrying out the functions performed by the elements for carrying out the objects of the invention.
As used herein, unless otherwise specified the use of the ordinal terms "first," "second," "third," etc., to describe a general object merely denote different instances of like objects, and are not intended to imply that the objects so described must have a given order, either temporally, spatially, in ranking, or in any other manner.
While the invention has been described with respect to a limited number of embodiments, those skilled in the art, having benefit of the above description, will appreciate that other embodiments are contemplated within the scope of the invention as described herein. Furthermore, it should be noted that the language used in the specification has been principally selected for readability and instructional purposes, and may not have been selected to delineate or circumscribe the inventive subject matter. Accordingly, many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the appended claims. The disclosure of the present invention is intended to be illustrative, but not limiting, of the scope of the invention, which is defined by the appended claims.
Claims (12)
1. The filling line processing and sorting method based on annular filling is characterized by comprising the following steps of:
obtaining a vector graph of a product pattern to be processed, and determining an outer ring of an outer ring polygon and an inner ring of an inner ring polygon in the vector graph;
determining a filling center point inside the inner ring polygon;
taking rays along the filling center point to the outer ring direction of the outer ring polygon according to the set filling interval to obtain a virtual filling line;
acquiring a real filling line from the virtual filling line;
acquiring the position relation between all the middle polygons between the outer ring and the inner ring, and grouping all the middle polygons according to the position relation;
setting a yin-yang carving mode of the inner ring polygon, the outer ring polygon and each middle polygon in each group, and dividing the real filling line according to the yin-yang carving mode to obtain a processing filling line;
and sequencing the processing filling lines according to the principle that the movement path of the product to be processed is minimum.
2. The method of annular packing-based packing line tooling ordering of claim 1, wherein the specific step of determining a packing center point inside the inner ring polygon comprises the steps of:
establishing a minimum envelope box of the inner ring polygon;
judging whether the center point of the minimum envelope box is positioned in the inner ring polygon;
if the center point is positioned in the inner ring polygon, taking the center point as a filling center point; and if the center point is not positioned in the inner ring polygon, determining a filling center point according to the center point by adopting a ray-guiding method.
3. The method of annular packing-based packing line tooling ordering of claim 2, wherein the specific step of determining a packing center point from the center point using an indexing method comprises the steps of:
radial is carried out along the central point to any axial direction;
acquiring all intersection points of the ray and the inner ring polygon;
selecting two intersection points closest to the central point from all the intersection points;
taking the midpoint of the two closest intersection points as a filling center point.
4. The method of annular filling-based packing line tooling ordering of claim 1, wherein the specific steps of obtaining a dummy packing line include the steps of:
acquiring a termination intersection point of each ray and the outer ring;
and connecting the filling center point and the termination intersection point to obtain a virtual filling line.
5. The method of claim 4, wherein when the outer ring polygon is a convex polygon, dividing the outer ring contour perimeter of the convex polygon equally by an equal division point on the outer ring according to the filling pitch, and taking a ray along the filling center point to the equal division point, wherein the equal division point is configured to terminate an intersection point.
6. The method according to claim 4, wherein when the outer ring polygon is a concave polygon, the filling center point is used as a center of a circle, and the filling pitch is used as a ray according to an equal angle θ.
7. The method of annular packing-based packing line tooling ordering of claim 6, wherein the θ is calculated as: θ=360 °/n;
where n=l/D, n represents the number of fills, L represents the outer ring contour perimeter of the concave polygon, and D represents the fill pitch.
8. The method of annular fill-based packing line tooling ordering of claim 6, wherein the specific step of obtaining a true fill line from the dummy fill line comprises the steps of:
respectively acquiring a first group of intersection points of the ray intersecting the inner ring and a second group of intersection points of the ray intersecting the outer ring, and respectively sequencing the first group of intersection points and the second group of intersection points in a direction of filling the central point along the ray outwards;
judging whether line segments formed by two adjacent intersection points in the ordered first group of intersection points are positioned outside the inner ring or not, and eliminating all virtual filling lines positioned inside the inner ring;
judging whether line segments formed by two adjacent intersection points in the ordered second group of intersection points are positioned in the outer ring or not, and eliminating all virtual filling lines positioned outside the outer ring;
judging whether a plurality of virtual filling lines in the outer ring are connected and collinear, configuring the connected and collinear virtual filling lines as the same real filling line, and configuring a plurality of unconnected and collinear virtual filling lines as different real filling lines.
9. The method of processing and sorting filling lines based on ring filling according to claim 1, wherein the specific step of obtaining the positional relationship between all intermediate polygons between the outer ring and the inner ring comprises the steps of:
establishing a minimum envelope box for each of the intermediate polygons;
judging the position relation among all the minimum envelope boxes;
if the minimum envelope boxes are separated, the position relationship of the corresponding middle polygons in the minimum envelope boxes is also separated;
if the minimum envelope boxes are not in a separation relationship, judging whether the corresponding intermediate polygons in the minimum envelope boxes are in a separation, containing or intersecting position relationship.
10. The method according to claim 1 or 9, wherein the following conditions are simultaneously satisfied when all intermediate polygons are grouped according to the positional relationship:
when the position relation among the intermediate polygons is separation, each intermediate polygon is respectively configured into a group;
when the position relation among the intermediate polygons is contained, the intermediate polygons containing the position relation are configured into a group.
11. Fill line processing sorting device based on annular filling, its characterized in that includes:
an inner ring and outer ring determining module: the method comprises the steps of obtaining a vector graph of a product pattern to be processed, and determining an outer ring of an outer ring polygon and an inner ring of an inner ring polygon in the vector graph;
a filling central point determining module: for determining a filling center point inside the inner ring polygon;
virtual filling line acquisition module: the virtual filling line is used for taking rays along the filling center point to the outer ring direction of the outer ring polygon according to the set filling interval;
a real filling line acquisition module: for obtaining a real filling line from the virtual filling lines;
an intermediate polygon grouping module: the method comprises the steps of acquiring the position relation between all intermediate polygons between an outer ring and an inner ring, and grouping all intermediate polygons according to the position relation;
processing filling line acquisition module: the method comprises the steps of setting yin-yang carving modes of an inner ring polygon, an outer ring polygon and each middle polygon in each group, and dividing the real filling line according to the yin-yang carving modes to obtain a processing filling line;
a processing filling line sequencing module: and the processing filling lines are used for sorting the products to be processed according to the principle that the platform motion path of the products to be processed is minimum.
12. A computer readable storage medium, characterized in that it has stored thereon a computer program which, when executed by a processor, implements the steps of the ring-filling based filling line process sequencing method of any of claims 1-10.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311359826.2A CN117291395B (en) | 2023-10-20 | 2023-10-20 | Method, device and storage medium for processing and sorting filling lines based on annular filling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311359826.2A CN117291395B (en) | 2023-10-20 | 2023-10-20 | Method, device and storage medium for processing and sorting filling lines based on annular filling |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117291395A CN117291395A (en) | 2023-12-26 |
| CN117291395B true CN117291395B (en) | 2024-01-26 |
Family
ID=89253466
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311359826.2A Active CN117291395B (en) | 2023-10-20 | 2023-10-20 | Method, device and storage medium for processing and sorting filling lines based on annular filling |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117291395B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117610889A (en) * | 2024-01-19 | 2024-02-27 | 北京金橙子科技股份有限公司 | Self-adaptive filling and filling line ordering processing method, device and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110489778A (en) * | 2019-07-02 | 2019-11-22 | 西安电子科技大学 | Pattern dividing method, laser ablation control system towards laser ablation processing |
| CN113793351A (en) * | 2021-09-30 | 2021-12-14 | 中国人民解放军国防科技大学 | Laser filling method and device of multi-layer contour pattern based on contour line |
| CN115294235A (en) * | 2022-10-08 | 2022-11-04 | 广州中望龙腾软件股份有限公司 | Bitmap-based graphic filling method, terminal and storage medium |
| CN115937468A (en) * | 2022-12-01 | 2023-04-07 | 北京航空航天大学 | Automatic generation method for machining program of countless-module robot |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018022648A1 (en) * | 2016-07-25 | 2018-02-01 | Iteris, Inc. | Image-based field boundary detection and identification |
-
2023
- 2023-10-20 CN CN202311359826.2A patent/CN117291395B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110489778A (en) * | 2019-07-02 | 2019-11-22 | 西安电子科技大学 | Pattern dividing method, laser ablation control system towards laser ablation processing |
| CN113793351A (en) * | 2021-09-30 | 2021-12-14 | 中国人民解放军国防科技大学 | Laser filling method and device of multi-layer contour pattern based on contour line |
| CN115294235A (en) * | 2022-10-08 | 2022-11-04 | 广州中望龙腾软件股份有限公司 | Bitmap-based graphic filling method, terminal and storage medium |
| CN115937468A (en) * | 2022-12-01 | 2023-04-07 | 北京航空航天大学 | Automatic generation method for machining program of countless-module robot |
Non-Patent Citations (1)
| Title |
|---|
| 快速成形中层片填充路径的优化处理;陈青果;刘超颖;张君彩;徐安平;;煤矿机械(第10期);194-196 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117291395A (en) | 2023-12-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN117291395B (en) | Method, device and storage medium for processing and sorting filling lines based on annular filling | |
| CN111497231B (en) | 3D printing method and device, storage medium and 3D printing system | |
| CN105678683B (en) | A kind of two-dimensional storage method of threedimensional model | |
| EP0633550B1 (en) | Image processing method and apparatus thereof | |
| CN103761397A (en) | Three-dimensional model slice for surface exposure additive forming and projection plane generating method | |
| CN108122277A (en) | A kind of modeling method and device | |
| JP4679757B2 (en) | 3D graphic generation apparatus and 3D graphic generation method | |
| CN111671518B (en) | Processing and generating method and device for hip joint femoral head spherical center and computer equipment | |
| CN106652037B (en) | Face mapping processing method and device | |
| CN112270332A (en) | Three-dimensional target detection method and system based on sub-stream sparse convolution | |
| CN105243137B (en) | A kind of three-dimensional model search viewpoint selection method based on sketch | |
| CN110893686A (en) | Three-dimensional printing method and three-dimensional printing device | |
| CN113878592B (en) | Workpiece cutting method and device based on laser locating and cutting robot | |
| CN114290660A (en) | Curved surface layered 3D printing method and system | |
| CN109299556B (en) | Annular cutter path generation and optimization method based on image processing | |
| CN107037738A (en) | The material based on STL models removes algorithm in geometry Simulation of NC Machining | |
| CN116542926B (en) | Method, device, equipment and storage medium for identifying defects of two-dimension codes of battery | |
| CN117610889A (en) | Self-adaptive filling and filling line ordering processing method, device and storage medium | |
| Alexander et al. | Layered manufacturing of surfaces with open contours using localized wall thickening | |
| CN110838167A (en) | Model rendering method and device and storage medium | |
| US20070005168A1 (en) | Method and apparatus for creating textured handle packaging | |
| CN115115743A (en) | Method for filling cavity in three-dimensional reconstruction process | |
| CN114943761A (en) | Method and device for extracting center of light stripe of central line structure of FPGA (field programmable Gate array) | |
| CN113393134A (en) | Process determination method and device for numerical control multi-gang drill, electronic equipment and storage medium | |
| CN112560126A (en) | Data processing method, system and storage medium for 3D printing |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |