Urban grid region automatic division method, system and device and medium

Abstract

The invention discloses an automatic division method, system, equipment and medium for an urban grid area, aiming at the problems that the traditional grid division is time-consuming and labor-consuming and is easy to make mistakes, and relates to a geographic information technology, and the method comprises the following steps: obtaining geographic information of an urban building and population information corresponding to the building; constructing a graph network based on the geographic information of the urban building and the population information corresponding to the building; and dividing nodes in the graph network by using a 0-1 knapsack algorithm to obtain a plurality of grid regions, so that the population number in the grid regions does not exceed the upper limit of the population number managed by the grid members. According to the invention, the traffic cost and time of grid staff work can be reduced.

Description

TECHNICAL FIELD

[0001] The present application relates to geographic information technology, in particular to an automatic division method, system, device and medium of a city grid area. BACKGROUND

[0002] GIS: Geographic Information System, is an integrated computer system for capturing, storing, processing, analyzing, managing and displaying geospatial data, and information associated with these data.

[0003] Grid member: refers to a person who is full-time or part-time engaged in service management within the grid unit of urban and rural communities.

[0004] Grid area: according to the area of jurisdiction, geographical location, population size, living habits, service management matters and other factors, according to the requirements of "territorial management and clear boundaries, adapting to local conditions, timely adjustment, convenient service management, the basic service management unit is divided, which is convenient for integrating resources and fine management. Each grid area is managed by a full-time grid member.

[0005] In the urban grassroots governance work, the city is divided into grids for management, mainly to cope with the high risk, high mobility and high complexity challenges of modern urban society, by subdividing the administrative jurisdiction into smaller responsibility units (grids), realizing governance resources sinking, responsibility accurate to people, information dynamic collection and service rapid response, so as to eliminate the "blind spot" and "dead angle" in the traditional management mode, and improve the fine level of governance and emergency efficiency. Grid management integrates all elements such as people, land, things, organizations and other elements into grid units, and realizes real-time problem discovery and collaborative disposal with the help of information technology platform, and promotes the governance mode from passive response to active service, for example, in the epidemic prevention, it can quickly block the chain of infection, and in the daily governance, it can accurately connect the needs of residents, and finally realize the goal of "service zero distance, governance full coverage, and response to all appeals".

[0006] Because the administrative area of the city is large, the number of communities and buildings is large, the population and management risk of each community and building are changing, and the upper limit of the population managed by each grid member is adjusted with the situation and policy changes, therefore, the traditional manual grid division method is time-consuming and laborious, and is prone to errors, therefore, an automatic grid division method is needed. SUMMARY

[0007] The present application provides an automatic division method, system, device and medium of a city grid area to overcome the shortcomings of the prior art.

[0008] To achieve the above purpose, the present application adopts the following technical scheme:

[0009] An automatic method for dividing urban grid areas includes the following steps: Obtain the geographical information of urban buildings and the population information corresponding to those buildings; A graph network is constructed based on the geographic information of urban buildings and the population information corresponding to those buildings; The 0-1 knapsack algorithm is used to divide the nodes in the graph network to obtain several grid regions, such that the population in each grid region does not exceed the upper limit of the population that the grid administrator can manage.

[0010] To optimize the above technical solution, the specific measures also include: Furthermore, the geographic information of the urban buildings includes residential communities, each building within a community, and boundary information of each commercial building. The boundary information includes the latitude and longitude information of the vertices and edges of each building.

[0011] Furthermore, the statistical method for the population information is as follows: The permanent residents of residential communities and each building within them are obtained from the household registration system and the permanent resident registration system. The number of people in each commercial building is estimated using building parameters and operational data: number of people in a commercial building = office building area × utilization rate × occupancy rate ÷ office area per person. The adjusted population information is obtained by multiplying the number of people in each building by a weighting coefficient based on the number of people in each community or building involved in safety risks and the number of people in difficulty.

[0012] Furthermore, the construction of the graph network based on the geographic information of urban buildings and the corresponding population information is specifically as follows: If the total number of permanent residents in the community is less than or equal to the maximum number of residents that a grid worker can manage, then the entire community is treated as a node in the graph network. If the total number of permanent residents in the community is greater than the maximum number of residents that a grid worker can manage, then each residential building in the community is treated as a node in the graph network, and each commercial building is treated as a separate node in the graph network. Determine if two nodes are adjacent; if so, establish an edge between the nodes.

[0013] Furthermore, determining whether an adjacency relationship exists between two nodes specifically includes: Step 1: Discretize the nodes at the boundaries of the actual geographical region to generate a candidate endpoint set, the candidate endpoint set for region A. Each point is a point on the boundary of region A. It is the m-th endpoint on the boundary of region A; the set of candidate endpoints of region B. , It is the nth endpoint on the boundary of region B; Step 2: Traverse all endpoint combinations to generate candidate line segments. ; Candidate line segments The two endpoints; Step 3: Create a set of edges for all edges in regions other than region A and region B. Recorded as ; Represents a set E The first in s Use the edge to determine each candidate line segment. With sets If each edge in E intersects with another edge in E, and there exists a candidate line segment that does not intersect with any edge in E, and the length of the candidate line segment is less than the threshold D, then region A and region B are adjacent, meaning that there is an edge between the corresponding nodes of the two regions in the graph network.

[0014] Furthermore, the determination of each candidate line segment With sets Whether each edge in the array intersects is specifically determined as follows: Set endpoints The coordinates are endpoints The coordinates are Then line segment The left boundary is The right boundary is The lower boundary is The upper boundary is ; Let set E The edge in The two endpoints are and Set the endpoints The coordinates are endpoints The coordinates are Then the edge The left boundary is The right boundary is The lower boundary is The upper boundary is ; If any one of the following four conditions is met, then the line segment... and edge Non-intersecting: line segment The right boundary is smaller than the edge The left boundary, or line segment The left boundary is greater than the side. The right boundary, or line segment The upper boundary is smaller than the edge The lower boundary, or line segment The lower boundary is greater than the edge The upper boundary; Further use the cross product of vectors to determine line segments and edge Whether they cross each other, the details are as follows: if( - )×( - )and( - )×( - If all values ​​are less than or equal to 0, then it indicates that the endpoints are... and Online segment If the two sides are collinear or collinear, if ( - )×( - )and( - )×( - If the value is less than or equal to 0, it indicates that the endpoints are... and On the side If the two sides of a line segment are collinear, and the cross product of all four lines is less than 0, then the line segment... and edge intersect.

[0015] Furthermore, the specific steps of using the 0-1 knapsack algorithm to partition the nodes in the graph network are as follows: Starting with node N, located in the top left corner of the city's jurisdiction, treat node N and its adjacent nodes as items. Use the 0-1 knapsack algorithm to divide the city into regions. The weight of each item corresponds to the number of people at each node, and the capacity of the knapsack is the maximum number of people that the grid administrator can manage. Node N must be included in the knapsack; that is, the actual capacity of the knapsack is the difference between the maximum number of people that the grid administrator can manage and the number of people corresponding to node N. If the number of people corresponding to node N and its adjacent nodes is less than the maximum number of people that the grid administrator can manage, then the adjacent nodes of these adjacent nodes are also included in the knapsack algorithm calculation. The nodes included in the result of the knapsack algorithm form a grid region. Then, remove the nodes included in the grid region from the graph network. Starting from the top left corner of the remaining nodes, use the same method to divide the next grid region. Repeat this process to complete the division of all grid regions in the city.

[0016] This invention also proposes an automatic urban grid area division system, comprising: The data acquisition module is used to acquire the geographic information of urban buildings and the population information corresponding to the buildings; The graph network construction module is used to construct graph networks based on the geographic information of urban buildings and the population information corresponding to the buildings. The partitioning module is used to partition the nodes in the graph network using the 0-1 knapsack algorithm to obtain several grid regions, ensuring that the population in each grid region does not exceed the upper limit of the population that the grid administrator can manage.

[0017] The present invention also proposes an electronic device, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, it implements the automatic division method of urban grid areas as described above.

[0018] The present invention also proposes a computer-readable storage medium storing a computer program that enables a computer to execute the automatic urban grid area division method described above.

[0019] The beneficial effects of this invention are: (1) Within the grid, each community or building is adjacent to each other, reducing the transportation costs and time for grid workers.

[0020] (2) The number of grid regions should be as small as possible.

[0021] (3) The upper limit of the number of households or people managed by each grid member and the threshold of the minimum distance between communities or buildings in each grid can be configured.

[0022] (4) The number of managed persons in each community or building can be adjusted according to the safety risks and the number of people in difficulty involved in each community or building, and the workload of each grid member can be adjusted to be roughly the same.

[0023] (5) The method of the present invention has strong scalability and can be extended to marketing scenarios such as physical store site selection. Attached Figure Description

[0024] Figure 1 This is a flowchart of an automatic urban grid area division method proposed in this invention.

[0025] Figure 2 This is a schematic diagram showing that region A and region B are adjacent.

[0026] Figure 3 This is a schematic diagram showing that region A and region B are not adjacent.

[0027] Figure 4This is a schematic diagram showing that region A and region B are not adjacent. Detailed Implementation

[0028] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of this application.

[0029] Example 1 This invention proposes an automatic method for dividing urban grid areas, the process of which is as follows: Figure 1 As shown, it includes the following steps: Obtain geographic information of urban buildings and population information corresponding to the buildings; the geographic information of urban buildings includes residential areas, each building within the area, and boundary information of each commercial building, and the boundary information includes the latitude and longitude information of the vertices and edges of each building.

[0030] The statistical methods for population information are as follows: For the permanent residents of residential communities and each building within them, data is obtained from the household registration system and the permanent resident registration system. For the number of people in each commercial building, one method is to deploy personnel at all entrances to record the number of people entering during peak morning hours (e.g., 8:00–10:00) on weekdays, and then average the data over 3–5 consecutive days. Another method is to estimate using building parameters and operational data: Number of people in a commercial building = Office building area × Utilization rate × Occupancy rate ÷ Office area per person; where office building area is the net area after deducting parking and commercial facilities, which can be estimated by multiplying the property certificate or standard floor area by the number of floors; utilization rate is the percentage after deducting shared areas (lobby, elevator shafts, etc.), typically 65%–75%.

[0031] Based on the number of people at risk of safety hazards and facing difficulties in each community or building, the population of each building is multiplied by a weighting coefficient to obtain adjusted population information. For example, if a residential building has a permanent population of 300, but a large number of people are at risk of safety hazards or facing difficulties, the weighting coefficient can be multiplied by 1.2, meaning the actual number of people managed in that building is considered to be equivalent to 360. This way, the workload of each grid worker can be adjusted to be roughly the same.

[0032] A graph network is constructed based on the geographic information of urban buildings and the population information corresponding to the buildings. If the number of permanent residents in the entire community is less than or equal to the upper limit of the number of people that the grid member can manage, then the entire community is regarded as a node of the graph network. If the number of permanent residents in the entire community is greater than the upper limit of the number of people that the grid member can manage, then each residential building in the community is regarded as a node of the graph network, and each commercial building is regarded as a separate node of the graph network. Determine if two nodes are adjacent; if so, establish an edge between the nodes.

[0033] In this invention, for two regions to be adjacent, the following conditions must be met simultaneously: 1) The geographical regions corresponding to the two nodes are not completely obscured by the geographical regions corresponding to other nodes, i.e., there is at least one line segment connecting the two regions, and the line segment intersects the interior of any other region. 2) The two endpoints of the line segment are on the boundaries of the geographical regions corresponding to the two nodes. 3) The length of the line segment is less than a settable threshold D. Figure 2 In a given context, if there exists a line segment between region A and region B with a length less than the threshold D, and this line segment does not intersect with the interior of the surrounding regions C, D, and E, then region A and region B are considered adjacent. Figure 3 In a given context, if any straight line between region A and region B is occluded by other regions, then region A and region B are considered not adjacent. Figure 4 Although there is a line segment between region A and region B, and this line segment does not intersect with the interior of the surrounding regions C, D and E, the length of the line segment is greater than the threshold D. Therefore, it is considered that region A and region B are not adjacent.

[0034] To quickly determine whether two regions are adjacent and save on algorithm overhead, the circumcircle of each region can be calculated first. The method for determining the circumcircle should be selected based on the region type (e.g., triangle, regular polygon, or irregular polygon). The circumcircles of two regions are then checked for intersection. If they intersect, the two regions are considered adjacent. If the distance between the centers of the two circumcircles is greater than the sum of their radii and a threshold D, the two regions are considered non-adjacent.

[0035] Preferably, determining whether an adjacency relationship exists between two nodes specifically includes: Step 1: Discretize the nodes at the boundaries of the actual geographical region to generate a candidate endpoint set, the candidate endpoint set for region A. Each point is a point on the boundary of region A. It is the m-th endpoint on the boundary of region A; the set of candidate endpoints of region B. , It is the nth endpoint on the boundary of region B; Step 2: Traverse all endpoint combinations to generate candidate line segments. ; Candidate line segments The two endpoints; Step 3: Create a set of edges for all edges in regions other than region A and region B. Recorded as ; Represents a set E The first in s Use the edge to determine each candidate line segment. With sets If each edge in E intersects with another edge in E, and there exists a candidate line segment that does not intersect with any edge in E, and the length of the candidate line segment is less than the threshold D, then region A and region B are adjacent, meaning that there is an edge between the corresponding nodes of the two regions in the graph network.

[0036] Determine each candidate line segment With sets Whether each edge in the array intersects is specifically determined as follows: Set endpoints The coordinates are endpoints The coordinates are Then line segment The left boundary is The right boundary is The lower boundary is The upper boundary is ; Let set E The edge in The two endpoints are and Set the endpoints The coordinates are endpoints The coordinates are Then the edge The left boundary is The right boundary is The lower boundary is The upper boundary is ; If any one of the following four conditions is met, then the line segment... and edge Non-intersecting: line segment The right boundary is smaller than the edge The left boundary, or line segment The left boundary is greater than the side. The right boundary, or line segment The upper boundary is smaller than the edge The lower boundary, or line segment The lower boundary is greater than the edge The upper boundary; Further use the cross product of vectors to determine line segments and edge Whether they cross each other, the details are as follows: if( - )×( - )and( - )×( - If all values ​​are less than or equal to 0, then it indicates that the endpoints are... and Online segment If the two sides are collinear or collinear, if ( - )×( - )and( - )×( - If the value is less than or equal to 0, it indicates that the endpoints are... and On the side If the two sides of a line segment are collinear, and the cross product of all four lines is less than 0, then the line segment... and edge intersect.

[0037] The 0-1 knapsack algorithm is used to partition the nodes in the graph network, resulting in several grid regions. The population within each grid region does not exceed the maximum population that a grid administrator can manage. Specifically, starting with node N, which is located in the top left corner of the city, node N and its adjacent nodes are treated as items. The 0-1 knapsack algorithm is used to partition the city into regions. The weight of the items corresponds to the number of people at each node, and the capacity of the knapsack is the maximum number of people that the grid administrator can manage. Node N must be included in the knapsack; that is, the actual capacity of the knapsack is the difference between the maximum number of people that the grid administrator can manage and the number of people corresponding to node N. If the number of people corresponding to node N and its adjacent nodes is less than the maximum number of people that the grid administrator can manage, then the adjacent nodes of these adjacent nodes are also included in the calculation of the knapsack algorithm. The nodes included in the result of the knapsack algorithm form a grid region. The nodes included in the grid region are then removed from the graph network. Starting from the top left corner of the remaining nodes, the same method is used to partition the next grid region. This process is repeated until all grid regions of the city are partitioned.

[0038] Example 2 This invention proposes an automatic urban grid area division system corresponding to the method in Embodiment 1, comprising: The data acquisition module is used to acquire the geographic information of urban buildings and the population information corresponding to the buildings; The graph network construction module is used to construct graph networks based on the geographic information of urban buildings and the population information corresponding to the buildings. The partitioning module is used to partition the nodes in the graph network using the 0-1 knapsack algorithm to obtain several grid regions, ensuring that the population in each grid region does not exceed the upper limit of the population that the grid administrator can manage.

[0039] The implementation methods of each module and its function in the system are completely consistent with the steps of the method in Implementation Example 1, so they will not be repeated here.

[0040] Example 3 This invention proposes an electronic device, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the automatic division method of urban grid areas as described in Embodiment 1.

[0041] Example 4 The present invention proposes a computer-readable storage medium storing a computer program that causes a computer to execute the automatic division method of urban grid areas as described in Embodiment 1.

[0042] In the embodiments disclosed in this application, a computer storage medium may be a tangible medium that may contain or store programs for use by or in conjunction with an instruction execution system, apparatus, or device. The computer storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. More specific examples of computer storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, and portable compact disc read-only memory (CD). ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0043] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed in this application can be implemented in electronic hardware or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0044] The above are merely preferred embodiments of the present invention. The scope of protection of the present invention is not limited to the above embodiments. All technical solutions falling within the scope of the present invention's concept are within the scope of protection of the present invention. It should be noted that for those skilled in the art, any improvements and modifications made without departing from the principles of the present invention should be considered within the scope of protection of the present invention.

Claims

1. A method for automatic division of urban grid areas, characterized in that, The method comprises the following steps: obtaining geographical information of urban buildings and population information corresponding to the buildings; constructing a graph network based on the geographical information of the urban buildings and the population information corresponding to the buildings; dividing nodes in the graph network using a 0-1 knapsack algorithm to obtain a plurality of grid areas, so that the number of populations in the grid areas does not exceed an upper limit of the number of populations that can be managed by a grid administrator.

2. The method of claim 1, wherein, The geographical information of the urban buildings comprises boundary information of residential communities, each building in the communities, and each commercial building, and the boundary information comprises longitude and latitude information of vertices and edges of each building.

3. The method of claim 1, wherein, The population information is obtained from a household registration system and a resident population registration system for resident populations of the residential communities and each building in the communities, and is estimated for the number of people in each commercial building based on building parameters and operation data: number of people in a commercial building = office building area × usage rate × occupancy rate ÷ per capita office area. A weight coefficient is multiplied by the number of people in each building obtained by statistics according to the safety risks and the number of difficult groups involved in each community or building to obtain adjusted population information. The graph network is constructed based on the geographical information of the urban buildings and the population information corresponding to the buildings, and specifically comprises:

4. The method of claim 1, wherein, if the number of resident populations of the entire community is less than or equal to the upper limit of the number of populations that can be managed by a grid administrator, the entire community is taken as a node of the graph network, and if the number of resident populations of the entire community is greater than the upper limit of the number of populations that can be managed by a grid administrator, each residential building in the community is taken as a node of the graph network, and each commercial building is taken as a separate node of the graph network; whether there is an adjacent relationship between two nodes is judged, and if there is, an edge between the nodes is established. The judgment of whether there is an adjacent relationship between two nodes specifically comprises:

5. The method of claim 4, wherein, The division of the nodes in the graph network using the 0-1 knapsack algorithm specifically comprises: Step 1, discretely sampling the boundary of the actual geographical area of the node to generate a candidate endpoint set, the candidate endpoint set of region A where each point is a point on the boundary of region A, is the mth endpoint on the boundary of region A; the candidate endpoint set of region B is the nth endpoint on the boundary of region B;​ Step 2, iterate through all endpoint combinations, generate candidate line segments ; for the two endpoints of the candidate line segment ; Step 3: Create a set of edges for all edges in regions other than region A and region B. Recorded as ; Represents a set E The first in s Use the edge to determine each candidate line segment. With sets If each edge in E intersects with another edge in E, and there exists a candidate line segment that does not intersect with any edge in E, and the length of the candidate line segment is less than the threshold D, then region A and region B are adjacent, meaning that there is an edge between the corresponding nodes of the two regions in the graph network.

6. The method of claim 5, wherein, The judging whether each candidate line segment intersects with each edge in the set is specifically: Set endpoint with coordinates , endpoint with coordinates , then line segment has left boundary , right boundary , lower boundary , and upper boundary ; Let the two endpoints of the edge in the set E be and , let the coordinates of the endpoint be , and let the coordinates of the endpoint be , then the left boundary of the edge is , the right boundary is , the lower boundary is , and the upper boundary is ; The line segment and the edge are not intersected if any one of the following four conditions is satisfied: line segment the right boundary of the edge is smaller than the left boundary of the edge or a line segment the left border of the edge is greater than the right border of the edge or a line segment the upper boundary of the edge the lower boundary of the edge or a line segment the lower boundary of the edge is greater than the upper boundary of the edge Further use of vector cross product to determine if lines cross and edges each other, as follows: If ( - ) × ( - ) and ( - ) × ( - ) are both less than or equal to 0, then the endpoints and are on opposite sides of or collinear with the line segment , if ( - ) × ( - ) and ( - ) × ( - ) are both less than or equal to 0, then the endpoints and are on opposite sides of or collinear with the edge , and if all four cross products are simultaneously less than 0, then the line segment intersects the edge .

7. The method of claim 1, wherein, starting from a node N at the top left corner of the urban jurisdiction, node N and its adjacent nodes are taken as items, and the 0-1 knapsack algorithm is used to divide the nodes into areas, wherein the weight of the item corresponds to the number of people corresponding to each node, the capacity of the knapsack is the maximum number of people that can be managed by the grid administrator, and node N must be fixed into the knapsack, that is, the actual capacity of the knapsack is the difference between the maximum number of people that can be managed by the grid administrator and the number of people corresponding to node N, if the number of people corresponding to node N and its adjacent nodes is less than the maximum number of people that can be managed by the grid administrator, the adjacent nodes of these adjacent nodes are also taken into the calculation of the knapsack algorithm; the nodes contained in the running result of the knapsack algorithm form a grid area; the nodes included in the grid area are deleted from the graph network, and the same method is used to divide the next grid area starting from the node at the top left corner of the remaining nodes, and the division of all grid areas in the city is completed by iteration. It comprises:

8. An automatic division system of urban grid areas, characterized in that, a data acquisition module for obtaining geographical information of urban buildings and population information corresponding to the buildings; a graph network construction module for constructing a graph network based on the geographical information of the urban buildings and the population information corresponding to the buildings; ​ The division module is used for dividing nodes in the graph network by using a 0-1 knapsack algorithm to obtain a plurality of grid areas, so that the population in the grid area does not exceed the upper limit of the population that can be managed by the grid staff.

9. An electronic device, comprising: The application further provides a computer program product, comprising: The application further provides a computer program product, comprising:

10. A computer readable storage medium storing a computer program, characterized in that, The application further provides a computer program product, comprising:

Images