Polygonal dot matrix calculation method, scanning device and laser equipment

Abstract

The present invention provides a polygonal dot matrix calculation method, a scanning device and a laser device, and relates to the field of laser control technology. The method uses a multi-layer polygon as a scanning trajectory, and limits the spacing distance between adjacent polygonal trajectories by a dot matrix spacing input by a user. The vertices of the polygon and the middle points on each side are scanning points. The side length of the polygon can be set to be as close to the dot matrix spacing as possible. The spacing between any two adjacent scanning points is as close to the dot matrix spacing input by the user as possible, thereby achieving uniform distribution of scanning points in the scanning area, which is more conducive to the control of laser scanning effect and heat dissipation effect, and has a good user experience.

Description

Technical Field

[0001] The present invention relates to the field of dot matrix laser technology, and in particular to a polygonal dot matrix calculation method, a scanning device and a laser device. Background Art

[0002] In recent years, the application of lasers in the medical field has gradually matured, and laser beauty has received widespread attention. Among them, the most popular dot matrix laser beauty is to use grid marking technology to mark the treatment area with pattern partitions (such as circles, squares, prisms, etc.), and use adjustable dot matrix density to fill the grid marked pattern row by row and grid by grid (such as US Patents 60 / 712358 and 61 / 720789) to perform treatment. When the grid marked pattern is a polygon, the common filling method is the border line filling algorithm, such as using "Z" or "bow" shaped line scanning filling. In the line scanning filling method, the point spacing is uneven, the edge of the graphic is prone to have highlights or shortcomings, and the line scanning filling is prone to the defect that the line spacing is controllable but the point spacing is not controllable, and uniform dot matrix filling cannot be performed. Summary of the invention

[0003] To solve the above problems, the present invention provides a polygonal lattice calculation method, including: calculating the number of polygons required to cover the lattice area according to the width, height and lattice spacing of the lattice area; calculating all vertex coordinates of each polygon according to the width, height and number and number of edges of the polygons; calculating the coordinates of all middle points on each side of each polygon according to the two vertex coordinates of each side of each polygon and the lattice spacing; merging the coordinates of all vertex coordinates with the coordinates of all middle points to obtain the coordinates of all points of the polygonal lattice.

[0004] In the embodiment of the present invention, multi-layer polygons are used as scanning trajectories, and the spacing distance between adjacent polygon trajectories is limited by the dot spacing input by the user. The vertices of the polygons and the middle points on each side are scanning points. The side length of the innermost polygon can be set to be as close to the dot spacing as possible. The spacing between any two adjacent scanning points is as close as possible to the dot spacing input by the user, thereby achieving uniform distribution of scanning points in the scanning area, which is more conducive to the control of laser scanning effect and heat dissipation effect, and has a good user experience.

[0005] Optionally, the centers of the polygons coincide, the sides are of different lengths and the corresponding sides are parallel; the coordinates of all vertices of each polygon are calculated based on the width, the height and the number of polygons and the number of sides, including: calculating the horizontal and vertical spacing between two adjacent polygons based on the width, the height and the number of polygons; calculating the left and right boundary length values ​​and the upper and lower boundary length values ​​of each polygon based on the horizontal and vertical spacing; calculating the coordinates of all vertices of each polygon based on the left and right boundary length values, the upper and lower boundary length values ​​and the number of sides of the polygon.

[0006] In the embodiment of the present invention, the left and right boundary length values ​​and the upper and lower boundary length values ​​are calculated based on the horizontal and vertical spacing, and then combined with the number of sides of the polygon, the vertex coordinates of the polygon can be determined.

[0007] Optionally, the calculating the number of polygons required to cover the dot matrix area according to the width, height and dot matrix spacing includes:

[0008] If the width Greater than the height , then the height is adopted and the lattice spacing d dot Calculate the number of polygons required to cover the dot matrix area ; The calculation formula is as follows:

[0009]

[0010] If the height Greater than the width , then the width is adopted and the lattice spacing d dot Calculate the number of polygons required to cover the dot matrix area , the calculation formula is as follows:

[0011] .

[0012] In the embodiment of the present invention, if the width is greater than the height, the height and the dot spacing are used for calculation; if the height is greater than the width, the width and the dot spacing are used for calculation. Based on the above parameter selection method, it is possible to avoid the final determined dot matrix from exceeding the range of the scanning area.

[0013] Optionally, calculating the horizontal and vertical spacings between two adjacent polygons according to the width, the height and the number of polygons includes:

[0014] If the width Greater than the height , then the height is adopted and the number of said polygons Calculate the horizontal and vertical distances between two adjacent polygons , the calculation formula is as follows:

[0015]

[0016] If the height Greater than the width , then the width is adopted and the number of said polygons Calculate the horizontal and vertical distances between two adjacent polygons , the calculation formula is as follows:

[0017] .

[0018] In the embodiment of the present invention, if the width is greater than the height, the height and the number of polygons are used for calculation; if the height is greater than the width, the width and the number of polygons are used for calculation to obtain the spacing between two adjacent polygons.

[0019] Optionally, the calculating the left and right boundary length values ​​and the upper and lower boundary length values ​​of each polygon according to the horizontal and vertical spacing includes:

[0020] The set of left and right boundary length values ​​of each polygon is , the upper and lower boundary length values ​​are ,in ; The calculation formula is as follows:

[0021]

[0022] .

[0023] The embodiment of the present invention provides a method for calculating the length values ​​of the left and right boundaries and the upper and lower boundaries of a polygon, which can accurately limit the length and width range of the polygon.

[0024] Optionally, calculating all vertex coordinates of each polygon according to the left and right boundary length values, the upper and lower boundary length values ​​and the number of sides of the polygon includes:

[0025] The x-axis coordinate set of all the vertices of the polygon , y-axis coordinate set ,in , is the number of sides of the polygon, Indicates polygon; , , used to close the polygon vertex set; the calculation formula is as follows:

[0026] when

[0027]

[0028]

[0029] when

[0030]

[0031] .

[0032] The embodiment of the present invention provides a calculation formula for all vertex coordinates of each polygon, which can realize accurate determination of vertex coordinates.

[0033] Optionally, the calculating the coordinates of all the midpoints on each side of each polygon based on the two vertex coordinates of each side of each polygon and the lattice spacing includes: calculating the length of each side according to the two vertex coordinates of each side of each polygon; calculating the number of midpoints of each side according to the length of each side and the lattice spacing; calculating the coordinates of all the midpoints on each side according to the length of each side and the number of midpoints of the corresponding side.

[0034] The embodiment of the present invention provides a method for determining all coordinates on each side length of each polygon, which can achieve accurate determination of the coordinates of the middle point.

[0035] Optionally, calculating the coordinates of all the middle points on each side of each polygon according to the coordinates of two vertices of each side of each polygon and the lattice spacing includes:

[0036] Calculate the x-direction spacing and y-direction spacing of the middle points on each side of each polygon, where the x-direction spacing set is , the y-direction spacing set is ,in , is the number of middle points distributed on the side length, Indicates polygons, k represents the kth vertex of the corresponding polygon, and j corresponds to the jth edge of the polygon; the calculation formula is as follows:

[0037]

[0038]

[0039] The coordinates of the middle points distributed on all side lengths, the x-axis coordinate set is , the y-axis coordinate set is ,in , Indicates polygons, k represents the kth edge of the corresponding polygon, and j represents the jth edge of the polygon; the calculation formula is as follows:

[0040]

[0041] .

[0042] The embodiment of the present invention provides a calculation formula for the coordinates of all the middle points on each side length, which can realize the accurate determination of the coordinates of the middle points.

[0043] Optionally, the merging of the coordinates of all the vertices with the coordinates of all the intermediate points to obtain the coordinates of all the points of the polygonal scanning lattice includes: merging the horizontal coordinate set of all the vertices with the horizontal coordinate set of all the intermediate points, combined with the number of intermediate points of each side length of each polygon, to obtain the horizontal coordinate set of all the points of the polygonal scanning lattice; merging the vertical coordinate set of all the vertices with the vertical coordinate set of all the intermediate points, combined with the number of intermediate points of each side length of each polygon, to obtain the vertical coordinate set of all the points of the polygonal scanning lattice; merging the horizontal coordinate set of all the points of the polygonal scanning lattice with the vertical coordinate set of all the points of the polygonal scanning lattice in a one-to-one correspondence to obtain the coordinates of all the points of the polygonal scanning lattice.

[0044] An embodiment of the present invention provides a polygonal dot matrix scanning device, comprising: a quantity determination module, used to calculate the number of polygons required to cover the dot matrix area according to the width, height and dot matrix spacing of the dot matrix area; a vertex coordinate calculation module, used to calculate the coordinates of all vertices of each polygon according to the width, height and the number and number of edges of the polygons; an intermediate point coordinate calculation module, used to calculate the coordinates of all intermediate points on each side of each polygon according to the two vertex coordinates of each side of each polygon and the dot matrix spacing; a coordinate merging module, used to merge the coordinates of all vertices with the coordinates of all intermediate points to obtain the coordinates of all points of the polygonal dot matrix.

[0045] An embodiment of the present invention provides a laser device, including a computer-readable storage medium storing a computer program and a processor. When the computer program is read and executed by the processor, the above-mentioned polygonal point lattice calculation method is implemented.

[0046] The polygonal dot matrix scanning device and laser equipment provided by the embodiments of the present invention can achieve the same technical effects as the polygonal dot matrix calculation method provided by the above embodiments. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on the provided drawings without paying creative work.

[0048] Figure 1 A schematic diagram of a flow chart of a polygonal point lattice calculation method provided by an embodiment of the present invention;

[0049] Figure 2 A schematic diagram of an arrangement of multiple polygons provided in an embodiment of the present invention;

[0050] Figure 3 A schematic structural diagram of a polygonal dot matrix scanning device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0051] In order to make the above-mentioned objects, features and advantages of the present invention more clearly understood, the specific embodiments of the present invention are described in detail below in conjunction with the accompanying drawings. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.

[0052] In the existing line scanning filling method, the dot spacing is uneven, the edges of the graphics are prone to have highlights or defects, and although the line spacing is controllable, the dot spacing is not controllable, and uniform dot matrix filling cannot be performed.

[0053] The embodiment of the present invention provides a polygonal lattice calculation method, which is a dedicated lattice filling algorithm. By forming a multi-layer polygon scanning trajectory, each layer of polygons has the same shape and the corresponding sides are parallel. The lattice spacing between two adjacent points (including vertices and middle points) on each side and the spacing between adjacent polygons are as close as possible to the set lattice spacing, so as to achieve uniform distribution of scanning points in the scanning area, which is more conducive to the control of laser scanning effect and heat dissipation effect. This method is applicable to various polygons and can better adapt to scanning areas of different shapes.

[0054] See also Figure 1 The flowchart of a polygonal lattice calculation method in an embodiment of the present invention is shown, and the method comprises the following steps:

[0055] S102, calculating the number of polygons required to cover the dot matrix area according to the width, height and dot matrix spacing of the dot matrix area.

[0056] The user can input scanning parameters, including the width, height, dot spacing and number of sides of the scanning area. The number of sides of the polygon needs to be greater than or equal to three, that is, it can be a triangle, square, pentagon, hexagon, etc. Optionally, which polygon to use is determined according to the shape of the actual scanning area.

[0057] Among them, the centers of the polygons coincide, the sides are unequal and the corresponding sides are parallel. Multiple polygons are concentrically arranged and of different sizes, and the sizes are determined by the above-mentioned lattice spacing. It is equivalent to reducing or enlarging according to the lattice spacing, and the corresponding sides of the reduced / enlarged polygons are parallel to the corresponding sides of the polygons before reduction / enlargement. In this embodiment, the vertices on the side length of each polygon and the middle points filled on each side length are used as scanning points. Optionally, the side length of the smallest polygon is equal to the above-mentioned lattice spacing, and there is no need to fill the middle points on its side length.

[0058] Specifically, the number of polygons required to cover the dot matrix area can be calculated based on the dot matrix spacing, width or height. If the width is greater than the height, the height and dot matrix spacing are used for calculation; if the height is greater than the width, the width and dot matrix spacing are used for calculation. Based on the above parameter selection method, it is possible to avoid the final determined dot matrix exceeding the range of the scanning area.

[0059] If the width Greater than height , then use the height And dot spacing d dot Calculate the number of polygons needed to cover the area of ​​the dot matrix ; The calculation formula is as follows:

[0060]

[0061] If the height Greater than width , then use the width And dot spacing d dot Calculate the number of polygons needed to cover the area of ​​the dot matrix , the calculation formula is as follows:

[0062] .

[0063] It should be noted that the number of the above polygons includes the center points, that is, the actual number of polygons plus the number of center points 1.

[0064] S104, calculating all vertex coordinates of each polygon based on the width, height, number of polygons, and number of sides.

[0065] Specifically, the horizontal and vertical spacing between two adjacent polygons can be calculated based on the above-mentioned width, height and the number of polygons; the left and right boundary length values ​​and the upper and lower boundary length values ​​of each polygon can be calculated based on the horizontal and vertical spacing; and all vertex coordinates of each polygon can be calculated based on the left and right boundary length values, the upper and lower boundary length values ​​and the number of edges of the polygon.

[0066] The horizontal and vertical spacing refers to the spacing between two adjacent polygons in the height direction and the width direction. When calculating specifically, if the width is greater than the height, the height and the number of polygons are used for calculation; if the height is greater than the width, the width and the number of polygons are used for calculation.

[0067] If the width Greater than height , then use the height and the number of polygons Calculate the horizontal and vertical distances between two adjacent polygons , the calculation formula is as follows:

[0068]

[0069] If the height Greater than width , then use the width and the number of polygons Calculate the horizontal and vertical distances between two adjacent polygons , the calculation formula is as follows:

[0070] .

[0071] The left and right boundary length values ​​of a polygon refer to the distance between the leftmost point and the rightmost point of the polygon along the width direction; the above boundary length value of a polygon refers to the distance between the topmost point and the bottommost point of the polygon along the height direction.

[0072] The set of left and right boundary length values ​​of each polygon is , the upper and lower boundary length values ​​are ,in ; The calculation formula is as follows:

[0073]

[0074] .

[0075] Take a regular polygon as an example. If the number of its sides is known, its center is taken as the origin of coordinates and the width direction is taken as x Axis, with the height direction as y Axis, the vertex coordinates can be calculated by the above boundary length and the angle of the vertex relative to the coordinate axis.

[0076] For example, the vertices of all polygons x Axis coordinate collection , y Axis coordinate collection ,in , is the number of sides of the polygon, Indicates polygon; , , used to close the polygon vertex set; the calculation formula is as follows:

[0077] when

[0078]

[0079]

[0080] when

[0081]

[0082] .

[0083] in, i is the number of sides of the polygon.

[0084] The above order , , its logical principle is the closed loop of polygons, which is convenient for subsequent calculations. Take a triangle as an example, it has three sides and three vertices. Let the three vertices be A, B, and C, and the three sides be AB, BC, and CA. To ensure the convenience of calculation, the most convenient way is to add an A at the end of the set to form a set of {A, B, C, A}, and the graphic is closed. It is more convenient when taking edges in increments. When the polygon scanning point matrix set is finally formed, the A at the end will be removed to avoid repeated scanning.

[0085] S106, calculating the coordinates of all the middle points on each side of each polygon according to the coordinates of the two vertices of each side of each polygon and the lattice spacing.

[0086] In this embodiment, the length of each side can be calculated by knowing the coordinates of the two vertices of each side, and then divided by the lattice spacing to obtain the number of middle points on the side, and then the length of the side is divided equally based on the number to obtain the distance between adjacent middle points, and finally the coordinates of all the middle points on the side are calculated. Exemplarily, the following steps can be performed:

[0087] First, the length of each side of each polygon is calculated based on the coordinates of the two vertices of each side;

[0088] Secondly, according to the length of each side and the spacing between the dots, the number of middle points of each side is calculated;

[0089] Then, according to the length of each side and the number of midpoints of the corresponding side, the coordinates of all midpoints on each side are calculated.

[0090] Calculate the x-direction spacing and y-direction spacing of the middle points on each side of each polygon, where the x-direction spacing set is , the y-direction spacing set is ,in , is the number of middle points distributed on the side length, Indicates polygons, k represents the kth vertex of the corresponding polygon, and j corresponds to the jth edge of the polygon; the calculation formula is as follows:

[0091]

[0092]

[0093] The coordinates of the middle points distributed on all side lengths, the x-axis coordinate set is , the y-axis coordinate set is ,in , Indicates polygons, k represents the kth edge of the corresponding polygon, and j represents the jth edge of the polygon; the calculation formula is as follows:

[0094]

[0095] .

[0096] S108, merging the coordinates of all the vertices and the coordinates of all the middle points to obtain the coordinates of all the points of the polygonal lattice.

[0097] Optionally, first, the abscissa set of all vertices and the abscissa set of all midpoints are combined with the number of midpoints of each side length of each polygon to obtain the abscissa set of all points of the polygonal lattice;

[0098] Secondly, the ordinate set of all vertices and the ordinate set of all midpoints are combined with the number of midpoints of each side length of each polygon to obtain the ordinate set of all points of the polygon lattice;

[0099] Then, the horizontal coordinate set of all points of the polygonal lattice is merged with the vertical coordinate set of all points of the polygonal lattice in a one-to-one correspondence to obtain the coordinates of all points of the polygonal lattice.

[0100] Furthermore, the lasers can be controlled to be emitted sequentially according to the coordinates of all points of the polygonal lattice.

[0101] Optionally, polygons may be selected in order from outside to inside or from inside to outside, and the vertices and middle points of each polygon may be selected in a continuous manner to control the laser to be emitted in sequence.

[0102] The polygonal dot matrix calculation method provided by the embodiment of the present invention uses multi-layer polygons as scanning trajectories, and limits the spacing distance between adjacent polygonal trajectories by the dot matrix spacing input by the user. The vertices of the polygons and the middle points on each side are scanning points. The side length of the innermost polygon can be set to be as close to the dot matrix spacing as possible. The spacing between any two adjacent scanning points is as close to the dot matrix spacing input by the user as possible, thereby achieving uniform distribution of scanning points in the scanning area, which is more conducive to the control of laser scanning effect and heat dissipation effect, and has a good user experience.

[0103] The embodiment of the present invention can form polygonal scanning dot arrays with different numbers of sides, which can better adapt to scanning areas of different shapes, avoid the inconvenience of the scanning process caused by a single dot array shape, and is more convenient for user operation.

[0104] The following is a detailed introduction to the various steps of the polygonal lattice calculation method.

[0105] S1, user sets the width of the input scanning area S x ,high S y , the number of edges of the scanned polygon n side , dot spacing d dot .

[0106] S2. Verification n side Is it greater than or equal to 3? If yes, continue to execute, otherwise report an error.

[0107] S2. Calculate the number of scaled polygons in the scan area (including the center point) .

[0108] when

[0109]

[0110] when

[0111]

[0112] In this embodiment, the centers of multiple polygons with the same number of sides overlap to form a multi-layer structure. Figure 2FIG. 2 shows a schematic diagram of the arrangement of multiple polygons in an embodiment of the present invention. Figure 2 In the figure, a regular pentagon and a regular hexagon are taken as examples respectively. For the sake of clarity, only three layers of polygons are illustrated. The actual number of polygons is much greater than three.

[0113] S3. Calculate the vertex spacing between the scaled polygons in the scan area .

[0114] when

[0115]

[0116] when

[0117]

[0118] S4. All polygons (including center points) constitute a set , the number of polygons is the same as the number of scaled polygons, so .

[0119] S5. The set of left and right boundary length values ​​of each polygon is , the upper and lower boundary length values ​​are ,in .

[0120]

[0121]

[0122] S6. Calculate the coordinates of the polygon vertices. The x-axis coordinate set of all vertices , y-axis coordinate set ,in , For collection The element number is polygon. , , used to close the set of polygon vertices without repeated calculations.

[0123] when

[0124]

[0125]

[0126] when

[0127]

[0128]

[0129] The coordinates above are based on the center of the polygon as the origin and the width direction as the x Axis, with the height direction as y axis.

[0130] S7. Calculate the length of the line connecting adjacent vertices of the polygon (i.e. the length of the side) , the length of the line connecting the adjacent vertices of all polygons is the set ,in , For collection The element number is polygons.

[0131]

[0132] S8. Calculate the number of points distributed on the lines connecting adjacent vertices of the polygon. The corresponding number of points distributed on all lines is ,in , For collection The element number is polygons.

[0133]

[0134] Among them, the symbol Represents a round-down operation, which deducts the two vertices of an edge by subtracting 1 to get the number of points including only the middle point.

[0135] S9. Calculate the distance between points on the line connecting adjacent vertices of each polygon, and its set is ,in , For collection The element number is polygons. The value of this set is the same as the set Have a mapping relationship.

[0136]

[0137] It should be noted that S9 is an omissible step. This step has the following two purposes: one is to recalculate whether the subsequent two steps are wrong; the other is that it will be used in other calculations outside this solution, and it is more convenient to calculate here.

[0138] S10, calculate the x-direction spacing and y-direction spacing of the points on the line connecting the adjacent vertices of each polygon, where the x-direction spacing set is , the y-direction spacing set is .in , For collection The element number is polygons, k is a set and The element number of the corresponding polygon is the kth vertex, and j is the set The element number of corresponds to the j-th edge of the polygon.

[0139]

[0140]

[0141] S11, the coordinates of all points distributed on the connecting line, the x-axis coordinate set is , whose y-axis coordinate set is ,in , For collection The element number is polygons, k is a set The element number of the corresponding polygon is the kth edge, j is the set The element number of corresponds to the j-th edge of the polygon.

[0142]

[0143]

[0144] S12. According to the collection Vertices and Sets Connect the points on the line in order and combine the sets Record the points and collect them With Collection Merge, similarly and Merge in sequence to form the x-axis coordinates and y-axis coordinates of all points in the filling lattice of the polygonal area.

[0145] The above-mentioned polygonal lattice calculation method of this embodiment fits the scanning trajectory into multiple layers of polygons, and the minimum polygon side length is as close to the set lattice spacing as possible. The outer polygons add scanning points on the sides according to the lattice spacing requirements. Through preliminary estimation and correction, it is ensured that the spacing between adjacent scanning points is equal to or slightly larger than the set lattice spacing; by forming a multi-layer polygonal trajectory, the lattice spacing within each side of each layer of polygons and the spacing between adjacent polygons are as close to the set lattice spacing as possible, so as to achieve uniform distribution of scanning points in the scanning area, which is more conducive to the control of laser scanning effect and heat dissipation effect, and has a good user experience.

[0146] The polygonal dot matrix calculation method of this embodiment can form a polygonal scanning dot matrix, which can better adapt to scanning areas of different shapes, avoid the inconvenience of the scanning process caused by a single dot matrix shape, and is more convenient for user operation.

[0147] The above-mentioned polygonal dot matrix calculation method of this embodiment has a stable and reliable algorithm, can realize accurate scanning point coordinate control, and can be flexibly adjusted according to actual scanning requirements, and has good applicability.

[0148] Figure 3 The present invention provides a schematic diagram of the structure of a polygonal dot matrix scanning device, which includes:

[0149] The number determination module 301 is used to calculate the number of the polygons required to cover the dot matrix area according to the width, height and dot matrix spacing of the dot matrix area;

[0150] A vertex coordinate calculation module 302, used to calculate all vertex coordinates of each polygon according to the width, the height, and the number and edges of the polygons;

[0151] The middle point coordinate calculation module 303 is used to calculate the coordinates of all the middle points on each side of each polygon according to the coordinates of the two vertices of each side of each polygon and the lattice spacing;

[0152] The coordinate merging module 304 is used to merge the coordinates of all the vertices with the coordinates of all the intermediate points to obtain the coordinates of all the points of the polygonal lattice.

[0153] The polygonal dot matrix scanning device and laser equipment provided in the embodiments of the present invention can achieve the same technical effects as the polygonal dot matrix calculation method provided in the above embodiments, and will not be described again here to avoid repetition.

[0154] Although the present invention is disclosed as above, the present invention is not limited thereto. Any person skilled in the art can make various changes and modifications without departing from the spirit and scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the scope defined by the claims.

[0155] Finally, it should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the presence of other identical elements in the process, method, article or device including the elements.

[0156] The above description of the disclosed embodiments enables those skilled in the art to implement or use the present invention. Various modifications to these embodiments will be apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present invention. Therefore, the present invention will not be limited to the embodiments shown herein, but rather to the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A polygonal lattice calculation method, characterized in that: include: Calculate the number of polygons required to cover the dot matrix area according to the width, height and dot matrix spacing of the dot matrix area; The polygon is a regular hexagon; Calculate all vertex coordinates of each polygon according to the width, the height, the number of polygons, and the number of sides; Calculate the coordinates of all the middle points on each side of each polygon according to the coordinates of two vertices of each side of each polygon and the lattice spacing; Merge the coordinates of all vertices and the coordinates of all intermediate points to obtain the coordinates of all points of the polygonal lattice; The centers of the polygons coincide, the sides are of unequal lengths and the corresponding sides are parallel; The step of calculating all vertex coordinates of each polygon according to the width, the height, the number of polygons, and the number of edges includes: Calculate the horizontal and vertical distances between two adjacent polygons according to the width, the height and the number of polygons; Calculate the left and right boundary length values ​​and the upper and lower boundary length values ​​of each polygon according to the horizontal and vertical spacing; Calculate all vertex coordinates of each polygon according to the left and right boundary lengths, the upper and lower boundary lengths and the number of sides of the polygon; The method of calculating the number of polygons required to cover the dot matrix area according to the width, height and dot matrix spacing includes: If the width Greater than the height , then the height is adopted and the lattice spacing d dot Calculate the number of polygons required to cover the dot matrix area ; The calculation formula is as follows: If the height Greater than the width , then the width is adopted and the lattice spacing d dot Calculate the number of polygons required to cover the dot matrix area , the calculation formula is as follows: Calculating the horizontal and vertical spacings between two adjacent polygons according to the width, the height and the number of polygons includes: If the width Greater than the height , then the height is adopted and the number of said polygons Calculate the horizontal and vertical distances between two adjacent polygons , the calculation formula is as follows: If the height Greater than the width , then the width is adopted and the number of said polygons Calculate the horizontal and vertical distances between two adjacent polygons , the calculation formula is as follows: The calculating the left and right boundary length values ​​and the upper and lower boundary length values ​​of each polygon according to the horizontal and vertical spacing includes: The set of left and right boundary length values ​​of each polygon is , the upper and lower boundary length values ​​are ,in ; The calculation formula is as follows: The calculating of all vertex coordinates of each polygon according to the left and right boundary length values, the upper and lower boundary length values ​​and the number of sides of the polygon includes: The x-axis coordinate set of all the vertices of the polygon , y-axis coordinate set ,in , is the number of sides of the polygon, Indicates polygon; , , used to close the polygon vertex set; the calculation formula is as follows: when when 。 2. The method according to claim 1, characterized in that: The step of calculating the coordinates of all the middle points on each side of each polygon according to the coordinates of the two vertices of each side of each polygon and the lattice spacing includes: Calculate the length of each side of each polygon according to the coordinates of the two vertices of each side; Calculate the number of middle points of each side length according to the length of each side length and the dot matrix spacing; According to the length of each side length and the number of middle points of the corresponding side length, the coordinates of all middle points on each side length are calculated.

3. The method according to claim 1, characterized in that: The step of calculating the coordinates of all the middle points on each side of each polygon according to the coordinates of the two vertices of each side of each polygon and the lattice spacing includes: Calculate the x-direction spacing and y-direction spacing of the middle points on each side of each polygon, where the x-direction spacing set is , the y-direction spacing set is ,in , is the number of middle points distributed on the side length, Indicates polygons, k represents the kth vertex of the corresponding polygon, and j corresponds to the jth edge of the polygon; the calculation formula is as follows: The coordinates of the middle points distributed on all side lengths, the x-axis coordinate set is , the y-axis coordinate set is ,in , Indicates polygons, k represents the kth edge of the corresponding polygon, and j represents the jth edge of the polygon; the calculation formula is as follows: 。 4. The method according to claim 1, characterized in that The step of combining the coordinates of all vertices with the coordinates of all intermediate points to obtain the coordinates of all points of the polygonal lattice includes: The horizontal coordinate sets of all vertices and the horizontal coordinate sets of all midpoints are combined with the number of midpoints of each side length of each polygon to obtain the horizontal coordinate set of all points of the polygonal lattice; Combine the ordinate sets of all vertices and the ordinate sets of all midpoints with the number of midpoints of each side length of each polygon to obtain a ordinate set of all points of the polygonal lattice; The horizontal coordinate set of all points of the polygonal scanning lattice is merged with the vertical coordinate set of all points of the polygonal scanning lattice in a one-to-one correspondence to obtain the coordinates of all points of the polygonal lattice.

5. A polygonal dot matrix scanning device, characterized in that: include: A quantity determination module, used for calculating the number of the polygons required to cover the dot matrix area according to the width, height and dot matrix spacing of the dot matrix area; The polygon is a regular hexagon; A vertex coordinate calculation module, used for calculating all vertex coordinates of each polygon according to the width, the height, and the number and edges of the polygons; A middle point coordinate calculation module, used for calculating the coordinates of all middle points on each side of each polygon according to the coordinates of two vertices of each side of each polygon and the lattice spacing; A coordinate merging module, used to merge the coordinates of all vertices with the coordinates of all intermediate points to obtain the coordinates of all points of the polygonal lattice; The polygonal dot matrix scanning device is used to execute the polygonal dot matrix calculation method as described in any one of claims 1-4.

6. A laser device, characterized in that: It comprises a computer-readable storage medium storing a computer program and a processor, and when the computer program is read and executed by the processor, the polygonal point lattice calculation method according to any one of claims 1 to 4 is implemented.

Images