Uniform dotting method for planar region, electronic device, and program product

Abstract

The application relates to the technical field of point distribution, and discloses a uniform point distribution method for a planar region, an electronic device and a program product. The electronic device is used for determining a target planar region and generating a bias line according to distribution parameters, and a uniform point set is generated according to the bias line, the method can be used for processing a region with a polygon with holes, and ensures that each point is located in the region. Meanwhile, the bias line is generated according to the target planar region, and a target point set is generated according to the uniform point set generated by the bias line, so that the uniformity of the points distributed near the boundary of the target planar region is ensured during the uniform point distribution. During the generation of the target point set, all steps can be completed by the electronic device, and the automation degree during the uniform point distribution is improved.

Description

Technical Field

[0001] This invention relates to the field of point distribution technology, specifically to a method for uniformly distributing points in a planar area, electronic equipment, and software products. Background Technology

[0002] In regional planning, industrial production, scientific research, and many other fields, it is necessary to evenly distribute a given number of points within a given area. However, in practical applications, most currently popular uniform point distribution methods are only suitable for simple convex polygons. When dealing with irregular polygons, especially those containing inner rings, they often have significant limitations and struggle to handle complex scenarios in real-world engineering and scientific research. Existing point distribution techniques are primarily designed around simple convex polygons, exhibiting poor adaptability to complex shapes and inner rings. Most algorithms cannot effectively handle polygons with holes. Furthermore, existing point distribution techniques cannot guarantee sufficiently good uniformity. They typically distribute points in a region without boundaries, but for complex boundaries, uniformity at the boundary positions cannot be guaranteed. Moreover, ensuring that every point is within the region for complex polygons is itself a computationally intensive task. Existing point distribution techniques become performance bottlenecks when the number of points is extremely large and the boundaries are extremely complex. Existing solutions are often optimized for specific types of polygons, requiring users to select different algorithms based on the specific shape of the input region, and sometimes even requiring manual preprocessing, which significantly reduces the automation level of the method. Summary of the Invention

[0003] This invention provides a method for uniformly distributing dots in a planar area, an electronic device, and a program product to solve the problems of poor adaptability to complex shapes and inner rings, inability to guarantee sufficiently good uniformity, and low degree of automation in the existing technology.

[0004] In a first aspect, the present invention provides a method for uniformly distributing points in a planar region, the method comprising: Determine the target planar region and its boundary lines.

[0005] Determine the placement parameters. Placement parameters include the number of placement points and the offset step distance.

[0006] Based on the boundary lines and offset step distances, multiple offset lines are determined within the target plane region. The distance between adjacent offset lines is determined by the offset step distance.

[0007] Distribute points evenly along each offset line to create a uniform point set corresponding to the target planar region.

[0008] Generate a target point set based on the uniform point set. The target point set includes the number of points distributed in the uniform point set.

[0009] In some optional implementations, multiple offset lines within the target plane region are determined based on the boundary lines and offset step distances, including: Perform at least one round of offset operations on the target plane region to generate offset lines until no offset lines can be generated within the target plane region.

[0010] The bias operations in the current round include: For the current boundary line of the current wheel within the target plane region, offset inwards according to the offset step distance based on the current boundary line to generate the offset line corresponding to the current wheel. The current boundary line is the offset line generated by the previous round's offset operation.

[0011] If a bias line can be generated, the bias line corresponding to the current round is used as the boundary line for the bias operation in the next round.

[0012] In some optional implementations, points are evenly distributed along each offset line to create a uniform set of points corresponding to the target planar region, including: For any offset line, points are evenly distributed along the offset line according to a preset distribution distance to obtain the point set corresponding to the offset line.

[0013] The set of points corresponding to each offset line is taken as the uniform point set corresponding to the target plane region.

[0014] In some alternative implementations, generating the target point set based on a uniform point set includes: The number of candidate sites is determined based on the number of sites to be deployed. The number of candidate sites is greater than the number of sites to be deployed.

[0015] From the uniform point set, randomly select a number of candidate points to form the candidate point set.

[0016] Based on the candidate point set, generate the intermediate point set, and then determine the target point set based on the intermediate point set.

[0017] In some alternative implementations, generating an intermediate point set based on the candidate point set includes: The first point selection operation is performed iteratively on the candidate point set to generate an intermediate point set based on the number of candidate points selected from the candidate point set.

[0018] The first point selection operation includes: Among the unselected candidate points in the candidate point set, select one candidate point as the first candidate point.

[0019] Calculate the distances between the first candidate point and each of the second candidate points in the intermediate point set. The intermediate point set is initially empty.

[0020] If any one or more of the distances is less than the preset threshold, the first point selection operation is re-executed.

[0021] If all distances are greater than the preset threshold, the first candidate point is added to the intermediate point set as a new second candidate point in the intermediate point set.

[0022] If the number of candidate points in the intermediate point set is less than the number of points to be placed, the first point selection operation is repeated. If the number of candidate points in the intermediate point set is equal to the number of points to be placed, the generation of the intermediate point set is complete.

[0023] In some alternative implementations, generating an intermediate point set based on the candidate point set includes: The candidate points in the candidate point set are reordered according to the shortest path.

[0024] Perform a second point selection operation on the reordered candidate point set to generate an intermediate point set based on the number of candidate points selected from the reordered candidate point set.

[0025] In some optional implementations, a second point selection operation is performed on the reordered candidate point set to generate an intermediate point set based on the number of candidate points selected from the reordered candidate point set, including: The reordered set of candidate points is grouped according to the number of points to be placed. Each group consists of multiple candidate points arranged consecutively in the reordered set, and the number of candidate points in each group is the quotient of the total number of candidate points and the total number of points to be placed.

[0026] Perform a second point selection operation on each group in the candidate point set to generate an intermediate point set based on the candidate points selected from each group.

[0027] The second point selection operation includes: Among the candidate points in the group, select one candidate point as the third candidate point.

[0028] Calculate the distances between the first candidate point and each of the fourth candidate points in the intermediate point set. The intermediate point set is initially empty.

[0029] If any one or more of the distances is less than the preset threshold, the second point selection operation is re-executed.

[0030] If all distances are greater than the preset threshold, the first candidate point is added to the intermediate point set as the second candidate point added to the intermediate point set, and the group is marked as having been selected.

[0031] If any group within a given set is not marked as having a point taken, then a second point-taking operation is performed on that unmarked group. If all groups within a given set are marked as having a point taken, then the intermediate point set is generated.

[0032] In some optional implementations, determining the target point set based on the intermediate point set includes: The uniformity of multiple intermediate point sets is evaluated, and the multiple intermediate point sets are sorted according to the uniformity of the intermediate point sets.

[0033] The set of intermediate points with the highest uniformity is used as the target point set.

[0034] Secondly, the present invention provides a device for uniformly distributing dots in a planar area, the device comprising: The target determination module is used to determine the target planar region and the boundary line of the target planar region.

[0035] The parameter determination module is used to determine the point placement parameters. The point placement parameters include the number of points and the offset step distance.

[0036] The offset line generation module is used to determine multiple offset lines within the target plane region based on the boundary lines and offset step distance. The distance between adjacent offset lines is determined by the offset step distance.

[0037] The uniform point set generation module is used to uniformly distribute points along each offset line to create a uniform point set corresponding to the target planar region.

[0038] The target point set generation module is used to generate a target point set based on a uniform point set. The target point set includes the number of points distributed in the uniform point set.

[0039] Thirdly, the present invention provides an electronic device, comprising: a memory and a processor, wherein the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the computer instructions to perform the uniform distribution method of the planar region described in the first aspect or any corresponding embodiment.

[0040] Fourthly, the present invention provides a computer-readable storage medium storing computer instructions for causing a computer to execute the uniform distribution method of a planar region as described in the first aspect or any corresponding embodiment.

[0041] Fifthly, the present invention provides a computer program product, including computer instructions for causing a computer to execute the uniform point distribution method for a planar region as described in the first aspect or any corresponding embodiment. Attached Figure Description

[0042] To more clearly illustrate the specific embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the specific embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For those skilled in the art, other drawings can be obtained from these drawings without creative effort.

[0043] Figure 1 This is a schematic diagram of an application scenario according to an embodiment of the present invention; Figure 2 This is a schematic flowchart of a first method for uniformly distributing points in a planar region according to an embodiment of the present invention. Figure 3 This is a schematic diagram of the shape of a planar region according to an embodiment of the present invention; Figure 4 This is a schematic diagram of a second process for a uniform point distribution method in a planar region according to an embodiment of the present invention. Figure 5 This is a schematic diagram of the offset line corresponding to a planar region according to an embodiment of the present invention; Figure 6 This is a schematic diagram of a uniform point set generated by an offset line corresponding to a planar region according to an embodiment of the present invention. Figure 7 This is a schematic diagram of generating the shortest path based on a set of candidate points and selecting a set of intermediate points according to an embodiment of the present invention; Figure 8 This is a schematic diagram of constructing small polygons corresponding to each candidate point based on a set of intermediate points according to an embodiment of the present invention; Figure 9 This is a structural block diagram of a uniform point distribution device in a planar area according to an embodiment of the present invention; Figure 10 This is a schematic diagram of the hardware structure of an electronic device according to an embodiment of the present invention. Detailed Implementation

[0044] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0045] It is understood that before using the technical solutions disclosed in the various embodiments of the present invention, users should be informed of the types, scope of use, and usage scenarios of the personal information involved in the present invention and their authorization should be obtained in accordance with relevant laws and regulations through appropriate means.

[0046] The terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of this invention, "a plurality of" means two or more, unless otherwise explicitly specified.

[0047] As an optional application scenario of this invention, such as Figure 1 As shown, the uniformly distributed point system in this planar area may include at least one terminal device and at least one server. Figure 1 The system is illustrated in the example, which includes a computer 101, a mobile terminal 102, and a server 103, and the terminal devices such as the computer 101 and the mobile terminal 102 are connected to the server 103 through a network 110.

[0048] Specifically, the terminal device can be a smartphone, tablet, laptop, PDA, desktop computer, game console, smart TV, smart wearable device, in-vehicle terminal, VR (Virtual Reality) device, AR (Augmented Reality) device, etc. Server 103 can be a standalone physical server, a server cluster, a distributed system, or a cloud server providing cloud services. Network 110 can be a wired or wireless network, examples of which include, but are not limited to, the Internet, corporate intranet, local area network, wide area network, mobile communication network, and combinations thereof.

[0049] This invention provides a method for uniform point distribution over a planar region. An electronic device determines the target planar region and point distribution parameters, generates an offset line, and then distributes points uniformly according to the offset line to generate a uniform point set. This method can handle polygons with holes and ensures that each point is located within the region. Simultaneously, the target point set is generated by corresponding to the uniform point set, guaranteeing the uniformity of the boundaries during uniform point distribution. In this method for uniform point distribution over a planar region, users are not required to select different algorithms based on the specific shape of the input region or to perform manual preprocessing, thus improving the automation level of the uniform point distribution process.

[0050] According to an embodiment of the present invention, a method for uniformly distributing points in a planar area is provided. It should be noted that the steps shown in the flowchart in the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions. Furthermore, although a logical order is shown in the flowchart, in some cases, the steps shown or described may be executed in a different order than that shown here.

[0051] This embodiment provides a method for uniformly distributing dots in a planar area, which can be used in the aforementioned terminal devices, such as computers, mobile phones, and tablet computers. Figure 2 This is a flowchart of a method for uniformly distributing points in a planar region according to an embodiment of the present invention, such as... Figure 2 As shown, the process includes the following steps: Step S201: Determine the target planar region and the boundary line of the target planar region.

[0052] When placing points in a planar area, the target planar area needs to be determined first. The target planar area can be an entire region or a region manually drawn by the user. In this embodiment, the target planar area can be a simple convex polygon, a complex convex polygon, or a polygon with holes, such as... Figure 2 As shown. After determining the target planar region, its boundary lines can be determined. In practical applications, there is usually only one boundary line. However, when the target planar region is a polygonal plane with holes, there can be multiple boundary lines, for example, in... Figure 2 In the polygon with holes shown, the boundary lines are red lines. There are three in total: one outer boundary line and two inner boundary lines. Figure 2 Both inner boundary lines are circular.

[0053] Step S202: Determine the point placement parameters. The point placement parameters include the number of points and the offset step distance.

[0054] After determining the target planar region and its corresponding boundary line, it is necessary to determine the corresponding point placement parameters. Alternatively, the point placement parameters can be determined before determining the target planar region and its corresponding boundary line. In this embodiment, the point placement parameters can be preset default values ​​or manually input by the user. The point placement parameters include the number of points and the offset step distance. The number of points is the number of points to be placed in the corresponding target planar region, while the offset step distance can be a fixed value used to translate (i.e., offset) the distance when the outer boundary line of the original region (i.e., the target planar region) is translated inward and / or the inner boundary line is translated outward.

[0055] In this embodiment, the point layout parameters may also include the diameter of the detection ball, that is, the diameter of the probe head during the CMM (Coordinate Measuring Machine) detection process. After obtaining the diameter of the detection ball, the offset step distance can be made to be the diameter of the detection ball. When the diameter of the detection ball is used as the offset step distance, the outermost offset line can be made to be the path that the center of the detection ball can reach.

[0056] Step S203: Based on the boundary lines and offset step distances, determine multiple offset lines within the target plane region. The distance between adjacent offset lines is determined by the offset step distance.

[0057] After determining the boundary line and offset step distance of the target planar region, the outer boundary line of the target planar region can be offset inward to generate an offset line adjacent to the outer boundary. The distance between this offset line and the boundary is determined by the offset step distance. Simultaneously, the offset line is continued to be offset inward, generating multiple offset lines sequentially within the target planar region until the minimum distance between any point on the offset line and the inner boundary line is less than the offset step distance. A similar method can be used to offset the inner boundary line outward until the minimum distance between any point on the offset line and the outer boundary line is less than the offset step distance. Alternatively, offsets can be performed simultaneously, generating both offset lines offset outward from the inner boundary and offset lines offset inward from the outer boundary, until no further offset lines can be generated. This method can determine one or more offset lines corresponding to the target planar region, and all generated offset lines are within the target planar region; furthermore, the spacing between the offset lines is the offset step distance, ensuring a uniform distribution of the offset lines.

[0058] Step S204: Distribute points evenly along each offset line to create a uniform point set corresponding to the target planar region.

[0059] As mentioned earlier, the generated offset lines are all within the target plane area. The points obtained by uniformly distributing points according to the offset lines are also all within the target plane area. By obtaining the points obtained along each offset line, the corresponding uniform point set within the plane area can be obtained. In this embodiment, the points can be uniformly distributed along the offset lines according to a preset distance value, or the points can be uniformly distributed according to the distance value input by the user. This embodiment does not limit the method.

[0060] Step S205: Generate a target point set based on the uniform point set. The target point set includes the number of points distributed in the uniform point set.

[0061] After determining the uniform point set, a number of points can be randomly selected from the uniform point set to form the target point set. In this embodiment, the points in the uniform point set can be labeled or numbered. For example, if there are 10,000 points in the uniform point set, and a target point set with 10 points (i.e., a point quantity of 10) needs to be generated from the 10,000 points, then the points in the uniform point set are numbered. The computer randomly selects 10 numbers from 1 to 10,000, and outputs the set of points corresponding to the 10 numbers as the target point set.

[0062] For example, in the process of CMM inspection, it is necessary to measure the flatness of a plane. It is necessary to uniformly distribute points on the plane and use the positions corresponding to the uniform distribution points as sampling positions to ensure that the sampling positions can uniformly cover the entire plane. At this time, the uniform distribution method of the plane region provided in the embodiment of the present invention can be used. The plane to be measured is input as the target plane region, a target point set is generated, the target point set is used as the sampling position of the plane, and CMM is used to detect the sampling position of the plane to determine the flatness of the plane.

[0063] This invention provides a method for uniformly distributing points over a planar region. An electronic device determines the target planar region and distribution parameters to generate an offset line. Based on the offset line, a uniform point set is generated through uniform point distribution. This method can handle regions with perforated polygons and ensures that each point is located within the region. Simultaneously, by generating an offset line for the target planar region and correspondingly generating a target point set from the uniform point set generated by the offset line, the uniformity of point distribution near the boundary of the target planar region is guaranteed during uniform point distribution. All steps in generating the target point set can be completed by a computer, improving the automation level of the uniform point distribution process.

[0064] This embodiment provides a method for uniformly distributing dots in a planar area, which can be used in the aforementioned terminal devices, such as computers, mobile phones, and tablet computers. Figure 4 This is a flowchart of a method for uniformly distributing points in a planar region according to an embodiment of the present invention, such as... Figure 4 As shown, the process includes the following steps: Step S401: Determine the target planar region and the boundary line of the target planar region.

[0065] Please see details Figure 2 Step S201 of the illustrated embodiment will not be described again here.

[0066] Step S402: Determine the point placement parameters. The point placement parameters include the number of points and the offset step distance.

[0067] Please see details Figure 2 Step S202 of the illustrated embodiment will not be described again here.

[0068] Step S403: Perform at least one round of offset operation on the target plane region to generate offset lines until no offset lines can be generated within the target plane region.

[0069] During the offsetting process in the target planar region, multiple rounds of offsetting operations can be performed to ensure that the distance between any two generated offset lines is equal to the offset step distance, until the target planar region is filled with offset lines, meaning that offset lines can no longer be generated according to the offset step distance. For example, in the case of... Figure 3When the target plane shown simultaneously generates offset lines obtained by offsetting from the inner boundary outwards and offset lines obtained by offsetting from the outer boundary inwards, Figure 5 The blue line is based on Figure 3 As an offset line generated for the target plane region.

[0070] Specifically, the bias operation of the current round includes steps S4031 and S4034.

[0071] Step S4031: For the current boundary line of the current wheel within the target plane region, offset inward according to the offset step distance based on the current boundary line to generate the offset line corresponding to the current wheel. The current boundary line is the offset line generated by the previous offset operation.

[0072] In the initial state, i.e., during the first round of bias operations, no bias lines are generated. The current boundary line is the boundary line corresponding to the target plane region. If one or more bias lines have already been generated, the current boundary line is the bias line generated in the previous round. During the biasing process, biasing needs to be performed within the target plane region according to the bias step size, i.e., biasing towards the side of the first bias line away from the corresponding boundary. For example, when generating a bias line inward from the outer boundary, the bias direction is away from the outer boundary and inward; conversely, when biasing outward from the inner boundary, the bias direction is away from the inner boundary and outward.

[0073] In practice, the offset line generated in the previous round can be used directly as the boundary line of the new target plane region, and the corresponding offset line can be obtained by offsetting the new target plane region.

[0074] Step S4032: Determine whether an offset line can be generated within the already generated offset line in the target plane region.

[0075] Step S4033: If an offset line can be generated, use the offset line corresponding to the current round as the boundary line for the offset operation in the next round. That is, execute step S4031 again.

[0076] Step S4034: If offset lines cannot be generated, perform offset operations on the target plane region to determine one or more offset lines in the target plane region.

[0077] After generating offset lines in the current round, it's necessary to determine whether the next offset line can be generated. For example, this can be done by checking if the minimum distance between points on each offset line and other offset lines is greater than the offset step size. If offset lines can be generated within the target plane region (i.e., if any minimum distance between points on each offset line and other offset lines is greater than the offset step size), the offset lines generated in the current round are used as the current boundary lines for the next round of offset operations. If offset lines cannot be generated (i.e., if all minimum distances between points on each offset line and other offset lines are less than the offset step size), then offset lines cannot be generated further. In this case, the offset lines generated in each round of offset operations are used as the offset results to determine all offset lines within the target plane region.

[0078] Step S404: Distribute points evenly along each offset line to create a uniform point set corresponding to the target planar region.

[0079] In some optional implementations, step S404, "uniformly distributing points along each offset line to create a uniform point set corresponding to the target planar region," includes steps a1 and a2.

[0080] Step a1: For any offset line, distribute points evenly along the offset line according to a preset point spacing to obtain the point set corresponding to the offset line.

[0081] Step a2: The set of points corresponding to each offset line is taken as the uniform point set corresponding to the target plane region.

[0082] For an offset line, a point can be randomly selected on the offset line as the first placement point and recorded. Following a predetermined direction, such as clockwise, a second placement point is determined on the offset line based on the first placement point. The distance between the second placement point and the first placement point is a preset placement distance. This process is repeated, recording the second placement point as a new first placement point and determining a new second placement point based on the placement distance. When the position of the second placement point is between any two previously recorded adjacent first placement point positions (i.e., the distance between the second placement point and any two adjacent first placement points is less than the placement distance), the uniform placement of points on this offset line is complete. After uniform placement of points on all offset lines, the point sets corresponding to the first placement points of each offset line are aggregated to obtain the uniform point set corresponding to the target planar region.

[0083] During uniform point placement, the point spacing can be a preset spacing or a spacing generated based on the offset step size. For example, the point spacing can be 1.2 times the offset step size. (See below.) Figure 6 As shown, Figure 6 The yellow dot is the basis. Figure 5 The uniform point set corresponding to the target plane region generated by the blue offset line.

[0084] Step S405: Generate a target point set based on the uniform point set. The target point set includes the number of points distributed in the uniform point set.

[0085] In some alternative implementations, step S405 “generating a target point set based on a uniform point set” includes steps b1 to b3.

[0086] Step b1: Determine the number of candidate points based on the number of designated points. The number of candidate points is greater than the number of designated points.

[0087] In the process of generating the target point set based on the uniform point set, a preliminary selection can be performed first, that is, the number of candidate points is determined based on the number of points. In this embodiment, the process of determining the number of candidate points based on the number of points can be to increase the number of points by a certain level (e.g., powers of 2, such as powers of 5). For example, when the number of points is 30, the number of candidate points can be set to 30×25=960, or 30×26=1920.

[0088] Step b2: Randomly select a number of candidate points from the uniform point set to form a candidate point set.

[0089] After obtaining the number of candidate points, a number of points corresponding to the number of candidate points can be randomly selected from the uniform point set as the candidate point set. For example, if there are 10,000 points in the uniform point set and the number of candidate points is 960, then 960 points can be randomly selected without repetition from the 10,000 points in the uniform point set as the candidate point set.

[0090] Step b3: Generate an intermediate point set based on the candidate point set, and determine the target point set based on the intermediate point set.

[0091] Randomizing the candidate point set again generates a smaller set of intermediate points, which can then be used to determine the target point set. In steps b2 and b3, two randomizations—randomizing the candidate point set from the uniform point set and then randomizing the intermediate point set from the candidate point set—ensure the randomness of the randomly generated intermediate point set. This, to some extent, guarantees the uniformity of the target point set determined by the intermediate point set within the target planar region. Furthermore, when multiple intermediate point sets need to be generated from the uniform point set, randomization can be performed using a smaller candidate point set, ensuring the processing speed of the randomization process.

[0092] In some alternative implementations, step b3, “generating an intermediate point set based on the candidate point set,” includes step b31.

[0093] Step b31: Repeatedly perform the first point selection operation on the candidate point set to generate an intermediate point set based on the number of candidate points selected from the candidate point set.

[0094] During the generation of the intermediate point set, the first point-taking operation can be performed cyclically according to the number of points to be placed, and the points taken out can be recorded. The points taken out can be added to the intermediate point set. When the number of points in the intermediate point set is the same as the number of points to be placed, the generation of the intermediate point set is completed.

[0095] Specifically, the first point-taking operation includes steps b311 to b315.

[0096] Step b311: Select one candidate point from the unselected candidate points in the candidate point set as the first candidate point.

[0097] Since duplicate points cannot appear in the intermediate point set, a candidate point needs to be randomly selected from the unselected candidate points in the candidate point set. The unselected candidate point is the point that was not selected in the previous first point selection operation.

[0098] Step b312: Calculate the distances between the first candidate point and each of the second candidate points in the intermediate point set. The intermediate point set is initially empty.

[0099] After randomly selecting a first candidate point in the first point-taking operation, the distance between the first candidate point and each second candidate point in the intermediate point set is calculated. The second candidate points in the intermediate point set are the points selected and recorded in the previous first point-taking operation. It can be understood that if the first point-taking operation is currently being performed and there are no second candidate points in the intermediate point set (i.e., the intermediate point set is not empty), the calculation step can be skipped, or the distance can be set to infinity, and the subsequent step b314 can be executed directly.

[0100] Step b313: If any one or more of the distances is less than the preset threshold, then the first point selection operation is re-executed.

[0101] Since this embodiment of the invention requires uniform distribution of points across the target planar region, it is necessary to ensure that the selected points (i.e., the points in the target point set generated from the intermediate point set) have a certain distance from each other. Therefore, it is necessary to determine the distance between each point, and this determination process can be performed during point selection. If the distance between the first candidate point and at least one second candidate point in the intermediate point set is less than a preset threshold, it is determined that the distance between the first candidate point and the second candidate point selected this time is too close, indicating that the point selection is unreasonable (poor uniformity). In this case, the first candidate point selected this time is discarded, and points are selected again through the first point selection operation. The preset threshold can be a value input by the user, or it can be calculated based on the relationship between the area of ​​the target planar region and the number of selected points. For example, the preset threshold D can be calculated using the following formula: .

[0102] Where S is the area of ​​the target planar region, and N is the number of points.

[0103] Step b314: If all distances are greater than the preset threshold, the first candidate point is added to the intermediate point set as a new second candidate point in the intermediate point set.

[0104] If all distances are greater than the preset threshold, that is, the distances between the first candidate point selected this time and the second candidate point in the intermediate point set are relatively large, it indicates that the first candidate point selected this time is reasonable (good uniformity). At this time, the first candidate point can be added to the intermediate point set as a new second candidate point.

[0105] In step b315, if the number of candidate points in the intermediate point set is less than the number of points to be placed, the first point selection operation is executed again. If the number of candidate points in the intermediate point set is equal to the number of points to be placed, the generation of the intermediate point set is complete.

[0106] After adding a second candidate point to the intermediate point set in step b314, the number of candidate points in the intermediate point set will increase by one. At this point, it is necessary to check the number of second candidate points in the intermediate point set. If the number of second candidate points in the intermediate point set is less than the number of points to be placed, it means that the points in the current intermediate point set are insufficient to determine the target point set corresponding to the number of points to be placed. In this case, the first point selection operation needs to be repeated. If the number of second candidate points in the intermediate point set is equal to the number of points to be placed, it means that the points in the current intermediate point set can determine the target point set corresponding to the number of points to be placed. At this point, the first point selection operation can be ended, and the generation of the intermediate point set is completed.

[0107] It is easy to see that during each first point selection operation, the number of second candidate points added to the intermediate point set is at most 1 and at least 0, so there will be no situation where the number of second candidate points in the intermediate point set is greater than the number of points to be placed.

[0108] In some alternative implementations, in addition to implementing step b3 based on step b31, step b3 can also be implemented based on steps b32 and b33. That is, step b31 can be replaced by steps b32 and b33, in which case step b3 includes steps b32 and b33.

[0109] Step b32: Reorder the candidate points in the candidate point set according to the shortest path.

[0110] After obtaining the candidate point set, the candidate points in the candidate point set can be reordered. In this embodiment, the simulated annealing algorithm can be used to calculate the shortest path connecting all candidate points, and the candidate points can be reordered according to the shortest path. It can be understood that after reordering according to the shortest path, the distance between two adjacent candidate points is relatively short, and multiple adjacent candidate points are concentrated in a certain area of ​​the target plane region. Step b33, perform the second point selection operation on the reordered candidate point set to select the number of candidate points to place in the reordered candidate point set, and generate the intermediate point set.

[0111] After reordering, candidate points can be selected from the reordered set to generate an intermediate point set. During the selection process, selection can be done by region; for example, the target plane area can be divided into regions corresponding to the number of points, and then one point can be selected from each region as a candidate point. After selection, the set of candidate points can be used as the intermediate point set, or the selection can be performed according to the second point selection operation. Figure 7 As shown, Figure 7 The black line in the diagram represents the shortest path, and Figure 7 The red dots in the diagram represent the set of intermediate points selected from the candidate point set.

[0112] In some alternative implementations, step b33, “perform a second point selection operation on the reordered set of candidate points,” includes steps b331 and b332.

[0113] Step b331: Group the reordered candidate point set according to the number of points to be placed. Each group consists of multiple candidate points arranged consecutively in the reordered candidate point set, and the number of candidate points in each group is the quotient of the total number of candidate points and the total number of points to be placed.

[0114] When using the second point selection operation, the reordered candidate point set needs to be grouped first, and the entire candidate point set needs to be divided into groups based on the number of points. The relationship between the number of candidate points *m* in each group, the total number of candidate points *M*, and the total number of points *N* is *m* = *M* / *N*. Here, the total number of candidate points is the number of candidate points within the candidate point set. For example, if the total number of candidate points *M* is 960 and the total number of points *N* is 30, then the number of candidate points *m* in each group is 32, resulting in 30 groups (i.e., the number of groups is also the number of points). If *m* is not an integer, it can be rounded up and down alternately. For example, if *m* is 16.8, the number of candidate points in the first group is 17, the number of candidate points in the second group is 16, the number of candidate points in the third group is 17, the number of candidate points in the fourth group is 16, and so on. In actual operation, since the total number of candidate points *M* is the result of amplifying the number of points *N* in step b1 according to a series, cases where *m* is not an integer are generally unlikely.

[0115] In the specific implementation process, an identifier, such as a number, can be added to each candidate point in the reordered candidate point set. As mentioned earlier, multiple adjacent candidate points are concentrated in a certain area of ​​the target planar region. When grouping, they can be grouped according to the identifier. For example, if the number of candidate points in each group is 32, then points 1 to 32 are grouped into one group, points 33 to 64 are grouped into another group, and so on.

[0116] Step b332: Perform a second point selection operation on each group in the candidate point set to generate an intermediate point set based on the candidate points selected from each group.

[0117] After grouping, a second point selection operation can be performed on each group of the candidate point set. It's understandable that, since the number of points is the same as the number of groups, one candidate point is selected from each group. The point set generated from the candidate points selected in each group becomes the intermediate point set. Furthermore, as mentioned earlier, multiple adjacent candidate points tend to converge on a specific area within the target planar region. Therefore, selecting one point from each group allows for a faster and more even generation of the corresponding intermediate point set.

[0118] Specifically, step b332, "perform the second point selection operation on each group in the candidate point set", includes steps b3321 to b3325.

[0119] Step b3321: Select one of the candidate points in the group as the third candidate point.

[0120] During the second point selection operation in this round, one candidate point is randomly selected from the candidate points in a single group as the third candidate point. This group needs to be a group of candidate points that have not been selected. In step b3325, these groups of candidate points that have not been selected can be groups that have not been marked as having been selected.

[0121] Step b3322: Calculate the distances between the third candidate point and each of the fourth candidate points in the intermediate point set. The intermediate point set is initially empty.

[0122] In step b3323, if any one or more of the distances is less than the preset threshold, the second point selection operation is re-executed.

[0123] Similarly, after selecting a third candidate point each time, it is necessary to ensure that the distance between the third candidate point and each of the already selected fourth candidate points (i.e., the points in the intermediate point set) is greater than a certain threshold to ensure the uniformity of the point distribution. If the distance between the third candidate point and a certain already selected fourth candidate point is less than the threshold, it is determined that the selection of the third candidate point in this instance is unreasonable, and the selected third candidate point needs to be discarded, and the second point selection operation should be re-executed for the current group.

[0124] In step b3324, if all distances are greater than the preset threshold, the third candidate point is added to the intermediate point set as the newly added fourth candidate point in the intermediate point set, and the group is marked as having been selected.

[0125] If the distance between the third candidate point and a previously selected fourth candidate point is less than a threshold, then the selection of the third candidate point is deemed reasonable, and this third candidate point can be used as the fourth candidate point in the intermediate point set. Since multiple candidate points cannot be selected within the same group, in this step, a marker state needs to be added to the group that has completed the selection of candidate points for subsequent steps to determine the current state of the group.

[0126] Step b3325: If any group in each group is not marked as having a point taken, then perform a second point taking operation on the group that is not marked as having a point taken. If all groups in each group are marked as having a point taken, then the generation of the intermediate point set is complete.

[0127] As mentioned earlier, since the number of points is the same as the number of groups, one candidate point is selected from each group. The set of points generated from the candidate points selected in each group is the intermediate point set. Therefore, if a group with selected candidate points is marked, but some groups are not marked, it means that one or more groups have not yet had candidate points selected. At this point, the corresponding number of intermediate point sets cannot be generated. Therefore, a second point selection operation needs to be performed on the groups that are not marked as having selected points, until all groups are marked as having selected points. In this case, it means that a candidate point has been selected in each group in the candidate point set and added to the intermediate point set. At this point, the number of candidate points in the intermediate point set is the number of points, and the generation of the intermediate point set can be completed.

[0128] In some alternative implementations, step b3, “determining the target point set based on the intermediate point set,” includes steps b34 and b35.

[0129] Step b34: Evaluate the uniformity of multiple intermediate point sets and sort the multiple intermediate point sets according to the uniformity corresponding to the intermediate point sets.

[0130] Step b35: Select the set of intermediate points with the highest uniformity as the target point set.

[0131] It is understandable that the process of generating intermediate point sets based on candidate point sets in step b3 can be executed multiple times, resulting in multiple intermediate point sets. In this case, it is necessary to evaluate the uniformity of multiple intermediate point sets, and then sort the uniformity of the multiple intermediate point sets, using the intermediate point set with the highest uniformity as the final output target point set. In this embodiment, the evaluation can be performed using the Thiessen polygon method, such as... Figure 8 As shown, using each candidate point in the intermediate point set as the center, small polygons corresponding to each candidate point are constructed according to the Thiessen polygon construction rules. By calculating the ratio of the area of ​​each polygon to the average area, and calculating the variance σ² based on each ratio, the variance σ² can be used as a value for uniformity, where a smaller σ² indicates better uniformity. In actual operation, multiple intermediate point sets can be generated, and the σ² corresponding to each intermediate point set can be calculated. The intermediate point set with the smallest σ² is output as the target point set. Alternatively, a threshold for σ² can be set, and the process of generating intermediate point sets based on the candidate point sets in step b3 can be repeated until the σ² corresponding to a certain intermediate point set is less than the preset threshold. The intermediate point set generated at this time is the intermediate point set with the highest uniformity, and this intermediate point set is output as the target point set.

[0132] This embodiment also provides a uniform distribution device for a planar area, which is used to implement the above embodiments and preferred embodiments; details already described will not be repeated. As used below, the term "module" can refer to a combination of software and / or hardware that performs a predetermined function. Although the device described in the following embodiments is preferably implemented in software, hardware implementation, or a combination of software and hardware, is also possible and contemplated.

[0133] This embodiment provides a device for uniformly distributing dots in a planar area, such as... Figure 9 As shown, it includes: The target determination module 901 is used to determine the target planar region and the boundary line of the target planar region.

[0134] The parameter determination module 902 is used to determine the point placement parameters. The point placement parameters include the number of points and the offset step distance.

[0135] The offset line generation module 903 is used to determine multiple offset lines within the target plane region based on the boundary lines and the offset step distance. The distance between adjacent offset lines is determined by the offset step distance.

[0136] The uniform point set generation module 904 is used to uniformly distribute points along each offset line to create a uniform point set corresponding to the target planar region.

[0137] The target point set generation module 905 is used to generate a target point set based on a uniform point set. The target point set includes the number of points distributed in the uniform point set.

[0138] In some alternative implementations, the bias line generation module 903 includes: The bias submodule is used to perform at least one round of bias operations on the target planar region to generate bias lines until no bias lines can be generated within the target planar region.

[0139] Specifically, the bias operation for the current round includes: For the current boundary line of the current wheel within the target plane region, offset inwards according to the offset step distance based on the current boundary line to generate the offset line corresponding to the current wheel. The current boundary line is the offset line generated by the previous round's offset operation.

[0140] If a bias line can be generated, the bias line corresponding to the current round is used as the boundary line for the bias operation in the next round.

[0141] In some alternative implementations, the uniform point set generation module 904 includes: The offset line point placement submodule is used to uniformly place points on any offset line according to a preset point placement distance to obtain the point set corresponding to the offset line.

[0142] The uniform point set generation submodule is used to take the set of points corresponding to each offset line as the uniform point set corresponding to the target plane region.

[0143] In some optional implementations, the target point set generation module 905 includes: The "Candidate Point Quantity Determination" submodule is used to determine the number of candidate points based on the number of deployment points. The number of candidate points is greater than the number of deployment points.

[0144] The candidate point set generation submodule is used to randomly select a number of candidate points from the uniform point set to form a candidate point set.

[0145] The target point set determination submodule is used to generate an intermediate point set based on the candidate point set, and then determine the target point set based on the intermediate point set.

[0146] In some optional implementations, the target point set determination submodule includes: The first point selection operation unit is used to repeatedly perform the first point selection operation on the candidate point set to generate an intermediate point set based on the number of candidate points selected from the candidate point set.

[0147] Specifically, the first point-taking operation includes: Among the unselected candidate points in the candidate point set, select one candidate point as the first candidate point.

[0148] Calculate the distances between the first candidate point and each of the second candidate points in the intermediate point set. The intermediate point set is initially empty.

[0149] If any one or more of the distances is less than the preset threshold, the first point selection operation is re-executed.

[0150] If all distances are greater than the preset threshold, the first candidate point is added to the intermediate point set as a new second candidate point in the intermediate point set.

[0151] If the number of candidate points in the intermediate point set is less than the number of points to be placed, the first point selection operation is repeated. If the number of candidate points in the intermediate point set is equal to the number of points to be placed, the generation of the intermediate point set is complete.

[0152] In some optional implementations, the target point set determination submodule includes: The reordering unit is used to reorder the candidate points in the candidate point set according to the shortest path.

[0153] The second point selection operation unit is used to perform a second point selection operation on the reordered candidate point set to generate an intermediate point set based on the number of candidate points selected from the reordered candidate point set.

[0154] In some optional implementations, the second point-taking operation unit includes: The grouping sub-unit is used to group the reordered candidate point set according to the number of points to be placed. Each group consists of multiple candidate points arranged consecutively in the reordered candidate point set, and the number of candidate points in each group is the quotient of the total number of candidate points and the total number of points to be placed.

[0155] The second point selection module is used to perform a second point selection operation on each group in the candidate point set to generate an intermediate point set based on the candidate points selected from each group.

[0156] Specifically, the second point-taking operation includes: Among the candidate points in the group, select one candidate point as the third candidate point.

[0157] Calculate the distances between the first candidate point and each of the fourth candidate points in the intermediate point set. The intermediate point set is initially empty.

[0158] If any one or more of the distances is less than the preset threshold, the second point selection operation is re-executed.

[0159] If all distances are greater than the preset threshold, the first candidate point is added to the intermediate point set as the second candidate point added to the intermediate point set, and the group is marked as having been selected.

[0160] If any group within a given set is not marked as having a point taken, then a second point-taking operation is performed on that unmarked group. If all groups within a given set are marked as having a point taken, then the intermediate point set is generated.

[0161] In some optional implementations, the target point set determination submodule includes: The uniformity evaluation unit is used to evaluate the uniformity of multiple intermediate point sets and sort the multiple intermediate point sets according to the uniformity of the intermediate point sets.

[0162] The target point set determination unit is used to select the intermediate point set with the highest uniformity as the target point set.

[0163] Further functional descriptions of the above modules and units are the same as those in the corresponding embodiments described above, and will not be repeated here.

[0164] The planar area uniform distribution device provided in this embodiment of the invention can execute the planar area uniform distribution method provided in any embodiment of the invention, and has the corresponding functional modules and beneficial effects for executing the method. Further functional descriptions of the above modules and units are the same as in the corresponding embodiments described above, and will not be repeated here.

[0165] Figure 10 This is a schematic diagram of the structure of an electronic device provided in an embodiment of the present invention.

[0166] The following is a detailed reference. Figure 10 This diagram illustrates a structural schematic suitable for implementing an electronic device according to embodiments of the present invention. The electronic device may include a processor (e.g., a central processing unit, graphics processor, etc.) 1001, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 1002 or a program loaded from memory 1008 into random access memory (RAM) 1003. The RAM 1003 also stores various programs and data required for the operation of the electronic device. The processor 1001, ROM 1002, and RAM 1003 are interconnected via a bus 1004. An input / output (I / O) interface 1005 is also connected to the bus 1004.

[0167] Typically, the following devices can be connected to the I / O interface 1005: input devices 1006 including, for example, a touchscreen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 1007 including, for example, a liquid crystal display (LCD), speaker, vibrator, etc.; memory devices 1008 including, for example, magnetic tape, hard disk, etc.; and communication devices 1009. Communication device 1009 allows electronic devices to exchange data via wireless or wired communication with other devices. Although Figure 10 Electronic devices with various devices are shown, but it should be understood that it is not required to implement or have all of the devices shown, and more or fewer devices may be implemented or have instead.

[0168] In particular, according to embodiments of the present invention, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments of the present invention include a computer program product comprising a computer program carried on a non-transitory computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via a communication device 1009, or installed from a memory 1008, or installed from a ROM 1002. When the computer program is executed by the processor 1001, it performs the functions defined in the uniform distribution method for planar regions according to embodiments of the present invention.

[0169] Figure 10 The electronic device shown is merely an example and should not be construed as limiting the functionality and scope of use of the embodiments of the present invention.

[0170] This invention also provides a computer-readable storage medium. The methods described above according to embodiments of the invention can be implemented in hardware or firmware, or implemented as recordable on a storage medium, or implemented as computer code originally stored on a remote storage medium or a non-transitory machine-readable storage medium and subsequently stored on a local storage medium after being downloaded via a network. Thus, the methods described herein can be processed by software stored on a storage medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware. The storage medium can be a magnetic disk, optical disk, read-only memory, random access memory, flash memory, hard disk, or solid-state drive, etc.; further, the storage medium can also include combinations of the above types of memory. It is understood that computers, processors, microprocessor controllers, or programmable hardware include storage components capable of storing or receiving software or computer code. When the software or computer code is accessed and executed by the computer, processor, or hardware, the uniform distribution method for the planar area shown in the above embodiments is implemented.

[0171] A portion of this invention can be applied as a computer program product, such as computer program instructions, which, when executed by a computer, can invoke or provide the methods and / or technical solutions according to the invention through the operation of the computer. Those skilled in the art will understand that the forms in which computer program instructions exist in a computer-readable medium include, but are not limited to, source files, executable files, installation package files, etc. Correspondingly, the ways in which computer program instructions are executed by a computer include, but are not limited to: the computer directly executing the instructions, or the computer compiling the instructions and then executing the corresponding compiled program, or the computer reading and executing the instructions, or the computer reading and installing the instructions and then executing the corresponding installed program. Here, the computer-readable medium can be any available computer-readable storage medium or communication medium accessible to a computer.

[0172] Although embodiments of the invention have been described in conjunction with the accompanying drawings, those skilled in the art can make various modifications and variations without departing from the spirit and scope of the invention, and such modifications and variations all fall within the scope defined by the appended claims.

Claims

1. A method for uniformly distributing points in a planar region, characterized in that, The method includes: Determine the target planar region and the boundary lines of the target planar region; Determine the point placement parameters; the point placement parameters include the number of points and the offset step distance; Based on the boundary line and the offset step distance, multiple offset lines are determined within the target plane region; the distance between adjacent offset lines is determined by the offset step distance. A uniform point set corresponding to the target planar region is created by uniformly distributing points along each of the aforementioned offset lines. A target point set is generated based on the uniform point set, wherein the target point set includes the number of points specified in the uniform point set.

2. The method according to claim 1, characterized in that, The step of determining multiple offset lines within the target plane region based on the boundary line and the offset step distance includes: Perform at least one round of offset operation to generate offset lines on the target planar region until no offset lines can be generated within the target planar region; The bias operations in the current round include: For the current boundary line of the current wheel within the target plane region, based on the current boundary line, offset inward according to the offset step distance to generate the offset line corresponding to the current wheel; the current boundary line is the offset line generated by the offset operation of the previous wheel; If a bias line can be generated, the bias line corresponding to the current round is used as the boundary line for the next round of bias operation.

3. The method according to claim 1, characterized in that, The step of uniformly distributing points along each of the offset lines to create a uniform point set corresponding to the target planar region includes: For any offset line, points are evenly distributed along the offset line according to a preset distribution distance to obtain the point set corresponding to the offset line; The set of points corresponding to each of the offset lines is taken as the uniform point set corresponding to the target plane region.

4. The method according to claim 1, characterized in that, The step of generating the target point set based on the uniform point set includes: The number of candidate points is determined based on the number of deployment points; the number of candidate points is greater than the number of deployment points. From the set of uniform points, randomly select the specified number of candidate points as the candidate point set; Based on the candidate point set, an intermediate point set is generated, and based on the intermediate point set, the target point set is determined.

5. The method according to claim 4, characterized in that, The step of generating an intermediate point set based on the candidate point set includes: The first point selection operation is performed iteratively on the candidate point set to generate an intermediate point set based on the number of candidate points selected from the candidate point set. The first point selection operation includes: From the unselected candidate points in the candidate point set, select one candidate point as the first candidate point; Calculate the distances between the first candidate point and each of the second candidate points in the intermediate point set; the intermediate point set is initially empty. If any one or more of the distances is less than the preset threshold, then the first point selection operation is re-executed; If all distances are greater than the preset threshold, the first candidate point is added to the intermediate point set as a new second candidate point in the intermediate point set. If the number of candidate points in the intermediate point set is less than the number of points to be deployed, the first point selection operation is executed again; if the number of candidate points in the intermediate point set is equal to the number of points to be deployed, the generation of the intermediate point set is completed.

6. The method according to claim 4, characterized in that, The step of generating an intermediate point set based on the candidate point set includes: The candidate points in the candidate point set are reordered according to the shortest path. A second point selection operation is performed on the reordered candidate point set to generate an intermediate point set by selecting the specified number of candidate points from the reordered candidate point set.

7. The method according to claim 6, characterized in that, The second point selection operation on the reordered candidate point set, to select the specified number of candidate points from the reordered candidate point set and generate an intermediate point set, includes: The reordered set of candidate points is grouped according to the number of points to be placed; each group includes multiple candidate points arranged consecutively in the reordered set of candidate points, and the number of candidate points in each group is the quotient of the total number of candidate points and the number of points to be placed. A second point selection operation is performed on each of the groups in the candidate point set to generate the intermediate point set based on the candidate points selected from each of the groups; The second point selection operation includes: Among the candidate points in the group, select one candidate point as the third candidate point; Calculate the distances between the third candidate point and each of the fourth candidate points in the intermediate point set; the intermediate point set is initially empty. If any one or more of the distances is less than the preset threshold, then the second point selection operation is re-executed; If all distances are greater than the preset threshold, the third candidate point is added to the intermediate point set as the newly added fourth candidate point in the intermediate point set, and the group is marked as having been selected. If any group in each group is not marked as having a point taken, then a second point taking operation is performed on the group that is not marked as having a point taken; if all groups in each group are marked as having a point taken, then the generation of the intermediate point set is completed.

8. The method according to claim 4, characterized in that, Determining the target point set based on the intermediate point set includes: The uniformity of the multiple intermediate point sets is evaluated, and the multiple intermediate point sets are sorted according to the uniformity corresponding to the intermediate point sets. The set of intermediate points with the highest uniformity is used as the target point set.

9. An electronic device, characterized in that, include: A memory and a processor are interconnected, the memory storing computer instructions, and the processor executing the computer instructions to perform the uniform point distribution method for the planar region as described in any one of claims 1 to 8.

10. A computer program product, characterized in that, Includes computer instructions for causing a computer to execute the uniform point distribution method for a planar region as described in any one of claims 1 to 8.

Images