Comprehensive grid coordinate arrangement method based on village-in-city grid merging

Abstract

The invention aims to provide a comprehensive grid coordinate arrangement method based on village-in-city grid merging. The method comprises the following steps: acquiring grid coordinate data; determining a junction point and an end point in the adjacent grid coordinate data to form two combined grids; and combining the plurality of grids which are combined in pairs to obtain a new grid. By means of the comprehensive grid merging algorithm, comprehensive grid coordinate arrangement of grid merging of the villages in the city can be achieved, and the structural design of the algorithm enables the application range to be expanded by adjusting logic so as to be applied to different data scenes.

Description

Technical Field

[0001] The present invention relates to the technical field of data processing, and in particular to a comprehensive grid coordinate arrangement method based on urban village grid merging. Background Art

[0002] Coordinate data refers to a type of data that consists of two floating-point values, representing horizontal and vertical coordinates, and grid boundary data is a set of data composed of these coordinate numbers, which can form a polygonal grid. Coordinate data is used to represent the spatial position of a point. In N-dimensional space, as long as a coordinate system is specified, N scalar data can be used to determine the position of any point in space. For example, after establishing a polar coordinate system in a two-dimensional space, that is, a plane, the azimuth and distance of the line connecting any point A in the space and the coordinate origin O can be used to determine the position of point A. Coordinate data can be divided into plane rectangular coordinate data, space rectangular coordinate data, polar coordinate data, spherical coordinate data, cylindrical coordinate data and geographic coordinate data, etc. These classifications are based on different application scenarios and needs and are used to determine the position of ground points on a plane or in space. Coordinate data has a wide range of applications in many fields. For example, in the field of surveying and mapping, the accuracy of coordinate data is directly related to the quality of construction projects and the correctness of urban vision planning. The processing of surveying and mapping data, such as manual input, is not only time-consuming and laborious, but also has a high error rate and requires repeated verification, resulting in a large workload and low efficiency. Therefore, the use of computer software such as CASS and AutoCAD can achieve rapid processing and efficient conversion of coordinate data and improve work efficiency. The main purpose of coordinate data is to determine and describe the position of an object in space, as well as to perform related calculations and analysis. Coordinate data, which defines the position of a point in space or on a plane by providing numerical values, has a wide range of applications. In engineering, coordinates are the basis for the design and manufacture of various machinery, buildings, etc. Through coordinates, practical problems can be converted into mathematical problems and solved using mathematical tools. Coordinate data also plays an important role in fields such as computer science and geographic information systems (GIS). In computer science, coordinates are the basis of fields such as graphical interface design and computer graphics; in GIS, coordinates are the key to describing location information on the earth's surface.

[0003] For multiple grid data, if multiple grids can be merged to form a new grid, the flexibility of grid management will be increased for the comprehensive grid management of urban villages. However, the grid merging problem for urban villages is currently more complicated, and the current algorithm is difficult to cope with the technical problems of irregular grid merging. Summary of the invention

[0004] The purpose of the present invention is to provide a comprehensive grid coordinate arrangement method based on the merging of urban village grids. The method can realize the comprehensive grid coordinate arrangement of urban village grid merging through a comprehensive grid merging algorithm. The structural design of the algorithm enables the application scope to be expanded by adjusting the logic to be applied to different data scenarios.

[0005] A comprehensive grid coordinate arrangement method based on urban village grid merging, comprising: Get grid coordinate data; Determine that the intersection points and the end points in the adjacent grid coordinate data constitute two merged grids; Merge multiple pairwise merged grids to obtain a new grid.

[0006] Preferably, after obtaining the grid coordinate data, the method further includes preprocessing the grid coordinate data, specifically: Select two or more adjacent grid data processing programs; After receiving the request initiated by the client, create a collection to hold the final synthesized grid boundary dataset; Taking any grid as the base, traverse each subsequent grid data backwards; Filter out valid mesh data and remove invalid mesh data.

[0007] Preferably, the step of determining that the intersection points and the end points in the adjacent grid coordinate data form two merged grids comprises: Define the two merged grid data as two grids, and define the intersection point and merge point of the two grids; Extract the same coordinate points in the two grid boundary data and place them in the defined intersection points; In the junction point, the junction start and junction end points are determined.

[0008] Preferably, the step of merging a plurality of meshes that are merged in pairs to obtain a new mesh comprises: Get the intersection starting points and non-repeated points of the grids that are merged two by two; Define a Boolean variable to track whether the coordinate has been processed; Initialize the iterator; When the next element is equal to the end point of the intersection and the Boolean variable is false, it means that the coordinate sequence currently being processed is the one starting from the last intersection point; Traverse the intersection starting point coordinate array until the coordinate corresponding to the current iterator is found, and record the index of the current coordinate in the array; Use an inner loop to traverse from the index of the current coordinate in the array, adjusting the index and a counter so that each coordinate is traversed at least twice; In the loop, whenever a coordinate is accessed, add the coordinate to the merged point set; If the counter is greater than 2 or the adjusted index is out of the array range, jump out of the inner loop.

[0009] Preferably, the step of merging a plurality of grids that are merged in pairs to obtain a new grid further comprises: For non-repeated coordinate points, excluding intersection points, starting points and processed coordinates, they are directly added to the merged point set; Create a new dynamic array, add the contents of the merged point set to the dynamic array, and then add the first coordinate as a closure to form the final new grid boundary coordinate set; The synthesized new grid is analyzed and merged with the subsequent grids to form a new grid until there is no next grid.

[0010] A comprehensive grid coordinate arrangement system based on urban village grid merging, comprising: A grid coordinate acquisition module, used to acquire grid coordinate data; A grid coordinate processing module, used to determine that the intersection points and end points in the adjacent grid coordinate data constitute two merged grids; The grid coordinate merging module is used to merge multiple grids that are merged in pairs to obtain a new grid.

[0011] An electronic device comprises: a processor and a memory, wherein the memory is used to store computer program codes, and the computer program codes include computer instructions. When the processor executes the computer instructions, the electronic device executes a comprehensive grid coordinate arrangement method based on the merging of urban village grids.

[0012] A computer-readable storage medium stores a computer program, wherein the computer program includes program instructions. When the program instructions are executed by a processor of an electronic device, the processor executes a comprehensive grid coordinate arrangement method based on the merging of urban village grids.

[0013] The beneficial effects of the present invention are as follows: 1. The present invention can accurately resolve each coordinate point and calculate the starting point of the intersection between grids, and is also applicable to complex polygonal grids. 2. The present invention uses the characteristics of sets to reduce the time complexity of searches and improve computational efficiency. 3. The present invention focuses on specific data processing tasks (i.e., merging data sets with common boundaries), but its structural design allows the scope of application to be expanded by adjusting the logic and applied to different data types or scenarios. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and, together with the description, serve to explain the principles of the invention. In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor. Figure 1 A flow chart of a comprehensive grid coordinate arrangement method based on urban village grid merging according to the present invention; Figure 2 A diagram for preprocessing grid coordinate data according to the present invention; Figure 3 A schematic diagram of grid boundary coordinate points of the present invention; Figure 4 The figure is a schematic diagram of the hardware structure of an electronic device of the present invention. DETAILED DESCRIPTION

[0015] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0016] It should be noted that all directional indications (such as up, down, left, right, front, back, etc.) in the embodiments of the present invention are only used to explain the relative position relationship, movement status, etc. between the components under a certain specific posture (as shown in the accompanying drawings). If the specific posture changes, the directional indication will also change accordingly.

[0017] In addition, the descriptions of "first", "second", etc. in the present invention are only used for descriptive purposes and cannot be understood as indicating or implying their relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first" and "second" may explicitly or implicitly include at least one of the features. In addition, the technical solutions between the various embodiments can be combined with each other, but they must be based on the ability of ordinary technicians in the field to implement them. When the combination of technical solutions is contradictory or cannot be implemented, it should be deemed that such a combination of technical solutions does not exist and is not within the scope of protection required by the present invention.

[0018] For multiple grid data, if multiple grids can be merged to form a new grid, the flexibility of grid management will be increased for the comprehensive grid management of urban villages. However, the grid merging problem for urban villages is currently more complicated, and the current algorithm is difficult to cope with the technical problems of irregular grid merging.

[0019] The present invention can accurately parse each coordinate point and calculate the starting point of the intersection between grids, and is also applicable to complex polygonal grids. The present invention uses the characteristics of sets to reduce the time complexity of searches and improves computing efficiency. The present invention focuses on specific data processing tasks (i.e., merging data sets with common boundaries), but its structural design allows the scope of application to be expanded by adjusting the logic and applied to different data types or scenarios.

[0020] Example 1 A comprehensive grid coordinate arrangement method based on urban village grid merging, referring to Figure 1 ,include: S100, obtaining grid coordinate data; S200, determining that the intersection points and the end points in the adjacent grid coordinate data constitute two merged grids; S300, merging multiple meshes that are merged in pairs to obtain a new mesh.

[0021] In the management of the comprehensive grid of the urban village, the grid needs to be managed, which involves grid merging, merging multiple grids into a new grid. Therefore, the present invention proposes a comprehensive grid coordinate arrangement method based on the merging of urban village grids. The present invention parses the boundary coordinate data of multiple grids and then merges and arranges them to achieve the functional requirement of integrating multiple grids.

[0022] Preferably, reference Figure 2 After obtaining the grid coordinate data at step S100, the method further includes preprocessing the grid coordinate data at step S110, specifically: S111, selecting two or more adjacent grid data processing programs; Grid data processing program is a software tool used to process and analyze grid data. It supports real-time processing and analysis of data, including real-time refresh, real-time calculation, real-time monitoring, real-time prediction, real-time processing and real-time alarm. These functions enable the grid data processing program to respond immediately when data changes, providing real-time data analysis and processing capabilities.

[0023] S112, after receiving the request initiated by the client, create a collection to contain the final synthesized grid boundary data set; Grid boundary datasets are datasets that contain grid boundary information of geographic space. This kind of dataset usually divides the geographic space into a series of regular grid cells and provides relevant attributes or information for each grid cell. Grid boundary datasets are widely used in geographic information systems (GIS) and related fields, such as urban planning, land use analysis, environmental monitoring, etc. Through these datasets, researchers and decision makers can better understand and analyze the distribution and changes of geographic space.

[0024] S113, taking any grid as a base, traversing each subsequent grid data backwards; S114, filtering out valid mesh data and eliminating invalid mesh data.

[0025] The function of coordinate data filtering is to hide data records that do not need to be displayed and only display data records that meet one or several conditions. ‌Coordinate data filtering searches for data records based on specific conditions and only displays records that meet these conditions, thereby filtering data. This filtering method can help users quickly locate data of interest and improve the efficiency of data processing and analysis. Through filtering, unnecessary data can be removed, data redundancy can be reduced, and data analysis can be made more accurate and efficient. In addition, filtered data is easier to manage and store, which helps to improve the overall efficiency and quality of data processing‌ The client program selects two or more adjacent grid data processing programs. After the algorithm program receives the request initiated by the client, it first creates a collection to contain the final synthesized grid boundary data set, which contains a pair of coordinate string data. Then, based on a certain grid, it traverses each subsequent grid data backwards to perform parsing and merging operations.

[0026] Preferably, S200, determining that the intersection points and the end points in the adjacent grid coordinate data constitute two merged grids includes: Define the two merged grid data as two grids, and define the intersection point and merge point of the two grids; Extract the same coordinate points in the two grid boundary data and place them in the defined intersection points; In the junction point, the junction start and junction end points are determined.

[0027] Before parsing begins, first, define the two merged grid data as two List <string>gridDataA and gridDataB, then define LinkedHashSet <string>The types of junction points, junction Points and merge Points. (A junction point means that the prerequisite for merging two meshes is that there must be two or more non-repeating junction points at the same time, otherwise they cannot be merged into a new polygonal mesh. First, two junction points need to be determined: the junction start point and the junction end point, which represent the first and last coordinate points in the junction point set of the two polygonal meshes; the merge point is the coordinate point after the final merger). Next, the same coordinate points in the boundary data of the two meshes need to be extracted and placed in the above junction Points, and then the junction start and junction end points are determined. (It should be mentioned here that the merged mesh boundary data is ordered and is in the same direction clockwise or counterclockwise, and the closed coordinate data of one coordinate point followed by another coordinate point is drawn through the boundary). Because it is an ordered coordinate, when the current coordinate is a junction point and its next coordinate is not a junction point, it means that the current coordinate is the junction start point and the junction end point.

[0028] like Figure 3 There are many ways to sort the boundary data of grid A. It does not start from a. Let me define it as bcdihab. The boundary data of grid B is idefghi. Then their actual intersection starting point is h, and the intersection end point is d. When traversing grid A, when traversing to h, because it is a junction point and its next coordinate a is not a junction point, h is determined as the junction starting point. When traversing grid B, when traversing to d, because it is a junction point and its next coordinate e is not a junction point, d is determined as the junction end point. At this point, the junction start point and end point are determined, and data analysis is completed here.

[0029] Preferably, S300, merging a plurality of meshes that are merged in pairs to obtain a new mesh comprises: Get the intersection starting points and non-repeated points of the grids that are merged two by two; After determining the starting point of the intersection, the next step is to arrange the grid boundary data and merge it into a new polygonal grid boundary data. Here, the coordinates of the two grid boundary data to be merged, namely gridDataA and gridDataB, need to be filtered, that is, the coordinate points of their intersection points except the starting point are removed. Non-repeated coordinate points and intersection starting points are retained. The two filtered grid data are defined as points1 and points2 respectively. The next step is to merge.

[0030] Define a Boolean variable to track whether the coordinate has been processed; Initialize the iterator; When the next element is equal to the end point of the intersection and the Boolean variable is false, it means that the coordinate sequence currently being processed is the one starting from the last intersection point; Boolean variables are a data type used to represent logical states. They have only two possible values: True and False. Boolean variables are widely used in programming to judge conditions and represent logical states such as the truth or falsity, existence or non-existence of things. ‌Boolean variables have only two values: True and False. In some programming languages, Boolean values ​​can also be converted to numerical values ​​1 and 0 for use when numerical operations are required. ‌Boolean variables are widely used in programming, including but not limited to: Conditional judgment: judge whether the condition is met in control structures such as if statements and while loops. Logical operations: logical operations such as AND, OR, and NOT. ‌For safety reasons, initialize Boolean variables to False. This avoids using variables without initialization, thereby reducing potential errors.

[0031] Traverse the intersection starting point coordinate array until the coordinate corresponding to the current iterator is found, and record the index of the current coordinate in the array; Use an inner loop to traverse from the index of the current coordinate in the array, adjusting the index and a counter so that each coordinate is traversed at least twice; In the loop, whenever a coordinate is accessed, add the coordinate to the merged point set; If the counter is greater than 2 or the adjusted index is out of the array range, jump out of the inner loop.

[0032] Define a Boolean variable isFor: This is a flag used to track whether the points2 array has been processed. Initially it is set to false.

[0033] Initialize iterator: Use the iterator of points1 to start traversal.

[0034] Condition check: When the next element of the iterator is equal to the lastJunctionPoint, that is, the end point of the junction, and isFor is false, a series of operations are performed. This means that the coordinate sequence currently being processed is the sequence starting from the last junction point.

[0035] Processing points2 array: If the above conditions are met, traverse the points2 coordinate array until the coordinate corresponding to the currentIterator is found. Once found, record the index of the coordinate in the array.

[0036] Loop through the points2 array: Use an inner loop to traverse the points2 array starting from index. Make sure that each coordinate is traversed at least twice by adjusting the index j and a counter roll. The purpose of this is to ensure that all coordinates are visited, even if the last coordinate is visited again after the loop ends.

[0037] ‌Adjusting indexes‌ refers to the process of modifying or adjusting the indexes in a database to improve query performance and data access efficiency. An index is a data structure in a database used to improve query performance, similar to the table of contents of a book, which helps the database engine quickly locate the location of stored data, thereby speeding up queries. Indexes are usually created on one or more columns of a table, and can be quickly searched and sorted based on the values ​​of these columns. However, as the database is used and the data changes, the index may need to be adjusted to ensure that it remains valid and optimize query performance. Methods and strategies for adjusting indexes include: Unique index: An index that ensures that the value of the index column is unique in the table, which helps reduce data duplication checks during queries and improve query efficiency. Cross indexes and joint indexes: Optimize queries by combining indexes of multiple columns, especially in scenarios where multi-column joint queries are required. Index Tuning Wizard: A tool that analyzes the workload of query tasks and recommends the best index mix to databases with a large workload to speed up database queries. By adjusting indexes, you can ensure that the performance of the database remains optimal, especially when dealing with large amounts of data and complex queries, which is critical to improving the overall performance and responsiveness of the system.

[0038] A counter is a logic circuit that performs calculations. It is mainly used to count the number of pulses in a digital system to achieve measurement, counting and control functions, and also has a frequency division function. There are many types of counters according to different classification standards, such as: According to the clock pulse input method: it can be divided into synchronous counters and asynchronous counters. According to the carry system: it can be divided into binary counters and non-binary counters. According to the trend of digital increase and decrease during the counting process: it can be divided into add counters, subtract counters and reversible counters. The counter is composed of a basic counting unit and some control gates. The counting unit is composed of a series of various types of triggers with information storage functions. These triggers include RS triggers, T triggers, D triggers and JK triggers.

[0039] Add to mergePoints collection: In the loop, each time a coordinate is accessed, add it to the mergePoints collection. This collection will eventually contain the merged sequence of coordinates.

[0040] Exit condition: If the roll counter is greater than 2 or j exceeds the range of the array, then jump out of the inner loop, because at this time it is guaranteed that each coordinate has been visited at least twice.

[0041] Preferably, S300, merging a plurality of grids that are merged in pairs to obtain a new grid further includes: For non-repeated coordinate points, excluding intersection points, starting points and processed coordinates, they are directly added to the merged point set; Create a new dynamic array, add the contents of the merged point set to the dynamic array, and then add the first coordinate as a closure to form the final new grid boundary coordinate set; The synthesized new grid is analyzed and merged with the subsequent grids to form a new grid until there is no next grid.

[0042] Operation after traversing points1: For other coordinates in points1 (excluding intersection points, starting points and processed coordinates), directly add them to the mergePoints collection.

[0043] Form a new grid: Create a new ArrayList finalData and add the contents of the mergePoints collection to it. Since a closed loop needs to be formed to form a polygon, the first item, i.e. the first coordinate, is added to the end of finalData as a closure to form the final new grid boundary coordinate set.

[0044] Final processing: The synthesized new mesh needs to be analyzed and merged with the subsequent meshes to form a new mesh, until there is no next mesh, at which point all the meshes are merged.

[0045] Example 2 A comprehensive grid coordinate arrangement system based on urban village grid merging, comprising: A grid coordinate acquisition module, used to acquire grid coordinate data; A grid coordinate processing module, used to determine the intersection points and end points in the adjacent grid coordinate data to form two merged grids; The grid coordinate merging module is used to merge multiple grids that are merged in pairs to obtain a new grid.

[0046] Example 3 An electronic device includes: a processor and a memory, the memory is used to store computer program codes, the computer program codes include computer instructions, when the processor executes the computer instructions, the electronic device executes a comprehensive grid coordinate arrangement method based on the merging of urban village grids.

[0047] refer to Figure 4 , the electronic device 2 includes a processor 21, a memory 22, an input device 23, and an output device 24. The processor 21, the memory 22, the input device 23, and the output device 24 are coupled via a connector, and the connector includes various interfaces, transmission lines, or buses, etc., which are not limited in the embodiments of the present invention. It should be understood that in various embodiments of the present invention, coupling refers to mutual connection in a specific manner, including direct connection or indirect connection through other devices, for example, through various interfaces, transmission lines, buses, etc.

[0048] The processor 21 may be one or more graphics processing units (GPUs). When the processor 21 is a GPU, the GPU may be a single-core GPU or a multi-core GPU. Optionally, the processor 21 may be a processor group consisting of multiple GPUs, and the multiple processors are coupled to each other via one or more buses. Optionally, the processor may also be other types of processors, etc., which are not limited in the embodiments of the present invention.

[0049] The memory 22 can be used to store computer program instructions and various computer program codes including program codes for executing the scheme of the present invention. Optionally, the memory includes but is not limited to random access memory (RAM), read-only memory (ROM), erasable programmable read only memory (EPROM), or portable read only memory (CD-ROM), which is used for related instructions and data.

[0050] The input device 23 is used to input data and / or signals, and the output device 24 is used to output data and / or signals. The output device 24 and the input device 23 may be independent devices or an integrated device.

[0051] Example 4 A computer-readable storage medium stores a computer program, wherein the computer program includes program instructions. When the program instructions are executed by a processor of an electronic device, the processor executes a comprehensive grid coordinate arrangement method based on the merging of urban village grids.

[0052] The present invention can accurately parse each coordinate point and calculate the starting point of the intersection between grids, and is also applicable to complex polygonal grids. The present invention uses the characteristics of sets to reduce the time complexity of searches and improves computing efficiency. The present invention focuses on specific data processing tasks (i.e., merging data sets with common boundaries), but its structural design allows the scope of application to be expanded by adjusting the logic and applied to different data types or scenarios.

[0053] The foregoing is merely a specific embodiment of the present invention, which enables those skilled in the art to understand or implement the present invention. Various modifications to these embodiments will be apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present invention. Therefore, the present invention will not be limited to the embodiments shown herein, but rather to the widest scope consistent with the principles and novel features claimed herein.< / string> < / string>

Claims

1. A comprehensive grid coordinate arrangement method based on urban village grid merging, characterized in that: include: Get grid coordinate data; Determine that the intersection points and the end points in the adjacent grid coordinate data constitute two merged grids; Merge multiple pairwise merged grids to obtain a new grid.

2. A comprehensive grid coordinate arrangement method based on urban village grid merging according to claim 1, characterized in that: After obtaining the grid coordinate data, the grid coordinate data is pre-processed, specifically: Select two or more adjacent grid data processing programs; After receiving the request from the client, create a collection to hold the final synthesized grid boundary dataset; Taking any grid as the base, traverse each subsequent grid data backwards; Filter out valid mesh data and remove invalid mesh data.

3. The method for arranging comprehensive grid coordinates based on urban village grid merging according to claim 1, characterized in that: Determining the intersection points and end points in the adjacent grid coordinate data to form two merged grids includes: Define the two merged grid data as two grids, and define the intersection point and merge point of the two grids; Extract the same coordinate points in the two grid boundary data and place them in the defined intersection points; In the junction point, the junction start and junction end points are determined.

4. The method for arranging comprehensive grid coordinates based on urban village grid merging according to claim 1, characterized in that: Merging a plurality of pairwise merged grids to obtain a new grid comprises: Get the intersection starting points and non-repeated points of the two merged grids; Define a Boolean variable to track whether the coordinate has been processed; Initialize the iterator; When the next element is equal to the end point of the intersection and the Boolean variable is false, it means that the coordinate sequence currently being processed is the one starting from the last intersection point; Traverse the intersection starting point coordinate array until the coordinate corresponding to the current iterator is found, and record the index of the current coordinate in the array; Use an inner loop to traverse from the index of the current coordinate in the array, adjusting the index and a counter so that each coordinate is traversed at least twice; In the loop, whenever a coordinate is accessed, add the coordinate to the merged point set; If the counter is greater than 2 or the adjusted index is out of the array range, jump out of the inner loop.

5. The method for arranging comprehensive grid coordinates based on urban village grid merging according to claim 3, characterized in that: The step of merging the plurality of grids merged in pairs to obtain a new grid further comprises: For non-repeated coordinate points, excluding intersection points, starting points and processed coordinates, they are directly added to the merged point set; Create a new dynamic array, add the contents of the merged point set to the dynamic array, and then add the first coordinate as a closure to form the final new grid boundary coordinate set; The synthesized new grid is analyzed and merged with the subsequent grids to form a new grid until there is no next grid.

6. A comprehensive grid coordinate arrangement system based on urban village grid merging, characterized in that: include: A grid coordinate acquisition module is used to obtain grid coordinate data; A grid coordinate processing module, configured to determine that intersection points and end points in adjacent grid coordinate data constitute two merged grids; The grid coordinate merging module is used to merge multiple grids that are merged in pairs to obtain a new grid.

7. An electronic device, characterized in that: include: A processor and a memory, the memory being used to store computer program code, the computer program code including computer instructions, and when the processor executes the computer instructions, the electronic device executes a comprehensive grid coordinate arrangement method based on urban village grid merging as described in any one of claims 1 to 5.

8. A computer-readable storage medium, characterized in that The computer-readable storage medium stores a computer program, which includes program instructions. When the program instructions are executed by a processor of an electronic device, the processor executes the comprehensive grid coordinate arrangement method based on urban village grid merging as described in any one of claims 1 to 5.

Images