Region division method and device

Abstract

The invention provides a region division method and device, and relates to the field of communication. The method comprises the following steps: acquiring a first area, wherein the first area comprises p roads; according to the road network data corresponding to the p roads, buffer areas corresponding to the p roads are established, and a first road area is obtained. Wherein the first road area comprises buffer areas corresponding to the p roads respectively, and the road network data corresponding to the p roads comprises the positions of the p roads in the first area. And removing a part corresponding to the first road area from the first area to obtain a plurality of first area units. The method is used for accurately dividing the first region.

Description

Technical Field

[0001] The present application relates to the field of communications, and in particular to a method and device for dividing an area. Background Art

[0002] With the rapid development of geographic information system (GIS), regional analysis has become increasingly important in many geospatial applications. For example, in applications such as urban planning management, traffic condition analysis, and communication base station construction, it is often necessary to divide a large area into multiple smaller regional units in order to analyze each smaller regional unit.

[0003] Among them, the roads in an area are used to divide the area into multiple area units, which is a commonly used area division method at present. Specifically, in the prior art, when dividing an area, the road network data of the area can be obtained first (wherein the road network data includes the location of the roads in the area. Specifically, the coordinates of 0-dimensional nodes and 1-dimensional vector line segments are usually used in the road network data to represent the location of the road), and then the road network data is used to determine the multiple area units separated by the roads through triangulation and triangle merging and other calculation processes. It can be seen that although the above-mentioned prior art can achieve the effect of dividing the area into multiple area units, the area units divided according to the above-mentioned prior art may include many area units that do not meet the use requirements.

[0004] For example, in road network data, two lanes running in opposite directions on a road are usually regarded as independent roads, and the coordinates of 0-dimensional nodes and 1-dimensional vector segments are used to record the positions of the independent roads. At this time, if the road network data is used to divide the area, the area between the two lanes running in opposite directions may be divided into an area unit. However, this area unit usually does not meet the usage requirements.

[0005] Therefore, how to achieve accurate division of regions is a problem that needs to be solved at present. Summary of the invention

[0006] The present application provides a region division method and device for achieving efficient region division.

[0007] In a first aspect, a method for dividing a region is provided, comprising: obtaining a first region, wherein the first region includes p roads. According to road network data corresponding to the p roads, buffer zones corresponding to the p roads are established to obtain a first road region. The first road region includes buffer zones corresponding to the p roads, and the road network data corresponding to the p roads includes positions of the p roads in the first region. A portion corresponding to the first road region is removed from the first region to obtain a plurality of first region units separated by the first road region.

[0008] In the above method, after obtaining an area (referred to as the first area), a buffer zone is established for p roads, so that the range of the road is expanded from the 0-dimensional nodes and 1-dimensional segments in the road network data to a 2-dimensional area, so that the first road area (that is, the area including the buffer zones corresponding to the p roads) can include a partial area in the first area that does not need to be divided into separate area units. For example, when a buffer zone is established for two lanes traveling in opposite directions, the buffer zones of the two lanes can be connected as one. At this time, the first road area includes a partial area between the two lanes (that is, a partial area that does not need to be divided into separate area units). Then, a plurality of first area units are obtained by removing the portion corresponding to the first road area from the first area (wherein the first area units are separated by the first road area). In this way, the plurality of first area units obtained will not include the above-mentioned area units that do not need to be divided into separate areas.

[0009] In one implementation, the width of the buffer zone corresponding to each road in the first road area is positively correlated with the corresponding road grade.

[0010] Through the above implementation, in the process of dividing the area, the roads can be divided into different levels, and the roads of different levels correspond to different buffer widths. In this way, the intervals between adjacent first area units can also be different with the different levels of the corresponding roads.

[0011] In one implementation, the p roads are roads in the first area whose road grades reach a preset grade.

[0012] In the above implementation, it is considered that in the actual application process, the granularity of the required division results is different according to different needs. For example, in some scenarios, it is necessary to divide an area into regional units with coarser granularity and fewer divisions; in other scenarios, it is necessary to divide an area into regional units with finer granularity and more divisions. In view of the above situation, during the implementation of the present application, a road level (i.e., a preset level) can be determined as needed, and then when establishing a buffer zone, a buffer zone for roads whose road level reaches the preset level is established, thereby obtaining a first road area including these buffer zones. It can be understood that when the preset level is set higher, the buffer zones of the roads included in the first road area are more, so the first area can be divided into more regional units with finer granularity; when the preset level is set lower, the buffer zones of the roads included in the first road area are less, so the first area can be divided into regional units with smaller number and more granularity. In this way, it is possible to obtain division results of different granularities as needed.

[0013] In one implementation, the method further includes: establishing buffer zones corresponding to the q roads respectively according to the road network data corresponding to the q roads, and obtaining a second road area. The second road area includes buffer zones corresponding to the q roads respectively, and the road network data corresponding to the q roads include positions of p roads in the first area, and the q roads are roads in the first area whose road grades are lower than a preset grade. Removing the portion corresponding to the second road area from the plurality of first area units, and obtaining a plurality of second area units.

[0014] Through the above implementation, the first area can be divided into a plurality of first area units according to a coarse granularity, and then, based on the plurality of first area units, a plurality of second area units with a finer granularity can be obtained by removing the portion corresponding to the second road area.

[0015] In one implementation, the method further includes: removing first area units whose corresponding node numbers and areas meet preset conditions from among the plurality of first area units.

[0016] In the above implementation, first area units whose corresponding node numbers and areas satisfy preset conditions are removed from the plurality of first area units, thereby deleting area units with relatively small practical significance that are divided by auxiliary roads such as roundabouts and ramps in the division results.

[0017] In one implementation, the method further includes: performing a closing operation on all or part of the first area units among the plurality of first area units.

[0018] In the above implementation, the problem of possible intrusion of hanging wires in the first area unit is solved by performing a closing operation on the first area unit.

[0019] In one implementation, the method further includes: determining parameters corresponding to the closing operation according to characteristic information of the region to which the first area belongs.

[0020] In the above implementation, different road conditions in different regions are taken into consideration. For example, when comparing regions with larger economic scales with regions with smaller economic scales, regions with larger economic scales tend to have fewer dead-end roads and the corresponding grades of dead-end roads tend to be lower, while regions with larger economic scales tend to have more dead-end roads and the corresponding grades of dead-end roads tend to be higher (for example, in towns with smaller economic scales, there may be situations where the main roads are dead-end roads, while this situation rarely occurs in developed cities with larger economic scales). Therefore, when the feature information of the region to which the first region belongs indicates that the first region is a region with a larger economic scale, a convolution kernel with a smaller number of covered pixels is used in the expansion operation and the corrosion operation in the closing operation; when the feature information of the region to which the first region belongs indicates that the first region is a region with a smaller economic scale, a convolution kernel with a smaller number of covered pixels is used in the expansion operation and the corrosion operation in the closing operation. In this way, the error caused by the closing operation can be avoided under the premise of solving the problem of hanging line intrusion.

[0021] In one implementation, the method further includes: obtaining a region to be divided, wherein the region to be divided includes a plurality of sub-regions. The first region is one of the plurality of sub-regions. The plurality of sub-regions are sub-regions obtained by dividing the region to be divided according to a preset size, or the plurality of sub-regions are sub-regions obtained by dividing the region to be divided according to administrative regions.

[0022] Through the above implementation, a relatively large area to be divided can be first divided into a plurality of sub-areas, and then the method of the present invention can be used to perform area division on the plurality of sub-areas.

[0023] In one implementation, the method further includes: obtaining spatial vector data of the first area, the spatial vector data including the positions of various objects in the first area. Eliminating feature boundary data from the spatial vector data to obtain road network data of the first area, the feature boundary data including the positions of other objects except roads. Finding road network data corresponding to p roads from the road network data of the first area.

[0024] In the above implementation, the road network data can be obtained by removing the boundary data of the objects.

[0025] In one implementation, based on the road network data corresponding to the p roads, buffer zones corresponding to the p roads are established, including: performing a topological check on the road network data corresponding to the p roads. Based on the result of the topological check, topological problem processing is performed on the road network data corresponding to the p roads to obtain corrected road network data. Based on the corrected road network data, buffer zones corresponding to the p roads are established.

[0026] In the above implementation, topological problems may exist in the road network data. For example, the road network data may have problems such as self-intersection (i.e., line elements must not cross or overlap with themselves), hanging points (i.e., both end points of line elements must touch the lines in the same feature class), etc. Therefore, before establishing the buffer, the corrected road network data (hereinafter referred to as the corrected road network data) can be obtained by processing the topological problems, and then the buffer is established for the roads in the road network data according to the corrected road network data.

[0027] In a second aspect, a data processing device is provided, comprising: an acquisition unit, configured to acquire a first area. The processing unit is configured to establish buffer zones corresponding to the p roads respectively according to road network data corresponding to the p roads, to obtain a first road area; the first road area includes buffer zones corresponding to the p roads respectively, and the road network data corresponding to the p roads includes positions of the p roads in the first area. The processing unit is further configured to remove a portion corresponding to the first road area from the first area, to obtain a plurality of first area units separated by the first road area.

[0028] In one implementation, in the first road area, the width of the buffer zone corresponding to each road is positively correlated with the corresponding road grade.

[0029] In one implementation, the p roads are roads in the first area whose road grades reach a preset grade.

[0030] In one implementation, the processing unit is further used to establish buffer zones corresponding to the q roads according to the road network data corresponding to the q roads, and obtain a second road area; the second road area includes buffer zones corresponding to the q roads, the road network data corresponding to the q roads include positions of the p roads in the first area, and the q roads are roads in the first area whose road grades are lower than a preset grade. The processing unit is further used to remove the portion corresponding to the second road area from the plurality of first area units, and obtain a plurality of second area units.

[0031] In one implementation, the processing unit is further configured to remove the first area units whose corresponding node numbers and areas meet preset conditions from among the plurality of first area units.

[0032] In one implementation, the processing unit is further configured to perform a closing operation on all or part of the first area units among the plurality of first area units.

[0033] In one implementation, the processing unit is further configured to determine parameters corresponding to the closing operation according to characteristic information of the region to which the first region belongs.

[0034] In one implementation, an acquisition unit, used to acquire a first area, includes: an acquisition unit, used to acquire an area to be divided, the area to be divided includes multiple sub-areas, the first area is one of the multiple sub-areas, wherein the multiple sub-areas are sub-areas obtained by dividing the area to be divided according to preset sizes, or the multiple sub-areas are sub-areas obtained by dividing the area to be divided according to administrative areas.

[0035] In one implementation, the acquisition unit is further used to acquire spatial vector data of the first area, wherein the spatial vector data includes the positions of various objects in the first area. The processing unit is further used to remove feature boundary data from the spatial vector data to obtain road network data of the first area, wherein the feature boundary data includes the positions of other objects except roads. The processing unit is further used to search for road network data corresponding to p roads from the road network data of the first area.

[0036] In one implementation, a processing unit is used to establish buffer zones corresponding to the p roads according to the road network data corresponding to the p roads, including: a processing unit is used to perform a topology check on the road network data corresponding to the p roads. A processing unit is used to perform a topology problem processing on the road network data corresponding to the p roads according to the result of the topology check to obtain the corrected road network data. A processing unit is used to establish the buffer zones corresponding to the p roads according to the corrected road network data.

[0037] In a third aspect, a data processing device is provided, comprising a memory and a processor, wherein the memory is used to store computer instructions, and the processor is used to call and execute computer instructions from the memory to implement a method as in the first aspect or any implementation method in the first aspect.

[0038] In a fourth aspect, a computer-readable storage medium stores instructions, which, when executed on a processor, implement the method of the first aspect or any one of the implementations of the first aspect.

[0039] According to a fifth aspect, a computer program product is provided. The computer program product includes instructions. When the instructions are executed on a processor, the method according to the first aspect or any implementation method of the first aspect is implemented. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] Figure 1A One of the schematic diagrams of establishing a buffer zone provided in an embodiment of the present application;

[0041] Figure 1B A second schematic diagram of establishing a buffer zone provided in an embodiment of the present application;

[0042] Figure 2 One of the flow charts of a method for dividing a region provided in an embodiment of the present application;

[0043] Figure 3 A schematic diagram of corresponding positions of roads in road network data provided in an embodiment of the present application;

[0044] Figure 4 One of the structural schematic diagrams of a road area provided in an embodiment of the present application;

[0045] Figure 5 One of the structural schematic diagrams of a plurality of area units included in a first area provided in an embodiment of the present application;

[0046] Figure 6 A second flow chart of a method for dividing a region provided in an embodiment of the present application;

[0047] Figure 7 A second structural schematic diagram of a road area provided in an embodiment of the present application;

[0048] Figure 8 A second structural schematic diagram of a plurality of area units included in a first area provided in an embodiment of the present application;

[0049] Fig. 9 A third structural schematic diagram of a plurality of area units included in a first area provided in an embodiment of the present application;

[0050] Fig.10 A third structural diagram of a road area provided in an embodiment of the present application;

[0051] Fig.11 A fourth structural schematic diagram of a plurality of regional units included in a first region provided in an embodiment of the present application;

[0052] Fig.12 A fourth structural schematic diagram of a road area provided in an embodiment of the present application;

[0053] Fig.13 A fifth structural diagram of a plurality of regional units included in a first region provided in an embodiment of the present application;

[0054] Fig.14 A third flowchart of a method for dividing a region provided in an embodiment of the present application;

[0055] Fig.15 A fifth structural diagram of a road area provided in an embodiment of the present application;

[0056] Fig.16 One of the schematic diagrams of cutting multiple area units provided in an embodiment of the present application;

[0057] Fig.17A fourth flowchart of a method for dividing a region provided in an embodiment of the present application;

[0058] Fig.18 A sixth structural diagram of a road area provided in an embodiment of the present application;

[0059] Fig.19 A sixth structural diagram of a plurality of regional units included in a first region provided in an embodiment of the present application;

[0060] Fig. 20 A fifth flow chart of a method for dividing a region provided in an embodiment of the present application;

[0061] Fig.21 A seventh structural diagram of a plurality of regional units included in a first region provided in an embodiment of the present application;

[0062] Fig. 22 A sixth flow chart of a method for dividing a region provided in an embodiment of the present application;

[0063] Fig.23 A seventh structural diagram of a road area provided in an embodiment of the present application;

[0064] Fig.24 An eighth structural schematic diagram of a road area provided in an embodiment of the present application;

[0065] Fig.25 An eighth structural schematic diagram of a plurality of regional units included in a first region provided in an embodiment of the present application;

[0066] Fig.26 A ninth structural diagram of a plurality of regional units included in a first region provided in an embodiment of the present application;

[0067] Fig. 27 A second schematic diagram of cutting multiple area units provided in an embodiment of the present application;

[0068] Fig.28 A tenth structural diagram of a plurality of regional units included in a first region provided in an embodiment of the present application;

[0069] Fig.29 A third schematic diagram of cutting multiple area units provided in an embodiment of the present application;

[0070] Fig.30 An eleventh structural diagram of a plurality of regional units included in a first region provided in an embodiment of the present application;

[0071] Fig.31 A seventh flowchart of a method for dividing a region provided in an embodiment of the present application;

[0072] Fig.32 FIG8 is a flow chart of a method for dividing a region provided in an embodiment of the present application;

[0073] Fig.33 A schematic diagram of merging the division results of multiple sub-regions provided in an embodiment of the present application;

[0074] Fig.34 One of the structural schematic diagrams of a data processing device provided in an embodiment of the present application;

[0075] Fig.35 The second structural diagram of a data processing device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0076] To facilitate understanding of the technical solution, the technical terms involved in this application are first introduced:

[0077] 1. Geographic Information System (GIS), also known as "geographic information system", is a spatial information system. It is a technical system that collects, stores, manages, calculates, analyzes, displays and describes the geographical distribution data in the entire or part of the earth's surface (including the atmosphere) space with the support of computer hardware and software systems. In other words, GIS can be understood as a collection of coordinate-related spatial vector data.

[0078] 2. Traffic autonomous zone (TAZ). When operators perform network planning and optimization, they need to divide the city into several grid units according to certain rules for grid management. Each grid unit can be used as a TAZ, and each TAZ usually corresponds to the same type of people, so as to achieve more reasonable functional zoning. In practical applications, a large area can be divided into several TAZs based on information such as road networks, points of interest (POIs), and the intensity of interaction between various spatial places.

[0079] 3. Atom traffic autonomous zone (AtomTAZ), also known as "atomic TAZ" or "superblock". Atom TAZ is the basic spatial unit of space division. Atom TAZs are characterized by non-repetition in space and gaps between them. Specifically, a TAZ can be composed of one or more atomic TAZs.

[0080] 4. Buffer zone refers to the area formed around the selected map element (for example, point, line or surface) according to the preset buffer distance. Figure 1A Taking the point shown in (a) as an example, when a buffer is established for the point according to the buffer distance L, as shown in FIG. Figure 1A As shown in (b), the resulting buffer is a circular area with a radius of L. It can be understood that when the buffer distance is large enough, the buffers of two or more points may overlap. When merging buffers is selected, the overlapping parts will be merged, and the resulting buffer is a complex surface area. Figure 1B Taking the buffer zone established for the line shown in (a) as an example, when a buffer zone is established for the line according to the buffer distance L, on the one hand, two lines are obtained by translating the distance L to both sides of the line along the normal direction of the line (the distance between the two lines is 2L), and on the other hand, a smooth curve is formed at the end point of the line. The closed area formed by joining the above two lines is shown in FIG. Figure 1B as shown in (b). Figure 1B The enclosed area shown in (b) is the buffer. Similar to the buffer corresponding to the point, when the buffer distance is large enough, the buffers of two or more lines may overlap. When merging buffers is selected, the overlapping parts will be merged, and the final buffer is a complex surface area.

[0081] Among them, in practical applications, a buffer zone can be established by utilizing the dilation operation in image processing. Among them, dilation refers to the operation of convolving some images (or a part of the image, called A) with a kernel (called B). Kernel B can be of any shape and size, and it has a separately defined reference point (anchor point). When establishing a buffer zone, the selected map element (for example, a point, line or surface) is used as image A, and kernel B is a solid disk with a reference point (the diameter can be the above-mentioned buffer distance L). The convolution of kernel B and image A is to calculate the maximum value of the pixel points in the area covered by kernel B, and assign this maximum value to the pixel specified by the reference point, so that the highlight area in image A gradually grows. Simply put, dilation will increase the highlight part and reduce the dark part.

[0082] Specifically, buffer zones are used in many fields such as agriculture, urban planning, and ecological protection. For example, in environmental governance, a certain width is often drawn around a polluted river to represent the polluted area. A buffer zone can be established for the river, and the buffer zone can be used to represent the polluted area. For example, in the construction of transportation infrastructure, a buffer zone can be created for the road according to the road widening width, and then the buffer zone can be superimposed with the building layer, and the buildings that fall into the buffer zone and need to be demolished can be found through superimposition analysis, etc.

[0083] 5. Topological rules. In practical applications, it is sometimes necessary to maintain certain specific relationships between elements. For example, administrative areas cannot overlap, linear roads cannot have overlapping segments, and some bus stations must be on public transportation routes. These specific spatial relationships can be described and defined using topology. Therefore, a series of topological rules can be specified to establish spatial relationships between elements, and these rules (i.e., relationships) can also be adjusted.

[0084] The following is an introduction to the technical solution provided in the embodiment of the present application with reference to examples:

[0085] At present, in applications such as urban planning management, traffic condition analysis, and communication base station construction, it is often necessary to divide a larger area into multiple smaller areas in order to analyze each smaller area.

[0086] In the process of implementing regional division, the regional division is usually carried out based on the road network data in the region and the road as the boundary. However, the regional division method of the related technology often has problems such as complex calculation process, low division efficiency and inaccurate division results.

[0087] Take a method for area division in the related art as an example. The method specifically includes the following steps: Step 1: Obtain the road network data of the area to be divided. Step 2: Triangulate the road network node data in the road network data to obtain a division result. Step 3: Based on the road data in the road network data, merge the triangles in the division result to obtain at least one minimum connected block, and each minimum connected block is a closed block formed by a road. Step 4: Map each point of interest in the area to be divided to each minimum connected block to obtain the division result of the area to be divided.

[0088] It can be seen that, although the region division method provided by the above related technology can be used to divide the region into multiple minimum connected blocks to complete the region division, the division result obtained according to the above related technology may include many region units that do not meet the use requirements.

[0089] For example, in road network data, two lanes running in opposite directions on a road are usually regarded as independent roads, and the coordinates of 0-dimensional nodes and 1-dimensional vector segments are used to record the positions of the independent roads. At this time, if the road network data is used to divide the area, the area between the two lanes running in opposite directions may be divided into an area unit. However, this area unit usually does not meet the usage requirements.

[0090] In view of the above technical problems, the embodiments of the present application take into account that 0-dimensional and 1-dimensional vector segments are usually used to represent the location of the road in the road network data. Therefore, when the related technology directly divides the area according to the nodes and vector segments in the road network data, the division results often include many regional units that do not meet the use requirements. Furthermore, the embodiments of the present application provide a method for regional division. In this method, after obtaining an area (hereinafter referred to as the first area for distinction), a buffer zone is established for the roads in the first area (hereinafter mainly taking the p roads in the first area as an example), so that the range of the road is expanded from the 0-dimensional nodes and 1-dimensional segments in the road network data to a 2-dimensional area, so that the first road area (that is, the area including the buffer zones corresponding to the p roads) can include a part of the area in the first area that does not need to be divided into separate regional units. For example, when a buffer zone is established for two lanes traveling in opposite directions, the buffer zones of the two lanes can be connected as one. At this time, the first road area includes a part of the area between the two lanes (that is, a part of the area that does not need to be divided into separate regional units). Then, multiple first area units are obtained by removing the portion corresponding to the first road area from the first area (wherein the first area units are separated by the first road area). In this way, the multiple first area units obtained will not include the above-mentioned area units that do not need to be divided into separate areas, so a more accurate division result can be obtained.

[0091] The following is an introduction to the area division method provided in the embodiment of the present application with reference to specific examples.

[0092] The area division method provided in the embodiment of the present application can be applied to various types of data processing devices, so that the data processing device can be operated according to the method provided in the embodiment of the present application, thereby obtaining the area division result. In the actual application process, the functions of the above-mentioned data processing device can be implemented by a personal computer (including desktop computers, laptop computers, handheld computers and notebook computers, etc.), an ultra-mobile personal computer (UMPC), or a smart phone, a server and other electronic devices; or, the functions of the above-mentioned data processing device can also be implemented by some hardware / software devices in the above-mentioned electronic devices. The embodiment of the present application does not impose any special restrictions on the specific form of the data processing device.

[0093] The following describes the implementation process of the method provided in the embodiment of the present application in conjunction with the operation process of the data processing device. Figure 2 As shown, the method may include:

[0094] S101: A data processing device obtains a first area.

[0095] The first area may be any area that needs to be divided. For example, the first area may be an area corresponding to a certain country; for another example, the first area may be an area corresponding to a certain city in a certain country; for another example, the first area may be a part of an area in a certain city. The scope of the first area may not be limited in the embodiments of the present application.

[0096] The first area may include many roads. The following mainly takes the p roads included in the first area as an example to introduce the process of dividing the first area using the p roads.

[0097] S102: The data processing device establishes buffer zones corresponding to the p roads respectively according to the road network data corresponding to the p roads, and obtains a first road area.

[0098] The road network data corresponding to the p roads include the positions of the p roads in the first area. For example, in the road network data, 0-dimensional nodes and 1-dimensional vector segments can be used to represent the positions of the roads. In this case, the road network data includes the coordinates of the nodes and vector segments corresponding to each road.

[0099] For example, Figure 3 The schematic diagram of the road network structure established based on the road network data of the first area. Each line segment represents a road. The vector direction of each line segment represents the driving direction of the road (not shown in the figure). It should be noted that, in order to facilitate the understanding of the scheme, Figure 3 In the embodiment, relatively simple horizontal and vertical line segments are used to represent roads. In actual application, the roads in an area may be more complex and rugged. In this case, multiple vector line segments that are segmented and connected end to end may be used to represent the roads. The specific shape of the road may not be limited in the embodiments of the present application.

[0100] The first road area includes buffer zones corresponding to p roads respectively.

[0101] In addition, in the embodiment of the present application, the buffer zone can be an area formed around the map element according to the set distance conditions and the preset buffer distance for the points and / or line segments representing the roads in the road network data. In practical applications, the buffer zone can be obtained by dilating the line segments. By establishing a buffer zone corresponding to each road, the range of the road can be expanded from the 0-dimensional nodes and 1-dimensional line segments in the road network data to a 2-dimensional area.

[0102] For example, in Figure 3 After establishing buffer zones for the 16 roads in the figure, the first road area can be obtained as follows: Figure 4 As shown. Figure 4Taking road a as an example, road a includes a long strip area with a length of x and a width of y in the first road area. The long strip area can cover a partial area that does not need to be divided into separate area units.

[0103] S103: The data processing device removes a portion corresponding to the first road area from the first area to obtain a plurality of area units (hereinafter referred to as “a plurality of first area units” for easy distinction).

[0104] It can be understood that adjacent first area units among the plurality of first area units are separated by a portion corresponding to the first road area.

[0105] For example, the overlapping portion of the first region and the first road region may be removed by using a superposition analysis method, thereby obtaining a plurality of first region units. For another example, the portion corresponding to the first road region may be cut out from the first region by using an image cutting technique, thereby obtaining a plurality of first region units. The specific implementation process of removing the portion corresponding to the first road region from the first region in the embodiment of the present application may not be limited.

[0106] Exemplarily, removing from the first region Figure 4 After the first road area corresponding to the part is shown, the multiple first area units obtained are as follows Figure 5 As shown. It can be seen that Figure 5 The adjacent first area units are separated by the portion corresponding to the first road area. Figure 5 For example, the first area unit 1 and the first area unit 2 adjacent to each other are separated (by Figure 4 From the width y of the area corresponding to the middle road a, it can be known that the distance between the first area unit 1 and the first area unit 2 is y).

[0107] Specifically, after determining the multiple first area units corresponding to the first area, each first area unit can be used as an atomic TAZ so as to perform subsequent area management according to the scope of each first area unit. For example, the first area unit can be used for urban planning management, traffic condition analysis, and communication base station construction. Alternatively, each first area unit can be used as an input for subsequent upward aggregation, and multiple first area units can be merged to obtain a coarser division result.

[0108] In addition, in one implementation, after multiple first area units are determined through the content of S103, the multiple first area units can also be optimized. Specifically, considering that the multiple first area units obtained in S103 may include first area units with relatively small practical significance that are divided by auxiliary roads such as roundabouts and ramps. Therefore, Figure 6 As shown, the method may also include:

[0109] S104: The data processing device removes the first area units whose corresponding node numbers and areas meet preset conditions from the plurality of first area units.

[0110] Specifically, the number of nodes corresponding to the area unit can be understood as the number of nodes used to determine the range of the area unit. For example, taking a quadrilateral area unit as an example, because the range of the area unit is determined by four vertices, the number of nodes corresponding to the area unit is 4. For another example, taking a pentagonal area unit as an example, because the range of the area unit is determined by five vertices, the number of nodes corresponding to the area unit is 5.

[0111] In addition, in the embodiment of the present application, the preset condition may be that the area is less than an area threshold, or the preset condition may be that the ratio of the area to the corresponding number of nodes (i.e., the number of nodes used to enclose the area unit) is greater than a ratio threshold, etc.

[0112] For example, Figure 7 Take the first road area shown as an example, which includes the buffer zone corresponding to the roundabout and ramp. Figure 7 The first road area shown, the obtained multiple first area units are as follows Figure 8 As shown. It can be seen that Figure 8 The first area unit is divided by the roundabout and the first area unit is divided by the ramp. Then, Fig. 9 The result shown is the result of removing the corresponding first regional unit (ie, the regional unit whose corresponding node number and area meet the preset conditions).

[0113] Furthermore, the multiple first area units determined in S104 can be used as atomic TAZs, so as to perform subsequent area management according to the range of each first area unit determined in S104. Alternatively, each first area unit determined in S104 can be used as an input for subsequent upward aggregation, and a coarser division result can be obtained by merging multiple first area units.

[0114] In addition, in one implementation, in the process of dividing the area in the embodiment of the present application, the roads can be divided into different levels, and the roads of different levels correspond to different buffer widths. In this way, the intervals between the multiple first area units obtained by S103 can also be different with the different levels of the corresponding roads.

[0115] Specifically, in the method provided in the embodiment of the present application, the width of the buffer zone corresponding to each road in the first road area is positively correlated with the corresponding road grade.

[0116] by Figure 3Taking the road network shown in FIG. 1 as an example, when the roads in the road network are divided into three levels (for example, level 1, level 2 and level 3, where level 1 is the highest and level 3 is the lowest), as shown in FIG. Fig.10 The figure shows a schematic diagram of the first road area obtained by the data processing device. The buffer zone corresponding to the level 1 road is the widest, and the buffer zone corresponding to the level 3 road is the narrowest. Fig.10 The first road area shown, the multiple area units obtained are as follows Fig.11 As shown. It can be seen that Fig.11 Among them, the interval between adjacent area units separated by level 1 roads is the widest, the interval between adjacent area units separated by level 3 roads is the narrowest, and the interval width between adjacent area units separated by level 2 roads is in the middle.

[0117] In addition, in the embodiment of the present application, when determining the road grade corresponding to the road, the road grade division method can be determined according to actual needs. Specifically:

[0118] In one possible design, the method further includes: a data processing device determines the grade of the road based on the type of the road.

[0119] For example, the types of roads may include: trunk, motorway, primary, secondary, and track. Furthermore, after obtaining the types of each road (for example, when the road network data includes the road type, the data processing device may obtain the road type by reading the corresponding information in the road network data), the data processing device may determine the trunk, motorway, and secondary as level 1; determine the secondary as level 2; and determine the secondary as level 3.

[0120] In another possible design, the method further includes: a data processing device determines the road grade according to an actual width of the road.

[0121] For example, a road with an actual width of less than 10 meters is determined as Class 3, a road with an actual width of 10 to 20 meters is determined as Class 2, and a road with an actual width of more than 30 meters is determined as Class 1. Furthermore, after obtaining the actual width of each road (for example, when the road network data includes the road width, the data processing device can obtain the actual width of the road by reading the corresponding information in the road network data), the data processing device determines the road grade according to the above correspondence between the actual width of the road and the road grade.

[0122] In addition, in one implementation, considering that in actual application, the granularity of the required division results is different according to different requirements. For example, in some scenarios, it is necessary to divide an area into regional units with coarser granularity and fewer divisions; in other scenarios, it is necessary to divide an area into regional units with finer granularity and more divisions. In view of the above situation, during the implementation of the embodiment of the present application:

[0123] The above S102 is used to determine that the p roads in the first road area are roads whose road grades reach a preset grade.

[0124] That is to say, the first road area obtained in S102 may not include areas corresponding to roads whose road grades are lower than the preset grades. In this way, a division result of corresponding granularity can be obtained according to actual needs.

[0125] For example, Fig.10 Taking the road level shown in FIG. 1 as an example, when the preset level is level 2 (i.e., the first road area only includes areas corresponding to p roads with a road level of level 2), the first road area obtained by S102 is as follows: Fig.12 Then, through S103, the first region is removed Fig.12 The first road area shown, the obtained multiple first area units are as follows Fig.13 As shown. It can be seen that Fig.13 The first area unit divided in Fig.11 The first area unit divided in the middle has a coarser granularity.

[0126] In addition, in one implementation, considering the need to divide a region into multiple granularity division results (for example, on the one hand, it is necessary to Figure 2 The first area shown is divided into level 1 and level 2 roads to obtain the division result. Figure 2 The first area shown in the figure is divided according to level 1-3 roads to obtain a finer granularity division result). The area can be divided according to the coarse granularity first, and then further divided on the basis of the coarse granularity division to obtain a finer granularity division result. Fig.14 As shown, the method provided in the embodiment of the present application may include:

[0127] S201: A data processing device obtains a first area.

[0128] The implementation process of S201 may refer to the content of S101 above, and will not be elaborated here.

[0129] S202. The data processing device establishes buffer zones corresponding to the p roads respectively according to the road network data corresponding to the p roads, and obtains a first road area.

[0130] The road network data corresponding to the p roads include the positions of the p roads in the first area. The first road area includes buffer zones corresponding to the p roads respectively.

[0131] In addition, the p roads are roads whose road grades reach a preset grade.

[0132] The implementation process of S202 may refer to the corresponding content of S102 above.

[0133] Taking the road network shown in FIG1 as an example, when the preset level is level 2, the above p roads specifically include level 1 roads and level 2 roads, so the first road area is as follows Fig.12 shown.

[0134] S203: The data processing device removes a portion corresponding to the first road area from the first area to obtain a plurality of first area units.

[0135] The implementation process of S203 may refer to the corresponding content of S103 above.

[0136] by Fig.12 As an example of the first road area shown in FIG. 1 , the multiple first area units obtained in S203 are as follows: Fig.13 shown.

[0137] S204: The data processing device removes the first area units whose corresponding node numbers and areas meet preset conditions from the plurality of first area units.

[0138] The implementation process of S204 may refer to the corresponding content of S104 above.

[0139] After obtaining a plurality of first area units, the method may further include:

[0140] S205. The data processing device establishes buffer zones corresponding to the q roads respectively according to the road network data corresponding to the q roads, and obtains a second road area.

[0141] The q roads are roads in the first area whose road grades are lower than the preset grade. The road network data corresponding to the q roads include the positions of the p roads in the first area. The first road area includes buffer zones corresponding to the p roads respectively.

[0142] The specific implementation process of determining the second road area may refer to the corresponding content of S102 above.

[0143] Continuing the above example, when the preset level is level 2, the above q roads specifically include level 3 roads, so the second road area is as follows: Fig.15 shown.

[0144] S206: The data processing device removes a portion corresponding to the second road area from the plurality of first area units to obtain a plurality of second area units.

[0145] It can be understood that the plurality of second area units are separated by the first road area or by the corresponding parts of the second road area.

[0146] For example, the portion corresponding to the second road area may be removed from the plurality of second area units by superposition processing or the like, such as Fig.16 As shown. Then, the obtained multiple second area units can be as follows Fig.11 As shown. At this point, it can be understood that: on the one hand, Fig.11 The adjacent second area units are separated by the first road area (or can be said to be separated by the first-level road or the second-level road); on the other hand, Fig.11 Also included are adjacent second area units separated by second road areas (or separated by third-level roads).

[0147] It should be noted that the "multiple first area units" used to remove the part corresponding to the second road area in S206 may be the first area units remaining after removing the "first area units whose corresponding node number and area meet the preset conditions" obtained in S204. In some other application scenarios, S204 may not be executed, and the part corresponding to the second road area may be removed from the multiple first area units obtained in S203 to obtain multiple second area units. This may not be limited in the embodiments of the present application.

[0148] S207: The data processing device removes the second area units whose corresponding node numbers and areas meet preset conditions from the plurality of second area units.

[0149] The implementation process of S207 may refer to the corresponding content of S104 above.

[0150] It can be seen that through the above process of S201-S207, two granularity division results (ie, the multiple first area units determined in S204 and the multiple second area units determined in S207) can be obtained, wherein the granularity of the first area unit is coarser than that of the second area unit.

[0151] It is understandable that, in actual application, when more road levels can be divided (for example, including road levels 4, 5, etc.), road levels 3, 4, etc. can be used as preset levels, and multiple second area units can be further cut with reference to the contents of S205-S207 above, so as to obtain a first area division result with finer granularity. This embodiment of the present application will not be described in detail.

[0152] In addition, in one implementation, during the process of dividing the first area, the required division granularity may be determined according to user operations. Fig.17 As shown, the method also includes:

[0153] S301: The data processing device receives a user operation.

[0154] The user operation is used to indicate the granularity of dividing the first area.

[0155] For example, the division granularity of the first area may be preset to include: level 1 granularity, level 2 granularity, and level 3 granularity. Level 1 granularity corresponds to dividing the first area according to level 1 roads, level 2 granularity corresponds to dividing the first area according to level 1 and level 2 roads, and level 3 granularity corresponds to dividing the first area according to level 1-3 roads.

[0156] S302: The data processing device determines a preset level according to the division granularity indicated by the user operation.

[0157] In this way, the data processing device can divide the first area according to the preset level determined in S302. For example, after the data processing device determines the preset level in S302, it can divide the first area according to Fig. 9 According to the process shown, a plurality of first area units are obtained.

[0158] In addition, in a possible design, the user operation in S301 can be used to indicate multiple division granularities. In this way, after receiving the user operation, the data processing device can first determine the preset level according to the coarsest granularity among the multiple division granularities, and then Fig.14 The data processing device can further divide the plurality of second area units with finer granularity according to the contents of S205-S207. Similarly, the data processing device can further divide the plurality of second area units with reference to the contents of S205-S207 to obtain a division result with finer granularity.

[0159] In addition, in one implementation, it is considered that there may be region units with abnormal shapes in the division results obtained according to S104, S204 or S207. Figure 3 When the road network shown includes dead-end roads (i.e., one end node of the road is only connected to the opposite road in the opposite direction and is not connected to other roads), the buffer zone established for the road at this time is as follows: Fig.18 Further, if we follow Fig.18 The road area shown in the figure is clipped to the first area, and the obtained area unit is as follows Fig.19 As shown. It can be seen that there are regional units with abnormal shapes (such as Fig.19Therefore, in the embodiment of the present application, the problem of hanging line intrusion can be solved by performing a closing operation on the regional unit, thereby optimizing the division result.

[0160] Specifically, when a plurality of first regional units are obtained through S101-S104, as Fig. 20 As shown, after obtaining a plurality of first area units, the method may further include:

[0161] S105: The data processing device performs a closing operation on all or part of the first area units among the plurality of first area units.

[0162] The closing operation can be understood as the process of first dilating and then eroding. Dilation refers to the operation of convolving some images (or a part of the image, called A) with a kernel (called B). Erosion is the inverse operation of dilation. The erosion operation calculates the minimum value of the pixels in the kernel area. Erosion can generate a new image through the following algorithm: when the kernel B is convolved with the image, the minimum pixel value of the area covered by B is calculated and this value is placed on the reference point.

[0163] Specifically, the data processing device performs a closing operation on all or part of the multiple first area units, which may include: the data processing device performs an expansion operation on each first area unit, and then the data processing device performs an erosion operation on the result of the expansion operation, so as to obtain an optimization result.

[0164] For example, when a plurality of first area units are Fig.19 When the optimization result is obtained after closing the multiple first area units, Fig.21 As shown in Figure 2, it can be seen that the closed operation can make the optimization result no longer include the regional units with abnormal shapes.

[0165] In addition, in the process of first dividing the region according to coarse granularity and then further dividing it based on the coarse granularity division result to obtain a fine granularity division result (i.e., the above-mentioned process S201-S207), the division results corresponding to each granularity (i.e., the multiple first area units obtained in S204 and the multiple second area units obtained in S207) can also be closed respectively to obtain the corresponding optimization result.

[0166] Furthermore, in a possible design, when the area division is performed through S201-S107, as shown in FIG. Fig. 22 As shown, after obtaining a plurality of first area units through S204, the method may further include:

[0167] S208. The data processing device performs a closing operation on the multiple first area units obtained in S204 (for the sake of distinction, the result obtained after performing the closing operation on the multiple first area units is referred to as a “first optimization result” hereinafter).

[0168] In addition, after obtaining a plurality of second regional units in S207, the method may further include:

[0169] S209. The data processing device performs a closing operation on the multiple second area units obtained in S207 (for the sake of distinction, the result obtained after performing the closing operation on the multiple second area units is referred to as a “second optimization result” hereinafter).

[0170] Similarly, when the region units included in the plurality of second region units are further cropped with reference to the contents of S205-S207 above, thereby obtaining a first region division result with a finer granularity, a closing operation may also be performed on the division result with a finer granularity. This embodiment of the present application will not be described in detail.

[0171] In addition, in the above design, it is considered that in the process of first dividing the region according to the coarse granularity and then further dividing it on the basis of the coarse granularity to obtain the fine granularity division result (i.e., the above S201-S207 process), if further division is performed on the basis of the optimization result of the closing operation corresponding to the coarse granularity, the obtained fine granularity division result may be unreasonable. Fig. 22 In the illustrated process, in S206, the plurality of first region units that have not undergone the closing operation (i.e., the plurality of first region units obtained in S204, not the region units obtained after the closing operation in S208) are still clipped to obtain a plurality of second region units. Similarly, when the plurality of second region units are further clipped to obtain region units with finer granularity, the division results that have not undergone the closing operation can also be further clipped.

[0172] The following is an example of the unreasonable problem of fine-grained division results when further division is performed on the basis of the optimization result of the closing operation corresponding to the coarse-grained. Specifically, when there are two connected roads with different road grades in the road network, the areas of the two roads in the first road area determined at this time may be as follows: Fig.23 The part enclosed by the dotted circle is shown in the figure.

[0173] On the one hand, if the optimization result obtained by the closing operation is used to divide the region into the next granularity, the processing process includes: first, by establishing a buffer zone for level 1 and level 2 roads (i.e., S202), the first road region obtained is as follows: Fig.24 Then, using Fig.24The first road area shown in FIG. 1 is used to cut the first area and obtain a plurality of first area units (such as Fig.25 ), and then Fig.25 The first optimization result (such as Fig.26 Then, the first optimization result is clipped using the buffer of the Class 3 road (i.e., the second buffer) (as shown in Fig. 27 As shown) and obtain a plurality of second area units (as shown Fig.28 shown).

[0174] On the other hand, if multiple first area units that have not been closed are used to perform area division of the next granularity, the processing process includes: first, by establishing a buffer zone for level 1 and level 2 roads (i.e., S202), the first road area obtained is as follows: Fig.24 Then, using Fig.24 The first road area shown in FIG. 1 is used to cut the first area and obtain a plurality of first area units (such as Fig.25 Then, the buffer zone of the Level 3 road (i.e., the second buffer zone) is used to Fig.25 The first area units are cut as shown (eg Fig.29 As shown) and obtain a plurality of second area units (as shown Fig.30 ). Fig.28 and Fig.30 , it can be seen Fig.28 There are regional units with abnormal shapes.

[0175] In addition, in a possible design, when a closing operation is performed on the division result, the method may further include: a data processing device determines parameters of the closing operation based on characteristic information of the region to which the first area belongs.

[0176] The parameters of the closing operation may specifically include: parameters of the convolution kernel used in the dilation operation and the erosion operation in the closing operation.

[0177] The characteristic information of the region to which the first region belongs may include: the economic scale of the region to which the first region belongs, the area size of the city to which the first region belongs, or the population of the city to which the first region belongs, etc. In practical applications, which characteristic information of the region to which the first region belongs is used to determine the parameters of the closing operation may not be limited in the embodiments of the present application.

[0178] For example, considering comparing regions with larger economies with regions with smaller economies, regions with larger economies tend to have fewer dead-end roads and the corresponding grades of dead-end roads tend to be lower, while regions with larger economies tend to have more dead-end roads and the corresponding grades of dead-end roads tend to be higher (for example, in towns with smaller economies, there may be situations where main roads are dead-end roads, while this situation rarely occurs in developed cities with larger economies). Therefore, when the feature information of the region to which the first region belongs indicates that the first region is a region with a larger economy, a convolution kernel with a smaller number of covered pixels is used in the expansion operation and the erosion operation in the closing operation; when the feature information of the region to which the first region belongs indicates that the first region is a region with a smaller economy, a convolution kernel with a smaller number of covered pixels is used in the expansion operation and the erosion operation in the closing operation.

[0179] In addition, in one implementation, in order to obtain the road network data corresponding to the p roads, so as to establish the buffer zones corresponding to the p roads respectively according to the road network data corresponding to the p roads to obtain the first road area (ie, S102), as follows Fig.31 As shown, after the data processing device acquires the first area, the method may further include:

[0180] S106: The data processing device obtains spatial vector data of the first area.

[0181] The spatial vector data includes the positions of various objects in the first area. For example, the spatial vector data may include the positions of roads, railways, and water bodies in the first area.

[0182] S107: The data processing device removes the feature boundary data from the spatial vector data to determine the road network data of the first area.

[0183] The feature boundary data includes the locations of other objects except roads. Specifically, the feature boundary data may include the locations of water bodies (such as rivers, lakes or seas, etc.) and railways in the first area.

[0184] S108. The data processing device searches for road network data corresponding to p roads from the road network data of the first area.

[0185] Specifically, the road network data of the first area obtained by S107 may include locations of many roads. In practical applications, all or part of these roads can be used to divide the area. In other words, all or part of the roads in the road network data of the first area can be used as the above-mentioned p roads for subsequent processing.

[0186] In addition, in one implementation, it is considered that the road network data obtained by the data processing device may violate the topological rules. For example, the road network data may have self-intersections (i.e., line elements must not cross or overlap with themselves), hanging points (i.e., both end points of line elements must touch the lines in the same feature class), and other problems. Therefore, in the process of establishing a buffer zone, the corrected road network data (hereinafter referred to as the corrected road network data) can be obtained by processing the topological problems, and then the buffer zone can be established for the road based on the corrected road network data.

[0187] Therefore, if Fig.32 As shown, S102 may specifically include:

[0188] S1021. The data processing device performs a topological check on the road network data corresponding to the p roads.

[0189] Specifically, the topology check may include checking various topological problems that violate the line topology rules in the road network data corresponding to the p roads. Among them, the line topology rules may specifically include the line topology rules commonly used in GIS. For example, the line topology rules may include: Rule 1: Line elements are not allowed to have hanging nodes; Rule 2: There cannot be pseudo nodes, that is, the endpoints of the line segment cannot be just the contact points of the two endpoints (the first contact of itself is an exception); Rule 3: In the same feature class, lines cannot overlap with each other; Rule 4: Line elements cannot overlap with themselves; Rule 5: In the same feature, lines cannot intersect with each other; Rule 6: In the same feature class, line elements cannot intersect with themselves; Rule 7: Lines cannot cross, and endpoints cannot touch non-endpoints (non-contact points overlap each other is allowed); Rule 8: Line elements must be separate and cannot touch or overlap each other; Rule 9: Line segments in two line feature classes cannot overlap; Rule 10: Line segments in a feature class must be covered by line segments in another feature class; Rule 11: The endpoints of line elements are covered by point elements; Rule 12: Line elements must be covered by the boundaries of polygon elements, and so on.

[0190] S1022. The data processing device performs topological problem processing on the road network data corresponding to the p roads according to the structure of the topological check to obtain corrected road network data.

[0191] S1023. The data processing device establishes buffer zones corresponding to the p roads respectively based on the corrected road network data to obtain a first road area.

[0192] Specifically, the modified road network data includes the coordinates of nodes and vector segments indicating the positions of the p roads in the first area. Furthermore, using the coordinates of these nodes and vector segments, buffers corresponding to the p roads can be established respectively.

[0193] The process of establishing buffer zones corresponding to the p roads based on the modified road network data in S1023, and then obtaining the first road area, can be referred to in the above description according to Figure 3 The road network structure shown is established Figure 4 The process of the first road area is shown, and the repeated contents are not repeated here.

[0194] In one implementation, considering that a larger area can be divided into multiple sub-areas, each sub-area can be divided according to the above method for dividing the first area. Therefore, in the method provided in the embodiment of the present application, the process of obtaining the first area in S101 or S201 can specifically include: the data processing device obtains the area to be divided.

[0195] The area to be divided includes multiple sub-areas, and the first area in the above S101 or S201 is one of the multiple sub-areas.

[0196] The plurality of sub-regions are sub-regions obtained by dividing the area to be divided according to preset sizes; or the plurality of sub-regions are sub-regions obtained by dividing the area to be divided according to administrative regions.

[0197] In other words, in an embodiment of the present application, after obtaining the area to be divided, the area to be divided can be divided according to a preset size (for example, the area to be divided can be divided according to a rectangle with length and width as set parameters) to obtain multiple sub-areas, or the area to be divided can be divided according to administrative areas (for example, the area to be divided can be divided according to the jurisdictions corresponding to different cities) to obtain multiple sub-areas.

[0198] For each sub-area in the divided area, the above Figure 2 , Figure 6 , Fig.14 , Fig.17 , Fig. 20 , Fig. 22 , Fig.31 or Fig.32 In other words, the above Figure 2 , Figure 6 , Fig.14 , Fig.17 , Fig. 20 , Fig. 22 , Fig.31 or Fig.32 The first region in can be any one of multiple sub-regions.

[0199] Furthermore, through the above Figure 2 , Figure 6 , Fig.14 , Fig.17 , Fig. 20 , Fig. 22 , Fig.31 or Fig.32 After the division results of multiple sub-areas are obtained through the process, the method may further include:

[0200] The data processing device combines the division results of the multiple sub-regions to obtain the division result of the region to be divided.

[0201] Specifically, in a possible design, the division results of multiple sub-regions may be merged by means of vector fusion.

[0202] For example Fig.33 As shown, in Fig.33 After vector fusion of the two sub-regions in (a), Fig.33 As shown in (b), adjacent area units in the edge parts of two sub-areas are merged into one area unit.

[0203] With the above design, when merging the division results of multiple sub-regions, the region units at the edge of adjacent sub-regions can be merged into one region unit, thereby avoiding unreasonable region division at the division position when the region to be divided is divided according to the preset size.

[0204] In another possible design, the division results of the multiple sub-regions may be merged by first performing vector combination and then performing vector decomposition.

[0205] For example Fig.33 As shown, in Fig.33 The two sub-regions in (a) are first vector-combined and then vector-decomposed, as shown in Fig.33 As shown in (c), the adjacent area units in the edge parts of the two sub-areas will each constitute an independent area unit.

[0206] Through the above design, when the division results of multiple sub-regions are merged, the regional units at the edge of adjacent sub-regions can constitute independent regional units. Therefore, when the area to be divided is divided according to administrative divisions, the boundaries of administrative divisions can also be used as the basis for dividing the area.

[0207] Combined with the above Figure 2-Figure 33 , describes in detail the area division method provided by this embodiment, and the various devices corresponding to the area division method provided by this embodiment will be described below.

[0208] like Fig.34, which is a schematic diagram of the structure of a data processing device provided in this embodiment. Specifically, the data processing device 40 may include a desktop computer, a tablet computer, a desktop, a laptop, a handheld computer, a notebook computer, an ultra-mobile personal computer (UMPC), a netbook, a cellular phone, a personal digital assistant (PDA), an augmented reality (AR)\virtual reality (VR) device, and various artificial intelligence (AI) hardware accelerators and other devices that can perform image processing, or the data processing device 40 may also be software running on the above devices.

[0209] The data processing device 40 can be used to execute the above Figure 2 , Figure 6 , Fig.14 , Fig.17 , Fig. 20 , Fig. 22 , Fig.31 or Fig.32 Specifically, the data processing device 40 includes:

[0210] The acquisition unit 401 is configured to acquire a first area.

[0211] The processing unit 402 is used to establish buffer zones corresponding to the p roads respectively according to the road network data corresponding to the p roads, and obtain a first road area; the first road area includes buffer zones corresponding to the p roads respectively, and the road network data corresponding to the p roads includes the positions of the p roads in the first area.

[0212] The processing unit 402 is further configured to remove a portion corresponding to the first road region from the first region to obtain a plurality of first region units separated by the first road region.

[0213] In one implementation, in the first road area, the width of the buffer zone corresponding to each road is positively correlated with the corresponding road grade.

[0214] In one implementation, the p roads are roads in the first area whose road grades reach a preset grade.

[0215] In one implementation, the processing unit 402 is further configured to establish buffer zones corresponding to the q roads respectively according to the road network data corresponding to the q roads, so as to obtain a second road area.

[0216] The second road area includes buffer zones corresponding to q roads, the road network data corresponding to the q roads include the locations of p roads in the first area, and the q roads are roads with a road grade lower than a preset grade in the first area.

[0217] The processing unit 402 is further configured to remove a portion corresponding to the second road area from the plurality of first area units to obtain a plurality of second area units.

[0218] In one implementation, the processing unit 402 is further configured to remove the first area units whose corresponding node numbers and areas meet preset conditions from among the plurality of first area units.

[0219] In one implementation, the processing unit 402 is further configured to perform a closing operation on all or part of the first area units among the plurality of first area units.

[0220] In one implementation, the processing unit 402 is further configured to determine parameters corresponding to the closing operation according to feature information of the region to which the first region belongs.

[0221] In one implementation, the acquiring unit 401 is configured to acquire the first area, including:

[0222] The acquisition unit 401 is used to acquire the area to be divided, which includes multiple sub-areas. The first area is one of the multiple sub-areas, wherein the multiple sub-areas are sub-areas obtained by dividing the area to be divided according to preset sizes, or the multiple sub-areas are sub-areas obtained by dividing the area to be divided according to administrative areas.

[0223] In one implementation, the acquisition unit 401 is further configured to acquire spatial vector data of the first area, where the spatial vector data includes positions of various objects in the first area.

[0224] The processing unit 402 is further configured to remove the feature boundary data from the spatial vector data to obtain the road network data of the first area, wherein the feature boundary data includes the positions of other objects except the roads.

[0225] The processing unit 402 is further configured to search for road network data corresponding to the p roads from the road network data of the first area.

[0226] In one implementation, the processing unit 402 is configured to establish buffer zones corresponding to the p roads according to the road network data corresponding to the p roads, including:

[0227] The processing unit 402 is used to perform a topology check on the road network data corresponding to the p roads;

[0228] The processing unit 402 is used to perform topological problem processing on the road network data corresponding to the p roads according to the result of the topological check to obtain the corrected road network data;

[0229] The processing unit 402 is used to establish buffer zones corresponding to the p roads respectively based on the modified road network data.

[0230] For a more detailed description of the acquisition unit 401 and the processing unit 402, please refer to Figure 2 , Figure 6 , Fig.14 , Fig.17 , Fig. 20 , Fig. 22 , Fig.31 or Fig.32 The relevant description in the method shown will not be repeated here.

[0231] Fig.35 This is a schematic diagram of the structure of another data processing device provided in this embodiment. The data processing device 50 may be a chip or a system on a chip. Specifically, the data processing device 50 may include all or part of the hardware in a device that can perform data processing, such as a desktop computer, a tablet computer, a desktop, a laptop, a handheld computer, a notebook computer, a super mobile personal computer, a netbook, and a cellular phone, a personal digital assistant, an augmented reality\virtual reality device, etc.

[0232] The data processing device 50 may include: a processor 501 , a communication line 502 , a memory 503 , and part or all of at least one communication interface 504 .

[0233] The processor 501 is used to execute the Figure 2 , Figure 6 , Fig.14 , Fig.17 , Fig. 20 , Fig. 22 , Fig.31 or Fig.32 All or part of the steps executed by a data processing device in the provided method.

[0234] Specifically, the processor 501 may include a general-purpose central processing unit (CPU), and the processor 501 may also include a microprocessor, a field programmable gate array (Field Programmable Gate Array, FPGA), a digital signal processor (digital signal processing, DSP) or an application-specific integrated circuit (application-specific integrated circuit, ASIC), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc.

[0235] In a specific implementation, as an embodiment, the processor 501 may include one or more CPUs, such as Fig.35 CPU0 and CPU1 in.

[0236] In a specific implementation, as an embodiment, the device 50 may include multiple processors, such as Fig.35 501 and processor 508 in the embodiment of the present invention. Each of these processors can be a single-CPU processor or a multi-CPU processor. The processor here can refer to one or more devices, circuits, and / or processing cores for processing, for example, computer data (computer program instructions).

[0237] In addition, the memory 503 may be a volatile memory or a nonvolatile memory, or may include both volatile and nonvolatile memories. Among them, the nonvolatile memory may be a read-only memory (ROM), a programmable ROM (PROM), an erasable programmable ROM (EPROM), an electrically erasable programmable ROM (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example but not limitation, many forms of RAM are available, such as static RAM (SRAM), dynamic random access memory (DRAM), synchronous DRAM (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM) and direct rambus RAM (DR RAM). Memory 503 can be independent and connected to processor 501 via communication line 502. Memory 503 can also be integrated with processor 501.

[0238] The memory 503 stores computer instructions. The processor 501 can execute all or part of the steps in the area division method provided in this embodiment by executing the computer instructions stored in the memory 503. Fig.35 As shown, the computer instructions stored in the memory 503 may include software modules for implementing the functions of the acquisition unit 401 and the processing unit 402. The processor 501 may execute the computer instructions stored in the memory 503 to perform the area division method provided in this embodiment.

[0239] Optionally, the computer-executable instructions in this embodiment may also be referred to as application program codes, which is not specifically limited in this embodiment.

[0240] In addition, the communication interface 504 uses any transceiver or other device for communicating with other devices or communication networks, such as Ethernet, radio access network (RAN), wireless local area networks (WLAN), etc.

[0241] In addition, the communication line 502 is used to connect the various components in the data processing device 50. Specifically, the communication line 502 may include a data bus, a power bus, a control bus, a status signal bus, etc. However, for the sake of clarity, various buses are marked as communication lines 502 in the figure.

[0242] In a specific implementation, as an embodiment, the data processing device 50 may further include an output device 507 and an input device 506. The output device 507 may communicate with the processor 501 and may display information in a variety of ways. For example, the output device 507 may be a liquid crystal display (LCD), a light emitting diode (LED) display device, a cathode ray tube (CRT) display device, or a projector. The input device 506 may communicate with the processor 501 and may receive user input in a variety of ways. For example, the input device 506 may be a mouse, a keyboard, a touch screen device, or a sensor device.

[0243] In addition, the data processing device 50 may further include a storage medium 505. The storage medium 505 is used to store computer instructions and various data for implementing the technical solution of this embodiment. When the data processing device 50 executes the above-mentioned area division method of this embodiment, the computer instructions and various data stored in the storage medium 505 are loaded into the memory 503, so that the processor 501 can execute the computer instructions stored in the memory 503 to execute the area division method provided by this embodiment.

[0244] The method steps in this embodiment can be implemented by hardware or by a processor executing software instructions. The software instructions can be composed of corresponding software modules, and the software modules can be stored in RAM, flash memory, ROM, PROM, EPROM, EEPROM, registers, hard disks, mobile hard disks, CD-ROMs or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor so that the processor can read information from the storage medium and write information to the storage medium. Of course, the storage medium can also be a component of the processor. The processor and the storage medium can be located in an ASIC. In addition, the ASIC can be located in a data processing device. Of course, the processor and the storage medium can also be present in the data processing device as discrete components.

[0245] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented by software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instruction is loaded and executed on the computer, the process or function of the present embodiment is executed in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, a communication device, a user device or other programmable device. The computer program or instruction can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer program or instruction can be transmitted from one website site, computer, server or data center to another website site, computer, server or data center by wired or wireless means. The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that integrates one or more available media. The available medium can be a magnetic medium, such as a floppy disk, a hard disk, a tape; it can also be an optical medium, such as a digital video disc (DVD); it can also be a semiconductor medium, such as an SSD.

[0246] In this embodiment, unless otherwise specified or there is a logical conflict, the terms and / or descriptions between different implementations are consistent and can be referenced to each other, and the technical features in different embodiments can be combined to form a new embodiment based on their internal logical relationships.

[0247] In this embodiment, "at least one" means one or more, "more than one" means two or more, and other quantifiers are similar. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, for elements (element) in the singular form "a", "an" and "the", unless the context clearly stipulates otherwise, it does not mean "one or only one", but means "one or more than one". For example, "a device" means one or more such devices. Furthermore, at least one (at least one of) ......." means one or any combination of subsequent associated objects, for example, "at least one of A, B and C" includes A, B, C, AB, AC, BC, or ABC. In the text description of this embodiment, the character " / " generally indicates that the previous and next associated objects are in an "or" relationship; in the formula of this embodiment, the character " / " indicates that the previous and next associated objects are in a "division" relationship.

Claims

1. A method for dividing a region, characterized in that: include: Acquire a first area, wherein the first area includes p roads; According to the road network data corresponding to the p roads, buffer zones corresponding to the p roads are established to obtain a first road area; the first road area includes the buffer zones corresponding to the p roads, and the road network data corresponding to the p roads include the positions of the p roads in the first area; A portion corresponding to the first road area is removed from the first area to obtain a plurality of first area units.

2. The method according to claim 1, characterized in that In the first road area, the width of the buffer zone corresponding to each road is positively correlated with the corresponding road grade.

3. The method according to claim 1 or 2, characterized in that: The p roads are roads in the first area whose road grades reach a preset grade.

4. The method according to claim 3, characterized in that The method further comprises: According to the road network data corresponding to the q roads, buffer zones corresponding to the q roads are established to obtain a second road area; the second road area includes the buffer zones corresponding to the q roads, the road network data corresponding to the q roads include the positions of the p roads in the first area, and the q roads are roads in the first area whose road grades are lower than a preset grade; A portion corresponding to the second road area is removed from the plurality of first area units to obtain a plurality of second area units.

5. The method according to any one of claims 1 to 4, characterized in that: The method further comprises: The first area units whose corresponding node numbers and areas meet preset conditions are removed from the plurality of first area units.

6. The method according to any one of claims 1 to 5, characterized in that: The method further comprises: A closing operation is performed on all or part of the plurality of first area units.

7. The method according to claim 6, characterized in that The method further comprises: Parameters corresponding to the closing operation are determined according to characteristic information of the region to which the first area belongs.

8. The method according to any one of claims 1 to 7, characterized in that: The obtaining of the first region includes: Obtain an area to be divided, wherein the area to be divided includes multiple sub-areas, and the first area is one of the multiple sub-areas, wherein the multiple sub-areas are sub-areas obtained by dividing the area to be divided according to preset sizes, or the multiple sub-areas are sub-areas obtained by dividing the area to be divided according to administrative areas.

9. The method according to any one of claims 1 to 8, characterized in that: The method further comprises: Acquire spatial vector data of the first area, wherein the spatial vector data includes positions of various objects in the first area; Eliminating the feature boundary data from the spatial vector data to obtain the road network data of the first area, wherein the feature boundary data includes the positions of other objects except the roads; The road network data corresponding to the p roads are searched from the road network data of the first area.

10. The method according to any one of claims 1 to 9, characterized in that: The step of establishing buffer zones corresponding to the p roads respectively according to the road network data corresponding to the p roads comprises: Performing a topological check on the road network data corresponding to the p roads; According to the result of the topology check, topology problem processing is performed on the road network data corresponding to the p roads to obtain corrected road network data; Based on the corrected road network data, buffer zones corresponding to the p roads are established to obtain a first road area.

11. A data processing device, characterized in that: include: An acquiring unit, configured to acquire a first area; A processing unit is used to establish buffer zones corresponding to the p roads respectively according to the road network data corresponding to the p roads, so as to obtain a first road area; the first road area includes the buffer zones corresponding to the p roads respectively, and the road network data corresponding to the p roads includes the positions of the p roads in the first area; The processing unit is further configured to remove a portion corresponding to the first road region from the first region to obtain a plurality of first region units separated by the first road region.

12. A data processing device, characterized in that: The system comprises a memory and a processor, wherein the memory is used to store computer instructions, and the processor is used to call and execute the computer instructions from the memory to implement the method according to any one of claims 1 to 10.

13. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores instructions, and when the instructions are executed on a processor, the method according to any one of claims 1 to 10 is implemented.

14. A computer program product, characterized in that The computer program product comprises instructions, which, when executed on a processor, implement the method according to any one of claims 1 to 10.

Images