Map interest point aggregation method, electronic equipment and computer program product

Abstract

The invention discloses a map interest point aggregation method, electronic equipment and a computer program product, and relates to the technical field of geographic information service, the map interest point aggregation method comprises the following steps: obtaining map interest point data, a digital elevation model and three-dimensional grid data of a target area, the map interest point data comprises a two-dimensional coordinate of a map interest point, and the three-dimensional grid data comprises grid data of a three-dimensional grid corresponding to a target area in a Beidou grid code coding system under a target grid level; determining a three-dimensional coordinate of the map interest point through the two-dimensional coordinate and a digital elevation model; determining a three-dimensional position relationship between the map interest point and the three-dimensional grid according to the three-dimensional coordinates; based on the three-dimensional position relation, the map interest points are aggregated, and three-dimensional aggregation point data of the target area under the target grid hierarchy are obtained. According to the method, multi-level and multi-precision map interest point aggregation of a unified grid can be realized.

Description

Technical Field

[0001] The present application relates to the field of geographic information service technology, and in particular to a map interest point aggregation method, an electronic device, and a computer program product. Background Art

[0002] In the field of geographic information systems and location-based services, the grid algorithm is a commonly used map POI aggregation method, which can effectively organize and process a large amount of map POI data by dividing the geographic space into a series of grid cells.

[0003] However, existing grid algorithms face some challenges when processing multi-source heterogeneous data: Inconsistent grid levels and sizes: Different data sources often require the creation of grids of different levels and sizes, which leads to incompatibility between grids and increases the difficulty of data integration and analysis.

[0004] Limitations of fixed grid size: Fixed-size grids are inefficient when dealing with datasets of varying densities. For example, in areas with dense map interest points, smaller grids may not be enough to capture enough details, while in areas with sparse map interest points, larger grids may result in a waste of resources. Summary of the invention

[0005] The main purpose of the present application is to provide a method for aggregating map points of interest, an electronic device and a computer program product, aiming to solve the technical problem that the application of grid algorithms in the aggregation of map points of interest is relatively limited.

[0006] To achieve the above objectives, the present application provides a method for aggregating points of interest on a map, comprising: Acquire map point of interest data, digital elevation model and three-dimensional grid data of the target area, wherein the map point of interest data includes two-dimensional coordinates of the map point of interest, the three-dimensional grid data includes grid data of a three-dimensional grid corresponding to the target area in the Beidou grid code encoding system at the target grid level, and the map point of interest and the three-dimensional grid are in the same coordinate system; Determining the three-dimensional coordinates of the map point of interest by using the two-dimensional coordinates and the digital elevation model; Determining a three-dimensional positional relationship between the map interest point and the three-dimensional grid according to the three-dimensional coordinates; Based on the three-dimensional position relationship, the map interest points are aggregated to obtain three-dimensional aggregation point data of the target area under the target grid level, wherein the three-dimensional aggregation point data includes the coordinates of the three-dimensional aggregation points and the number of map interest points aggregated, and there is a corresponding relationship between the three-dimensional aggregation points and the three-dimensional grid.

[0007] In one embodiment, the digital elevation model is a grid digital elevation model, and the step of determining the three-dimensional coordinates of the map interest point through the two-dimensional coordinates and the digital elevation model includes: Determining, from the grid digital elevation model, a target grid cell matching the map point of interest according to the two-dimensional coordinates; The elevation value of the target grid cell is used as the elevation value of the map interest point, and combined with the two-dimensional coordinates to generate the three-dimensional coordinates of the map interest point.

[0008] In one embodiment, the digital elevation model is a vector digital elevation model, and the step of determining the three-dimensional coordinates of the map interest point by using the two-dimensional coordinates and the digital elevation model comprises: Determining, from the vector digital elevation model, a target contour line matching the map point of interest according to the two-dimensional coordinates; The elevation value of the map interest point is calculated based on the elevation value of the target contour line and the distance between the target contour line and the map interest point, and the three-dimensional coordinates of the map interest point are generated in combination with the two-dimensional coordinates.

[0009] In one embodiment, the step of obtaining map point of interest data, digital elevation model and three-dimensional grid data of the target area includes: Obtain original map point of interest data, digital elevation model and 3D grid data of the target area; The original map point of interest data is preprocessed to obtain the map point of interest data of the target area, wherein the preprocessing includes data cleaning, data standardization and coordinate system conversion, and the coordinate system conversion is used to make the map point of interest and the three-dimensional grid in the same coordinate system.

[0010] In one embodiment, the method further comprises: Visualizing the three-dimensional aggregation point according to the coordinates of the three-dimensional aggregation point and the number of map interest points, wherein the more the number of map interest points of the three-dimensional aggregation point is at the same grid level, the larger the visualization icon of the three-dimensional aggregation point is when the three-dimensional aggregation point is visualized; The three-dimensional grid is visualized according to the coordinates of the three-dimensional aggregation points and the number of map interest points. The more the number of map interest points corresponding to the three-dimensional aggregation points of the three-dimensional grid at the same grid level is, the darker the visualization color of the three-dimensional grid is when the three-dimensional grid is visualized.

[0011] In one embodiment, the grid data includes a Beidou grid code, and the step of determining the three-dimensional positional relationship between the map point of interest and the three-dimensional grid according to the three-dimensional coordinates includes: Decode the Beidou grid code of each three-dimensional grid to obtain the three-dimensional coordinate range corresponding to each three-dimensional grid; According to the three-dimensional coordinates of each map interest point and the three-dimensional coordinate range corresponding to each three-dimensional grid, the attribution relationship between each map interest point and each three-dimensional grid is determined respectively, and the attribution relationship is determined as the three-dimensional position relationship between the map interest point and the three-dimensional grid.

[0012] In one embodiment, the grid data includes a Beidou grid code, and the step of determining the three-dimensional positional relationship between the map point of interest and the three-dimensional grid according to the three-dimensional coordinates includes: Encoding the three-dimensional coordinates of each map interest point according to the target grid level to obtain the Beidou grid code corresponding to each map interest point at the target grid level; According to the Beidou grid code of each three-dimensional grid and the Beidou grid code corresponding to each map point of interest at the target grid level, the attribution relationship between each map point of interest and each three-dimensional grid is determined respectively, and the attribution relationship is determined as the three-dimensional position relationship between the map point of interest and the three-dimensional grid.

[0013] In one embodiment, the coordinates of the three-dimensional aggregation point are the centroid coordinates of the three-dimensional grid to which the three-dimensional aggregation point belongs, or are the geometric median coordinates of each three-dimensional aggregation point in the three-dimensional grid to which the three-dimensional aggregation point belongs.

[0014] In addition, to achieve the above-mentioned purpose, the present application also provides an electronic device, which includes: a memory, a processor, and a map point of interest aggregation program stored on the memory and executable on the processor, and the map point of interest aggregation program, when executed by the processor, implements the steps of the map point of interest aggregation method as described above.

[0015] In addition, to achieve the above-mentioned purpose, the present application also provides a computer program product, including a computer program, which implements the steps of the above-mentioned map interest point aggregation method when executed by a processor.

[0016] The present application provides a method for aggregating map points of interest, an electronic device and a computer program product. The technical solution of the present application is to first obtain map point of interest data, a digital elevation model and three-dimensional grid data of a target area, wherein the map point of interest data includes two-dimensional coordinates of the map point of interest, and the three-dimensional grid data includes grid data of a three-dimensional grid corresponding to the target area at a target grid level in a Beidou grid code encoding system, and the map point of interest and the three-dimensional grid are in the same coordinate system, and then the three-dimensional coordinates of the map point of interest are determined by the two-dimensional coordinates and the digital elevation model, and then the three-dimensional positional relationship between the map point of interest and the three-dimensional grid is determined according to the three-dimensional coordinates, and finally, based on the three-dimensional positional relationship, the map point of interest is aggregated to obtain three-dimensional aggregation point data of the target area at the target grid level, wherein the three-dimensional aggregation point data includes the coordinates of the three-dimensional aggregation point and the number of map point of interest aggregation, and the three-dimensional aggregation point has a corresponding relationship with the three-dimensional grid, so that the present application can realize multi-level and multi-precision map point of interest aggregation of a unified grid to solve the technical problem that the grid algorithm has large limitations in the application of map point of interest aggregation. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0018] In order to more clearly illustrate the embodiments of the present application 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, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on the structures shown in these drawings without paying any creative work.

[0019] Figure 1 This is a flow chart of a method for aggregating points of interest on a map according to an embodiment of the present application; Figure 2 This is a schematic diagram of the first process of determining three-dimensional coordinates in an embodiment of the present application; Figure 3 This is a schematic diagram of a second process for determining three-dimensional coordinates in an embodiment of the present application; Figure 4 A schematic diagram of a process for determining a three-dimensional position relationship in an embodiment of the present application; Figure 5 Schematic diagram of the device structure of the hardware operating environment involved in the map interest point aggregation method in the embodiment of the present application.

[0020] The purpose, features and advantages of this application will be further described in conjunction with the embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION

[0021] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with the present application. Instead, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.

[0022] It should be understood that the specific embodiments described herein are only used to explain the technical solutions of the present application and are not used to limit the present application.

[0023] Currently, grid algorithms have great limitations in the application of map point of interest aggregation.

[0024] The main solution of the embodiment of the present application is: obtaining map point of interest data, digital elevation model and three-dimensional grid data of the target area, wherein the map point of interest data includes the two-dimensional coordinates of the map point of interest, and the three-dimensional grid data includes the grid data of the three-dimensional grid corresponding to the target area in the Beidou grid code coding system at the target grid level, and the map point of interest and the three-dimensional grid are in the same coordinate system; determining the three-dimensional coordinates of the map point of interest through the two-dimensional coordinates and the digital elevation model; determining the three-dimensional position relationship between the map point of interest and the three-dimensional grid according to the three-dimensional coordinates; based on the three-dimensional position relationship, aggregating the map point of interest to obtain the three-dimensional aggregation point data of the target area at the target grid level, wherein the three-dimensional aggregation point data includes the coordinates of the three-dimensional aggregation point and the number of map point of interest aggregations, and there is a corresponding relationship between the three-dimensional aggregation point and the three-dimensional grid.

[0025] The embodiments of the present application can realize multi-level and multi-precision aggregation of map points of interest in a unified grid, so as to solve the technical problem that the grid algorithm has great limitations in the application of aggregation of map points of interest.

[0026] It should be noted that the execution subject of the embodiments of the present application is an electronic device, which may include but is not limited to mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions), PMPs (Portable Media Players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs (Televisions), desktop computers, etc., or any electronic device that can achieve the above functions, and the embodiments of the present application do not specifically limit this. The following uses electronic devices as the execution subject as an example to illustrate the following embodiments of the present application.

[0027] In order to better understand the technical solution of the present application, a detailed description will be given below in conjunction with the accompanying drawings and specific implementation methods.

[0028] Please refer to Figure 1 , Figure 1 Schematic diagram of the process of aggregating points of interest on a map in an embodiment of the present application.

[0029] In this embodiment, the map interest point aggregation method includes steps S100 to S300: Step S100, obtaining map point of interest data, digital elevation model and three-dimensional grid data of the target area, wherein the map point of interest data includes the two-dimensional coordinates of the map point of interest, the three-dimensional grid data includes the grid data of the three-dimensional grid corresponding to the target area in the Beidou grid code coding system under the target grid level, and the map point of interest and the three-dimensional grid are in the same coordinate system.

[0030] It should be noted that the target area refers to the geographical area where map points of interest need to be aggregated, which can be a city, a village or any spatial range with clear boundaries. Map points of interest refer to places or facilities on the map that have specific geographical significance, or have certain practical value or significance to users, such as buildings, parks, restaurants, etc. Map point of interest data refers to the attribute information of map points of interest, usually including the name, type, location (i.e., two-dimensional coordinates) of the map points of interest. An elevation model is a digital model of ground elevation information, which is used to provide height information of the terrain surface. A three-dimensional grid refers to dividing a given geographic space into multiple three-dimensional space units according to certain rules, and each three-dimensional space unit is called a three-dimensional grid. A three-dimensional grid is not limited to horizontal plane divisions, but also includes divisions in the vertical direction. Each three-dimensional grid has clear boundaries and height ranges, and has a unique identifier or code. Three-dimensional grid data refers to the grid data of a three-dimensional grid, usually including the code, boundaries, height, center point coordinates, volume, etc. of the three-dimensional grid. The target grid level refers to the grid level selected when aggregating map points of interest in the target area. Different grid levels represent different grid sizes and densities. A lower level means a larger grid size, which means that the same space is divided into fewer grids, while a higher level means a smaller grid size, which means that the same space is divided into more grids.

[0031] Those skilled in the art will know that the Beidou grid code system is a coding system for uniquely identifying grids. It is based on the geographic reference framework of the Beidou satellite navigation system and can accurately determine the location of each grid. The Beidou grid code system identifies each grid through a unique code (also called the Beidou grid code) to facilitate data retrieval and management.

[0032] In this embodiment, one or more grid levels can be selected as the target grid level from the multiple grid levels provided by the Beidou grid code encoding system according to actual needs, and then the grid data of the three-dimensional grid corresponding to the target area under the target grid level in the Beidou grid code system is obtained, that is, the three-dimensional grid data in this embodiment adopts the unified standard of the Beidou grid code system, which means that the three-dimensional grids are all in the same coordinate system, and their sizes, shapes and heights are the same under the same grid level, and they are all uniquely identified by a unique Beidou grid code. There is no overlap or gap between them, and the target area can be completely covered, thereby laying a solid foundation for the application of grid algorithms in map interest point aggregation, ensuring that when performing map interest point aggregation, the three-dimensional grid data of the Beidou grid code encoding system can be used to achieve accurate aggregation to avoid overlap and omission, and effectively solve the problem that the existing grid algorithm creates grids of different levels and sizes due to different data sources in the application of map interest point aggregation, resulting in incompatibility between grids and high difficulty in data integration and analysis. At the same time, there is no limitation of fixed grid size, and different grid levels can be flexibly selected as target grid levels for map interest point aggregation according to actual needs.

[0033] It is worth mentioning that this embodiment can first obtain the three-dimensional grid data of the target grid level divided in the Beidou grid code coding system, and then use the spatial extraction and analysis technology to extract and filter the three-dimensional grid data within the target area, thereby obtaining the three-dimensional grid data of the target area. It can also use the Beidou grid code coding system to generate a three-dimensional grid within the target area according to the requirements of the target grid level, thereby obtaining the three-dimensional grid data of the target area.

[0034] This embodiment downloads the digital elevation model of the target area from the National Geographic Information Public Service Platform or other official channels, and ensures that the resolution of the digital elevation model meets the requirements, that is, matches the target grid level. If necessary, the downloaded digital elevation model can be preprocessed, such as cropping, splicing or resampling, so that it matches the boundary of the target area, thereby obtaining a digital elevation model of the target area.

[0035] This embodiment can obtain data of all map points of interest in the target area, including name, type, two-dimensional coordinates and other information, from authoritative data sources (such as public databases, commercial data providers, etc.) through GIS (Geographic Information System) software or online service interfaces, and then pre-process the obtained information, including data quality assessment, data cleaning, data standardization, coordinate system identification, etc., so that the map points of interest and the three-dimensional grid are finally in the same coordinate system, that is, both use the coordinate system of the Beidou grid code encoding system, so as to obtain the map point of interest data of the target area.

[0036] For example, in a feasible implementation, the step of obtaining map point of interest data, digital elevation model and three-dimensional grid data of the target area includes steps S110 to S120: S110, obtaining original map point of interest data, digital elevation model and three-dimensional grid data of the target area; It should be noted that, in this embodiment, the original map POI data refers to unprocessed map POI data directly obtained from the data source, which may have problems such as duplication, missing, error, different format, different coordinate system, etc.

[0037] S120, preprocessing the original map point of interest data to obtain map point of interest data of the target area, wherein the preprocessing includes data cleaning, data standardization and coordinate system conversion, and the coordinate system conversion is used to make the map point of interest and the three-dimensional grid in the same coordinate system.

[0038] This embodiment first obtains the original data of all map points of interest in the target area from public data sets, commercial service providers and other channels, that is, the original map point of interest data, and then pre-processes it, checks the outliers, duplicates and missing values ​​in the original map point of interest data, and performs corresponding data cleaning to reduce the noise in the data and improve the accuracy of subsequent analysis. Then, the data format and unit are unified, the data is standardized, and all are converted to the target coordinate system to complete the coordinate system 1, and the map point of interest data of the target area is obtained, and the compatibility between data and the accuracy of subsequent processing are ensured, which provides a basis for subsequent spatial analysis and aggregation. Among them, the target coordinate system is the coordinate system adopted by the Beidou grid code encoding system, that is, the coordinate system where the three-dimensional grid is located.

[0039] It is not difficult to understand that since the map interest points lack height information, after the map interest points are uniformly converted to the target coordinate system, the values ​​corresponding to the heights are temporarily defaulted, and are supplemented by digital elevation models in subsequent steps, thereby truly completing the unification of the coordinate system.

[0040] The map point of interest data, digital elevation model and three-dimensional grid data obtained in this embodiment together constitute the spatial information basis of the target area, providing comprehensive data support for subsequent spatial analysis and aggregation of map points of interest, and all input data are in the same coordinate system, ensuring the compatibility between data and the accuracy of subsequent processing. The digital elevation model can also provide height information for map points of interest, thereby realizing the spatial conversion from two-dimensional to three-dimensional, and enhancing the practicality of spatial data. The use of three-dimensional grid data makes the management of map points of interest more orderly, facilitates the three-dimensional aggregation processing of map points of interest in subsequent steps, and reduces the computational complexity.

[0041] Step S200, determining the three-dimensional coordinates of the map interest point through the two-dimensional coordinates and the digital elevation model; This embodiment matches the two-dimensional coordinates of each map point of interest with the corresponding position in the digital elevation model, thereby finding the elevation value of the two-dimensional coordinate on the digital elevation model as the height information of the map point of interest, and then combining with the two-dimensional coordinates to obtain the three-dimensional coordinates of the map point of interest, truly realizing the coordinate system between the map point of interest and the three-dimensional grid.

[0042] For example, Figure 2 As shown, in a first feasible implementation manner, the digital elevation model is a grid digital elevation model, and the step of determining the three-dimensional coordinates of the map interest point by using the two-dimensional coordinates and the digital elevation model may include steps S210 to S220: Step S210, determining a target grid cell matching the map interest point from the grid digital elevation model according to the two-dimensional coordinates; Step S220: Using the elevation value of the target grid cell as the elevation value of the map interest point, and combining the two-dimensional coordinates to generate the three-dimensional coordinates of the map interest point.

[0043] Those skilled in the art will know that digital elevation models have two formats: raster format and vector format. Among them, the digital elevation model in raster format is also called a raster digital elevation model, which stores terrain information in a matrix composed of regularly arranged pixels (grids, also called grid cells), and each pixel has a numerical value corresponding to the terrain height, that is, the elevation value.

[0044] This embodiment can use spatial overlay analysis technology based on the two-dimensional coordinates of the map point of interest to determine the grid unit that matches the map point of interest from the grid digital elevation model as the target grid unit, thereby using the elevation value of the target grid unit as the elevation value of the map point of interest, and combining the two-dimensional coordinates of the map point of interest to generate the three-dimensional coordinates of the map point of interest.

[0045] It is not difficult to understand that the grid unit in the raster digital elevation model is similar to a three-dimensional grid, and also has information such as center point coordinates, boundaries and heights. The raster digital elevation model in this embodiment also adopts the coordinate system of the Beidou grid code coding system, that is, the grid unit and the map interest point are in the same coordinate system, so the two-dimensional coordinates of the map interest point can be directly used to determine in which grid unit the map interest point is located, and then use it as the target grid unit that matches the map interest point.

[0046] This implementation is based on the terrain height information (i.e., elevation value) provided by the raster digital elevation model. By combining the two-dimensional coordinates of the map interest points with the corresponding elevation values, the conversion from two-dimensional to three-dimensional space is achieved, the dimension of the map interest point data is increased, the practicality and application scope of the data are improved, and the implementation is simple and easy. The coordinate conversion can be completed with simple mathematical operations, and it is easy to implement with computer programs.

[0047] In addition to the above methods, interpolation method can also be used to perform interpolation calculations based on the elevation values ​​of multiple grid cells around the map interest point (that is, the multiple grid cells closest to the map interest point) to obtain the elevation value of the map interest point, thereby further improving the accuracy of the elevation value of the map interest point.

[0048] For example, Figure 3 As shown, in a second feasible implementation manner, the digital elevation model is a vector digital elevation model, and the step of determining the three-dimensional coordinates of the map interest point by using the two-dimensional coordinates and the digital elevation model may include steps S230 to S240: Step S230, determining a target contour line matching the map interest point from the vector digital elevation model according to the two-dimensional coordinates; Step S240, calculating the elevation value of the map interest point according to the elevation value of the target contour line and the distance between the target contour line and the map interest point, and generating the three-dimensional coordinates of the map interest point in combination with the two-dimensional coordinates.

[0049] It should be noted that the vector digital elevation model is a digital elevation model in vector format, which represents the undulation of terrain through a series of contour lines (that is, continuous curves with the same elevation values).

[0050] This implementation can determine the contour line that matches the map interest point from the raster digital elevation model based on the two-dimensional coordinates of the map interest point, as the target contour line, and then interpolate and calculate the elevation value of the map interest point based on the elevation value of the target contour line and the distance between the target contour line and the map interest point, and generate the three-dimensional coordinates of the map interest point in combination with the two-dimensional coordinates of the map interest point.

[0051] It is not difficult to understand that the vector digital elevation model also uses the coordinate system of the Beidou grid code coding system, that is, the contour lines and the map interest points are in the same coordinate system, so that the two-dimensional coordinates of the map interest points can be directly used to determine on which contour line the map interest point is located, or between which two adjacent contour lines it is located. Then, when the map interest point is located on a certain contour line, it is used as the target contour line matching the map interest point, and the elevation value of the target contour line is used as the elevation value of the map interest point. Or when the map interest point is located between two adjacent contour lines, it is used as the target contour line matching the map interest point, and according to the distance between the map interest point and the two adjacent target contour lines, and the elevation values ​​of the two adjacent target contour lines, the elevation value of the map interest point is calculated by the interpolation method.

[0052] This implementation is based on the contour information provided by the vector digital elevation model, by calculating the relationship between the map interest point and the target contour line, using the interpolation method to determine the actual height (i.e., elevation value) of the map interest point, and by combining the two-dimensional coordinates of the map interest point with the corresponding elevation value, thereby realizing the conversion from two-dimensional to three-dimensional space, increasing the dimension of the map interest point data, and improving the practicality and application scope of the data. And because the contour line can represent more complex terrain features, compared with the first feasible implementation method mentioned above, this implementation is suitable for more complex terrain changes.

[0053] This embodiment gives the map interest points height information through the digital elevation model, making the location description of the map interest points more accurate, which is conducive to subsequent spatial analysis and visualization. The constructed three-dimensional coordinates provide the necessary data support for the subsequent three-dimensional aggregation of map interest points.

[0054] Step S300, determining a three-dimensional positional relationship between the map interest point and the three-dimensional grid according to the three-dimensional coordinates; It should be noted that, in this embodiment, the three-dimensional positional relationship between the map interest point and the three-dimensional grid refers to the position of the map interest point relative to the three-dimensional grid, including which grid it is located in and its relationship with the grid boundary.

[0055] This embodiment can determine, based on the three-dimensional coordinates of the map interest points, for each grid level in the target grid level, which three-dimensional grid each map interest point belongs to, and record the three-dimensional positional relationship between the map interest points and the three-dimensional grids to which they belong through indexes or association lists.

[0056] That is, for each grid level in the target grid level, based on the center point coordinates, boundaries and height of the three-dimensional grid at the grid level and the three-dimensional coordinates of the map point of interest, it is analyzed in which three-dimensional grid the map point of interest falls and at which position within the three-dimensional grid it falls, thereby obtaining the three-dimensional position relationship between the map point of interest and the three-dimensional grid.

[0057] This embodiment can effectively manage and query map interest point data by clarifying the three-dimensional position relationship between the map interest points and the three-dimensional grid, which facilitates subsequent aggregation processing.

[0058] In a feasible implementation manner, the grid data includes a Beidou grid code, and step S300 may include steps S310 to S320: Step S310, decoding the Beidou grid code of each three-dimensional grid to obtain the three-dimensional coordinate range corresponding to each three-dimensional grid; Step S320, according to the three-dimensional coordinates of each map interest point and the three-dimensional coordinate range corresponding to each three-dimensional grid, determine the attribution relationship between each map interest point and each three-dimensional grid, and determine the attribution relationship as the three-dimensional position relationship between the map interest point and the three-dimensional grid.

[0059] In this embodiment, the Beidou grid code of the three-dimensional grid can be decoded to obtain the three-dimensional coordinate range corresponding to each three-dimensional grid, so that the map interest points whose three-dimensional coordinates are within the three-dimensional coordinate range corresponding to the three-dimensional grid are determined to belong to the three-dimensional grid, and then the attribution relationship between each map interest point and each three-dimensional grid is determined, and the attribution relationship is used as the three-dimensional position relationship between the map interest point and the three-dimensional grid.

[0060] It should be noted that in this embodiment, the three-dimensional coordinate ranges corresponding to different three-dimensional grids at the same grid level do not overlap and there are no gaps, so as to avoid the inability to determine the ownership of map interest points located on the boundaries of adjacent grids.

[0061] In another feasible implementation manner, the grid data includes a Beidou grid code, and step S300 may further include steps S330 to S340: Step S330, encoding the three-dimensional coordinates of each map interest point according to the target grid level to obtain the Beidou grid code corresponding to each map interest point at the target grid level; Step S340, according to the Beidou grid code of each three-dimensional grid and the Beidou grid code corresponding to each map interest point at the target grid level, determine the attribution relationship between each map interest point and each three-dimensional grid respectively, and determine the attribution relationship as the three-dimensional position relationship between the map interest point and the three-dimensional grid.

[0062] In this embodiment, the three-dimensional coordinates of the map interest points can also be encoded at the target grid level to obtain the Beidou grid code corresponding to each map interest point at the target grid level, so that the map interest point can be determined to belong to the three-dimensional grid corresponding to its Beidou grid code, and then the attribution relationship between each map interest point and each three-dimensional grid can be determined, and the attribution relationship can be used as the three-dimensional position relationship between the map interest point and the three-dimensional grid.

[0063] Step S400, based on the three-dimensional position relationship, the map interest points are aggregated to obtain three-dimensional aggregation point data of the target area under the target grid level, wherein the three-dimensional aggregation point data includes the coordinates of the three-dimensional aggregation points and the number of map interest points aggregated, and the three-dimensional aggregation points have a corresponding relationship with the three-dimensional grid.

[0064] It should be noted that a 3D aggregation point refers to a point obtained by aggregating multiple map interest points located in the same 3D grid. 3D aggregation point data refers to the attribute information of the 3D aggregation point, including the coordinates, type, number of map interest points, Beidou grid code of the 3D grid to which it belongs, etc. Among them, the number of map interest points refers to the number of map interest points aggregated when the 3D aggregation point is aggregated, which means how many map interest points are aggregated to obtain the 3D aggregation point.

[0065] In this embodiment, the coordinates of the three-dimensional aggregation point are the centroid coordinates of the three-dimensional grid to which the three-dimensional aggregation point belongs, or are the geometric median coordinates of each three-dimensional aggregation point in the three-dimensional grid to which the three-dimensional aggregation point belongs.

[0066] Those skilled in the art will know that the center of mass refers to the average position of the mass distribution of an object (or a system composed of multiple objects), and the geometric median refers to the point with the smallest sum of distances to all points.

[0067] In this embodiment, the centroid coordinates refer to the coordinates of the centroid, and the geometric median coordinates refer to the coordinates of the geometric median.

[0068] In this embodiment, the coordinates of the three-dimensional aggregation point may be the centroid coordinates of the three-dimensional grid, or may be the geometric median coordinates of each map interest point in the three-dimensional grid to which it belongs, and this embodiment does not specifically limit this.

[0069] When the coordinates of the three-dimensional aggregation points are taken as the centroid coordinates, the computational complexity of the map interest point aggregation processing can be greatly simplified. When the geometric median coordinates are taken, although the computational complexity is a little larger, it is still much lower than the map interest point aggregation based on the distance algorithm, and can reflect the center position of each map interest point in the three-dimensional grid.

[0070] It should be noted that when there is more than one type of map points of interest, the map points of interest can be aggregated by type. At this time, the three-dimensional aggregation point refers to a point representing all map points of interest of the specified type in the same three-dimensional grid by aggregating the map points of interest of the specified type located in the same three-dimensional grid. Therefore, one three-dimensional grid can be aggregated to obtain multiple three-dimensional aggregation points of different types. That is, the correspondence between the three-dimensional grid and the three-dimensional aggregation point is one-to-many.

[0071] In addition, map points of interest can be aggregated according to three-dimensional grids, and multiple types of map points of interest can be aggregated into the same three-dimensional aggregation point. At this time, the types of the three-dimensional aggregation point are complex, such as restaurant type + park type, and library type + school type + residential area type. At the same time, the number of map points of interest aggregated will be subdivided into the number of aggregations of each type of map points of interest, and the total number of aggregations. That is, at this time, the correspondence between the three-dimensional grid and the three-dimensional aggregation point is one-to-one.

[0072] It is not difficult to understand that the present embodiment aggregates map interest points based on three-dimensional grids, that is, map interest points belonging to the same three-dimensional grid are aggregated according to the aggregation method (e.g., aggregation by type, aggregation by three-dimensional grid, etc.) to obtain the three-dimensional aggregation point corresponding to the three-dimensional grid.

[0073] It is worth mentioning that after aggregating the three-dimensional aggregation point, the coordinates of the center point of the corresponding three-dimensional grid can be used as the coordinates of the three-dimensional aggregation point, or they can be calculated based on the three-dimensional coordinates of the map interest points aggregated by the three-dimensional aggregation point. For example, the coordinates with the smallest total distance between the three-dimensional coordinates of the map interest points aggregated by the three-dimensional aggregation point can be used as the coordinates of the three-dimensional aggregation point, or the three-dimensional coordinates of the map interest points aggregated by the three-dimensional aggregation point can be averaged, and the average value can be used as the coordinates of the three-dimensional aggregation point.

[0074] This embodiment uses the three-dimensional positional relationship between map interest points and three-dimensional grids to count the number of map interest points that fall into each three-dimensional grid at each grid level in the target grid level, obtains the aggregated number of map interest points at each three-dimensional aggregation point at each grid level in the target grid level, and calculates the coordinates of each three-dimensional aggregation point, thereby completing the aggregation of map interest points and obtaining three-dimensional aggregation point data of the target area at the target grid level.

[0075] This embodiment first obtains map interest point data, digital elevation model and three-dimensional grid data of the target area, wherein the map interest point data includes the two-dimensional coordinates of the map interest point, and the three-dimensional grid data includes the grid data of the three-dimensional grid corresponding to the target area in the Beidou grid code encoding system at the target grid level, and the map interest point and the three-dimensional grid are in the same coordinate system, and then the three-dimensional coordinates of the map interest point are determined by the two-dimensional coordinates and the digital elevation model, and then the three-dimensional position relationship between the map interest point and the three-dimensional grid is determined according to the three-dimensional coordinates, and finally the map interest point is aggregated based on the three-dimensional position relationship to obtain the three-dimensional aggregation point data of the target area at the target grid level, wherein the three-dimensional aggregation point data includes the coordinates of the three-dimensional aggregation point and the aggregation number of the map interest points, and there is a corresponding relationship between the three-dimensional aggregation point and the three-dimensional grid, so that this embodiment can realize the multi-level and multi-precision map interest point aggregation of the unified grid, so as to solve the technical problem that the grid algorithm has great limitations in the application of map interest point aggregation, and further introduces height information to realize three-dimensional map interest point aggregation, breaking through the limitation that the existing grid algorithm can only aggregate two-dimensional map interest points.

[0076] Furthermore, in a feasible implementation manner, the method further includes steps A10 to A20: Step A10, visualizing the 3D aggregation point according to the coordinates of the 3D aggregation point and the number of map interest points, wherein the more the number of map interest points of the 3D aggregation point at the same grid level is, the larger the visualization icon of the 3D aggregation point is when visualizing the 3D aggregation point; Step A20, visualizing the three-dimensional grid according to the coordinates of the three-dimensional aggregation points and the number of map interest points, wherein the more the number of map interest points corresponding to the three-dimensional aggregation points of the three-dimensional grid at the same grid level is, the darker the visualization color of the three-dimensional grid is when visualizing the three-dimensional grid.

[0077] In this embodiment, after the three-dimensional aggregation point data of the target area at the target grid level is aggregated, the three-dimensional aggregation points and the three-dimensional grid are also visualized, so as to intuitively display the aggregation results of the map interest points on the map, including using visualization icons to display the three-dimensional aggregation points, and using visualization colors to display the three-dimensional grid. Among them, the visualization icon can be set to a dot or other shaped icon according to actual needs or the type of map interest points, and at the same grid level, the larger the number of map interest points of the three-dimensional aggregation point is, the larger its visualization icon is. The visualization color can also be set to different colors according to actual needs or the type of map interest points, and at the same grid level, the larger the number of map interest points of the three-dimensional aggregation point corresponding to the three-dimensional grid is, the darker its visualization color is.

[0078] It is not difficult to understand that when viewing the aggregation results of map points of interest, the user can specify to view the aggregation results of one or several grid levels in the target grid level, thereby performing a visualization based on the three-dimensional aggregation point data under the grid level. Correspondingly, the user can also specify to view a certain type of aggregation results, thereby performing a visualization based on the three-dimensional aggregation point data of that type.

[0079] It is worth mentioning that when performing visualization, information such as the type of three-dimensional aggregation points and the number of map interest points can also be displayed inside the corresponding visualization icon or in the corresponding three-dimensional grid.

[0080] In addition, please refer to Figure 5 , Figure 5 Schematic diagram of the device structure of the hardware operating environment involved in the map interest point aggregation method in the embodiment of the present application.

[0081] The present application also provides an electronic device, which includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the map interest point aggregation method in the above-mentioned embodiment.

[0082] Reference below Figure 5 , which shows a schematic diagram of the structure of an electronic device suitable for implementing the embodiments of the present application. The electronic devices in the embodiments of the present application may include but are not limited to mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions), PMPs (Portable Media Players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs (Televisions), desktop computers, etc., or any electronic device that can implement the above functions. Figure 5 The electronic device shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0083] like Figure 5As shown, the electronic device may include a processing device 1001 (e.g., a central processing unit, a graphics processor, etc.), which may perform various appropriate actions and processes according to a program stored in a read-only memory 1002 or a program loaded from a storage device 1003 to a random access memory 1004. In the random access memory 1004, various programs and data required for the operation of the electronic device are also stored. The processing device 1001, the read-only memory 1002, and the random access memory 1004 are connected to each other via a bus 1005. An input / output interface 1006 is also connected to the bus. Generally, the following systems may be connected to the input / output interface 1006: an input device 1007 including, for example, a touch screen, a touch pad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; an output device 1008 including, for example, a liquid crystal display (LCD, Liquid Crystal Display), a speaker, a vibrator, etc.; a storage device 1003 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 1009. The communication device 1009 may allow the electronic device to communicate with other devices wirelessly or by wire to exchange data. Although the electronic device with various systems is shown in the figure, it should be understood that it is not required to implement or have all the systems shown. More or fewer systems can be implemented or have instead.

[0084] In particular, according to the embodiments disclosed in the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present application include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device, or installed from a storage device 1003, or installed from a read-only memory 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the method of the embodiment disclosed in the present application are executed.

[0085] The electronic device provided by the present application adopts the map interest point aggregation method in the above embodiment, which can solve the technical problem that the grid algorithm has great limitations in the application of map interest point aggregation. Compared with the prior art, the beneficial effects of the electronic device provided by the present application are the same as the beneficial effects of the map interest point aggregation method provided by the above embodiment, and other technical features in the electronic device are the same as the features disclosed in the map interest point aggregation method in the above embodiment, which will not be repeated here.

[0086] It should be understood that the various parts disclosed in this application can be implemented by hardware, software, firmware or a combination thereof. In the description of the above embodiments, specific features, structures, materials or characteristics can be combined in any one or more embodiments or examples in a suitable manner.

[0087] In addition, the present application also provides a computer-readable storage medium having computer-readable program instructions (ie, computer programs) stored thereon, and the computer-readable program instructions are used to execute the map interest point aggregation method in the above-mentioned embodiment.

[0088] The computer-readable storage medium provided in the present application may be, for example, a USB flash drive, but is not limited to electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, systems or devices, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory, a read-only memory, an erasable programmable read-only memory, an optical fiber, a portable compact disk read-only memory, an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program, which may be used by or in combination with an instruction execution system, system or device. The program code contained on the computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to: wires, optical cables, RF (Radio Frequency), etc., or any suitable combination of the above.

[0089] The computer-readable storage medium may be included in the electronic device, or may exist independently without being installed in the electronic device.

[0090] The computer-readable storage medium carries one or more programs. When the one or more programs are executed by an electronic device, the electronic device: obtains map point of interest data, a digital elevation model and three-dimensional grid data of a target area, wherein the map point of interest data includes two-dimensional coordinates of the map point of interest, and the three-dimensional grid data includes grid data of a three-dimensional grid corresponding to the target area in a Beidou grid code encoding system at a target grid level, and the map point of interest and the three-dimensional grid are in the same coordinate system; determines the three-dimensional coordinates of the map point of interest through the two-dimensional coordinates and the digital elevation model; determines the three-dimensional positional relationship between the map point of interest and the three-dimensional grid according to the three-dimensional coordinates; aggregates the map point of interest based on the three-dimensional positional relationship to obtain three-dimensional aggregation point data of the target area at the target grid level, wherein the three-dimensional aggregation point data includes the coordinates of the three-dimensional aggregation point and the number of map point of interest aggregations, and there is a corresponding relationship between the three-dimensional aggregation point and the three-dimensional grid.

[0091] Computer program code for performing the operations of the present application may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0092] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present application. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0093] The modules involved in the embodiments described in this application may be implemented by software or hardware, wherein the name of the module does not constitute a limitation on the unit itself in some cases.

[0094] The computer-readable storage medium provided by the present application stores computer-readable program instructions (i.e., computer programs) for executing the above-mentioned method for aggregating points of interest on a map, which can solve the technical problem that the grid algorithm has large limitations in the application of aggregating points of interest on a map. Compared with the prior art, the beneficial effects of the computer-readable storage medium provided by the present application are the same as the beneficial effects of the method for aggregating points of interest on a map provided by the above-mentioned embodiment, and will not be described in detail here.

[0095] In addition, an embodiment of the present application also provides a computer program product, including a computer program, which, when executed by a processor, implements the map interest point aggregation method as in the above embodiment.

[0096] The computer program product provided by the present application can solve the technical problem that the grid algorithm has great limitations in the application of map interest point aggregation. Compared with the prior art, the beneficial effects of the computer program product provided by the embodiment of the present application are the same as the beneficial effects of the map interest point aggregation method provided by the above embodiment, which will not be repeated here.

[0097] The above descriptions are only some embodiments of the present application, and are not intended to limit the patent scope of the present application. All equivalent structural changes made using the contents of the present application specification and drawings under the technical concept of the present application, or direct / indirect applications in other related technical fields are included in the patent protection scope of the present application.

Claims

1. A method for aggregating points of interest on a map, characterized in that: The method comprises: Acquire map point of interest data, digital elevation model and three-dimensional grid data of the target area, wherein the map point of interest data includes two-dimensional coordinates of the map point of interest, the three-dimensional grid data includes grid data of a three-dimensional grid corresponding to the target area in the Beidou grid code encoding system at the target grid level, and the map point of interest and the three-dimensional grid are in the same coordinate system; Determining the three-dimensional coordinates of the map point of interest by using the two-dimensional coordinates and the digital elevation model; Determining a three-dimensional positional relationship between the map interest point and the three-dimensional grid according to the three-dimensional coordinates; Based on the three-dimensional position relationship, the map interest points are aggregated to obtain three-dimensional aggregation point data of the target area under the target grid level, wherein the three-dimensional aggregation point data includes the coordinates of the three-dimensional aggregation points and the number of map interest points aggregated, and there is a corresponding relationship between the three-dimensional aggregation points and the three-dimensional grid.

2. The method for aggregating points of interest on a map according to claim 1, characterized in that: The digital elevation model is a grid digital elevation model, and the step of determining the three-dimensional coordinates of the map interest point through the two-dimensional coordinates and the digital elevation model comprises: Determining, from the grid digital elevation model, a target grid cell matching the map point of interest according to the two-dimensional coordinates; The elevation value of the target grid cell is used as the elevation value of the map interest point, and combined with the two-dimensional coordinates to generate the three-dimensional coordinates of the map interest point.

3. The method for aggregating points of interest on a map according to claim 1, characterized in that: The digital elevation model is a vector digital elevation model, and the step of determining the three-dimensional coordinates of the map interest point through the two-dimensional coordinates and the digital elevation model comprises: Determining, from the vector digital elevation model, a target contour line matching the map point of interest according to the two-dimensional coordinates; The elevation value of the map interest point is calculated based on the elevation value of the target contour line and the distance between the target contour line and the map interest point, and the three-dimensional coordinates of the map interest point are generated in combination with the two-dimensional coordinates.

4. The method for aggregating points of interest on a map according to any one of claims 1 to 3, characterized in that: The step of obtaining map point of interest data, digital elevation model and three-dimensional grid data of the target area includes: Obtain original map point of interest data, digital elevation model and 3D grid data of the target area; The original map point of interest data is preprocessed to obtain the map point of interest data of the target area, wherein the preprocessing includes data cleaning, data standardization and coordinate system conversion, and the coordinate system conversion is used to make the map point of interest and the three-dimensional grid in the same coordinate system.

5. The method for aggregating points of interest on a map according to any one of claims 1 to 3, characterized in that: The method further comprises: Visualizing the three-dimensional aggregation point according to the coordinates of the three-dimensional aggregation point and the number of map interest points, wherein the more the number of map interest points of the three-dimensional aggregation point is at the same grid level, the larger the visualization icon of the three-dimensional aggregation point is when the three-dimensional aggregation point is visualized; The three-dimensional grid is visualized according to the coordinates of the three-dimensional aggregation points and the number of map interest points. The more the number of map interest points corresponding to the three-dimensional aggregation points of the three-dimensional grid at the same grid level is, the darker the visualization color of the three-dimensional grid is when the three-dimensional grid is visualized.

6. The method for aggregating points of interest on a map according to any one of claims 1 to 3, characterized in that: The grid data includes a Beidou grid code, and the step of determining the three-dimensional positional relationship between the map point of interest and the three-dimensional grid according to the three-dimensional coordinates includes: Decode the Beidou grid code of each three-dimensional grid to obtain the three-dimensional coordinate range corresponding to each three-dimensional grid; According to the three-dimensional coordinates of each map interest point and the three-dimensional coordinate range corresponding to each three-dimensional grid, the attribution relationship between each map interest point and each three-dimensional grid is determined respectively, and the attribution relationship is determined as the three-dimensional position relationship between the map interest point and the three-dimensional grid.

7. The method for aggregating points of interest on a map according to any one of claims 1 to 3, characterized in that: The grid data includes a Beidou grid code, and the step of determining the three-dimensional positional relationship between the map point of interest and the three-dimensional grid according to the three-dimensional coordinates includes: Encoding the three-dimensional coordinates of each map interest point according to the target grid level to obtain the Beidou grid code corresponding to each map interest point at the target grid level; According to the Beidou grid code of each three-dimensional grid and the Beidou grid code corresponding to each map point of interest at the target grid level, the attribution relationship between each map point of interest and each three-dimensional grid is determined respectively, and the attribution relationship is determined as the three-dimensional position relationship between the map point of interest and the three-dimensional grid.

8. The method for aggregating points of interest on a map according to claim 1, wherein: The coordinates of the 3D aggregation point are the centroid coordinates of the 3D grid to which the 3D aggregation point belongs, or the geometric median coordinates of each 3D aggregation point in the 3D grid to which the 3D aggregation point belongs.

9. An electronic device, characterized in that: include: A memory, a processor, and a map interest point aggregation program stored in the memory and executable on the processor, wherein the map interest point aggregation program, when executed by the processor, implements the steps of the map interest point aggregation method as described in any one of claims 1 to 8.

10. A computer program product, characterized in that The computer program product comprises a computer program, and when the computer program is executed by a processor, the steps of the map interest point aggregation method according to any one of claims 1 to 8 are implemented.

Images