Region positioning method and device, electronic equipment and storage medium

Abstract

The invention relates to a region positioning method and device, electronic equipment and a storage medium, and belongs to the technical field of image processing. The method comprises the steps of obtaining a simulation graph of a target area; determining coordinate data of an intersection point between any two simulation edges on the simulation graph; and determining an area schematic diagram of the target area based on the coordinate data of the intersection points. Therefore, according to the scheme, the simulation graph of the target area is generated, and the coordinate data of the intersection points in the simulation graph are determined. And calculating vertex coordinate data of the region schematic diagram, and finally generating the region schematic diagram of the target region. The simulation graph is generated through the portable positioning chip, so that the cost of positioning equipment is saved, and the simulation graph of the target area is conveniently drawn. By determining the vertex coordinate data, a region schematic diagram with a regular shape can be obtained, and a normative reference site is provided for subsequently monitoring the motion trail of a moving object.

Description

Technical Field

[0001] The present application relates to the field of image processing technology, and in particular to a method, device, electronic device and storage medium for locating an area. Background Art

[0002] In the prior art, the positioning of a stadium mainly relies on large-scale hardware equipment (such as several positioning base stations, gateways, servers, etc.), which is expensive, complex to deploy and maintain, and has errors in the positioning data. It is impossible to provide accurate data for generating a stadium diagram, and thus it is impossible to obtain a standard rectangular stadium diagram. Summary of the invention

[0003] The present application provides a method, device, electronic device, computer-readable storage medium and computer program product for locating an area to solve the problem that a standard rectangular area schematic diagram cannot be generated. The technical solution of the present application is as follows:

[0004] According to the first aspect of an embodiment of the present application, a method for locating an area is provided, comprising: obtaining a simulated graphic of a target area; determining coordinate data of an intersection point between any two simulated edges on the simulated graphic; and determining an area schematic diagram of the target area based on the coordinate data of the intersection point.

[0005] In one embodiment of the present application, obtaining a simulated graphic of the target area includes: obtaining multiple positioning data on each physical edge of the target area; for each physical edge, performing a straight line fitting on the positioning data on the physical edge, determining a simulated edge corresponding to the physical edge, and enclosing the simulated edge to form the simulated graphic.

[0006] In one embodiment of the present application, determining the coordinate data of the intersection point between any two simulated edges on the simulated figure includes: for each of the intersection points, determining the first simulated edge and the second simulated edge connected to the intersection point; determining the first slope and the first X-axis intercept of the first simulated edge, and the second slope and the second X-axis intercept of the second simulated edge; based on the first slope and the first X-axis intercept, and the second slope and the second X-axis intercept, determining the coordinate data of the intersection point.

[0007] In one embodiment of the present application, the obtaining of the simulated graphics of the target area includes: obtaining vertex positioning data of multiple vertices of the target area, and mapping the vertex positioning data to obtain mapping coordinate data; connecting the mapping coordinate data to generate the simulated graphics.

[0008] In one embodiment of the present application, determining the coordinate data of the intersection point between any two simulated edges on the simulated graphic includes: determining the mapped coordinate data as the coordinate data of the intersection point.

[0009] In one embodiment of the present application, the method also includes: receiving an adjustment request for any simulated edge in the simulated graph, and re-collecting the positioning data of the target physical edge corresponding to any simulated edge according to the adjustment request; and updating the simulated graph based on the re-collected positioning data of the target physical edge.

[0010] In one embodiment of the present application, the area schematic diagram of the target area is determined based on the coordinate data of the intersection points, including: taking any simulated edge as a reference edge, and based on the coordinate data of the intersection points, determining the target intersection point farthest from the reference edge from the intersection points, and obtaining the first edge intersection point and the second edge intersection point of the simulated figure corresponding to the reference edge; determining the vertex coordinate data of multiple vertices on the area schematic diagram based on the target intersection point, the first edge intersection point, the second edge intersection point, and the first intersection point and the second intersection point on the reference edge; and generating the area schematic diagram based on the vertex coordinate data of the multiple vertices.

[0011] In one embodiment of the present application, the vertex coordinate data of multiple vertices on the area schematic diagram are determined based on the target intersection point, the first edge intersection point, the second edge intersection point, and the first intersection point and the second intersection point on the reference edge, including: obtaining a first cross product result between a third vector and a first vector, wherein the first vector is a vector pointing from the first intersection point to the second intersection point, and the third vector is a vector pointing from the first intersection point to the target intersection point; obtaining a first dot product result between a fourth vector and the first vector, wherein the fourth vector is a vector pointing from the first intersection point to the first edge intersection point; obtaining a second dot product result between the fifth vector and the second vector, wherein the second vector is a vector pointing from the second intersection point to the first intersection point, and the fifth vector is a vector pointing from the second intersection point to the second edge intersection point; based on the first cross product result, the first dot product result and the second dot product result, and the first intersection point and the second intersection point, the vertex coordinate data of the multiple vertices are determined.

[0012] In one embodiment of the present application, the vertex coordinate data of the multiple vertices are determined based on the first cross product result, the first dot product result and the second dot product result, as well as the first intersection point and the second intersection point, including: determining the first distance between the first intersection point and the second intersection point based on the first coordinate data of the first intersection point and the second coordinate data of the second intersection point; obtaining the height of the area schematic diagram based on the first cross product result and the first distance; obtaining the first length from the first intersection point to the first edge intersection point based on the first dot product result and the first distance; obtaining the first distance from the second intersection point to the first edge intersection point based on the second dot product result and the first distance; and obtaining the first distance from the second intersection point to the first edge intersection point based on the second dot product result and the first distance. The second length of the second edge point; based on the second length and the first distance, and the first coordinate data and the second coordinate data, determine the vertex coordinate data of the first vertex; based on the first length and the first distance, and the first coordinate data and the second coordinate data, determine the vertex coordinate data of the second vertex; based on the height of the area schematic diagram and the first distance, the first coordinate data and the second coordinate data, and the coordinate data of the second vertex, determine the vertex coordinate data of the third vertex; based on the height of the area schematic diagram and the first distance, the first coordinate data and the second coordinate data, and the coordinate data of the first vertex, determine the vertex coordinate data of the fourth vertex.

[0013] In one embodiment of the present application, based on the coordinate data of the intersection points, determining the target intersection point farthest from the reference edge from the intersection points includes: obtaining a second cross product result between the sixth vector and the first vector, wherein the first vector is a vector pointing from the first intersection point to the second intersection point, and the sixth vector is a vector pointing from the first intersection point to the third intersection point of the target area; obtaining a third cross product result between the second vector and the seventh vector, wherein the second vector is a vector pointing from the second intersection point to the first intersection point, and the seventh vector is a vector pointing from the second intersection point to the fourth intersection point of the target area; selecting the maximum cross product result between the second cross product result and the third cross product result, and taking the intersection point corresponding to the maximum cross product result as the target intersection point.

[0014] In one embodiment of the present application, the process of determining any edge intersection point includes: determining the starting intersection point corresponding to any edge intersection point from the first intersection point and the second intersection point; obtaining the third dot product result of the eighth vector and the eighth vector, wherein the eighth vector is a vector pointing from the starting intersection to another intersection point on the baseline; obtaining the fourth dot product result of the eighth vector and the ninth vector, wherein the ninth vector is a vector pointing from the starting intersection point to the fifth intersection point on the same diagonal as the starting intersection point; selecting the maximum dot product result between the third dot product result and the fourth dot product result, and taking the intersection point corresponding to the maximum dot product result as any edge intersection point.

[0015] In one embodiment of the present application, the method also includes: obtaining the area schematic diagram corresponding to each simulated edge; receiving a schematic diagram selection indication, and based on the schematic diagram selection indication, selecting the final area schematic diagram of the target area from the area schematic diagrams corresponding to each simulated edge.

[0016] In one embodiment of the present application, the method further includes: traversing to obtain the area schematic diagram corresponding to the simulated edge, and during the traversal process, if the area schematic diagram corresponding to one of the simulated edges is selected as the final area schematic diagram of the target area, stopping the generation of the area schematic diagram corresponding to the subsequent simulated edge.

[0017] In one embodiment of the present application, the method further includes: if the final area schematic diagram of the target area is not selected from the area schematic diagram corresponding to each of the simulated edges, returning to execute the simulated graphics of the target area and subsequent steps.

[0018] According to the second aspect of an embodiment of the present application, a device for locating an area is provided, comprising: an acquisition module for acquiring a simulated graphic of a target area; a first determination module for determining coordinate data of an intersection point between any two simulated edges on the simulated graphic; and a second determination module for determining an area schematic diagram of the target area based on the coordinate data of the intersection point.

[0019] In one embodiment of the present application, the acquisition module is also used to: acquire multiple positioning data on each physical edge of the target area; for each physical edge, perform straight line fitting on the positioning data on the physical edge, determine the simulated edge corresponding to the physical edge, and enclose the simulated figure with the simulated edges.

[0020] In one embodiment of the present application, the acquisition module is also used to: determine, for each of the intersection points, the first simulated edge and the second simulated edge connected by the intersection point; determine the first slope and the first X-axis intercept of the first simulated edge, and the second slope and the second X-axis intercept of the second simulated edge; and determine the coordinate data of the intersection point based on the first slope and the first X-axis intercept, and the second slope and the second X-axis intercept.

[0021] In one embodiment of the present application, the acquisition module is further used to: acquire vertex positioning data of multiple vertices of the target area, and map the vertex positioning data to obtain mapping coordinate data; connect the mapping coordinate data to generate the simulation graphics.

[0022] In one embodiment of the present application, the acquisition module is further used to: determine the mapping coordinate data as the coordinate data of the intersection point.

[0023] In one embodiment of the present application, the device also includes: receiving an adjustment request for any simulated edge in the simulated graph, and re-collecting the positioning data of the target physical edge corresponding to any simulated edge according to the adjustment request; and updating the simulated graph based on the re-collected positioning data of the target physical edge.

[0024] In one embodiment of the present application, the second determination module is also used to: take any simulated edge as a reference edge, and based on the coordinate data of the intersection points, determine the target intersection point farthest from the reference edge from the intersection points, and obtain the first edge intersection point and the second edge intersection point of the simulated figure corresponding to the reference edge; determine the vertex coordinate data of multiple vertices on the area schematic diagram based on the target intersection point, the first edge intersection point, the second edge intersection point, and the first intersection point and the second intersection point on the reference edge; and generate the area schematic diagram based on the vertex coordinate data of the multiple vertices.

[0025] In one embodiment of the present application, the second determination module is also used to: obtain a first cross product result between a third vector and a first vector, wherein the first vector is a vector pointing from the first intersection point to the second intersection point, and the third vector is a vector pointing from the first intersection point to the target intersection point; obtain a first dot product result between a fourth vector and the first vector, wherein the fourth vector is a vector pointing from the first intersection point to the first edge intersection point; obtain a second dot product result between the fifth vector and the second vector, wherein the second vector is a vector pointing from the second intersection point to the first intersection point, and the fifth vector is a vector pointing from the second intersection point to the second edge intersection point; determine the vertex coordinate data of the multiple vertices based on the first cross product result, the first dot product result and the second dot product result, as well as the first intersection point and the second intersection point.

[0026] In one embodiment of the present application, the second determination module is also used to: determine the first distance between the first intersection point and the second intersection point based on the first coordinate data of the first intersection point and the second coordinate data of the second intersection point; obtain the height of the area schematic diagram based on the first cross product result and the first distance; obtain the first length from the first intersection point to the first edge intersection point based on the first dot product result and the first distance; obtain the second length from the second intersection point to the second edge point based on the second dot product result and the first distance; determine the vertex coordinate data of the first vertex based on the second length and the first distance, as well as the first coordinate data and the second coordinate data; determine the vertex coordinate data of the second vertex based on the first length and the first distance, as well as the first coordinate data and the second coordinate data; determine the vertex coordinate data of the third vertex based on the height of the area schematic diagram and the first distance, the first coordinate data and the second coordinate data, and the coordinate data of the second vertex; determine the vertex coordinate data of the fourth vertex based on the height of the area schematic diagram and the first distance, the first coordinate data and the second coordinate data, and the coordinate data of the first vertex.

[0027] In one embodiment of the present application, the second determination module is also used to: obtain a second cross product result between the sixth vector and the first vector, wherein the first vector is a vector pointing from the first intersection point to the second intersection point, and the sixth vector is a vector pointing from the first intersection point to the third intersection point of the target area; obtain a third cross product result between the second vector and the seventh vector, wherein the second vector is a vector pointing from the second intersection point to the first intersection point, and the seventh vector is a vector pointing from the second intersection point to the fourth intersection point of the target area; select the maximum cross product result between the second cross product result and the third cross product result, and use the intersection point corresponding to the maximum cross product result as the target intersection point.

[0028] In one embodiment of the present application, the second determination module is also used to: determine the starting intersection point corresponding to any edge intersection point from the first intersection point and the second intersection point; obtain the third dot product result of the eighth vector and the eighth vector, wherein the eighth vector is a vector pointing from the starting intersection to another intersection point on the baseline; obtain the fourth dot product result of the eighth vector and the ninth vector, wherein the ninth vector is a vector pointing from the starting intersection point to the fifth intersection point on the same diagonal as the starting intersection point; select the maximum dot product result from the third dot product result and the fourth dot product result, and use the intersection point corresponding to the maximum dot product result as any edge intersection point.

[0029] In one embodiment of the present application, the device also includes: obtaining the area schematic diagram corresponding to each simulated edge; receiving a schematic diagram selection indication, and based on the schematic diagram selection indication, selecting the final area schematic diagram of the target area from the area schematic diagrams corresponding to each simulated edge.

[0030] In one embodiment of the present application, the device also includes: traversing to obtain the area schematic diagram corresponding to the simulated edge, and during the traversal process, if the area schematic diagram corresponding to one of the simulated edges is selected as the final area schematic diagram of the target area, stopping the generation of the area schematic diagram corresponding to the subsequent simulated edge.

[0031] In one embodiment of the present application, the device further includes: if the final area schematic diagram of the target area is not selected from the area schematic diagram corresponding to each of the simulated edges, returning to execute the simulated graphics of the target area and subsequent steps.

[0032] According to a third aspect of an embodiment of the present application, there is provided an electronic device, comprising a processor; and a memory for storing instructions executable by the processor; wherein the processor is configured to implement the steps of the method of the first aspect of the embodiment of the present application.

[0033] According to a fourth aspect of an embodiment of the present application, a computer-readable storage medium is provided, on which computer program instructions are stored. When the program instructions are executed by a processor, the steps of the method of the first aspect of the embodiment of the present application are implemented.

[0034] According to a fifth aspect of an embodiment of the present application, a computer program product is provided, comprising a computer program, wherein when the computer program is executed by a processor of an electronic device, the steps of the method of the first aspect of the embodiment of the present application are implemented.

[0035] The technical solution provided by the embodiments of the present application brings at least the following beneficial effects: a simulation graph of the target area can be generated, and the coordinate data of the intersection point between any two simulation edges in the simulation graph can be determined. Based on the coordinate data of the intersection point, the vertex coordinate data of the regional schematic diagram can be calculated, and finally a regional schematic diagram of the target area is generated. The simulation graph is generated by a portable positioning chip, which saves the cost of the positioning equipment and facilitates the drawing of the simulation graph of the target area. By determining the vertex coordinate data, a regional schematic diagram of a regular shape can be obtained, which provides a standardized reference site for subsequent monitoring of the motion trajectory of the moving object.

[0036] It should be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the application.

[0038] Figure 1 The figure is a flow chart of a method for locating an area according to an exemplary embodiment.

[0039] Figure 2 The figure is a flow chart of a method for locating an area according to another exemplary embodiment.

[0040] Figure 3 It is a schematic diagram showing generation of simulation edges according to an exemplary embodiment.

[0041] Figure 4 is a schematic diagram of a simulation graph according to an exemplary embodiment.

[0042] Figure 5 The figure is a flow chart of a method for locating an area according to another exemplary embodiment.

[0043] Figure 6 The figure is a flow chart of a method for locating an area according to another exemplary embodiment.

[0044] Figure 7 is a schematic diagram of a region according to an exemplary embodiment.

[0045] Figure 8 The present invention is a flowchart of a process of determining a target intersection point in a method for locating an area according to an exemplary embodiment.

[0046] Fig. 9 The present invention is a flowchart of a process of determining edge intersection points in a method for locating a region according to an exemplary embodiment.

[0047] Fig.10 The figure is a flow chart of a method for locating an area according to another exemplary embodiment.

[0048] Fig.11 is a schematic diagram of a region according to another exemplary embodiment.

[0049] Fig.12 is a schematic diagram of a region according to another exemplary embodiment.

[0050] Fig.13 is a schematic diagram of a region according to another exemplary embodiment.

[0051] Fig.14 The figure is a flowchart of generating a region schematic diagram according to an exemplary embodiment.

[0052] Fig.15 The figure is a flow chart of a method for locating an area according to another exemplary embodiment.

[0053] Fig.16 The figure is a structural block diagram of a device for locating a region according to an exemplary embodiment.

[0054] Fig.17 The present invention is a structural block diagram of an electronic device according to an exemplary embodiment.

[0055] Fig.18 It is a structural block diagram of another electronic device according to an exemplary embodiment. DETAILED DESCRIPTION

[0056] In order to enable ordinary persons in the art to better understand the technical solution of the present application, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the accompanying drawings.

[0057] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. On the contrary, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the attached claims.

[0058] The acquisition, storage, use, and processing of data in the technical solution of this application comply with the relevant provisions of national laws and regulations.

[0059] Figure 1 is a flow chart of a method for locating an area according to an exemplary embodiment. Figure 1 As shown, the method for locating a region in the embodiment of the present application includes but is not limited to the following steps:

[0060] S101, obtaining a simulated graphic of a target area.

[0061] It should be noted that the execution subject of the method for locating the area provided in the embodiment of the present application is an electronic device, which may be a mobile electronic device or a non-mobile electronic device. For example, the mobile electronic device may be a mobile phone, a tablet computer, a laptop computer, a PDA, an in-vehicle electronic device, a wearable device, an ultra-mobile personal computer (UMPC), a netbook or a personal digital assistant (PDA), etc., and the non-mobile electronic device may be a network attached storage (NAS), a personal computer (PC), a television (TV), a teller machine or a self-service machine, etc., which is not specifically limited in the embodiment of the present application.

[0062] In some implementations, the coordinate data of the target area may be acquired based on a global positioning system (GPS), wherein the coordinate data of the target area includes the longitude and latitude of the geographical location.

[0063] Optionally, the user can carry a device with a GPS positioning chip and walk along a physical boundary of the target area. The GPS positioning chip will automatically collect all positioning data of the boundary and upload it to the application software. The target area can refer to a stadium, including but not limited to football fields, basketball courts, tennis courts and other stadium areas.

[0064] It is understandable that the accuracy and quantity of GPS positioning data directly affect the generation of target area coordinate data. The coordinate data includes geographic location longitude information and geographic location latitude information, wherein the geographic location longitude information can be accurate to six decimal places with an error of 0.1 meters, and the geographic location latitude information can be accurate to eight decimal places with an error of 0.001 meters. Optionally, the geographic location longitude information can also be accurate to four decimal places, and the geographic location latitude information can also be accurate to seven decimal places. This application does not impose too many restrictions on accuracy.

[0065] For example, if a positioning data is the geographical location longitude: 116.3126831 and the geographical location latitude: 40.04859543, then it is represented as (116.3126831, 40.04859543) in the coordinate system. As shown in Table 1:

[0066] Table 1

[0067] Geographic location longitude Geographical location latitude 116.3126831 40.04859543

[0068] Furthermore, based on the collected positioning data of a certain physical edge, a simulated edge corresponding to the physical edge in the simulated graph can be calculated based on a linear fitting algorithm. For each physical edge of the target area, the positioning data of the collector can be collected, and a linear fitting can be performed based on the positioning data to obtain the simulated edge of the simulated graph corresponding to the physical edge in the simulated graph. The quadrilateral surrounded by the simulated edges is the simulated graph of the target area.

[0069] For example, Figure 4 In the simulation graph shown, the four simulation edges are y=k1x+b1, y=k2x+b2, y=k3x+b3 and y=k4x+b4. Assuming that the four simulation edges are arranged in a clockwise order, the characteristics of the simulation edges are that the values ​​of k1 and k2 are greater than 0, the values ​​of k3 and k4 are less than 0, b1>b2, and b3>b4.

[0070] S102, determining the coordinate data of the intersection point between any two simulated edges on the simulated graph.

[0071] In some implementations, a plane coordinate system is established based on the simulation graph, wherein the x-axis points to the due east direction, i.e., the position at latitude 0 degrees, and the y-axis points to the due north direction, i.e., the position at longitude 0 degrees. Based on the positioning data of the physical edge, the expression of the simulation edge can be calculated, such as y=kx+b, where k is the slope and b is the intercept.

[0072] Optionally, the coordinate data of the intersection point in the simulated graph can be calculated based on the slopes and intercepts of the two simulated edges where the intersection point is located. For example, assuming that one simulated edge where the intersection point is located is y=k1x+b1 and the other simulated edge is y=k3x+b3, the coordinate data of the intersection point is

[0073] S103, determining a region schematic diagram of the target region based on the coordinate data of the intersection point.

[0074] It is understandable that the simulated figure formed based on the simulated edge is not a regular rectangle, and it is necessary to determine the coordinate data of the four vertices of the region schematic diagram based on the coordinate data of the intersection points of the simulated figure and the simulated edge, and then obtain the region schematic diagram of the target area, wherein the region schematic diagram is a regular rectangle.

[0075] In some implementations, any simulated edge can be used as a reference edge, and the target intersection point farthest from the reference edge is determined from the intersection points, thereby determining the edge intersection point on the right side of the simulated graphic and the edge intersection point on the left side of the simulated graphic. The edge intersection point on the right side of the reference edge is the first edge intersection point, and the edge intersection point on the left side of the reference edge is the second edge intersection point.

[0076] Optionally, the distance between the target intersection point and the reference side, that is, the height of the region diagram, can be calculated based on the two intersection points on the reference side, the target intersection point, and the length between the two intersection points on the reference side, wherein the left point on the reference side is the first intersection point, and the right point on the reference side is the second intersection point.

[0077] Optionally, the distance between the first intersection point and the first edge intersection point can be calculated based on the first intersection point, the second intersection point and the first edge intersection point, and the distance between the two intersection points on the reference side. Optionally, the distance between the second intersection point and the second edge intersection point can be calculated based on the first intersection point, the second intersection point and the second edge intersection point, and the length between the two intersection points on the reference side.

[0078] Further, based on the height of the region schematic diagram, the distance between the first intersection point and the first edge intersection point, and the distance between the second intersection point and the second edge intersection point, the coordinate data of multiple vertices of the region schematic diagram can be calculated. After obtaining the coordinate data of multiple vertices, the multiple vertices can be connected to generate a region schematic diagram.

[0079] In the method for locating an area provided in an embodiment of the present application, a simulated graph of the target area is generated, and the coordinate data of the intersection point between any two simulated edges in the simulated graph is determined. Based on the coordinate data of the intersection point, the vertex coordinate data of the area schematic diagram can be calculated, and finally a regional schematic diagram of the target area is generated. By generating a simulated graph through a portable positioning chip, the cost of the positioning equipment is saved, and it is convenient to draw a simulated graph of the target area. By determining the vertex coordinate data, a regional schematic diagram of a regular shape can be obtained, which provides a standardized reference site for subsequent monitoring of the motion trajectory of a moving object.

[0080] Figure 2 is a flow chart of a method for locating an area according to an exemplary embodiment. Figure 2 As shown, the method for locating a region in the embodiment of the present application includes but is not limited to the following steps:

[0081] S201, obtaining a plurality of positioning data on each physical edge of the target area.

[0082] In some implementations, since the latitude and longitude of the target area do not change much, the target area can be regarded as a plane and a plane coordinate system can be established. Among them, the x-axis points to the due east direction, that is, the position of latitude 0 degrees, and the y-axis points to the due north direction, that is, the position of longitude 0 degrees. Then the positioning data collected by the GPS positioning chip is (x, y), where x is the longitude of the geographical location and y is the latitude of the geographical location.

[0083] Optionally, the user may carry a device with a GPS positioning chip and walk along each physical edge of the target area, and the GPS positioning chip collects multiple positioning data on each physical edge.

[0084] S202, for each physical edge, performing straight line fitting on the positioning data on the physical edge, determining a simulation edge corresponding to the physical edge, and forming a simulation graph with the simulation edges.

[0085] In some implementations, an initial slope and an initial X-axis intercept can be determined based on the positioning data on the physical edge, and starting from the initial slope and the initial X-axis intercept, the slope and the X-axis intercept are iteratively updated based on the positioning data and the learning rate until the iteration end condition is met to obtain the target slope and the target X-axis intercept, and then based on the target slope and the target X-axis intercept, the fitted edge line corresponding to the physical edge is obtained.

[0086] Optionally, the first minimum coordinate value and the first maximum coordinate value on the X-axis, and the second minimum coordinate value and the second maximum coordinate value on the Y-axis can be determined from the positioning data; based on the first minimum coordinate value and the first maximum coordinate value, and the second minimum coordinate value and the second maximum coordinate value, the initial slope and the initial X-axis intercept are determined.

[0087] For example, assume that there are N positioning data, the initial slope is k, and the initial X-axis intercept is b. From the N positioning data, it can be determined that the first minimum coordinate value on the X-axis is Xmin, the first maximum coordinate value is Xmax, the second minimum coordinate value on the Y-axis is Ymin, and the second maximum coordinate value is Ymax. Then the initial slope is The initial X-intercept is

[0088] In some implementations, the estimated Y-axis coordinate value can be determined based on the slope k and the X-axis intercept b of the current iteration and the X-axis coordinate value in the positioning data, and the Y-axis coordinate difference between the estimated Y-axis coordinate value and the Y-axis coordinate value in the positioning data is obtained. Assume that the positioning data of the current iteration is (x i ,y i ), the slope is k, the X-intercept is b, then the expected Y-axis coordinate value is kx i +b, and then determine that the Y-axis coordinate difference of the Y-axis coordinate value in the positioning data is kx i +by i . Furthermore, the gradient of the X-axis intercept can be obtained based on the Y-axis coordinate difference of the positioning data and the number of positioning data. For example, if the gradient of the X-axis intercept is b_grad, then the gradient of the X-axis intercept is

[0089] Optionally, the gradient of the slope k can be obtained based on the Y-axis coordinate difference and the X-axis coordinate value of the positioning data and the number of positioning data. For example, let the gradient of the slope be k_grad, then the gradient of the slope is

[0090]

[0091] Further, the slope of the next iteration can be obtained based on the gradient of the learning rate and the slope, and the slope of the current iteration. That is, the slope of the next iteration is the slope of the current iteration minus the gradient product of the learning rate and the slope. The X-axis intercept of the next iteration can be obtained based on the gradient of the learning rate and the X-axis intercept, and the X-axis intercept. That is, the X-axis intercept of the next iteration is the X-axis intercept of the current iteration minus the gradient product of the learning rate and the X-axis intercept.

[0092] For example, let the learning rate be learning_rate, the slope of the current iteration is k, the X-intercept is b, the slope of the next iteration is k+1, the X-intercept is b+1, the gradient of the slope is k_grad, the gradient of the X-intercept is b_grad, then the slope of the next iteration is k+1=k-learning_rate*k_grad, and the X-intercept of the next iteration is b+1=b-learning_rate*b_grad. The number of iterations must be greater than or equal to 1,000,000.

[0093] like Figure 3 The schematic diagram shown is of iterating the slope and intercept to obtain the simulated edge, wherein multiple cross points represent sampled positioning data, and the straight line is a straight line after iteration, and the straight line is a simulated edge corresponding to a physical edge.

[0094] In some implementations, a simulated graphic can be formed based on the simulated edges and displayed to the user. If the user is not satisfied with a simulated edge, an adjustment request can be generated to instruct the user to re-collect the positioning data of the physical edge corresponding to the simulated edge, generate a new simulated edge, and update the simulated graphic.

[0095] Optionally, by receiving an adjustment request for any simulated edge in the simulated graph and re-collecting positioning data of a target physical edge corresponding to any simulated edge according to the adjustment request, the simulated graph is updated based on the re-collected positioning data of the target physical edge.

[0096] S203, determining the coordinate data of the intersection point between any two simulated edges on the simulated graph.

[0097] In some implementations, the coordinate data of the intersection point between two simulated edges may be determined based on the slopes and intercepts of the two simulated edges where the intersection point is located. Optionally, for each intersection point, the first simulated edge and the second simulated edge connected to the intersection point are determined. Figure 4 As shown, the first simulated edge of the intersection point A is y=k1x+b1, and the second simulated edge is y=k3x+b3, the first simulated edge of the intersection point B is y=k2x+b2, and the second simulated edge is y=k3x+b3, the first simulated edge of the intersection point C is y=k2x+b2, and the second simulated edge is y=k4x+b4, and the first simulated edge of the intersection point D is y=k1x+b1, and the second simulated edge is y=k4x+b4.

[0098] Further, the first slope and the first X-axis intercept of the first simulated side, and the second slope and the second X-axis intercept of the second simulated side are determined, and based on the first slope and the first X-axis intercept, and the second slope and the second X-axis intercept, the coordinate data of the intersection point is determined. Optionally, the X-axis coordinate of the intersection point can be determined based on the ratio of the difference between the second X-axis intercept and the first X-axis intercept to the difference between the first slope and the second slope. Optionally, the Y-axis coordinate of the intersection point can be determined based on the ratio of the difference between the product of the first slope and the second X-axis intercept and the product of the second slope and the first X-axis intercept to the difference between the first slope and the second slope.

[0099] For example, Figure 4 In the simulation graph shown, there are four intersection points A, B, C, and D. According to the first simulation edge and the second simulation edge connected by the intersection point, the coordinate data of the intersection point A can be determined as follows: The coordinate data of the intersection point B is The coordinate data of the intersection point C is The coordinate data of the intersection point D is

[0100] S204: Determine a region schematic diagram of the target region based on the coordinate data of the intersection point.

[0101] In the embodiment of the present application, the implementation method of step S204 can be implemented by any method in the embodiments of the present application, which is not limited here and will not be repeated.

[0102] In the method for locating an area provided in an embodiment of the present application, by obtaining the positioning data on each physical edge of the target area and performing straight line fitting, a simulated edge that accurately corresponds to the physical edge can be obtained, thereby generating a simulated graph, reducing the error of the simulated graph. By determining the coordinate data of the intersection point between any two simulated edges in the simulated graph, and based on the coordinate data of the intersection point, the vertex coordinate data of the regional schematic diagram can be calculated, and finally a regional schematic diagram of the target area is generated. By generating a simulated graph through a portable positioning chip, the cost of the positioning equipment is saved, and the simulated graph of the target area is conveniently drawn. By determining the vertex coordinate data, a regional schematic diagram of a regular shape can be obtained, which provides a standardized reference site for subsequent monitoring of the motion trajectory of a moving object.

[0103] Figure 5 is a flow chart of a method for locating an area according to an exemplary embodiment. Figure 5 As shown, the method for locating a region in the embodiment of the present application includes but is not limited to the following steps:

[0104] S501, acquiring vertex positioning data of a plurality of vertices in a target area, and mapping the vertex positioning data to obtain mapping coordinate data.

[0105] In some implementations, the simulation graphics can also be generated based on the positioning data of the vertices of the target area and the vertex positioning data. Optionally, the user determines the vertex positioning data of the multiple vertices by collecting the geographical location longitude and latitude information of the multiple vertices of the target area. The vertex positioning data is in the form of (x, y), where x is the latitude coordinate and y is the longitude coordinate. Further, the vertex positioning data can be mapped to the coordinate system where the simulation graphics are located to obtain the mapping coordinate data.

[0106] It is understood that the vertices are physical vertices, which refer to multiple vertices of the target area, and the vertex positioning data refers to the coordinates of multiple vertices of the target area collected by the GPS positioning device. For example, if the target area is a court, the vertices are the four corner points on the court.

[0107] S502, connecting the mapped coordinate data to generate a simulation graph.

[0108] In some implementations, after obtaining the mapping coordinate data, the mapping coordinate data can be connected with straight lines in a clockwise or counterclockwise direction, and the figure surrounded by the straight lines is the simulation figure. For example, the mapping coordinate data are A, B, C, and D in a clockwise direction, and the coordinates are connected in a clockwise direction, so that A is connected to B, B is connected to C, C is connected to D, and D is connected to A, and the generated simulation image is a quadrilateral ABCD.

[0109] S503, determining the coordinate data of the intersection point between any two simulated edges on the simulated graph.

[0110] In some implementations, since the simulated graph is generated by mapping coordinate data, the intersection point between any two simulated edges on the simulated graph is also the mapping coordinate point. Optionally, the mapping coordinate data is determined as the coordinate data of the intersection point.

[0111] S504: Determine a region schematic diagram of the target region based on the coordinate data of the intersection point.

[0112] In the embodiment of the present application, the implementation method of step S504 can be implemented by any method in the embodiments of the present application, which is not limited here and will not be repeated.

[0113] In the method for locating an area provided in an embodiment of the present application, by locating multiple vertices of the target area and obtaining corresponding mapping coordinate data, a simulation graphic is generated based on the mapping coordinate data, which saves time for collecting positioning data and reduces labor costs. By determining the coordinate data of the intersection point between any two simulated edges in the simulation graphic, and based on the coordinate data of the intersection point, the vertex coordinate data of the regional schematic diagram can be calculated, and finally a regional schematic diagram of the target area is generated. By generating a simulation graphic through a portable positioning chip, the cost of the positioning equipment is saved, and the simulation graphic of the target area is conveniently drawn. By determining the vertex coordinate data, a regional schematic diagram of a regular shape can be obtained, which provides a standardized reference site for subsequent monitoring of the motion trajectory of the moving object.

[0114] Figure 6 is a flow chart of a method for locating an area according to an exemplary embodiment. Figure 6 As shown, the method for locating a region in the embodiment of the present application includes but is not limited to the following steps:

[0115] S601, obtaining a simulation graph of a target area.

[0116] In the embodiment of the present application, the implementation method of step S601 can be implemented by any method in the embodiments of the present application, which is not limited here and will not be repeated.

[0117] S602, determining the coordinate data of the intersection point between any two simulated edges on the simulated graph.

[0118] In the embodiment of the present application, the implementation method of step S602 can be implemented by any method in the embodiments of the present application, which is not limited here and will not be repeated.

[0119] S603, taking any simulated edge as a reference edge, based on the coordinate data of the intersection points, determining the target intersection point farthest from the reference edge from the intersection points, and obtaining the first edge intersection point and the second edge intersection point of the simulated figure corresponding to the reference edge.

[0120] In some implementations, any simulated edge in the simulated graph can be selected as a reference edge for generating a region schematic diagram, and the intersection point farthest from the reference edge is determined as a target intersection point from two intersection points opposite to the reference edge, thereby determining the edge intersection point of the simulated graph corresponding to the reference edge.

[0121] Optionally, the intersection point located farthest to the right of the reference edge can be used as the first edge intersection point of the simulation figure, and the intersection point located farthest to the left of the reference edge can be used as the second edge intersection point of the simulation figure.

[0122] Optionally, the target intersection point may be determined based on the cross product result of the intersection point. The edge intersection point may be determined based on the dot product result between the intersection points.

[0123] S604, determining vertex coordinate data of a plurality of vertices on the region schematic diagram based on the target intersection point, the first edge intersection point, the second edge intersection point, and the first intersection point and the second intersection point on the reference edge.

[0124] In some implementations, the intersection point located on the left side of the reference edge can be used as the first intersection point, and the intersection point located on the right side of the reference edge can be used as the second intersection point. The vertex coordinate data of multiple vertices on the area schematic diagram can be determined based on the vector between the first intersection point and the second intersection point, the vector between the first intersection point and the target intersection point, the vector between the first intersection point and the first edge intersection point, and the vector between the second intersection point and the second edge intersection point.

[0125] Optionally, obtain a first cross product result between the third vector and the first vector, wherein the first vector is a vector pointing from the first intersection point to the second intersection point, and the third vector is a vector pointing from the first intersection point to the target intersection point. Obtain a first dot product result between the fourth vector and the first vector, wherein the fourth vector is a vector pointing from the first intersection point to the first edge intersection point. Obtain a second dot product result between the fifth vector and the second vector, wherein the second vector is a vector pointing from the second intersection point to the first intersection point, and the fifth vector is a vector pointing from the second intersection point to the second edge intersection point.

[0126] For example, Figure 7 In the schematic diagram of the region shown, let the DC edge be the reference edge, then the first intersection point is D, and the second intersection point is C. Let the target intersection point be X, the first edge intersection point be M, and the second edge intersection point be N, then the first vector is vector DC (starting from the first intersection point to the second intersection point), the second vector is vector CD (starting from the second intersection point to the first intersection point), the third vector is vector DX (starting from the first intersection point to the target intersection point), the fourth vector is vector DM (starting from the first intersection point to the first edge intersection point), and the fifth vector is vector CN (starting from the second intersection point to the second edge intersection point).

[0127] The first cross product result between the third vector and the first vector is cross(D,X,C), which means the cross product of vector DX and vector DC starting from point D. The first dot product result between the fourth vector and the first vector is dot(D,M,C), which means the cross product of vector DM and vector DC starting from point D. The second dot product result between the fifth vector and the second vector is dot(C,N,D), which means the cross product of vector CN and vector CD starting from point C.

[0128] Further, vertex coordinate data of the plurality of vertices may be determined based on the first cross product result, the first dot product result, and the second dot product result, as well as the first intersection point and the second intersection point. Optionally, a first distance between the first intersection point and the second intersection point may be determined based on the first coordinate data of the first intersection point and the second coordinate data of the second intersection point. Figure 7 In the example, the first distance is the distance d between DC. If the coordinate data of point D is (d0, d1) and the coordinate data of point C is (c0, c1), then the first distance is

[0129] In some implementations, the height of the region diagram may be obtained based on the first cross product result and the first distance. A first length from the first intersection point to the first edge intersection point may be obtained based on the first dot product result and the first distance, and a second length from the second intersection point to the second edge point may be obtained based on the second dot product result and the first distance. Figure 7 In , let the height of the area diagram be H, which is the distance between point B and point P2, the first length be R, which is the distance between point P1 and point C, and the second length be L, which is the distance between point D and point P2. Then the height of the area diagram is H = cross(D,X,C) / d, the first length is R = dot(D,M,C) / d, and the second length is R = dot(C,N,D) / d.

[0130] Further, vertex coordinate data of the first vertex may be determined based on the second length and the first distance, and the first coordinate data and the second coordinate data. Vertex coordinate data of the second vertex may be determined based on the first length and the first distance, and the first coordinate data and the second coordinate data. Vertex coordinate data of the third vertex may be determined based on the height of the region schematic diagram and the first distance, the first coordinate data and the second coordinate data, and the coordinate data of the second vertex. Vertex coordinate data of the fourth vertex may be determined based on the height of the region schematic diagram and the first distance, the first coordinate data and the second coordinate data, and the coordinate data of the first vertex.

[0131] For example, Figure 7 In the schematic diagram of the region shown, the first coordinate data, that is, the coordinate data of point D, is (d0, d1), the second coordinate data, that is, the coordinate data of point C, is (c0, c1), the first vertex is point P1, the second vertex is point P2, the third vertex is point P3, and the fourth vertex is point P4. The X-axis coordinate data of the first vertex is The Y-axis coordinate data is The X-axis coordinate data of the second vertex is The Y-axis coordinate data is The X-axis coordinate data of the third vertex is The Y-axis coordinate data is The X-axis coordinate data of the fourth vertex is The Y-axis coordinate data is

[0132] S605, generating a region schematic diagram based on vertex coordinate data of a plurality of vertices.

[0133] In some implementations, multiple vertices may be connected clockwise or counterclockwise using straight lines to obtain a region diagram. Figure 7 As shown, point P1, point P2, point P3 and point P4 are four vertices of the region schematic diagram, and a regular rectangle enclosed in a counterclockwise direction is the region schematic diagram.

[0134] In the method for locating the area provided in the embodiment of the present application, a simulated graphic of the target area is generated, and the coordinate data of the intersection point between any two simulated edges in the simulated graphic is determined. By determining the target intersection point, the first edge intersection point, and the second edge intersection point, and calculating the vertex coordinate data of the regional schematic diagram, accurate vertex coordinate data can be obtained, and finally a regional schematic diagram of the target area is generated, reducing the error of the regional schematic diagram. By generating a simulated graphic through a portable positioning chip, the cost of the positioning equipment is saved, and it is convenient to draw a simulated graphic of the target area. By determining the vertex coordinate data, a regional schematic diagram of a regular shape can be obtained, which provides a standardized reference site for subsequent monitoring of the motion trajectory of a moving object.

[0135] Based on the above embodiment, the embodiment of the present application can also explain the process of determining the target intersection point, such as Figure 8 As shown, the process of determining the target intersection point includes but is not limited to the following steps:

[0136] S801, obtaining a second cross product result between a sixth vector and the first vector, wherein the first vector is a vector starting from the first intersection point and pointing to the second intersection point, and the sixth vector is a vector starting from the first intersection point and pointing to the third intersection point of the target area.

[0137] In some implementations, the target intersection point may be determined by calculating the cross product results between two intersection points opposite to the reference side in the simulation graph and the first intersection point and the second intersection point, and comparing the magnitudes of the cross product results.

[0138] Optionally, a vector starting from the first intersection point and pointing to the second intersection point is used as the first vector, and a vector starting from the first intersection point and pointing to the third intersection point of the target area is used as the sixth vector. By performing a cross product calculation between the sixth vector and the first vector, a second cross product result can be obtained.

[0139] For example, Figure 4In the simulation figure shown, there are four intersection points A, B, C, and D. Assuming the DC edge as the reference edge, point D is the first intersection point, point C is the second intersection point, point A is the third intersection point, the first vector is vector DC, and the sixth vector is vector DA. Assuming the second cross product result is distance_one, distance_one = cross(D,A,C) = DA×DC.

[0140] S802, obtaining a third cross product result between the second vector and the seventh vector, wherein the second vector is a vector starting from the second intersection point and pointing to the first intersection point, and the seventh vector is a vector starting from the second intersection point and pointing to the fourth intersection point of the target area.

[0141] Optionally, the vector starting from the second intersection point and pointing to the first intersection point is used as the second vector, and the fourth intersection point starting from the second intersection point and pointing to the target area is used as the seventh vector. By performing a cross product calculation between the second vector and the seventh vector, a third cross product result can be obtained.

[0142] For example, Figure 4 In the simulation figure shown, there are four intersection points A, B, C, and D. Assuming the DC edge as the reference edge, point D is the first intersection point, point C is the second intersection point, point B is the third intersection point, the second vector is vector CD, and the seventh vector is vector CB. Assuming the second cross product result is distance_two, then distance_two = cross(C, D, B) = CD × CB.

[0143] S803, selecting the maximum cross product result from the second cross product result and the third cross product result, and taking the intersection point corresponding to the maximum cross product result as the target intersection point.

[0144] In some implementations, the target intersection point can be determined by comparing the second cross product result and the third cross product result. Optionally, if the second cross product result is greater than the third cross product result, the third intersection point is the target intersection point; if the second cross product result is less than the third cross product result, the fourth intersection point is the target intersection point.

[0145] For example, Figure 4 If distance_one is greater than distance_two, point A is the target intersection point. If distance_one is less than distance_two, point B is the target intersection point.

[0146] In the method for locating the area provided in the embodiment of the present application, a simulated graph of the target area is generated, and the coordinate data of the intersection point between any two simulated edges in the simulated graph is determined. The target intersection point can be determined based on the cross product result between the vectors. By determining the target intersection point, the first edge intersection point and the second edge intersection point, and calculating the vertex coordinate data of the regional schematic diagram, accurate vertex coordinate data can be obtained, and finally a regional schematic diagram of the target area is generated, reducing the error of the regional schematic diagram. The simulated graph is generated by a portable positioning chip, which saves the cost of the positioning equipment and facilitates the drawing of the simulated graph of the target area. By determining the vertex coordinate data, a regional schematic diagram of a regular shape can be obtained, which provides a standardized reference site for subsequent monitoring of the motion trajectory of the moving object.

[0147] Based on the above embodiments, the embodiments of the present application can explain the process of determining the edge intersection point, such as Fig. 9 As shown, the process of determining the edge intersection point includes but is not limited to the following steps:

[0148] S901: Determine a starting intersection point corresponding to any edge intersection point from the first intersection point and the second intersection point.

[0149] In some implementations, any edge intersection point can be determined to be a first edge intersection point or a second edge intersection point by calculating the dot product result between the starting intersection point corresponding to any edge intersection point and another intersection point on the reference edge, and comparing the size of the dot product result.

[0150] It can be understood that the two intersection points on the reference edge are the first intersection point and the second intersection point. The first intersection point is the left point on the reference edge. The second intersection point is the right point on the reference edge. If the first edge intersection point located on the right side of the reference edge is determined, the corresponding starting intersection point is the first intersection point. If the second edge intersection point located on the left side of the reference edge is determined, the corresponding starting intersection point is the second intersection point.

[0151] S902, obtaining a third dot product result of the eighth vector and the eighth vector, wherein the eighth vector is a vector starting from the starting intersection and pointing to another intersection point on the baseline.

[0152] In some implementations, for the first edge intersection point, the eighth vector is a vector starting from the first intersection point and pointing to the second intersection point on the baseline, and then the dot product calculation is performed on the eighth vector and the eighth vector to obtain a third dot product result.

[0153] For example, Figure 4In the simulation figure shown, there are four intersection points A, B, C, and D. Suppose the DC edge is the reference edge, then point D is the first intersection point, point C is the second intersection point, then the eighth vector is vector DC, and suppose the result of the third dot product is distance_three, then distance_three = dot(D, C, C), which means the dot product of vector DC and vector DC with point D as the starting point.

[0154] In some implementations, for the second edge intersection point, the eighth vector is a vector starting from the second intersection point and pointing to the first intersection point on the baseline, and then the dot product calculation is performed on the eighth vector and the eighth vector to obtain a third dot product result.

[0155] For example, Figure 4 In the simulation figure shown, there are four intersection points A, B, C, and D. Suppose the DC edge is the reference edge, then point D is the first intersection point, point C is the second intersection point, then the eighth vector is vector CD, and suppose the result of the third dot product is distance_five, then distance_five = dot(C, D, D), which means the dot product of vector CD and vector CD with point D as the starting point.

[0156] S903, obtaining a fourth dot product result of the eighth vector and the ninth vector, wherein the ninth vector is a vector starting from the starting intersection point and pointing to the fifth intersection point on the same diagonal as the starting intersection point.

[0157] In some implementations, for the first edge intersection point, the eighth vector is a vector starting from the first intersection point and pointing to the second intersection point, and the ninth vector is a vector starting from the first intersection point and pointing to the fifth intersection point on the same diagonal as the first intersection point. Then, the eighth vector and the ninth vector are dotted to obtain a fourth dot product result.

[0158] For example, Figure 4 In the simulation figure shown, there are four intersection points A, B, C, and D. Let the DC edge be the reference edge, then point D is the first intersection point, point C is the second intersection point, and point B is the fifth intersection point. The eighth vector is vector CD, and the ninth vector is vector CA. Let the result of the fourth dot product be distance_four, then distance_four = dot(D,C,B), which means the dot product of vector DC and vector DB with point D as the starting point.

[0159] In some implementations, for the second edge intersection point, the eighth vector is a vector starting from the second intersection point and pointing to the first intersection point, and the ninth vector is a vector starting from the second intersection point and pointing to the fifth intersection point on the same diagonal as the first. The eighth vector and the ninth vector are then dotted to obtain a fourth dot product result.

[0160] For example, Figure 4In the simulation figure shown, there are four intersection points A, B, C, and D. If the DC edge is the reference edge, then point D is the first intersection point, point C is the second intersection point, and point A is the fifth intersection point. The eighth vector is vector DC, and the ninth vector is DB. If the result of the fourth dot product is distance_six, then distance_six = dot(C, D, A), which means the dot product of vector CD and vector CA with point C as the starting point.

[0161] S904, selecting the maximum dot product result between the third dot product result and the fourth dot product result, and taking the intersection point corresponding to the maximum dot product result as any edge intersection point.

[0162] In some implementations, any edge intersection point may be determined by comparing the third dot product result and the fourth dot product result. Optionally, for the first edge intersection point, if the third dot product result is greater than the fourth dot product result, the second intersection point is taken as the first edge intersection point; if the third dot product result is less than the fourth dot product result, the fifth intersection point is taken as the first edge intersection point.

[0163] For example, Figure 4 In the example, if distance_three is greater than distance_four, point C is the first edge intersection point. If distance_three is less than distance_four, point B is the first edge intersection point, and the first edge intersection point is recorded as M.

[0164] Optionally, for the second edge intersection point, if the third dot product result is greater than the fourth dot product result, the first intersection point is taken as the second edge intersection point; if the third dot product result is less than the fourth dot product result, the fifth intersection point is taken as the first edge intersection point.

[0165] For example, Figure 4 In the example, if distance_five is greater than distance_six, point D is the second edge intersection point. If distance_five is less than distance_six, point A is the second edge intersection point, and the second edge intersection point is recorded as N.

[0166] In the method for locating the area provided in the embodiment of the present application, a simulated graph of the target area is generated, and the coordinate data of the intersection point between any two simulated edges in the simulated graph is determined. Any edge intersection point can be determined based on the result of the dot multiplication between vectors. By determining the target intersection point, the first edge intersection point, and the second edge intersection point, and calculating the vertex coordinate data of the regional schematic diagram, accurate vertex coordinate data can be obtained, and finally a regional schematic diagram of the target area is generated, reducing the error of the regional schematic diagram. By generating a simulated graph through a portable positioning chip, the cost of the positioning device is saved, and the simulated graph of the target area is conveniently drawn. By determining the vertex coordinate data, a regional schematic diagram of a regular shape can be obtained, which provides a standardized reference site for subsequent monitoring of the motion trajectory of a moving object.

[0167] Fig.10 is a flow chart of a method for locating an area according to an exemplary embodiment. Fig.10 As shown, the method for locating a region in the embodiment of the present application includes but is not limited to the following steps:

[0168] S1001, obtaining a simulation graph of a target area.

[0169] In the embodiment of the present application, the implementation method of step S1001 can be implemented by any method in the embodiments of the present application, which is not limited here and will not be repeated.

[0170] S1002, determining the coordinate data of the intersection point between any two simulated edges on the simulated graph.

[0171] In the embodiment of the present application, the implementation method of step S1002 can be implemented by any method in the embodiments of the present application, which is not limited here and will not be repeated.

[0172] S1003, obtaining a region schematic diagram corresponding to each simulated edge.

[0173] In some implementations, each simulated edge in the simulated graph may be used as a reference edge, and by executing steps S603 to S605, a region schematic diagram corresponding to each simulated edge may be obtained.

[0174] For example, Fig.11 The diagram shows a region diagram generated by taking edge AB as the reference edge. Fig.12 The diagram shows a region diagram generated by using edge AD as a reference edge. Fig.13 The diagram shows a region diagram generated using edge BC as a reference edge.

[0175] S1004, receiving a schematic diagram selection instruction, and based on the schematic diagram selection instruction, selecting a final area schematic diagram of the target area from the area schematic diagrams corresponding to each simulation edge.

[0176] In some implementations, the generated area schematic diagrams can be displayed to the user. If the user selects one of the area schematic diagrams, it will be used as the final area schematic diagram of the target area. Optionally, the user can click on the area schematic diagram to generate a corresponding schematic selection indication. Then, based on the schematic selection indication, the final area schematic diagram of the target area is determined. For example, the user selects Figure 7 , Fig.11 , Fig.12 and Fig.13 In the user selection Fig.11 ,but Fig.11 The region schematic diagram shown is the final region schematic diagram.

[0177] In some implementations, the regional schematic diagrams corresponding to the simulated edges may be traversed, and during the traversal process, the final regional schematic diagram of the target area may be determined. Optionally, the regional schematic diagrams corresponding to the simulated edges are obtained by traversing, and during the traversal process, if the regional schematic diagram corresponding to one of the simulated edges is selected as the final regional schematic diagram of the target area, the generation of the regional schematic diagrams corresponding to the subsequent simulated edges is stopped.

[0178] In some implementations, if the final region diagram of the target region is not selected from the region diagrams corresponding to each simulated edge, the process returns to executing the simulated graphics of the target region and subsequent steps until the final region diagram of the target region is obtained.

[0179] In the method for locating an area provided in an embodiment of the present application, a simulated graphic of a target area is generated, and the coordinate data of the intersection point between any two simulated edges in the simulated graphic is determined. Based on the coordinate data of the intersection point, the vertex coordinate data of the area schematic diagram can be calculated to generate an area schematic diagram of the target area. By generating a simulated graphic through a portable positioning chip, the cost of the positioning device is saved, and the simulated graphic of the target area is conveniently drawn. By determining the vertex coordinate data, a regular-shaped area schematic diagram can be obtained, which provides a standardized reference site for subsequent monitoring of the motion trajectory of the moving object. In the case where the user is not satisfied with the area schematic diagram, the simulated graphic of the target area can be regenerated, and the area schematic diagram can be obtained again, which can meet the user's demand for the area schematic diagram and improve the user's experience.

[0180] like Fig.14What is shown is a flow chart of generating a regional schematic diagram, wherein the target area is a football field. When the number of coordinate solutions of the football field does not exceed N times, the user collects the positioning data of a physical side of the football field and transmits it to the application software, which can generate a simulated side corresponding to the physical side of the football field. By collecting the positioning data of the four physical sides of the football field, the corresponding four simulated sides and the coordinate data of the intersection point between any two simulated sides are obtained. The regional schematic diagram is calculated based on the coordinate data and displayed to the user. If the user determines that the regional schematic diagram does not conform to the football field. Then re-collect the positioning data of a physical side of the football field, obtain the corresponding simulation graphics and subsequent steps, until the user determines that the regional schematic diagram conforms to the football field, then the regional schematic diagram is the final regional schematic diagram of the football field.

[0181] Fig.15 is a flow chart of a method for locating an area according to an exemplary embodiment. Fig.15 As shown, the method for locating a region in the embodiment of the present application includes but is not limited to the following steps:

[0182] S1501, obtaining multiple positioning data on each physical edge of the target area.

[0183] S1502: For each physical edge, perform straight line fitting on the positioning data on the physical edge to determine the simulation edge corresponding to the physical edge, and form a simulation graph using the simulation edge.

[0184] S1503, receiving an adjustment request for any simulated edge in the simulated graph, and re-collecting positioning data of a target physical edge corresponding to any simulated edge according to the adjustment request.

[0185] S1504, based on the positioning data re-collected from the target physical edge, the simulation graph is updated, and the coordinate data of the intersection point between any two simulation edges on the simulation graph is determined.

[0186] S1505, taking any simulated edge as a reference edge, based on the coordinate data of the intersection points, determining the target intersection point farthest from the reference edge from the intersection points, and obtaining the first edge intersection point and the second edge intersection point of the simulated figure corresponding to the reference edge.

[0187] S1506, determining vertex coordinate data of a plurality of vertices on the region schematic diagram based on the target intersection point, the first edge intersection point, the second edge intersection point, and the first intersection point and the second intersection point on the reference edge.

[0188] S1507, generating a region schematic diagram based on vertex coordinate data of a plurality of vertices.

[0189] S1508, obtaining a region schematic diagram corresponding to each simulated edge.

[0190] S1509, receiving a schematic diagram selection instruction, and based on the schematic diagram selection instruction, selecting a final area schematic diagram of the target area from the area schematic diagrams corresponding to each simulation edge.

[0191] In the method for locating an area provided in an embodiment of the present application, a simulated graphic of a target area is generated, and the coordinate data of the intersection point between any two simulated edges in the simulated graphic is determined. Based on the coordinate data of the intersection point, the vertex coordinate data of the area schematic diagram can be calculated, and finally a regional schematic diagram of the target area is generated. By generating a simulated graphic through a portable positioning chip, the cost of the positioning equipment is saved, and the simulated graphic of the target area is conveniently drawn. By determining the vertex coordinate data, a regional schematic diagram of a regular shape can be obtained, which provides a standardized reference site for subsequent monitoring of the motion trajectory of a moving object. In the case where the user is not satisfied with the regional schematic diagram, the simulated graphic of the target area can be regenerated, and the regional schematic diagram can be obtained again, which can meet the user's demand for the regional schematic diagram and improve the user's experience.

[0192] Fig.16 FIG. 1 is a structural block diagram of a device for locating a region according to an exemplary embodiment. Fig.16 The area positioning device 1600 of the embodiment of the present application includes: an acquisition module 1601 , a first determination module 1602 , and a second determination module 1603 .

[0193] The acquisition module 1601 is used to acquire the simulated graphics of the target area.

[0194] The first determination module 1602 is used to determine the coordinate data of the intersection point between any two simulated edges on the simulated graph.

[0195] The second determining module 1603 is used to determine the area schematic diagram of the target area based on the coordinate data of the intersection point.

[0196] In one embodiment of the present application, the acquisition module 1601 is also used to: obtain multiple positioning data on each physical edge of the target area; for each physical edge, perform straight line fitting on the positioning data on the physical edge, determine the simulated edge corresponding to the physical edge, and enclose the simulated figure with the simulated edges.

[0197] In one embodiment of the present application, the acquisition module 1601 is also used to: determine, for each of the intersection points, the first simulated edge and the second simulated edge connected by the intersection point; determine the first slope and the first X-axis intercept of the first simulated edge, and the second slope and the second X-axis intercept of the second simulated edge; and determine the coordinate data of the intersection point based on the first slope and the first X-axis intercept, and the second slope and the second X-axis intercept.

[0198] In one embodiment of the present application, the acquisition module 1601 is further used to: acquire vertex positioning data of multiple vertices of the target area, and map the vertex positioning data to obtain mapping coordinate data; connect the mapping coordinate data to generate the simulation graphics.

[0199] In one embodiment of the present application, the acquisition module 1601 is further used to: determine the mapping coordinate data as the coordinate data of the intersection point.

[0200] In one embodiment of the present application, the device also includes: receiving an adjustment request for any simulated edge in the simulated graph, and re-collecting the positioning data of the target physical edge corresponding to any simulated edge according to the adjustment request; and updating the simulated graph based on the re-collected positioning data of the target physical edge.

[0201] In one embodiment of the present application, the second determination module 1603 is also used to: take any simulated edge as a reference edge, and based on the coordinate data of the intersection points, determine the target intersection point farthest from the reference edge from the intersection points, and obtain the first edge intersection point and the second edge intersection point of the simulated figure corresponding to the reference edge; determine the vertex coordinate data of multiple vertices on the area schematic diagram based on the target intersection point, the first edge intersection point, the second edge intersection point, and the first intersection point and the second intersection point on the reference edge; and generate the area schematic diagram based on the vertex coordinate data of the multiple vertices.

[0202] In one embodiment of the present application, the second determination module 1603 is also used to: obtain a first cross product result between a third vector and a first vector, wherein the first vector is a vector pointing from the first intersection point to the second intersection point, and the third vector is a vector pointing from the first intersection point to the target intersection point; obtain a first dot product result between a fourth vector and the first vector, wherein the fourth vector is a vector pointing from the first intersection point to the first edge intersection point; obtain a second dot product result between the fifth vector and the second vector, wherein the second vector is a vector pointing from the second intersection point to the first intersection point, and the fifth vector is a vector pointing from the second intersection point to the second edge intersection point; determine the vertex coordinate data of the multiple vertices based on the first cross product result, the first dot product result and the second dot product result, as well as the first intersection point and the second intersection point.

[0203] In one embodiment of the present application, the second determination module 1603 is also used to: determine the first distance between the first intersection point and the second intersection point based on the first coordinate data of the first intersection point and the second coordinate data of the second intersection point; obtain the height of the area schematic diagram based on the first cross product result and the first distance; obtain the first length from the first intersection point to the first edge intersection point based on the first dot product result and the first distance; obtain the second length from the second intersection point to the second edge point based on the second dot product result and the first distance; determine the vertex coordinate data of the first vertex based on the second length and the first distance, as well as the first coordinate data and the second coordinate data; determine the vertex coordinate data of the second vertex based on the first length and the first distance, as well as the first coordinate data and the second coordinate data; determine the vertex coordinate data of the third vertex based on the height of the area schematic diagram and the first distance, the first coordinate data and the second coordinate data, and the coordinate data of the second vertex; determine the vertex coordinate data of the fourth vertex based on the height of the area schematic diagram and the first distance, the first coordinate data and the second coordinate data, and the coordinate data of the first vertex.

[0204] In one embodiment of the present application, the second determination module 1603 is also used to: obtain a second cross product result between the sixth vector and the first vector, wherein the first vector is a vector pointing from the first intersection point to the second intersection point, and the sixth vector is a vector pointing from the first intersection point to the third intersection point of the target area; obtain a third cross product result between the second vector and the seventh vector, wherein the second vector is a vector pointing from the second intersection point to the first intersection point, and the seventh vector is a vector pointing from the second intersection point to the fourth intersection point of the target area; select the maximum cross product result between the second cross product result and the third cross product result, and use the intersection point corresponding to the maximum cross product result as the target intersection point.

[0205] In one embodiment of the present application, the second determination module 1603 is also used to: determine the starting intersection point corresponding to any edge intersection point from the first intersection point and the second intersection point; obtain the third dot product result of the eighth vector and the eighth vector, wherein the eighth vector is a vector pointing from the starting intersection to another intersection point on the baseline; obtain the fourth dot product result of the eighth vector and the ninth vector, wherein the ninth vector is a vector pointing from the starting intersection point to the fifth intersection point on the same diagonal as the starting intersection point; select the maximum dot product result from the third dot product result and the fourth dot product result, and use the intersection point corresponding to the maximum dot product result as any edge intersection point.

[0206] In one embodiment of the present application, the device also includes: obtaining the area schematic diagram corresponding to each simulated edge; receiving a schematic diagram selection indication, and based on the schematic diagram selection indication, selecting the final area schematic diagram of the target area from the area schematic diagrams corresponding to each simulated edge.

[0207] In one embodiment of the present application, the device also includes: traversing to obtain the area schematic diagram corresponding to the simulated edge, and during the traversal process, if the area schematic diagram corresponding to one of the simulated edges is selected as the final area schematic diagram of the target area, stopping the generation of the area schematic diagram corresponding to the subsequent simulated edge.

[0208] In one embodiment of the present application, the device further includes: if the final area schematic diagram of the target area is not selected from the area schematic diagram corresponding to each of the simulated edges, returning to execute the simulated graphics of the target area and subsequent steps.

[0209] In the method for locating an area provided in an embodiment of the present application, a simulated graphic of a target area is generated, and the coordinate data of the intersection point between any two simulated edges in the simulated graphic is determined. Based on the coordinate data of the intersection point, the vertex coordinate data of the area schematic diagram can be calculated, and finally a regional schematic diagram of the target area is generated. By generating a simulated graphic through a portable positioning chip, the cost of the positioning equipment is saved, and the simulated graphic of the target area is conveniently drawn. By determining the vertex coordinate data, a regional schematic diagram of a regular shape can be obtained, which provides a standardized reference site for subsequent monitoring of the motion trajectory of a moving object. In the case where the user is not satisfied with the regional schematic diagram, the simulated graphic of the target area can be regenerated, and the regional schematic diagram can be obtained again, which can meet the user's demand for the regional schematic diagram and improve the user's experience.

[0210] Fig.17 It is a block diagram of an electronic device according to an exemplary embodiment. Fig.17 The electronic device shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0211] like Fig.17As shown, the electronic device 1700 includes a processor 1701, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 1702 or the program loaded from the memory 1706 to the random access memory (RAM) 1703. In the RAM 1703, various programs and data required for the operation of the electronic device 1700 are also stored. The processor 1701, the ROM 1702 and the RAM 1703 are connected to each other through a bus 1704. An input / output (I / O) interface 1705 is also connected to the bus 1704.

[0212] The following components are connected to the I / O interface 1705: a memory 1706 including a hard disk, etc.; and a communication part 1707 including a network interface card such as a local area network (LAN) card, a modem, etc., and the communication part 1707 performs communication processing via a network such as the Internet; a drive 1708 is also connected to the I / O interface 1705 as needed.

[0213] In particular, according to an embodiment of the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present application includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 1707. When the computer program is executed by the processor 1701, the above-mentioned functions defined in the method of the present application are executed.

[0214] In an exemplary embodiment, a storage medium including instructions is also provided, such as a memory including instructions, and the instructions can be executed by the processor 1701 of the electronic device 1700 to complete the above method. Optionally, the storage medium can be a non-transitory computer-readable storage medium, for example, the non-transitory computer-readable storage medium can be a ROM, a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, etc.

[0215] In the present application, a computer-readable storage medium may be any tangible medium containing or storing a program that may be used by or in combination with an instruction execution system, apparatus, or device. In the present application, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium, which may send, propagate, or transmit a program for use by or in combination with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium may be transmitted using any suitable medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0216] Fig.18 The present invention is a structural block diagram of an electronic device according to an exemplary embodiment. Fig.18 The electronic device shown is only an example and should not limit the functions and scope of use of the embodiments of the present application. Fig.18 As shown, the electronic device 1800 includes a processor 1801 and a memory 1802. The memory 1802 is used to store program codes, and the processor 1801 is connected to the memory 1802 to read the program codes from the memory 1802 to implement the method for locating the area in the above embodiment.

[0217] Optionally, the number of processors 1801 may be one or more.

[0218] Optionally, the electronic device may further include an interface 1803, and the number of the interface 1803 may be multiple. The interface 1803 may be connected to an application program and may receive data from an external device such as a sensor.

[0219] Those skilled in the art will readily appreciate other embodiments of the present invention after considering the specification and practicing the invention disclosed herein. This application is intended to cover any variations, uses or adaptations of the present invention that follow the general principles of the present invention and include common knowledge or customary techniques in the art that are not disclosed in this application. The specification and examples are intended to be exemplary only, and the true scope and spirit of the present application are indicated by the following claims.

[0220] It should be understood that the present application is not limited to the precise structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present application is limited only by the appended claims.

Claims

1. A method for locating an area, characterized in that: The method comprises: Obtain a simulated graphic of the target area; Determine the coordinate data of the intersection point between any two simulated edges on the simulated graph; Based on the coordinate data of the intersection point, a regional schematic diagram of the target area is determined.

2. The method according to claim 1, characterized in that The step of obtaining a simulated graphic of a target area includes: Acquire multiple positioning data on each physical edge of the target area; For each of the physical edges, straight line fitting is performed on the positioning data on the physical edge to determine the simulation edge corresponding to the physical edge, and the simulation edge is used to enclose the simulation graph.

3. The method according to claim 2, characterized in that The step of determining the coordinate data of the intersection point between any two simulated edges on the simulated graph includes: For each of the intersection points, determining a first simulated edge and a second simulated edge connected to the intersection point; determining a first slope and a first X-intercept of the first simulated edge, and a second slope and a second X-intercept of the second simulated edge; Based on the first slope and the first X-axis intercept, and the second slope and the second X-axis intercept, coordinate data of the intersection point is determined.

4. The method according to claim 1, characterized in that: The step of obtaining a simulated graphic of a target area includes: Acquire vertex positioning data of a plurality of vertices of the target area, and map the vertex positioning data to obtain mapping coordinate data; The mapping coordinate data are connected to generate the simulation graph.

5. The method according to claim 4, characterized in that The step of determining the coordinate data of the intersection point between any two simulated edges on the simulated graph includes: The mapped coordinate data is determined as the coordinate data of the intersection point.

6. The method according to any one of claims 1 to 3, characterized in that The method further comprises: receiving an adjustment request for any simulated edge in the simulated graph, and re-collecting positioning data of a target physical edge corresponding to any simulated edge according to the adjustment request; The simulation graph is updated based on the re-collected positioning data of the target physical edge.

7. The method according to any one of claims 1 to 5, characterized in that The step of determining the area schematic diagram of the target area based on the coordinate data of the intersection point comprises: Taking any simulated edge as a reference edge, based on the coordinate data of the intersection points, determining a target intersection point farthest from the reference edge from the intersection points, and obtaining a first edge intersection point and a second edge intersection point of the simulated figure corresponding to the reference edge; Determining vertex coordinate data of a plurality of vertices on the region schematic diagram based on the target intersection point, the first edge intersection point, the second edge intersection point, and the first intersection point and the second intersection point on the reference edge; The region schematic diagram is generated based on the vertex coordinate data of the plurality of vertices.

8. The method according to claim 7, characterized in that The step of determining vertex coordinate data of a plurality of vertices on the region schematic diagram based on the target intersection point, the first edge intersection point, the second edge intersection point, and the first intersection point and the second intersection point on the reference edge includes: Obtaining a first cross product result between a third vector and the first vector, wherein the first vector is a vector starting from the first intersection point and pointing to the second intersection point, and the third vector is a vector starting from the first intersection point and pointing to the target intersection point; Obtain a first dot product result between a fourth vector and the first vector, wherein the fourth vector is a vector starting from the first intersection point and pointing to the first edge intersection point; Obtain a second dot product result between the fifth vector and the second vector, wherein the second vector is a vector starting from the second intersection point and pointing to the first intersection point, and the fifth vector is a vector starting from the second intersection point and pointing to the second edge intersection point; Vertex coordinate data of the plurality of vertices are determined based on the first cross product result, the first dot product result, the second dot product result, and the first intersection point and the second intersection point.

9. The method according to claim 8, characterized in that The determining of vertex coordinate data of the plurality of vertices based on the first cross product result, the first dot product result, the second dot product result, and the first intersection point and the second intersection point includes: Determine a first distance between the first intersection point and the second intersection point based on the first coordinate data of the first intersection point and the second coordinate data of the second intersection point; Based on the first cross product result and the first distance, obtaining a height of the region schematic diagram; Obtaining a first length from the first intersection point to the first edge intersection point based on the first dot product result and the first distance; Obtaining a second length from the second intersection point to the second edge point based on the second dot product result and the first distance; Determine vertex coordinate data of a first vertex based on the second length and the first distance, and the first coordinate data and the second coordinate data; Determine vertex coordinate data of a second vertex based on the first length and the first distance, and the first coordinate data and the second coordinate data; Determine vertex coordinate data of a third vertex based on the height of the area schematic diagram and the first distance, the first coordinate data and the second coordinate data, and the coordinate data of the second vertex; Vertex coordinate data of a fourth vertex is determined based on the height of the area schematic diagram and the first distance, the first coordinate data and the second coordinate data, and the coordinate data of the first vertex.

10. The method according to claim 7, characterized in that The step of determining, based on the coordinate data of the intersection points, a target intersection point farthest from the reference edge from the intersection points comprises: Obtaining a second cross product result between a sixth vector and a first vector, wherein the first vector is a vector starting from the first intersection point and pointing to the second intersection point, and the sixth vector is a vector starting from the first intersection point and pointing to a third intersection point of the target area; Obtaining a third cross product result between a second vector and a seventh vector, wherein the second vector is a vector starting from the second intersection point and pointing to the first intersection point, and the seventh vector is a vector starting from the second intersection point and pointing to a fourth intersection point of the target area; The maximum cross product result between the second cross product result and the third cross product result is selected, and the intersection point corresponding to the maximum cross product result is used as the target intersection point.

11. The method according to claim 7, characterized in that The process of determining any edge intersection point includes: Determine a starting intersection point corresponding to any edge intersection point from the first intersection point and the second intersection point; Obtain a third dot product result of an eighth vector and the eighth vector, wherein the eighth vector is a vector starting from the starting intersection and pointing to another intersection point on the baseline; Obtain a fourth dot product result of the eighth vector and the ninth vector, wherein the ninth vector is a vector starting from the starting intersection point and pointing to the fifth intersection point on the same diagonal as the starting intersection point; The maximum dot product result between the third dot product result and the fourth dot product result is selected, and the intersection point corresponding to the maximum dot product result is used as any edge intersection point.

12. The method according to claim 7, characterized in that The method further comprises: Obtaining the regional schematic diagram corresponding to each simulated edge; A schematic diagram selection instruction is received, and based on the schematic diagram selection instruction, a final area schematic diagram of the target area is selected from the area schematic diagrams corresponding to each simulated edge.

13. The method according to claim 12, characterized in that The method further comprises: The area schematic diagrams corresponding to the simulated edges are traversed to obtain. During the traversal process, if the area schematic diagram corresponding to one of the simulated edges is selected as the final area schematic diagram of the target area, the generation of the area schematic diagrams corresponding to the subsequent simulated edges is stopped.

14. The method according to claim 11 or 12, characterized in that: The method further comprises: If the final region schematic diagram of the target region is not selected from the region schematic diagrams corresponding to each of the simulated edges, the process returns to executing the simulated graphics of the target region and subsequent steps.

15. A device for locating an area, characterized in that: The device comprises: An acquisition module, used for acquiring a simulated image of a target area; A first determination module, used to determine the coordinate data of the intersection point between any two simulated edges on the simulated graph; The second determining module is used to determine the area schematic diagram of the target area based on the coordinate data of the intersection point.

16. An electronic device, characterized in that: include: processor; a memory for storing processor-executable instructions; The processor is configured to implement the steps of the method according to any one of claims 1 to 14.

17. A computer-readable storage medium having computer program instructions stored thereon, characterized in that: When the program instructions are executed by a processor, the steps of the method described in any one of claims 1 to 14 are implemented.

Images