Search

CN-121997502-A - Grid boundary adjustment method, device and computer storage medium

CN121997502ACN 121997502 ACN121997502 ACN 121997502ACN-121997502-A

Abstract

The embodiment of the application provides a grid boundary adjustment method, a grid boundary adjustment device and a computer storage medium. The grid number of the grid to be adjusted is determined, a target grid number corresponding to the grid to be adjusted is obtained based on the coverage corresponding relation, the adjacent grid of the current grid to be adjusted is determined based on the target grid number, the vertices to be adjusted of the grid to be adjusted are optimally adjusted based on the relative position relation between the vertices to be adjusted of the grid to be adjusted and the adjacent vertices of the adjacent grid, the grid after adjustment is obtained, and the coverage corresponding relation is updated based on the grid after adjustment. According to the method provided by the embodiment of the application, the boundary adjustment efficiency and reliability are improved.

Inventors

  • JIANG HUIMIN
  • WU BINYI
  • SUN JUNHUI
  • PAN LIWEN
  • JIN HUIWEN

Assignees

  • 中国移动通信集团浙江有限公司
  • 中国移动通信集团有限公司

Dates

Publication Date
20260508
Application Date
20251119

Claims (10)

  1. 1. A method for adjusting a grid boundary, comprising: Dividing squares of a preset area range to obtain bottom squares, determining bottom squares covered by each grid in a plurality of grids to obtain a covering corresponding relation between grid numbers and square numbers, wherein each grid is used for representing a service area, the service area is in the preset area range, and the bottom squares are numbered according to a position sequence; Determining grid numbers of grids to be adjusted, acquiring target grid numbers corresponding to the grids to be adjusted based on the coverage corresponding relation, and determining adjacent grids of the current grids to be adjusted based on the target grid numbers; Optimizing and adjusting the vertexes to be adjusted of the grids to be adjusted based on the relative position relations between the vertexes to be adjusted of the grids to be adjusted and the adjacent vertexes of the adjacent grids to be adjusted to obtain adjusted grids, and updating the corresponding relation of coverage based on the adjusted grids.
  2. 2. The method of claim 1, wherein determining the bottom grid covered by each of the plurality of grids to obtain the coverage correspondence between the grid number and the grid number comprises: For each grid, determining the intersection point of each edge line of the grid and the bottom grid, and determining the common boundary vertex of the grid and the bottom grid from the vertex of the grid and/or the intersection point; starting from each common boundary vertex, taking rays along at least one preset direction, and determining the number of the intersecting points of the rays and the edge lines of the grid; And under the condition that the number of the cross points is odd, adding the bottom square lattice with the common boundary points into a square lattice number set of the bottom square lattice corresponding to the grid, and performing de-duplication based on the square lattice number set to obtain a coverage corresponding relation between the grid number and the square lattice number.
  3. 3. The method of claim 1, wherein the optimally adjusting the vertices of the mesh to be adjusted based on the relative positional relationship between the vertices of the mesh to be adjusted and adjacent vertices of the adjacent mesh comprises: Optimizing and adjusting the vertexes to be adjusted of the grid to be adjusted according to a preset optimizing and adjusting mode based on the relative position relationship between the vertexes to be adjusted of the grid to be adjusted and the adjacent vertexes of the adjacent grid, wherein the preset optimizing and adjusting mode comprises at least one of a close-range vertex replacing mode, a close-range vertical point replacing mode, a close-range vertex adding mode and an intersecting point adding mode; The close-range vertex replacement mode is used for optimally adjusting the vertex to be adjusted based on the vertex to be adjusted and the adjacent vertex; The short-distance vertical point replacement mode is used for optimally adjusting the vertex to be adjusted based on a first vertical point of the vertex to be adjusted on the edge line of the adjacent grid; the close-range vertex adding mode is used for optimally adjusting the vertex to be adjusted based on a second vertical point of the close vertex on the edge line of the grid to be adjusted; the newly added mode of the intersection points is used for optimizing the vertexes to be adjusted based on the intersection points between the grids to be adjusted and the edge lines of the adjacent grids.
  4. 4. A method according to claim 3, wherein the close-range vertex replacement approach comprises: Traversing each vertex to be adjusted of the grid to be adjusted, searching for adjacent vertexes in the adjacent grids, wherein the distance between each adjacent vertex and the vertex to be adjusted is smaller than a preset error threshold value, replacing coordinates of the vertex to be adjusted with the adjacent vertexes, and determining the current adjacent vertexes as overlapping vertexes to obtain an adjusted grid; Screening vertexes to be adjusted of non-overlapped vertexes, determining a first vertical point from the vertexes to an edge line of the adjacent grid and a first vertical distance corresponding to the first vertical point, replacing coordinates of the vertexes to be adjusted with coordinates of the first vertical point under the condition that the first vertical distance is smaller than the preset error threshold, marking the first vertical point as an overlapped vertex in the grid to be adjusted, marking the first vertical point as a temporary vertex in the adjacent grid, and obtaining an adjusted grid; Traversing all adjacent vertexes of the adjacent grids, determining a second vertical point and a second vertical distance between the adjacent vertexes and each edge line corresponding to the grid to be adjusted, and newly adding the adjacent vertexes as initial optimized vertexes of the grid to be adjusted under the condition that the second vertical distance is smaller than a preset error threshold value, and marking the initial optimized vertexes as overlapping vertexes to obtain the grid after adjustment; The new adding mode of the intersecting points comprises the steps of determining all the intersecting points between the grid to be adjusted and the edge lines of all the adjacent grids, adding each intersecting point to be a temporary vertex on the vertex of the grid to be adjusted and the edge line of the adjacent grid, marking the intersecting point as an overlapping vertex, and obtaining the grid after adjustment.
  5. 5. The method of claim 4, further comprising, after said optimizing said vertices of said mesh to be adjusted in accordance with a preset optimization adjustment,: Traversing temporary vertices of the adjacent mesh; And deleting the temporary vertex under the condition that the coordinates of the temporary vertex and any overlapped vertex in the grid to be adjusted are the same.
  6. 6. The method according to claim 1, further comprising, after the optimizing adjustment of the vertices to be adjusted of the mesh to be adjusted based on the relative positional relationship between the vertices to be adjusted of the mesh to be adjusted and the adjacent vertices of the adjacent mesh: for each grid to be adjusted, identifying overlapping vertexes with the same coordinates of the vertexes to be adjusted and the adjacent vertexes; based on the connection sequence of the vertexes to be adjusted, determining each two adjacent overlapped vertexes on the connection sequence corresponding to the vertexes to be adjusted as a replacement judgment group; And for each replacement judgment group, performing a replacement operation based on the overlapped vertexes, wherein the replacement operation represents replacing a first vertex sequence which is positioned between two overlapped vertexes of the replacement judgment group on the grid to be adjusted with a second vertex sequence which is positioned between the two overlapped vertexes on the adjacent grid, and the vertex connection directions of the first vertex sequence and the second vertex sequence are opposite.
  7. 7. The method of claim 6, wherein the performing a replacement operation based on the overlapping vertices comprises: determining the area variation of the grid to be adjusted corresponding to the replacement operation, and determining the edge length of the edge line of the overlapping vertexes of the current replacement judgment group on the grid to be adjusted; and determining a product of the edge length and a preset error threshold as a replacement execution threshold, and executing the replacement operation based on the overlapped vertex when the absolute value of the area variation is smaller than the replacement execution threshold.
  8. 8. The method of claim 1, further comprising, after the updating the overlay correspondence based on the adjusted grid: Adding the grid number corresponding to the adjusted grid to an optimized grid set, acquiring the grid number of the next grid to be adjusted according to the number sequence of the grid number, and determining the adjacent grid of the next grid to be adjusted based on the target grid number and the optimized grid set; And repeatedly executing the steps of optimally adjusting the vertexes to be adjusted of the grids to be adjusted based on the relative position relations between the vertexes to be adjusted of the grids to be adjusted and the adjacent vertexes of the adjacent grids to be adjusted to obtain adjusted grids, and updating the coverage corresponding relations based on the adjusted grids until the grids to be adjusted do not exist.
  9. 9. A grid boundary adjustment device, the device comprising: The covering module is used for dividing a preset area range into squares to obtain bottom squares, determining the bottom squares covered by each grid in the multiple grids to obtain a covering corresponding relation between grid numbers and square numbers, wherein each grid is used for representing a service area, the service area is in the preset area range, and the bottom squares are numbered according to a position sequence; The processing module is used for determining the grid number of the grid to be adjusted, acquiring a target grid number corresponding to the grid to be adjusted based on the coverage corresponding relation, and determining the adjacent grid of the current grid to be adjusted based on the target grid number; the adjusting module is used for optimally adjusting the vertexes to be adjusted of the grids to be adjusted based on the relative position relationship between the vertexes to be adjusted of the grids to be adjusted and the adjacent vertexes of the adjacent grids to be adjusted to obtain adjusted grids, and updating the coverage corresponding relationship based on the adjusted grids.
  10. 10. A computer-readable storage medium, having stored thereon computer program instructions which, when executed by a processor, implement the grid boundary adjustment method of any one of claims 1 to 8.

Description

Grid boundary adjustment method, device and computer storage medium Technical Field The present application relates to the field of data processing technologies, and in particular, to a method and an apparatus for adjusting a grid boundary, and a computer storage medium. Background In the aspects of communication network, city management and the like, a gridding mode is generally adopted to carry out fine management on material resource or service areas, and the gridding management process generally depends on manual boundary division, so that small gaps or small-range cross coverage exists among grids, and inconvenience is brought to the expansion of related services. In the prior art, the grid boundary can be overlapped by adjusting the grid through functions such as boundary adsorption, however, the method is only suitable for static or small-scale grid planning, the dynamic adjustment requirement cannot be met, the complexity of grid adjustment is increased along with the increase of the number of the grids, the adjustment efficiency is low, and the user experience is poor. Disclosure of Invention The embodiment of the application provides a grid boundary adjusting method, a grid boundary adjusting device, grid boundary adjusting equipment and a computer storage medium, which can improve the automation degree, success rate and accuracy of grid boundary superposition adjustment, improve the efficiency of meeting continuous optimization requirements and reduce the dependence degree on manual intervention. In a first aspect, an embodiment of the present application provides a method for adjusting a grid boundary, where the method includes: Dividing squares in a preset area range to obtain bottom squares, determining bottom squares covered by each grid in a plurality of grids to obtain a covering corresponding relation between grid numbers and square numbers, wherein each grid is used for representing a service area, the service area is in the preset area range, and the bottom squares are numbered according to a position sequence; determining grid numbers of grids to be adjusted, acquiring target grid numbers corresponding to the grids to be adjusted based on the coverage corresponding relation, and determining adjacent grids of the current grids to be adjusted based on the target grid numbers; Optimizing and adjusting the vertices to be adjusted of the grids to be adjusted based on the relative position relationship between the vertices to be adjusted of the grids to be adjusted and the adjacent vertices of the adjacent grids to be adjusted to obtain adjusted grids, and updating the coverage corresponding relationship based on the adjusted grids. In a second aspect, an embodiment of the present application provides a mesh boundary adjustment apparatus, including: The covering module is used for dividing squares in a preset area range to obtain bottom squares, determining the bottom squares covered by each grid in the multiple grids to obtain a covering corresponding relation between grid numbers and square numbers, wherein each grid is used for representing a service area, the service area is in the preset area range, and the bottom squares are numbered according to the position sequence; The processing module is used for determining the grid number of the grid to be adjusted, acquiring a target grid number corresponding to the grid to be adjusted based on the coverage corresponding relation, and determining the adjacent grid of the current grid to be adjusted based on the target grid number; The adjusting module is used for optimizing and adjusting the to-be-adjusted vertexes of the to-be-adjusted grids based on the relative position relations between the to-be-adjusted vertexes of the to-be-adjusted grids and the adjacent vertexes of the adjacent grids to obtain adjusted grids, and updating the coverage corresponding relations based on the adjusted grids. In a third aspect, an embodiment of the present application provides a terminal device, where the device includes a processor and a memory storing computer program instructions, and the processor reads and executes the computer program instructions to implement a grid boundary adjustment method as in the first aspect. In a fourth aspect, an embodiment of the present application provides a computer storage medium having stored thereon computer program instructions which, when executed by a processor, implement a grid boundary adjustment method as in the first aspect. In a fifth aspect, embodiments of the present application provide a computer program product comprising a computer program which, when executed by a processor, implements a grid boundary adjustment method as in the first aspect. According to the grid boundary adjusting method, device and computer storage medium, the preset area range can be divided into squares to obtain bottom squares, the bottom squares covered by each grid in the multiple grids are determined to obtain the covering corres