Method, device, computer equipment and storage medium for determining spatial binary group

Abstract

The present disclosure proposes a method, device, computer equipment and storage medium for determining a spatial binary group, which specifically relates to the field of computer technology. The method includes: obtaining a given spatial distance and multiple spatial objects, wherein each of the spatial objects belongs to a first spatial object set or a second spatial object set; determining a global domain according to the minimum bounding rectangle and the extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set respectively; dividing the global domain into subspaces to obtain multiple subspaces; partitioning the multiple spatial objects according to the positional relationship between each of the spatial objects and each of the subspaces to determine the spatial objects contained in each subspace; determining a spatial binary group included in each of the subspaces that matches the given spatial distance according to the spatial distance between each of the spatial objects in each of the subspaces, thereby improving processing efficiency.

Description

Technical Field

[0001] The present disclosure relates to the field of computer technology, and in particular to a method, apparatus, computer device and storage medium for determining a spatial binary group. Background Art

[0002] With the popularization of global positioning systems and mobile Internet devices, massive amounts of spatial data are generated. Distance connection of spatial data is one of the most commonly used spatial analysis operators, and has a wide range of application scenarios, such as finding points of interest within 500 meters of a subway station, helping companies with site planning, finding roads and bridges crossed by rivers, and troubleshooting flood risks. In the spatial partitioning stage, if the global domain is selected to be too large and invalid data that does not contribute to the final result is not filtered out in advance, it may cause a waste of network bandwidth and computing storage resources, and ultimately reduce overall performance. How to select a more appropriate global domain is crucial. Summary of the invention

[0003] The present disclosure aims to solve one of the technical problems in the related art at least to some extent.

[0004] The first aspect of the present disclosure provides a method for determining a spatial binary, including:

[0005] Acquire a given spatial distance and a plurality of spatial objects, wherein each of the spatial objects belongs to a first spatial object set or a second spatial object set;

[0006] Determine a global domain according to the minimum bounding rectangle and the extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set respectively;

[0007] Dividing the global domain into subspaces to obtain a plurality of subspaces;

[0008] Partitioning the plurality of spatial objects according to a positional relationship between each of the spatial objects and each of the subspaces to determine the spatial objects contained in each subspace;

[0009] According to the spatial distances between the spatial objects in each of the subspaces, a spatial tuple included in each of the subspaces and matching the given spatial distance is determined.

[0010] The second aspect of the present disclosure provides a device for determining a spatial binary group, including:

[0011] A first acquisition module, used for acquiring a given spatial distance and a plurality of spatial objects, wherein each of the spatial objects belongs to a first spatial object set or a second spatial object set;

[0012] A first determining module, configured to determine a global domain according to a minimum bounding rectangle and an extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set respectively;

[0013] A second acquisition module is used to divide the global domain into subspaces to obtain multiple subspaces;

[0014] A second determining module, configured to partition the plurality of spatial objects according to a positional relationship between each of the spatial objects and each of the subspaces, so as to determine a spatial object contained in each subspace;

[0015] The third determination module is used to determine the spatial binary group included in each of the subspaces and matching the given spatial distance according to the spatial distances between the spatial objects in each of the subspaces.

[0016] The third aspect embodiment of the present disclosure proposes a computer device, including: a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, the method for determining a spatial binary group proposed in the first aspect embodiment of the present disclosure is implemented.

[0017] The fourth aspect embodiment of the present disclosure proposes a non-temporary computer-readable storage medium storing a computer program, which, when executed by a processor, implements the method for determining a spatial binary group as proposed in the first aspect embodiment of the present disclosure.

[0018] The fifth aspect embodiment of the present disclosure proposes a computer program product. When the instruction processor in the computer program product executes, the method for determining the spatial binary group proposed in the first aspect embodiment of the present disclosure is executed.

[0019] The method, device, computer device and storage medium for determining a spatial binary provided by the embodiments of the present disclosure have the following beneficial effects:

[0020] The given spatial distance and multiple spatial objects can be obtained first, and then the global domain can be determined according to the minimum bounding rectangle and the extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set, so that the global domain can be divided into subspaces to obtain multiple subspaces, and then the multiple spatial objects can be partitioned according to the positional relationship between each spatial object and each subspace to determine the spatial objects contained in each subspace, that is, according to the spatial distance between each spatial object in each subspace, the spatial binary tuple included in each subspace that matches the given spatial distance can be determined. Therefore, the global domain is first determined according to the minimum bounding rectangle and the extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set, and then the spatial binary tuple in each subspace in the global domain is determined, and invalid data is filtered out in advance through a smaller global domain, which reduces resource overhead and improves data processing efficiency.

[0021] Additional aspects and advantages of the present disclosure will be given in part in the following description and in part will be obvious from the following description or learned through practice of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] The above and / or additional aspects and advantages of the present disclosure will become apparent and easily understood from the following description of the embodiments in conjunction with the accompanying drawings, in which:

[0023] Figure 1A A schematic diagram of a flow chart of a method for determining a spatial binary group provided in an embodiment of the present disclosure;

[0024] Figure 1B A global domain schematic diagram provided by an embodiment of the present disclosure;

[0025] Figure 2A A schematic diagram of the computation time consumption when determining a spatial binary provided by an embodiment of the present disclosure;

[0026] Figure 2B A schematic diagram of the computation time consumption when determining a spatial binary provided by an embodiment of the present disclosure;

[0027] Figure 2C A schematic diagram of the computation time consumption when determining a spatial binary provided by an embodiment of the present disclosure;

[0028] Figure 3A A schematic diagram of a flow chart of a method for determining a spatial binary group provided by another embodiment of the present disclosure;

[0029] Figure 3B A schematic diagram of a subspace provided by an embodiment of the present disclosure;

[0030] Figure 4AA schematic diagram of a flow chart of a method for determining a spatial binary group provided in yet another embodiment of the present disclosure;

[0031] Figure 4B A schematic diagram of a space binary and a subspace provided by an embodiment of the present disclosure;

[0032] Figure 5 A schematic diagram of the structure of a device for determining a spatial binary group provided by an embodiment of the present disclosure;

[0033] Figure 6 A schematic diagram of the structure of a device for determining a spatial binary group provided by another embodiment of the present disclosure;

[0034] Figure 7 A block diagram of an exemplary computer device suitable for implementing embodiments of the present disclosure is shown. DETAILED DESCRIPTION

[0035] Embodiments of the present disclosure are described in detail below, examples of which are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are intended to be used to explain the present disclosure, and should not be construed as limiting the present disclosure.

[0036] The following describes the method, apparatus, computer device, and storage medium for determining a spatial binary group according to an embodiment of the present disclosure with reference to the accompanying drawings.

[0037] Figure 1A A flowchart of a method for determining a spatial binary group provided in an embodiment of the present disclosure.

[0038] The embodiment of the present disclosure takes the method for determining a spatial binary group as an example in which the method is configured in a device for determining a spatial binary group. The device for determining a spatial binary group can be applied to any computer device so that the computer device can perform the function of determining a spatial binary group.

[0039] Among them, the computer device can be a personal computer (PC), a cloud device, a mobile device, etc. The mobile device can be, for example, a mobile phone, a tablet computer, a personal digital assistant, a wearable device, a car device, etc., which are hardware devices with various operating systems, touch screens and / or display screens.

[0040] like Figure 1A As shown, the method for determining the spatial binary group may include the following steps:

[0041] Step 101: Obtain a given spatial distance and a plurality of spatial objects, wherein each spatial object belongs to a first spatial object set or a second spatial object set.

[0042] The given spatial distance may be denoted as δ, which may be any positive number and is not limited in the present disclosure.

[0043] In addition, for the sake of convenience, the first spatial object set can be recorded as S, the second spatial object set can be recorded as R, the spatial objects belonging to the first spatial object set S among the acquired spatial objects can be recorded as s, and the spatial objects belonging to the second spatial object R among the acquired spatial objects can be recorded as r.

[0044] It can be understood that the spatial object can be a point object, or a line object, or a surface object, etc., and the present disclosure does not limit this.

[0045] It should be noted that the above δ, S, R, s, and r are merely illustrative illustrations and cannot be used as limitations on the spatial distance, first spatial object set, second spatial object set, spatial objects, etc. given in the present disclosure.

[0046] Step 102: determine a global domain according to the minimum bounding rectangle and the extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set respectively.

[0047] Among them, the minimum bounding rectangle (Minimum Bounding Rectangle, MBR for short) can also be called the minimum circumscribed rectangle, the minimum containing rectangle or the minimum enclosing rectangle. The minimum bounding rectangle refers to the maximum range of a number of two-dimensional shapes (such as points, lines, polygons) represented by two-dimensional coordinates, that is, a rectangle whose lower boundary is defined by the maximum horizontal coordinate, the minimum horizontal coordinate, the maximum vertical coordinate and the minimum vertical coordinate of each vertex of a given two-dimensional shape. Such a rectangle contains the given two-dimensional shape and its sides are parallel to the coordinate axes.

[0048] It can be understood that the minimum bounding rectangle corresponding to the first spatial object set may be a minimum rectangle that is parallel to the coordinate axis and contains all spatial objects in the first spatial object set.

[0049] In addition, the Expand Minimum Bounding Rectangle (EMBR for short) may be a rectangle obtained by expanding the corresponding minimum bounding rectangle by a corresponding value.

[0050] For example, the extended minimum bounding rectangle of the second spatial object set R can be the ε extension of the minimum bounding rectangle R.mbr, R.embr(ε)= <ex min ,ey min ,ex max ,ey max >= <x min -ε,y min -ε,x max +ε,ymax +ε>, where <x min ,y min ,x max ,y max > is the minimum bounding rectangle of R, where ε can be any given positive number, which is not limited in the present disclosure.

[0051] In addition, there are multiple ways to determine the global domain.

[0052] For example, the minimum bounding rectangle corresponding to the first spatial object set and the extended minimum bounding rectangle corresponding to the second spatial object set may be determined first, and then the common area of ​​the minimum bounding rectangle and the extended minimum bounding rectangle may be determined as the global domain.

[0053] For example, in Figure 1B In the schematic diagram shown, the minimum bounding rectangle corresponding to the first spatial object set S is S.mbr of the right-side oblique line area, the minimum bounding rectangle corresponding to the second spatial object set R is R.mbr of the left-side oblique line area, R.embr(δ) is the extended minimum bounding rectangle after the minimum bounding rectangle R.mbr corresponding to the second spatial object set R is expanded by δ, and the common part of S.mbr and R.embr(δ), namely the dotted line area in the figure, is the determined global domain.

[0054] It should be noted that the above examples are only illustrative and cannot be used as a limitation on the scope, shape, content, etc. of the first spatial object set and its corresponding minimum bounding rectangle, the second spatial object set and its corresponding extended minimum bounding rectangle in the embodiments of the present disclosure.

[0055] Alternatively, the extended minimum bounding rectangle corresponding to the first spatial object set and the minimum bounding rectangle corresponding to the second spatial object set may be determined first, and then the common area of ​​the two may be determined as the global domain.

[0056] Alternatively, the extended minimum bounding rectangle corresponding to the first spatial object set and the extended minimum bounding rectangle corresponding to the second spatial object set may be determined first, and then the common area of ​​the two may be determined as the global domain.

[0057] Alternatively, the minimum bounding rectangle corresponding to the first spatial object set and the minimum bounding rectangle corresponding to the second spatial object set may be determined first, and then the common area of ​​the two may be determined as the global domain.

[0058] It should be noted that the above examples are merely illustrative and cannot be used as a limitation on the method of determining the global domain in the embodiments of the present disclosure.

[0059] In the disclosed embodiment, a smaller global domain can be determined, so that invalid data can be filtered out in advance. When subsequent data processing is performed, the consumption of additional CPU resources and memory resources, as well as unnecessary network transmission overhead, can be reduced, thereby greatly improving the efficiency of data processing.

[0060] Step 103: divide the global domain into subspaces to obtain multiple subspaces.

[0061] There are many ways to divide the global domain into subspaces.

[0062] For example, the global domain may be divided into a quadtree as a whole, thereby ensuring that the number of spatial objects in all leaf nodes is roughly the same.

[0063] Furthermore, after the global domain is divided into quadtrees as a whole, if two of the four parts obtained have a large number of spatial objects, the two parts can be further divided into quadtrees to obtain multiple subspaces.

[0064] Alternatively, the global domain may be partitioned by an octree. If there are three parts in the partition results that contain a large number of spatial objects, the three parts may be further partitioned by an octree, thereby obtaining multiple subspaces.

[0065] It should be noted that the above examples are merely illustrative and cannot be used as a limitation on obtaining multiple subspaces in the embodiments of the present disclosure.

[0066] In the disclosed embodiment, by dividing the global domain into multiple subspaces, the spatial objects in each subspace can be made roughly equal as much as possible, thereby achieving load balancing and further improving the overall operating efficiency.

[0067] Step 104 , partitioning the multiple spatial objects according to the positional relationship between each spatial object and each subspace, so as to determine the spatial objects contained in each subspace.

[0068] The positional relationship may be intersection, complete overlap, no intersection, etc., which is not limited in the present disclosure.

[0069] In addition, there may be multiple ways to determine the spatial objects contained in each subspace.

[0070] For example, the positional relationship between each spatial object and each subspace may be determined first, and then when partitioning multiple spatial objects, spatial objects belonging to the same subspace may be partitioned into the same subspace.

[0071] For example, if spatial object r1 intersects with subspace 1, then the spatial object r1 can be divided into subspace 1. If spatial object s1 intersects with both subspace 1 and subspace 2, then the spatial object s1 can be divided into subspace 1 and subspace 2, so that it can be determined that subspace 1 contains spatial objects r1 and s1, and subspace 2 contains spatial object s1.

[0072] Alternatively, the positional relationship between the minimum bounding rectangle corresponding to each spatial object and each subspace may be determined first, and then when partitioning multiple spatial objects, spatial objects belonging to the same subspace may be partitioned into the same subspace.

[0073] For example, if the minimum bounding rectangle corresponding to spatial object r1 is R1.mbr and intersects with subspace 2, then the spatial object r1 can be divided into subspace 2. If the minimum bounding rectangle corresponding to spatial object s1 is S1.mbr and intersects with subspace 1, subspace 2, and subspace 3, then the spatial object s1 can be divided into subspace 1, subspace 2, and subspace 3. Thus, it can be determined that subspace 1 contains spatial object s1, subspace 2 contains spatial objects r1 and s1, and subspace 3 contains spatial object s1.

[0074] Alternatively, the positional relationship between the extended minimum bounding rectangle corresponding to each spatial object and each subspace may be determined first, and then when partitioning multiple spatial objects, spatial objects belonging to the same subspace may be partitioned into the same subspace.

[0075] For example, if the extended minimum bounding rectangle corresponding to spatial object r1 is R1.embr and intersects with subspace 1, then the spatial object r1 can be divided into subspace 1. If the extended minimum bounding rectangle corresponding to spatial object s1 is S1.embr and intersects with both subspace 1 and subspace 2, then the spatial object s1 can be divided into subspace 1 and subspace 2, so it can be determined that subspace 1 contains spatial objects r1 and s1, and subspace 2 contains spatial object s1.

[0076] It should be noted that the above r1, s1, R1.mbr, S1.mbr, R1.embr, S1.embr, etc. are only schematic illustrations and cannot be used as limitations on determining the spatial objects contained in each subspace in the embodiments of the present disclosure.

[0077] Step 105: Determine, according to the spatial distances between the spatial objects in each subspace, the spatial tuples in each subspace that match the given spatial distance.

[0078] When determining the spatial distance between various spatial objects, the minimum Euclidean distance formula may be used for calculation, or the Manhattan distance formula may be used for calculation, and the present disclosure does not limit this.

[0079] If the spatial distance between the first spatial object and the second spatial object in any subspace is less than or equal to the δ value, it can be determined that the group of spatial objects is a spatial binary group that meets the matching condition.

[0080] For example, the spatial objects in subspace 1 include s1, s2, s3, r1, and r2. Then, according to the minimum Euclidean distance formula, the spatial distances between s1 and r1, s1 and r2, s2 and r1, s2 and r2, s3 and r1, and s3 and r2 are determined to be L respectively. 11 , L 12 , L 21 , L 22 , L 31 , L 32 If L 11 , L 22 , L 31 If all are smaller than the value of δ, then it can be determined that the spatial pairs included in subspace 1 that are smaller than or equal to the value of δ are (s1, r1), (s2, r2), and (s3, r1).

[0081] It should be noted that the spatial distance L between the above subspace 1 and the spatial objects r1, r2, s1, s2, and s3 is 11 , L 12 , L 21 , L 22 , L 31 , L 32 The above descriptions are merely illustrative and cannot be used as limitations on the subspaces, spatial objects, spatial distances, spatial binary groups, etc. in the embodiments of the present disclosure.

[0082] The following experiment is conducted using the Open Street Map (OSM) spatial dataset as an example to specifically describe the effect of the method for determining the spatial binary provided by the present disclosure.

[0083] Table 1 summarizes the point data and polygon data used in the experiment. These data are spread all over the world and are unevenly distributed in space.

[0084] Table 1 Experimental dataset

[0085]

[0086] In this experiment, the experimental environment is a distributed cluster consisting of 5 servers, and each server is configured with CentOS7.4, 30-core CPU, 100GB memory and 1T hard disk. The big data components used are Hadoop 2.7.3 and Spark 2.3.3.

[0087] In order to verify the advantages of the spatial binary determination method provided by the present invention in global domain calculation, the global space range is divided into 5 square areas with a length and width span of 180°: Grid1, Grid2, Grid3, Grid4 and Grid5, where the areas of the intersections between Grid1 and the other four areas are 20%, 40%, 60% and 80% of the area of ​​Grid1, respectively, which is referred to as spatial overlap. The spatial overlap between Grid1 and itself is 100%. In the experiment, the data set corresponding to Grid1 is equivalent to R. The experiment uses the overlap of the two data sets as a variable, and observes the time consumption of spatial distance connection calculation when the overlap is 20%, 40%, 60%, 80% and 100% respectively. In addition, in order to verify the advantages of the spatial binary determination method provided by the present invention in scalability, this experiment uses the spatial distance δ as a variable, and observes the time consumption of spatial distance connection calculation when δ is 0, 50, 100, 150 and 200 meters respectively. Note that since some systems do not support spatial distance connection and only support spatial connection, that is, the case of δ = 0, when overlap is used as a variable, the default value of δ is 0. When δ is used as a variable, the default value of overlap is 60%.

[0088] like Figure 2A As shown in , the spatial objects in the spatial binary are points and points. This figure is a schematic diagram of the calculation time consumption when determining the spatial distance between points. Figure 2B As shown in , the spatial objects in the spatial binary are polygons and points. This figure is a schematic diagram of the computation time consumption when determining the spatial distance between polygons and points. Figure 2C As shown, the spatial objects in the spatial binary are polygons and polygons. The figure is a schematic diagram of the calculation time consumption when determining the spatial distance between polygons.

[0089] according to Figure 2A , Figure 2B , Figure 2C It can be seen from the analysis that the method for determining spatial binary groups provided by the present disclosure is superior to other most advanced distributed methods in terms of efficiency and accuracy.

[0090] It should be noted that the above experiments are only examples and cannot be used as a limitation on the experimental environment, experimental data, and components used in the embodiments of the present disclosure.

[0091] In the disclosed embodiment, a given spatial distance and multiple spatial objects can be first obtained, and then the global domain can be determined according to the minimum bounding rectangle and the extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set, respectively. Thus, the global domain can be divided into subspaces to obtain multiple subspaces, and then the multiple spatial objects can be partitioned according to the positional relationship between each spatial object and each subspace to determine the spatial objects contained in each subspace, that is, the spatial binary group matching the given spatial distance included in each subspace can be determined according to the spatial distance between each spatial object in each subspace. Thus, the global domain is first determined according to the minimum bounding rectangle and the extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set, and then the spatial binary group in each subspace in the global domain is determined, and invalid data is filtered out in advance through a smaller global domain, thereby reducing resource overhead and improving data processing efficiency.

[0092] In the above embodiment, the global domain is first determined according to the minimum bounding rectangle and the extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set, and then the spatial tuple in each subspace in the global domain is determined. In a possible implementation, when the global domain is divided into multiple subspaces, the global domain can be spatially divided according to the first spatial object set and the second spatial object set to obtain multiple subspaces. Figure 3A The above process is described in detail.

[0093] like Figure 3A As shown, the method for determining the spatial binary group may include the following steps:

[0094] Step 201: Obtain a given spatial distance and a plurality of spatial objects, wherein each spatial object belongs to a first spatial object set or a second spatial object set.

[0095] Step 202: determine a global domain according to the minimum bounding rectangle and the extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set respectively.

[0096] Step 203 : Sample some spatial objects located in the global domain from the first spatial object set and the second spatial object set respectively to obtain a first reference spatial object set and a second reference spatial object set.

[0097] Among them, for massive spatial data, in order to improve the processing speed and efficiency, sampling can be performed before the corresponding data processing.

[0098] It should be noted that the sampling rate may be different for different application scenarios. For example, the sampling rate may be 0.01, 0.05, 0.1, 0.2, etc., and the present disclosure does not limit this.

[0099] Therefore, in actual use, a suitable sampling rate can be selected for sampling according to actual conditions. For example, in the embodiment of the present disclosure, when sampling is performed at a sampling rate of 0.01, the obtained sampling data can better represent the spatial distribution of the entire data set.

[0100] In addition, the first reference spatial object set may be a spatial object set obtained by sampling the spatial objects of the first spatial object set in the global domain at a certain sampling rate. Correspondingly, the second reference spatial object set may be a spatial object set obtained by sampling the spatial objects of the second spatial object set in the global domain at the sampling rate.

[0101] Step 204, according to the number and position of spatial objects in the first reference spatial object set in the global domain and the number and position of spatial objects in the second reference spatial object set in the global domain, respectively, quadtree partition the global domain to obtain the first spatial set and the second spatial set.

[0102] There may be multiple situations when the global domain is divided into quadtrees.

[0103] For example, when the number of spatial objects in the first reference spatial object set that are located in the global domain is greater than a threshold, the global domain may be divided into quadtrees to generate four first-level subspaces.

[0104] The threshold value may be a pre-set value, which may be any positive integer, and the present disclosure does not limit this.

[0105] For example, the threshold is 200, and the number of spatial objects in the first reference spatial object set located in the global domain is 220, which is greater than the threshold 200. The global domain can be divided into quadtrees, thereby generating four first-level subspaces.

[0106] It should be noted that the above is only an example and cannot be used as a limitation on the number, threshold, first-level subspace, etc. of spatial objects located in the global domain in the first reference spatial object set in the embodiments of the present disclosure.

[0107] Afterwards, when the number of spatial objects in the first reference spatial object set contained in the four first-level subspaces is less than or equal to a threshold, the four first-level subspaces are determined to be a first spatial set corresponding to the first reference spatial object set.

[0108] For example, the threshold is 100, and the number of spatial objects in the first reference spatial object set located in the global domain is 220, which is greater than the threshold 100. The global domain can be divided into quadtrees, and the numbers of spatial objects in the first reference spatial object set contained in the generated four first-level subspaces are 20, 50, 70, and 80, respectively, which are all less than the threshold. In this case, the quadtree division can be stopped, and the four first-level subspaces can be determined as the first spatial set corresponding to the first reference spatial object set.

[0109] It should be noted that the above is only an example and cannot be used as a limitation on the number of spatial objects, threshold, first spatial set, etc. in the first reference spatial object set contained in the first-level subspace in the embodiment of the present disclosure.

[0110] Alternatively, in a possible implementation, when the number of spatial objects in the first reference spatial object set contained in any first-level subspace is greater than a threshold, any first-level subspace is divided into quadtrees to generate four second-level subspaces.

[0111] For example, the threshold is 100, and the number of spatial objects in the first reference spatial object set located in the global domain is 220, which is greater than the threshold 100. The global domain can be divided into a quadtree, and the numbers of spatial objects in the first reference spatial object set contained in the generated four first-level subspaces are 150, 20, 10, and 40, respectively. Among them, 150 is greater than the threshold, and the first-level subspace corresponding to the number of spatial objects 150 can continue to be quadtree divided, thereby generating four second-level subspaces.

[0112] It should be noted that the above is only an example and cannot be used as a limitation on the number of spatial objects in the first reference spatial object set contained in the first-level subspace in the embodiment of the present disclosure, the threshold, the first spatial set, the second-level subspace, etc.

[0113] Afterwards, when the number of spatial objects in the first reference spatial object set contained in the four secondary subspaces is less than or equal to the threshold, the four secondary subspaces and each first-level subspace whose number of spatial objects in the first reference spatial object set is less than or equal to the threshold are determined to be the first spatial set corresponding to the first reference spatial object set.

[0114] For example, the threshold is 100, and the number of spatial objects in the first reference space object set located in the global domain is 220, which is greater than the threshold 100, and the global domain can be divided into quadtrees. The four generated first-level subspaces can be recorded as first-level subspace 1, first-level subspace 2, first-level subspace 3, and first-level subspace 4. The number of spatial objects in the first reference space object set contained in each first-level subspace is 150, 20, 10, and 40, respectively. Among them, 150 is greater than the threshold, and the first-level subspace 1 can continue to be quadtree divided to generate four second-level subspaces. The number of spatial objects in the first reference space object set contained in the four generated second-level subspaces may be 30, 40, 50, and 30, respectively, which are all less than the threshold. In this case, these four second-level subspaces, as well as first-level subspace 2, first-level subspace 3, and first-level subspace 4 can be determined as the first space set corresponding to the first reference space object set.

[0115] Correspondingly, if the number of spatial objects in the first reference spatial object set contained in any secondary subspace of the generated secondary subspace is greater than a threshold, the quadtree division can continue to be performed on any secondary subspace until the number of spatial objects in the first reference spatial object set contained in each generated subspace is less than or equal to the threshold.

[0116] It should be noted that the above is only an example and cannot be used as a limitation on the number of spatial objects in the first reference spatial object set contained in each level of subspace, the threshold, the first spatial set, each level of subspace, etc. in the embodiments of the present disclosure.

[0117] In addition, when the number of spatial objects in the second reference spatial object set located in the global domain is greater than a threshold, the step of quadtree-dividing the global domain is repeated until a second spatial set corresponding to the second reference spatial object set is determined.

[0118] Among them, when determining the second spatial set corresponding to the second reference spatial object set, the operation can be performed in accordance with the above-mentioned method of determining the first spatial set corresponding to the first reference spatial object set, so that when the number of spatial objects located in any subspace in the second reference spatial object set is greater than a threshold, the operation of quadtree dividing the any subspace is repeatedly performed until the number of spatial objects in the second reference spatial object set contained in each level of subspace is less than or equal to the threshold, thereby determining the second spatial set corresponding to the second reference spatial object set.

[0119] For example, the threshold is 100, and the number of spatial objects in the second reference spatial object set located in the global domain is 220, which is greater than the threshold 100. The global domain can be divided into quadtrees, and the four generated first-level subspaces can be recorded as first-level subspace 1, first-level subspace 2, first-level subspace 3, and first-level subspace 4. The number of spatial objects in the second reference spatial object set contained in each first-level subspace is 150, 20, 10, and 40, respectively. Among them, 150 is greater than the threshold, and the first-level subspace 1 can continue to be divided into quadtrees, thereby generating four second-level subspaces. The four generated second-level subspaces can be recorded as second-level subspace 1, second-level subspace 2, second-level subspace 3, and second-level subspace 4. The number of spatial objects in the second reference spatial object set contained in each second-level subspace may be 20, 130, 60, and 10, respectively. Among them, the number of spatial objects in the second reference spatial object set contained in second-level subspace 2 is greater than the threshold, and the second-level subspace 2 can continue to be divided into quadtrees, thereby generating four third-level subspaces. The number of spatial objects in the second reference space object set contained in the four third-level subspaces may be 10, 20, 60, and 30, respectively, all of which are less than the threshold. Then these four third-level subspaces, second-level subspace 1, second-level subspace 3, second-level subspace 4, first-level subspace 2, first-level subspace 3, and first-level subspace 4 can be determined as the second space set corresponding to the second reference space object set.

[0120] It should be noted that the above is only an example and cannot be used as a limitation on the number of spatial objects in the second reference spatial object set contained in each level of subspace, the threshold, the second spatial set, each level of subspace, etc. in the embodiments of the present disclosure.

[0121] Step 205: merge the first space set and the second space set to determine a plurality of subspaces.

[0122] Among them, corresponding fusion can be performed according to the levels of the subspaces divided by the quadtree.

[0123] For example, when the first space set and the second space set are subspaces of the same level, the subspaces can be fused respectively.

[0124] For example, the first space set finally determined is four first-level subspaces, namely, first-level subspace 1, first-level subspace 2, first-level subspace 3, and first-level subspace 4, and the second space set is also four first-level subspaces, namely, first-level subspace 5, first-level subspace 6, first-level subspace 7, and first-level subspace 8, then the first-level subspaces in corresponding positions can be merged respectively. For example, first-level subspace 1 and first-level subspace 5 are both located at the upper left of their respective space sets, first-level subspace 2 and first-level subspace 6 are both located at the lower left of their respective space sets, first-level subspace 3 and first-level subspace 7 are both located at the upper right of their respective space sets, and first-level subspace 4 and first-level subspace 8 are both located at the lower right of their respective space sets, and first-level subspace 1 and first-level subspace 5, first-level subspace 2 and first-level subspace 6, first-level subspace 3 and first-level subspace 7, and first-level subspace 4 and first-level subspace 8 can be merged respectively.

[0125] Alternatively, when any N-level subspace in the first space set contains each N+1-level subspace in the second space set, each N+1-level subspace is added to the subspace, where N is a positive integer.

[0126] For example, the subspaces in the first space set can be first-level subspace 2, first-level subspace 3, first-level subspace 4, second-level subspace 1, second-level subspace 2, second-level subspace 3, and second-level subspace 4, and the subspaces in the second space set can be first-level subspace 2, first-level subspace 3, first-level subspace 4, second-level subspace 1, second-level subspace 2, second-level subspace 3, tertiary subspace 1, tertiary subspace 2, tertiary subspace 3, and tertiary subspace 4. At this time, when merging the first space set with the second space set, the first-level subspaces and second-level subspaces can be merged first, and the tertiary subspaces in the second space set can be added to the subspaces.

[0127] Or, in Figure 3B In the subspace partitioning diagram shown, it can be seen that the first space set S is quadtree partitioned twice to obtain three first-level subspaces and four second-level subspaces, and the second space set R is quadtree partitioned three times to obtain two first-level subspaces, seven second-level subspaces, and four third-level subspaces. Therefore, when the subspace of the first space set S is merged with the subspace of the second space set R, the first-level subspace in S can be merged with the first-level subspace in R, and the second-level subspace in S can be merged with the second-level subspace in R, and each third-level subspace of the second space set R can be added to the subspace. The subspace partitioning result is as follows: Figure 3B As shown, they are first-level subspace 12, first-level subspace 4, second-level subspace 3, second-level subspace 2, second-level subspace 1, second-level subspace 0, second-level subspace 11, second-level subspace 10, second-level subspace 5, tertiary subspace 9, tertiary subspace 8, tertiary subspace 7, and tertiary subspace 6.

[0128] It should be noted that the above examples are only for illustration and cannot be used as limitations on the subspaces of each level of the first space set and the second space set in the embodiments of the present disclosure.

[0129] Step 206 , partitioning the multiple spatial objects according to the positional relationship between each spatial object and each subspace, so as to determine the spatial objects contained in each subspace.

[0130] Step 207: Determine, based on the spatial distances between the spatial objects in each subspace, the spatial tuples in each subspace that match the given spatial distance.

[0131] In the disclosed embodiment, a global domain is determined by obtaining a given spatial distance and multiple spatial objects, and according to the minimum bounding rectangle and the extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set, respectively. When the global domain is then divided into subspaces, the spatial objects in each spatial object set located in the global domain can be partially sampled to obtain the first reference spatial object set and the second reference spatial object set. Then, according to the number and position of spatial objects in the first reference spatial object set located in the global domain, and the number and position of spatial objects in the second reference spatial object set located in the global domain, the global domain is quad-tree divided to obtain the first spatial set and the second spatial set, and the two sets are merged to determine multiple subspaces. Then, the spatial objects contained in each subspace are determined, and then the spatial tuples that meet the conditions in each subspace are determined. Thus, by spatially dividing the global domain according to the first spatial object set and the second spatial object set, respectively, to obtain multiple subspaces, the amount of data in each subspace is made roughly equal, which further ensures load balancing and improves the overall operating efficiency.

[0132] In the above embodiment, the spatial binary tuples in each subspace can be determined by performing multiple quadtree divisions on the global domain and then repartitioning the spatial object according to the positional relationship between each spatial object and each subspace. In one possible implementation, the same spatial object may span multiple subspaces, so that different subspaces may contain the same spatial binary tuples, which will cause the final set of spatial binary tuples to contain repeated spatial binary tuples. Therefore, after determining the spatial binary tuples contained in each subspace, the spatial binary tuples can be screened so that the same spatial binary tuple is only recorded in one subspace, thereby avoiding duplication. The following is combined with Figure 4A The above process is described in detail.

[0133] Step 301: Obtain a given spatial distance and a plurality of spatial objects, wherein each spatial object belongs to a first spatial object set or a second spatial object set.

[0134] Step 302: determine the common area between the minimum bounding rectangle corresponding to the first spatial object set and the extended minimum bounding rectangle corresponding to the second spatial object set as the global domain.

[0135] Step 303: divide the global domain into quadtrees for a specified number of times to obtain multiple subspaces.

[0136] The specified number of times may be an arbitrarily set number of times, or a number of times set according to the scope and size of the global domain, or a number of times related to the number of positions of spatial objects in the global domain, and the present disclosure does not limit this.

[0137] For example, the specified number of times is 2, 4, or 7, etc. For any global domain, the specified number of quadtree partitions can be performed, thereby determining multiple subspaces according to the quadtree partition results.

[0138] Alternatively, when the currently determined global domain range is large, a larger specified number of times may be set, such as 10, 20, and the like.

[0139] Alternatively, if the spatial objects in the global domain are concentrated in a subspace in the global domain, a larger specified number can be set for the subspace.

[0140] It should be noted that the above examples are merely illustrative and cannot be used as limitations on the method and value for determining the specified number of times in the embodiments of the present disclosure.

[0141] Step 304: determine the positional relationship between the minimum bounding rectangle corresponding to each spatial object and each subspace.

[0142] Step 305 : When a minimum bounding rectangle corresponding to any spatial object and any subspace have a common area, determine that any subspace contains any spatial object.

[0143] There may be various positional relationships between the minimum bounding rectangle corresponding to each spatial object and each subspace, such as non-intersecting, intersecting, completely overlapping, etc., which is not limited in the present disclosure.

[0144] It can be understood that when the positional relationship between the minimum bounding rectangle corresponding to any spatial object and any subspace is a non-intersecting relationship, the spatial object has no intersection with the subspace, that is, there is no common area.

[0145] Alternatively, when the minimum bounding rectangle corresponding to any spatial object intersects with the position of any subspace, it can be determined that the minimum bounding rectangle corresponding to any spatial object and the any subspace have a common area.

[0146] Alternatively, when the minimum bounding rectangle corresponding to any spatial object completely overlaps with the position of any subspace, it can be determined that the minimum bounding rectangle corresponding to any spatial object and the any subspace also have a common area.

[0147] In addition, each subspace may be numbered in any manner, such as by numbers or letters, etc. The numbering result may be unique, and the present disclosure does not limit this.

[0148] In addition, when a minimum bounding rectangle corresponding to any spatial object has a common area with any subspace, the number of the subspace may be assigned to the spatial object having the common area therewith.

[0149] For example, there are 4 subspaces currently divided, namely subspace 1, subspace 2, subspace 3, and subspace 4, and the spatial objects are r1, r2, and s1.

[0150] Among them, the minimum bounding rectangle R1.mbr corresponding to r1 has no intersection with subspace 1, R1.mbr has intersection with subspace 2, R1.mbr has intersection with subspace 3, and R1.mbr has no intersection with subspace 4. It can be determined that the spatial object r1 belongs to subspace 2 and subspace 3, so the subspace number can be assigned to the spatial object r1, and the spatial object r1 can have the number 2 or 3.

[0151] Afterwards, the relationship between the minimum bounding rectangle R2.mbr corresponding to the spatial object r2 and each subspace is compared in turn. If subspace 1, subspace 3 and the minimum bounding rectangle R2.mbr have common areas, it can be determined that the spatial object r2 has the numbers 1 and 3 respectively.

[0152] Afterwards, the relationship between the minimum bounding rectangle S1.mbr corresponding to the spatial object s1 and each subspace is compared in turn. If subspace 2, subspace 3 and the minimum bounding rectangle S1.mbr have common areas, it can be determined that the spatial object s1 has the numbers 2 and 3 respectively.

[0153] Therefore, when partitioning spatial objects, spatial objects with the same number can be divided into the same subspace, and it can be determined that the spatial objects contained in subspace 1 are spatial objects r2, the spatial objects contained in subspace 2 are spatial objects r1 and s1, the spatial objects contained in subspace 3 are spatial objects r1, r2 and s1, and subspace 4 does not contain any spatial objects.

[0154] It should be noted that the above-mentioned spatial objects r1, r2 and s1, subspace 1, subspace 2, subspace 3, subspace 4 and the positional relationship between the minimum bounding rectangle corresponding to each spatial object and each subspace are only schematic illustrations and cannot be used as a limitation on the spatial objects, subspaces, and the positional relationship between the minimum bounding rectangle corresponding to each spatial object and each subspace, and the partitioning of multiple spatial objects in the embodiments of the present disclosure.

[0155] Step 306: Determine, based on the spatial distances between the spatial objects in each subspace, the spatial tuples in each subspace that match the given spatial distance.

[0156] Step 307, determining the first minimum bounding rectangle of the first spatial object and the first extended minimum bounding rectangle of the second spatial object in any spatial binary of any subspace, wherein the first spatial object is any spatial object in the first spatial object set and the second spatial object is any spatial object in the second spatial object set.

[0157] The first minimum bounding rectangle may be the minimum bounding rectangle corresponding to the first spatial object in any spatial binary in any subspace, and the first extended minimum bounding rectangle may be the extended minimum bounding rectangle corresponding to the second spatial object in any spatial binary in any subspace.

[0158] Step 308: determine the coordinates of any vertex in the common area between the first minimum bounding rectangle and the first extended minimum bounding rectangle.

[0159] Step 309: when any vertex coordinate is located in any subspace, retain any spatial tuple in any subspace.

[0160] Step 310: When any vertex coordinate is not in any subspace, any spatial binary group is deleted from all spatial binary groups in any subspace.

[0161] Among them, when determining the spatial tuples included in each subspace that match the given spatial distance, duplication may occur. For example, subspace 1 may contain (s1, r1), and subspace 2 may also contain (s1, r1). At this time, in order to avoid duplication, the position of any vertex of the common area between the first minimum bounding rectangle of the first spatial object and the first extended minimum bounding rectangle of the second spatial object in any spatial tuple of any subspace can be used to ensure that each subspace does not contain repeated spatial tuples.

[0162] For example, subspace 1 contains (s1, r1) and subspace 2 also contains (s1, r1). For the spatial binary (s1, r1), if the selected vertex is located in subspace 1, the spatial binary (s1, r1) in subspace 1 can be retained and the spatial binary (s1, r1) can be deleted from subspace 2.

[0163] Or, in Figure 4B In the schematic diagram shown, the spatial binary group (s1, r1) is in both subspace 0 and subspace 1. The first minimum bounding rectangle of the first spatial object s1 in the spatial binary group (s1, r1) is the rectangle S.mbr on the right, and the first extended minimum bounding rectangle of the second spatial object r1 is the dotted rectangle R.embr(δ) on the left. The common area between the two is the middle oblique line area. Select the vertex A at the lower left corner of the oblique line area. It can be seen that vertex A is in subspace 0. Then retain the spatial binary group (s1, r1) in subspace 0 and delete the spatial binary group (s1, r1) in subspace 1.

[0164] It is understandable that when selecting vertices, any vertex in the common area of ​​the first minimum bounding rectangle and the first extended minimum bounding rectangle can be selected, for example, vertex A, vertex B, or vertex C, or vertex D, etc. can be selected, and the present disclosure does not limit this.

[0165] It should be noted that the above examples are merely illustrative and cannot be used as limitations on any spatial binary, any subspace, etc. in the embodiments of the present disclosure.

[0166] In the disclosed embodiment, for spatial binary groups that meet the conditions, the first minimum bounding rectangle of the first spatial object and the first extended minimum bounding rectangle of the second spatial object in any spatial binary group of any subspace can be determined first, and then, based on whether any vertex coordinate of the common area of ​​the two is in the subspace, it is determined whether to retain or delete any spatial binary group in any subspace, so that the same spatial binary group is only recorded in one subspace, thereby avoiding duplication, reducing invalid operations, and improving overall efficiency.

[0167] In order to implement the above embodiment, the present disclosure also proposes a device for determining a spatial binary group.

[0168] Figure 5 A schematic diagram of the structure of a device for determining a spatial binary provided in an embodiment of the present disclosure.

[0169] like Figure 5 As shown, the device 100 for determining a spatial binary may include: a first acquisition module 110 , a first determination module 120 , a second acquisition module 130 , a second determination module 140 , and a third determination module 150 .

[0170] The first acquisition module 110 is used to acquire a given spatial distance and a plurality of spatial objects, wherein each of the spatial objects belongs to a first spatial object set or a second spatial object set.

[0171] The first determining module 120 is configured to determine a global domain according to the minimum bounding rectangle and the extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set, respectively.

[0172] The second acquisition module 130 is used to divide the global domain into subspaces to obtain multiple subspaces.

[0173] The second determining module 140 is used to partition the multiple spatial objects according to the positional relationship between each of the spatial objects and each of the subspaces, so as to determine the spatial objects included in each subspace.

[0174] The third determination module 150 is used to determine the spatial tuples included in each of the subspaces and matching the given spatial distance according to the spatial distances between the spatial objects in each of the subspaces.

[0175] The above explanations of the embodiment of the method for determining a spatial binary group are also applicable to the device for determining a spatial binary group of this embodiment, and will not be repeated here.

[0176] The device for determining the spatial binary of the embodiment of the present disclosure can first obtain a given spatial distance and multiple spatial objects, and then determine the global domain according to the minimum bounding rectangle and the extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set, so that the global domain can be divided into subspaces to obtain multiple subspaces, and then the multiple spatial objects are partitioned according to the positional relationship between each spatial object and each subspace to determine the spatial objects contained in each subspace, that is, according to the spatial distance between each spatial object in each subspace, the spatial binary matching the given spatial distance included in each subspace can be determined. Thus, firstly, the global domain is determined according to the minimum bounding rectangle and the extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set, and then the spatial binary in each subspace in the global domain is determined, and invalid data is filtered out in advance through a smaller global domain, which reduces resource overhead and improves data processing efficiency.

[0177] Further, in a possible implementation of the embodiment of the present disclosure, see Figure 6 ,exist Figure 5 Based on the illustrated embodiment, the first determining module 120 is specifically configured to determine a common area between a minimum bounding rectangle corresponding to the first spatial object set and an extended minimum bounding rectangle corresponding to the second spatial object set as the global domain.

[0178] In a possible implementation, the second acquisition module 130 includes:

[0179] The sampling unit 1310 is used to sample some spatial objects located in the global domain from the first spatial object set and the second spatial object set respectively, so as to obtain a first reference spatial object set and a second reference spatial object set;

[0180] An acquiring unit 1320 is configured to perform quadtree division on the global domain according to the number and position of spatial objects in the first reference spatial object set in the global domain and the number and position of spatial objects in the second reference spatial object set in the global domain, so as to acquire a first spatial set and a second spatial set;

[0181] The determining unit 1330 is configured to merge the first space set with the second space set to determine the multiple subspaces.

[0182] In a possible implementation, the acquiring unit 1320 is specifically configured to:

[0183] When the number of spatial objects in the first reference spatial object set located in the global domain is greater than a threshold, performing quadtree partitioning on the global domain to generate four first-level subspaces;

[0184] When the number of spatial objects in the first reference spatial object set contained in the four first-level subspaces is less than or equal to the threshold, determining the four first-level subspaces as a first spatial set corresponding to the first reference spatial object set;

[0185] When the number of spatial objects in the second reference spatial object set located in the global domain is greater than a threshold, the step of dividing the global domain into quadtrees is repeated until a second spatial set corresponding to the second reference spatial object set is determined.

[0186] In a possible implementation, the acquiring unit 1320 is further specifically configured to:

[0187] When the number of spatial objects in the first reference spatial object set contained in any first-level subspace is greater than the threshold, performing quadtree division on the any first-level subspace to generate four second-level subspaces;

[0188] When the number of spatial objects in the first reference spatial object set contained in the four secondary subspaces is less than or equal to the threshold, the four secondary subspaces and each first-level subspace whose number of spatial objects in the first reference spatial object set is less than or equal to the threshold are determined to be the first spatial set corresponding to the first reference spatial object set.

[0189] In a possible implementation, the determining unit 1330 is specifically configured to:

[0190] In the case where any N-level subspace in the first space set contains each N+1-level subspace in the second space set, each N+1-level subspace is added to the subspace, where N is a positive integer.

[0191] In a possible implementation, the second acquisition module 130 is specifically configured to:

[0192] The global domain is divided into quadtrees for a specified number of times to obtain a plurality of subspaces.

[0193] In a possible implementation, the second determining module 140 is specifically configured to:

[0194] Determine the positional relationship between the minimum bounding rectangle corresponding to each of the spatial objects and each of the subspaces;

[0195] In the case that a minimum bounding rectangle corresponding to any spatial object and any subspace have a common area, it is determined that any subspace contains the any spatial object.

[0196] Further, in a possible implementation of the embodiment of the present disclosure, see Figure 6 ,exist Figure 5 Based on the illustrated embodiment, the above device 100 may further include:

[0197] The fourth determination module 160 is used to determine the first minimum bounding rectangle of the first spatial object in any spatial binary of any subspace, and the first extended minimum bounding rectangle of the second spatial object, wherein the first spatial object is any spatial object in the first spatial object set, and the second spatial object is any spatial object in the second spatial object set.

[0198] The fifth determining module 170 is configured to determine coordinates of any vertex in a common area between the first minimum bounding rectangle and the first extended minimum bounding rectangle.

[0199] The retaining module 180 is configured to retain any spatial binary tuple in any subspace when any vertex coordinate is located in any subspace.

[0200] The deleting module 190 is configured to delete the any spatial binary group from each spatial binary group in the any subspace when the coordinates of any vertex are not in the any subspace.

[0201] The above explanations of the embodiment of the method for determining a spatial binary group are also applicable to the device for determining a spatial binary group of this embodiment, and will not be repeated here.

[0202] The device for determining the spatial binary of the embodiment of the present disclosure obtains a given spatial distance and multiple spatial objects, and determines the global domain according to the minimum bounding rectangle and the extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set respectively. When the global domain is then divided into subspaces, the spatial objects in each spatial object set located in the global domain can be partially sampled to obtain the first reference spatial object set and the second reference spatial object set. Then, according to the number and position of the spatial objects in the first reference spatial object set located in the global domain, and the number and position of the spatial objects in the second reference spatial object set located in the global domain, the global domain is quad-tree divided respectively to obtain the first spatial set and the second spatial set, and the two sets are merged to determine multiple subspaces. Then, the spatial objects contained in each subspace are determined, and then the spatial binary that meets the conditions in each subspace is determined. Therefore, by spatially dividing the global domain according to the first spatial object set and the second spatial object set, multiple subspaces are obtained, so that the amount of data in each subspace is roughly equal, further ensuring load balancing and improving the overall operating efficiency.

[0203] In order to implement the above embodiments, the present disclosure also proposes a computer device, including: a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, the method for determining the spatial binary group proposed in the above embodiments of the present disclosure is implemented.

[0204] In order to implement the above embodiments, the present disclosure further proposes a non-temporary computer-readable storage medium storing a computer program, which, when executed by a processor, implements the method for determining a spatial binary group as proposed in the above embodiments of the present disclosure.

[0205] In order to implement the above embodiments, the present disclosure further proposes a computer program product. When an instruction processor in the computer program product executes, the method for determining a spatial binary group proposed in the above embodiments of the present disclosure is executed.

[0206] Figure 7 A block diagram of an exemplary computer device suitable for implementing embodiments of the present disclosure is shown. Figure 7 The computer device 12 shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0207] like Figure 7As shown, the computer device 12 is in the form of a general-purpose computing device. The components of the computer device 12 may include, but are not limited to: one or more processors or processing units 16, a system memory 28, and a bus 18 that connects various system components (including the system memory 28 and the processing unit 16).

[0208] The bus 18 represents one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, a graphics acceleration port, a processor or a local bus using any of a variety of bus structures. For example, these architectures include but are not limited to Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MAC) bus, Enhanced ISA bus, Video Electronics Standards Association (VESA) local bus and Peripheral Component Interconnection (PCI) bus.

[0209] The computer device 12 typically includes a variety of computer system readable media. These media can be any available media that can be accessed by the computer device 12, including volatile and non-volatile media, removable and non-removable media.

[0210] The memory 28 may include computer system readable media in the form of volatile memory, such as random access memory (RAM) 30 and / or cache memory 32. The computer device 12 may further include other removable / non-removable, volatile / non-volatile computer system storage media. By way of example only, the storage system 34 may be used to read and write non-removable, non-volatile magnetic media ( Figure 7 not shown, usually called a "hard drive"). Although Figure 7Not shown in the figure, a disk drive for reading and writing a removable non-volatile disk (e.g., a "floppy disk"), and an optical disk drive for reading and writing a removable non-volatile optical disk (e.g., a compact disc read only memory (CD-ROM), a digital versatile disc read only memory (DVD-ROM), or other optical media) may be provided. In these cases, each drive may be connected to the bus 18 via one or more data medium interfaces. The memory 28 may include at least one program product having a set (e.g., at least one) of program modules configured to perform the functions of the various embodiments of the present disclosure.

[0211] A program / utility 40 having a set (at least one) of program modules 42 may be stored, for example, in the memory 28, such program modules 42 including but not limited to an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment. The program modules 42 generally perform the functions and / or methods of the embodiments described in the present disclosure.

[0212] The computer device 12 may also communicate with one or more external devices 14 (e.g., keyboard, pointing device, display 24, etc.), one or more devices that enable a user to interact with the computer device 12, and / or any device that enables the computer device 12 to communicate with one or more other computing devices (e.g., network card, modem, etc.). Such communication may be performed via an input / output (I / O) interface 22. In addition, the computer device 12 may also communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) via a network adapter 20. As shown, the network adapter 20 communicates with other modules of the computer device 12 via a bus 18. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the computer device 12, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0213] The processing unit 16 executes various functional applications and data processing by running programs stored in the system memory 28, such as implementing the methods mentioned in the above embodiments.

[0214] According to the technical solution of the embodiment of the present disclosure, a given spatial distance and multiple spatial objects can be obtained first, and then the global domain can be determined according to the minimum bounding rectangle and the extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set, so that the global domain can be divided into subspaces to obtain multiple subspaces, and then the multiple spatial objects can be partitioned according to the positional relationship between each spatial object and each subspace to determine the spatial objects contained in each subspace, that is, according to the spatial distance between each spatial object in each subspace, the spatial binary group matching the given spatial distance included in each subspace can be determined. Therefore, firstly, the global domain is determined according to the minimum bounding rectangle and the extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set, and then the spatial binary group in each subspace in the global domain is determined, and invalid data is filtered out in advance through a smaller global domain, which reduces resource overhead and improves data processing efficiency.

[0215] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present disclosure. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner. In addition, those skilled in the art may combine and combine the different embodiments or examples described in this specification and the features of the different embodiments or examples, without contradiction.

[0216] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one of the features. In the description of the present disclosure, "plurality" means at least two, such as two, three, etc., unless otherwise clearly and specifically defined.

[0217] Any process or method description in a flowchart or otherwise described herein may be understood to represent a module, segment or portion of code that includes one or more executable instructions for implementing the steps of a custom logical function or process, and the scope of the preferred embodiments of the present disclosure includes additional implementations in which functions may not be performed in the order shown or discussed, including performing functions in a substantially simultaneous manner or in reverse order depending on the functions involved, which should be understood by technicians in the technical field to which the embodiments of the present disclosure belong.

[0218] The logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered as an ordered list of executable instructions for implementing logical functions, and can be embodied in any computer-readable medium for use by an instruction execution system, device or apparatus (such as a computer-based system, a system including a processor, or other system that can fetch instructions from an instruction execution system, device or apparatus and execute the instructions), or in combination with these instruction execution systems, devices or apparatuses. For the purpose of this specification, "computer-readable medium" can be any device that can contain, store, communicate, propagate or transmit a program for use by an instruction execution system, device or apparatus, or in combination with these instruction execution systems, devices or apparatuses. More specific examples of computer-readable media (a non-exhaustive list) include the following: an electrical connection with one or more wires (electronic device), a portable computer disk box (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable and programmable read-only memory (EPROM or flash memory), a fiber optic device, and a portable compact disk read-only memory (CDROM). In addition, the computer-readable medium may even be paper or other suitable medium on which the program is printed, since the program may be obtained electronically, for example, by optically scanning the paper or other medium and then editing, interpreting or processing in other suitable ways if necessary, and then stored in a computer memory.

[0219] It should be understood that the various parts of the present disclosure can be implemented in hardware, software, firmware or a combination thereof. In the above-mentioned embodiments, multiple steps or methods can be implemented in software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, any one of the following technologies known in the art or a combination thereof can be used to implement: a discrete logic circuit having a logic gate circuit for implementing a logic function for a data signal, a dedicated integrated circuit having a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.

[0220] A person skilled in the art may understand that all or part of the steps in the method for implementing the above-mentioned embodiment may be completed by instructing related hardware through a program, and the program may be stored in a computer-readable storage medium, which, when executed, includes one or a combination of the steps of the method embodiment.

[0221] In addition, each functional unit in each embodiment of the present disclosure may be integrated into a processing module, or each unit may exist physically separately, or two or more units may be integrated into one module. The above-mentioned integrated module may be implemented in the form of hardware or in the form of a software functional module. If the integrated module is implemented in the form of a software functional module and sold or used as an independent product, it may also be stored in a computer-readable storage medium.

[0222] The storage medium mentioned above may be a read-only memory, a disk or an optical disk, etc. Although the embodiments of the present disclosure have been shown and described above, it can be understood that the above embodiments are exemplary and cannot be understood as limitations of the present disclosure. A person of ordinary skill in the art may change, modify, replace and modify the above embodiments within the scope of the present disclosure.

Claims

1. A method for determining a spatial binary group, characterized in that: include: Acquire a given spatial distance and a plurality of spatial objects, wherein each of the spatial objects belongs to a first spatial object set or a second spatial object set; Determine a global domain according to the minimum bounding rectangle and the extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set respectively; Dividing the global domain into subspaces to obtain a plurality of subspaces; Partitioning the plurality of spatial objects according to a positional relationship between each of the spatial objects and each of the subspaces to determine the spatial objects contained in each subspace; According to the spatial distances between the spatial objects in each of the subspaces, determining the spatial tuples included in each of the subspaces and matching the given spatial distances; Determine a first minimum bounding rectangle of a first spatial object and a first extended minimum bounding rectangle of a second spatial object in any spatial binary of any subspace, wherein the first spatial object is any spatial object in the first spatial object set, and the second spatial object is any spatial object in the second spatial object set; Determine the coordinates of any vertex of a common area between the first minimum bounding rectangle and the first extended minimum bounding rectangle; When the coordinates of any vertex are not in any subspace, deleting the any spatial binary group from each spatial binary group in the any subspace; The step of dividing the global domain into subspaces to obtain a plurality of subspaces includes: Sampling part of the spatial objects located in the global domain from the first spatial object set and the second spatial object set respectively, to obtain a first reference spatial object set and a second reference spatial object set; According to the number and position of spatial objects in the first reference spatial object set located in the global domain and the number and position of spatial objects in the second reference spatial object set located in the global domain, respectively, the global domain is divided into quadtrees to obtain a first spatial set and a second spatial set; The first space set and the second space set are fused to determine the plurality of subspaces.

2. The method according to claim 1, characterized in that The determining of the global domain according to the minimum bounding rectangle and the extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set respectively includes: A common area between a minimum bounding rectangle corresponding to the first spatial object set and an extended minimum bounding rectangle corresponding to the second spatial object set is determined as the global domain.

3. The method according to claim 1, characterized in that The method of performing quadtree division on the global domain according to the number and position of the spatial objects in the first reference spatial object set in the global domain and the number and position of the spatial objects in the second reference spatial object set in the global domain to obtain the first spatial set and the second spatial set comprises: When the number of spatial objects in the first reference spatial object set located in the global domain is greater than a threshold, performing quadtree partitioning on the global domain to generate four first-level subspaces; When the number of spatial objects in the first reference spatial object set contained in the four first-level subspaces is less than or equal to the threshold, determining the four first-level subspaces as a first spatial set corresponding to the first reference spatial object set; When the number of spatial objects in the second reference spatial object set located in the global domain is greater than a threshold, the step of dividing the global domain into quadtrees is repeated until a second spatial set corresponding to the second reference spatial object set is determined.

4. The method according to claim 3, characterized in that After generating four first-level subspaces, the method further includes: When the number of spatial objects in the first reference spatial object set contained in any first-level subspace is greater than the threshold, performing quadtree division on the any first-level subspace to generate four second-level subspaces; When the number of spatial objects in the first reference spatial object set contained in the four secondary subspaces is less than or equal to the threshold, the four secondary subspaces and each first-level subspace whose number of spatial objects in the first reference spatial object set is less than or equal to the threshold are determined to be the first spatial set corresponding to the first reference spatial object set.

5. The method according to claim 4, characterized in that The fusing the first space set with the second space set to determine the plurality of subspaces comprises: In the case where any N-level subspace in the first space set contains each N+1-level subspace in the second space set, each N+1-level subspace is added to the subspace, where N is a positive integer.

6. The method according to claim 1, characterized in that The step of dividing the global domain into subspaces to obtain a plurality of subspaces further includes: The global domain is divided into quadtrees for a specified number of times to obtain a plurality of subspaces.

7. The method according to any one of claims 1 to 6, characterized in that: Partitioning the plurality of spatial objects according to the positional relationship between each of the spatial objects and each of the subspaces to determine the spatial objects contained in each subspace includes: Determine the positional relationship between the minimum bounding rectangle corresponding to each of the spatial objects and each of the subspaces; In the case that a minimum bounding rectangle corresponding to any spatial object and any subspace have a common area, it is determined that any subspace contains the any spatial object.

8. The method according to any one of claims 1 to 6, further comprising, after determining the coordinates of any vertex of a common area between the first minimum bounding rectangle and the first extended minimum bounding rectangle: In the case where any vertex coordinate is located in any subspace, any spatial binary tuple in the any subspace is retained.

9. A device for determining a spatial binary group, characterized in that: include: A first acquisition module, used for acquiring a given spatial distance and a plurality of spatial objects, wherein each of the spatial objects belongs to a first spatial object set or a second spatial object set; A first determining module, configured to determine a global domain according to a minimum bounding rectangle and an extended minimum bounding rectangle corresponding to the first spatial object set and the second spatial object set respectively; A second acquisition module is used to divide the global domain into subspaces to obtain multiple subspaces; A second determining module, configured to partition the plurality of spatial objects according to a positional relationship between each of the spatial objects and each of the subspaces, so as to determine a spatial object contained in each subspace; A third determining module is used to determine the spatial tuples included in each of the subspaces and matching the given spatial distance according to the spatial distances between the spatial objects in each of the subspaces; a fourth determination module, configured to determine a first minimum bounding rectangle of a first spatial object and a first extended minimum bounding rectangle of a second spatial object in any spatial binary of any subspace, wherein the first spatial object is any spatial object in the first spatial object set, and the second spatial object is any spatial object in the second spatial object set; A fifth determining module, configured to determine coordinates of any vertex in a common area between the first minimum bounding rectangle and the first extended minimum bounding rectangle; a deleting module, configured to delete the any spatial binary from each spatial binary in the any subspace when the coordinates of the any vertex are not in the any subspace; The second acquisition module includes: a sampling unit, configured to sample part of the spatial objects located in the global domain from the first spatial object set and the second spatial object set, respectively, to obtain a first reference spatial object set and a second reference spatial object set; an acquiring unit, configured to perform quadtree division on the global domain according to the number and position of spatial objects in the first reference spatial object set in the global domain and the number and position of spatial objects in the second reference spatial object set in the global domain, so as to acquire a first spatial set and a second spatial set; A determining unit is used to merge the first space set with the second space set to determine the multiple subspaces.

10. The device according to claim 9, characterized in that The first determining module is specifically configured to: A common area between a minimum bounding rectangle corresponding to the first spatial object set and an extended minimum bounding rectangle corresponding to the second spatial object set is determined as the global domain.

11. The device according to claim 9, characterized in that The acquisition unit is specifically used for: When the number of spatial objects in the first reference spatial object set located in the global domain is greater than a threshold, performing quadtree partitioning on the global domain to generate four first-level subspaces; When the number of spatial objects in the first reference spatial object set contained in the four first-level subspaces is less than or equal to the threshold, determining the four first-level subspaces as a first spatial set corresponding to the first reference spatial object set; When the number of spatial objects in the second reference spatial object set located in the global domain is greater than a threshold, the step of dividing the global domain into quadtrees is repeated until a second spatial set corresponding to the second reference spatial object set is determined.

12. The device according to claim 11, characterized in that The acquisition unit is further used for: When the number of spatial objects in the first reference spatial object set contained in any first-level subspace is greater than the threshold, performing quadtree division on the any first-level subspace to generate four second-level subspaces; When the number of spatial objects in the first reference spatial object set contained in the four secondary subspaces is less than or equal to the threshold, the four secondary subspaces and each first-level subspace whose number of spatial objects in the first reference spatial object set is less than or equal to the threshold are determined to be the first spatial set corresponding to the first reference spatial object set.

13. The device according to claim 12, characterized in that The determining unit is specifically configured to: In the case where any N-level subspace in the first space set contains each N+1-level subspace in the second space set, each N+1-level subspace is added to the subspace, where N is a positive integer.

14. The device according to claim 9, characterized in that The second acquisition module is further specifically used for: The global domain is divided into quadtrees for a specified number of times to obtain a plurality of subspaces.

15. The device according to any one of claims 9 to 14, characterized in that: The second determining module is specifically used to: Determine the positional relationship between the minimum bounding rectangle corresponding to each of the spatial objects and each of the subspaces; In the case that a minimum bounding rectangle corresponding to any spatial object and any subspace have a common area, it is determined that any subspace contains the any spatial object.

16. The device according to any one of claims 9 to 14, characterized in that: Also includes: A retaining module is used to retain any spatial binary group in any subspace when any vertex coordinate is located in any subspace.

17. A computer device, characterized in that: The method comprises a memory, a processor and a computer program stored in the memory and executable on the processor. When the processor executes the program, the method for determining a spatial binary group as claimed in any one of claims 1 to 8 is implemented.

18. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the method for determining a spatial binary group as claimed in any one of claims 1 to 8 is implemented.

19. A computer program product, characterized in that The invention comprises a computer program, which, when executed by a processor, implements the method for determining a spatial binary group according to any one of claims 1 to 8.

Images