CN117743491A - Geographic entity coding method, device, computer equipment and medium - Google Patents
Geographic entity coding method, device, computer equipment and medium Download PDFInfo
- Publication number
- CN117743491A CN117743491A CN202311775349.8A CN202311775349A CN117743491A CN 117743491 A CN117743491 A CN 117743491A CN 202311775349 A CN202311775349 A CN 202311775349A CN 117743491 A CN117743491 A CN 117743491A
- Authority
- CN
- China
- Prior art keywords
- geographic entity
- geographic
- distance
- entity
- key sensitive
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 36
- 238000010586 diagram Methods 0.000 claims abstract description 30
- 238000004364 calculation method Methods 0.000 claims description 10
- 238000004590 computer program Methods 0.000 claims description 9
- 230000009467 reduction Effects 0.000 claims description 5
- 101100182247 Caenorhabditis elegans lat-1 gene Proteins 0.000 claims description 3
- 101100182248 Caenorhabditis elegans lat-2 gene Proteins 0.000 claims description 3
- 230000035945 sensitivity Effects 0.000 claims 1
- 238000005516 engineering process Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 238000013500 data storage Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention provides a geographic entity coding method, a geographic entity coding device, computer equipment and a geographic entity coding medium, and relates to the technical field of data processing, wherein the method comprises the following steps: abstracting each geographic entity into a vector diagram in a map of a preset area; in the map, calculating a first position of an area map of the key sensitive points, and calculating a second position of a vector map of each geographic entity; according to each second position and each first position, calculating the distance between each geographic entity and the key sensitive point; coding the region diagram of the key sensitive points to obtain a key sensitive point code; coding each distance to obtain a distance code corresponding to each geographic entity; and coding each geographic entity according to the key sensitive point codes and the distance codes corresponding to each geographic entity. According to the scheme, the codes of each geographic entity comprise key sensitive point codes and distance codes, so that geographic entities with different distances can be conveniently inquired, and further the retrieval efficiency is improved.
Description
Technical Field
The present invention relates to the field of data processing technologies, and in particular, to a method, an apparatus, a computer device, and a medium for encoding a geographic entity.
Background
Geoinformation encoding is the process of abstracting real-world geospatial objects into digital data. This includes mapping geographic entities (e.g., geospatial objects such as places, roads, plots, etc.) to unique Identifications (IDs) of the spatio-temporal database so that these geospatial objects can be uniquely identified and retrieved in the spatio-temporal database. Common geoinformation encoding systems include GeoHash, quadtree, etc., which can divide the geospatial space into different grids for efficient data storage and querying.
In the field of ecological environments, supervision is often performed against key sensitive points in the environment. There is a need for quick and accurate retrieval of geographic information around key sensitive points in an environment. In the current geographic information coding mode, if the geographic entities around the key sensitive point are many, the search is slower.
Disclosure of Invention
In view of the above, the embodiments of the present invention provide a method for encoding a geographic entity, so as to solve the technical problem of low retrieval efficiency in the case that there are many geographic entities around key sensitive points in the encoding method in the prior art. The method comprises the following steps:
abstracting each geographic entity into a vector diagram in a map of a preset area;
in the map, calculating a first position of an area map of key sensitive points, and calculating a second position of a vector map of each geographic entity;
calculating the distance between each geographic entity and the key sensitive point according to each second position and each first position;
coding the region diagram of the key sensitive points to obtain key sensitive point codes; coding each distance to obtain a distance code corresponding to each geographic entity;
and coding each geographic entity according to the key sensitive point codes and the distance codes corresponding to each geographic entity.
The embodiment of the invention also provides a geographic entity coding device, which is used for solving the technical problem of low retrieval efficiency under the condition that the coding mode in the prior art has a plurality of geographic entities around key sensitive points. The device comprises:
the entity diagram determining module is used for abstracting each geographic entity into a vector diagram in a map of a preset area;
the position calculation module is used for calculating a first position of the area map of the key sensitive point in the map and calculating a second position of the vector map of each geographic entity;
the distance calculation module is used for calculating the distance between each geographic entity and the key sensitive point according to each second position and each first position;
the first coding module is used for coding the region diagram of the key sensitive points to obtain key sensitive point codes; coding each distance to obtain a distance code corresponding to each geographic entity;
and the second coding module is used for coding each geographic entity according to the key sensitive point codes and the distance codes corresponding to each geographic entity.
The embodiment of the invention also provides computer equipment, which comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor realizes the arbitrary geographic entity coding method when executing the computer program, so as to solve the technical problem of low search efficiency under the condition that the coding mode in the prior art has a plurality of geographic entities around key sensitive points.
The embodiment of the invention also provides a computer readable storage medium which stores a computer program for executing any of the above-mentioned geographic entity coding methods, so as to solve the technical problem of low retrieval efficiency under the condition that the coding mode in the prior art has many geographic entities around key sensitive points.
Compared with the prior art, the beneficial effects that above-mentioned at least one technical scheme that this description embodiment adopted can reach include at least: the method comprises the steps of calculating a first position of a region diagram of key sensitive points and a second position of a vector diagram of each geographic entity, calculating the distance between each geographic entity and the key sensitive points according to each second position and each first position, coding the key sensitive points to obtain key sensitive point codes, coding each distance to obtain a distance code corresponding to each geographic entity, and finally coding each geographic entity based on the key sensitive point codes and the distance codes corresponding to each geographic entity, so that the codes of each geographic entity comprise the key sensitive point codes and the distance codes, and further, when inquiring the geographic entities, different geographic entities with different distances from the key sensitive points can be quickly and accurately inquired based on the codes of the geographic entities, and geographic entities with different distances can be conveniently inquired under the condition that the geographic entities around the key sensitive points are many, and further, the search efficiency is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flowchart of a method for encoding a geographic entity according to an embodiment of the present invention;
FIG. 2 is a block diagram of a computer device according to an embodiment of the present invention;
fig. 3 is a block diagram of a geographic entity encoding device according to an embodiment of the present invention.
Detailed Description
Embodiments of the present application are described in detail below with reference to the accompanying drawings.
Other advantages and effects of the present application will become apparent to those skilled in the art from the present disclosure, when the following description of the embodiments is taken in conjunction with the accompanying drawings. It will be apparent that the described embodiments are only some, but not all, of the embodiments of the present application. The present application may be embodied or carried out in other specific embodiments, and the details of the present application may be modified or changed from various points of view and applications without departing from the spirit of the present application. It should be noted that the following embodiments and features in the embodiments may be combined with each other without conflict. All other embodiments, which can be made by one of ordinary skill in the art based on the embodiments herein without making any inventive effort, are intended to be within the scope of the present application.
The inventor discovers that, currently, if geographical entities around a key sensitive point are to be searched, the distance between the key sensitive point and the geographical entities around the key sensitive point needs to be calculated, then the key sensitive points and the geographical entities around the key sensitive point are ordered, and finally the geographical entities within a certain range are obtained. If the geographic entities are numerous, a large amount of calculation and ordering work is involved, which is time consuming and reduces the searching efficiency. Therefore, the geographic entity coding method is provided, and the key sensitive point codes and the distance codes are included in the codes of each geographic entity, so that geographic entities with different distances around the key sensitive point can be conveniently inquired under the condition that the number of geographic entities around the key sensitive point is large, and the search efficiency is further improved.
In an embodiment of the present invention, a method for encoding a geographic entity is provided, as shown in fig. 1, where the method includes:
step S101: abstracting each geographic entity into a vector diagram in a map of a preset area;
step S102: in the map, calculating a first position of an area map of key sensitive points, and calculating a second position of a vector map of each geographic entity;
step S103: calculating the distance between each geographic entity and the key sensitive point according to each second position and each first position;
step S104: coding the region diagram of the key sensitive points to obtain key sensitive point codes; coding each distance to obtain a distance code corresponding to each geographic entity;
step S105: and coding each geographic entity according to the key sensitive point codes and the distance codes corresponding to each geographic entity.
As can be seen from the flow shown in fig. 1, in the embodiment of the present invention, a first position of a region map of a key sensitive point and a second position of a vector map of each geographic entity are calculated, and according to each second position and each first position, a distance between each geographic entity and the key sensitive point is calculated, so as to encode the key sensitive point to obtain a key sensitive point code, each distance is encoded to obtain a distance code corresponding to each geographic entity, and finally, each geographic entity is encoded based on the key sensitive point code and the distance code corresponding to each geographic entity, so that when querying the geographic entity, the codes based on the geographic entity can quickly and accurately query different geographic entities with different distances from the key sensitive point, and further, under the circumstance that geographic entities around the key sensitive point are many, the geographic entities with different distances can be queried conveniently, thereby being beneficial to improving the retrieval efficiency.
In the implementation, the key sensitive points refer to environmental assessment points, such as national standard stations of the atmosphere, standard stations of province and city, and the like. But also any area or point of interest that has an impact on the environment assessment or environment.
In particular, in order to accurately calculate the first position of the region map of the key sensitive point, in this embodiment, it is proposed that if the region map of the key sensitive point is a polygon, the geometric center position of the polygon is calculated by the following formula, and the geometric center position of the polygon is determined as the first position:
wherein C is x 、C y Longitude and latitude, x, respectively, of the first location i 、y i Longitude and latitude, x, respectively, of the ith vertex i+1 、y i+1 Longitude and latitude of the (i+1) th vertex; n is the total number of vertexes of the polygon, and A is the area of the polygon.
In the concrete implementation, geographic entities such as places, roads, plots and the like can be abstracted into basic geometric element points, lines and planes by utilizing a geographic information system technology, so that a vector diagram is formed, for example, the graphics of the geographic entities are subjected to feature definition, and an entity abstract form (points, lines and planes) is determined and converted into a basic geometric element point, line and plane (polygon) vector diagram; and then, according to the digital map, a logic characteristic diagram of the geographic entity is manufactured, wherein the logic characteristic diagram is a computer vector diagram of points, lines and planes (polygons), namely the vector diagram of the geographic entity.
In particular, in order to accurately calculate the second position of the vector diagram of each geographic entity, in this embodiment, the second position is calculated based on different types of geographic entities, for example, if the entity type of the geographic entity is a point, the position of the point is determined as the second position;
if the entity type of the geographic entity is a line, determining the midpoint position of the line as the second position; for example, if the single folding line (single-segment folding line), a midpoint where both ends of the single folding line are connected in a straight line is determined as the second position; if the position is a polyline (formed by a plurality of sections of single polylines), determining the midpoint of the single polyline at the position of the midpoint of the polyline as a second position;
and if the entity type of the geographic entity is a face, determining the geometric center position of the polygon of the face as the second position.
In specific implementation, the distance between each second position and the first position is calculated through the following formula:
wherein S is a distance between the second location and the first location, R is an earth radius, lat1 is a longitude of the first location, lat2 is a longitude of the second location, a is a longitude difference between the second location and the first location, and b is a latitude difference between the second location and the first location.
In the implementation, in order to quickly and effectively generate a distance code, the process of coding each distance to obtain a distance code corresponding to each geographic entity may be implemented by reducing the value of each distance according to a preset reduction ratio, and taking the reduced result value as the distance code.
Specifically, the preset reduction ratio may be determined according to actual requirements, for example, one hundredth, one thousandth, and the like. For example, the distance between the geographic entity and the key sensitive point is 1000 meters, and if the preset reduction scale is taken as an example of one thousandth, the obtained distance is encoded as 1.
In particular, in order to improve the accuracy of the geoentity coding, it is proposed to code each of the geoentities according to the key sensitive point codes and the distance codes corresponding to each of the geoentities, for example,
coding each geographic entity to obtain an initial code of each geographic entity;
and splicing the initial code of each geographic entity, the key sensitive point code and the distance code corresponding to each geographic entity to obtain the final code of each geographic entity. Therefore, the final code of each geographic entity comprises the key sensitive point code and the distance code corresponding to each geographic entity, and the key sensitive points and the geographic entities in any distance can be conveniently inquired.
In a specific implementation, in order to conveniently and effectively obtain initial codes of geographic entities, the process of coding each geographic entity to obtain the initial codes of each geographic entity can be realized by the following steps:
dividing grid cells in a map of the preset area, wherein each geographic entity is contained in the area of the grid cell;
determining a geometric center point of a region of the grid unit where each geographic entity is located, and generating a unique identifier of the grid unit according to coordinates of the geometric center point;
and determining the relative distance between each geographic entity and the geometric center point of the grid unit where each geographic entity is located aiming at each geographic entity, and splicing the unique identification of the grid unit where each geographic entity is located with the relative distance to obtain the initial code of each geographic entity.
In the implementation, during the process of dividing the grid cells in the map of the preset area, the size of the grid cells can be dynamically adjusted according to the distribution density of the geographic entities, for example, if the distribution density of the geographic entities in each grid cell is smaller than a preset threshold value, the grid cell is combined with the peripheral grid cells; if the distribution density of the geographic entities in the grid cells is greater than a preset threshold, dividing a plurality of sub-grid cells in the grid cells. Thus, each grid unit has similar geographic entity quantity, and the data distribution is relatively average, so that the query efficiency is relatively high in geographic entity areas with relatively high distribution density.
In specific implementation, the method for encoding the key sensitive points to obtain the key sensitive point codes is not particularly limited, and can be realized by adopting the existing encoding method.
In the implementation, in the prior art, when the information of the periphery of the key sensitive point needs to be searched, the distances are calculated in real time between the key sensitive point and the geographical entities around the key sensitive point, then the distances are sequenced, and finally the geographical entity information of the periphery of the key sensitive point is obtained, if the number of the geographical entities is large, the real-time calculation amount is large, and the inquiry is slower. The initial codes of the geographic entities, the key sensitive point codes and the distance codes corresponding to each geographic entity are spliced to obtain the final codes of each geographic entity, so that the relevant key sensitive points and the distances thereof can be reflected based on the final codes of each geographic entity, and the query speed can be remarkably improved. For example, an initial code of a geographic entity is dr5ru7u4, a distance corresponding to a distance between the geographic entity and a key sensitive point is 1, the key sensitive point is dr5ru7u3, and a final code of the spliced geographic entity is dr5ru7u4,1|dr5ru7u3.
In specific implementation, aiming at the inquiry of the surrounding of the environment sensitive point, the related environment sensitive point code is required to be searched from the space object code, the geographic space object is positioned according to the environment sensitive point code, and if the distance inquiry is required, the distance code is extracted from the space object (namely the geographic entity) code to be filtered.
In this embodiment, a computer device is provided, as shown in fig. 2, including a memory 201, a processor 202, and a computer program stored on the memory and executable on the processor, where the processor implements any of the above-mentioned methods of geo-entity encoding when executing the computer program.
In particular, the computer device may be a computer terminal, a server or similar computing means.
In this embodiment, a computer-readable storage medium storing a computer program for executing any of the above-described geo-entity encoding methods is provided.
In particular, computer-readable storage media, including both permanent and non-permanent, removable and non-removable media, may be used to implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer-readable storage media include, but are not limited to, phase-change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Disks (DVD) or other optical storage, magnetic cassettes, magnetic tape disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. Computer-readable storage media, as defined herein, does not include transitory computer-readable media (transmission media), such as modulated data signals and carrier waves.
Based on the same inventive concept, the embodiment of the invention also provides a geographic entity coding device, as described in the following embodiment. Since the principle of the geo-entity encoding device for solving the problem is similar to that of the geo-entity encoding method, the implementation of the geo-entity encoding device can refer to the implementation of the geo-entity encoding method, and the repetition is omitted. As used below, the term "unit" or "module" may be a combination of software and/or hardware that implements the intended function. While the means described in the following embodiments are preferably implemented in software, implementation in hardware, or a combination of software and hardware, is also possible and contemplated.
Fig. 3 is a block diagram of a geo-entity encoding device according to an embodiment of the present invention, as shown in fig. 3, the device includes:
the entity diagram determining module 301 is configured to abstract each geographic entity into a vector diagram in a map of a preset area;
a position calculation module 302, configured to calculate, in the map, a first position of a region map of key sensitive points, and calculate a second position of a vector map of each of the geographic entities;
a distance calculating module 303, configured to calculate a distance between each of the geographic entities and the key sensitive point according to each of the second location and the first location;
the first encoding module 304 is configured to encode the region map of the key sensitive point to obtain a key sensitive point code; coding each distance to obtain a distance code corresponding to each geographic entity;
and a second encoding module 305, configured to encode each geographic entity according to the key sensitive point code and the distance code corresponding to each geographic entity.
In one embodiment, the location calculation module is configured to calculate a geometric center location of the polygon if the area map of the key sensitive point is a polygon, and determine the geometric center location of the polygon as the first location by the following formula:
wherein C is x 、C y Longitude and latitude, x, respectively, of the first location i 、y i Longitude and latitude, x, respectively, of the ith vertex i+1 、y i+1 Longitude and latitude of the (i+1) th vertex; n is the total number of vertexes of the polygon, and A is the area of the polygon.
In one embodiment, the location calculation module is configured to determine, if the entity type of the geographic entity is a point, a location of the point as the second location; if the entity type of the geographic entity is a line, determining the midpoint position of the line as the second position; and if the entity type of the geographic entity is a face, determining the geometric center position of the polygon of the face as the second position.
In one embodiment, the distance calculation module is configured to calculate the distance between each of the second locations and the first location by the following formula:
wherein S is a distance between the second position and the first position, R is an earth radius, a is a difference value between the second position and the first position, lat1 is a longitude of the first position, lat2 is a longitude of the second position, and b is a difference value between the second position and the first position.
In one embodiment, the first encoding module is configured to reduce the value of each distance according to a preset reduction ratio, and use the reduced result value as the distance encoding.
In one embodiment, the second encoding module is configured to encode each of the geographic entities to obtain an initial encoding of each of the geographic entities; and splicing the initial code of each geographic entity, the key sensitive point code and the distance code corresponding to each geographic entity to obtain the final code of each geographic entity.
In one embodiment, the second encoding module is configured to divide a grid cell in a map of the preset area, and each of the geographic entities is contained in an area of the grid cell; determining a geometric center point of a region of the grid unit where each geographic entity is located, and generating a unique identifier of the grid unit according to coordinates of the geometric center point; and determining the relative distance between each geographic entity and the geometric center point of the grid unit where each geographic entity is located aiming at each geographic entity, and splicing the unique identification of the grid unit where each geographic entity is located with the relative distance to obtain the initial code of each geographic entity.
The embodiment of the invention realizes the following technical effects: the method comprises the steps of calculating a first position of a region diagram of key sensitive points and a second position of a vector diagram of each geographic entity, calculating the distance between each geographic entity and the key sensitive points according to each second position and each first position, coding the key sensitive points to obtain key sensitive point codes, coding each distance to obtain a distance code corresponding to each geographic entity, and finally coding each geographic entity based on the key sensitive point codes and the distance codes corresponding to each geographic entity, so that the codes of each geographic entity comprise the key sensitive point codes and the distance codes, and further, when inquiring the geographic entities, different geographic entities with different distances from the key sensitive points can be quickly and accurately inquired based on the codes of the geographic entities, and geographic entities with different distances can be conveniently inquired under the condition that the geographic entities around the key sensitive points are many, and further, the search efficiency is improved.
It will be apparent to those skilled in the art that the modules or steps of the embodiments of the invention described above may be implemented in a general purpose computing device, they may be concentrated on a single computing device, or distributed across a network of computing devices, they may alternatively be implemented in program code executable by computing devices, so that they may be stored in a storage device for execution by computing devices, and in some cases, the steps shown or described may be performed in a different order than what is shown or described, or they may be separately fabricated into individual integrated circuit modules, or a plurality of modules or steps in them may be fabricated into a single integrated circuit module. Thus, embodiments of the invention are not limited to any specific combination of hardware and software.
The above description is only of the preferred embodiments of the present invention and is not intended to limit the present invention, and various modifications and variations can be made to the embodiments of the present invention by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A method of geo-entity encoding, comprising:
abstracting each geographic entity into a vector diagram in a map of a preset area;
in the map, calculating a first position of an area map of key sensitive points, and calculating a second position of a vector map of each geographic entity;
calculating the distance between each geographic entity and the key sensitive point according to each second position and each first position;
coding the region diagram of the key sensitive points to obtain key sensitive point codes; coding each distance to obtain a distance code corresponding to each geographic entity;
and coding each geographic entity according to the key sensitive point codes and the distance codes corresponding to each geographic entity.
2. The geoentity encoding method of claim 1, wherein calculating a first location of a region map of key sensitive points comprises:
if the region map of the key sensitive point is a polygon, calculating the geometric center position of the polygon according to the following formula, and determining the geometric center position of the polygon as the first position:
wherein C is x 、C y Longitude and latitude, x, respectively, of the first location i 、y i Longitude and latitude, x, respectively, of the ith vertex i+1 、y i+1 Longitude and latitude of the (i+1) th vertex; n is the total number of vertexes of the polygon, and A is the area of the polygon.
3. The method of geoentity encoding of claim 1, wherein calculating a second location of a vector map of each of the geoentities comprises:
if the entity type of the geographic entity is a point, determining the position of the point as the second position;
if the entity type of the geographic entity is a line, determining the midpoint position of the line as the second position;
and if the entity type of the geographic entity is a face, determining the geometric center position of the polygon of the face as the second position.
4. The geoentity encoding method of claim 1, wherein calculating the distance of each of the second locations from the first location, respectively, comprises:
calculating the distance between each second position and the first position by the following formula:
wherein S is a distance between the second position and the first position, R is an earth radius, a is a difference value between the second position and the first position, lat1 is a longitude of the first position, lat2 is a longitude of the second position, and b is a difference value between the second position and the first position.
5. The method for encoding a geographic entity according to claim 1, wherein encoding each distance to obtain a distance code corresponding to each geographic entity comprises:
and reducing the numerical value of each distance according to a preset reduction ratio, and taking the reduced result numerical value as the distance code.
6. The method of encoding a geographic entity of claim 1, wherein encoding each of the geographic entities based on the key sensitivity point code and a distance code corresponding to each of the geographic entities comprises:
coding each geographic entity to obtain an initial code of each geographic entity;
and splicing the initial code of each geographic entity, the key sensitive point code and the distance code corresponding to each geographic entity to obtain the final code of each geographic entity.
7. The method of encoding a geographic entity of claim 6, wherein encoding each of said geographic entities results in an initial encoding of each of said geographic entities, comprising:
dividing grid cells in a map of the preset area, wherein each geographic entity is contained in the area of the grid cell;
determining a geometric center point of a region of the grid unit where each geographic entity is located, and generating a unique identifier of the grid unit according to coordinates of the geometric center point;
and determining the relative distance between each geographic entity and the geometric center point of the grid unit where each geographic entity is located aiming at each geographic entity, and splicing the unique identification of the grid unit where each geographic entity is located with the relative distance to obtain the initial code of each geographic entity.
8. A geo-entity encoding device, comprising:
the entity diagram determining module is used for abstracting each geographic entity into a vector diagram in a map of a preset area;
the position calculation module is used for calculating a first position of the area map of the key sensitive point in the map and calculating a second position of the vector map of each geographic entity;
the distance calculation module is used for calculating the distance between each geographic entity and the key sensitive point according to each second position and each first position;
the first coding module is used for coding the region diagram of the key sensitive points to obtain key sensitive point codes; coding each distance to obtain a distance code corresponding to each geographic entity;
and the second coding module is used for coding each geographic entity according to the key sensitive point codes and the distance codes corresponding to each geographic entity.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the geoentity encoding method of any one of claims 1 to 7 when the computer program is executed by the processor.
10. A computer readable storage medium, characterized in that the computer readable storage medium stores a computer program for executing the geoentity encoding method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311775349.8A CN117743491B (en) | 2023-12-21 | 2023-12-21 | Geographic entity coding method, device, computer equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311775349.8A CN117743491B (en) | 2023-12-21 | 2023-12-21 | Geographic entity coding method, device, computer equipment and medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117743491A true CN117743491A (en) | 2024-03-22 |
| CN117743491B CN117743491B (en) | 2024-07-02 |
Family
ID=90252453
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311775349.8A Active CN117743491B (en) | 2023-12-21 | 2023-12-21 | Geographic entity coding method, device, computer equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117743491B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1450499A (en) * | 2003-04-29 | 2003-10-22 | 上海城市发展信息研究中心 | Geography information system based city basic entity coding method and automation algorithm |
| CN102289464A (en) * | 2011-07-18 | 2011-12-21 | 南京师范大学 | Encoding method based on spatial features of vector data |
| CN109000650A (en) * | 2018-05-30 | 2018-12-14 | 北京都在哪网讯科技有限公司 | Atural object relative position determines method and device |
| CN112579712A (en) * | 2021-01-25 | 2021-03-30 | 武大吉奥信息技术有限公司 | Method and equipment for constructing polymorphic geographic entity data model and storage equipment |
| CN113010620A (en) * | 2020-11-18 | 2021-06-22 | 南通市测绘院有限公司 | Natural resource data index statistical method and system based on geographical multilevel grids |
| WO2022193872A1 (en) * | 2021-03-16 | 2022-09-22 | 京东城市(北京)数字科技有限公司 | Method and apparatus for determining spatial relationship, computer device, and storage medium |
| WO2023209560A1 (en) * | 2022-04-27 | 2023-11-02 | Ecopia Tech Corporation | Machine learning for vector map generation |
-
2023
- 2023-12-21 CN CN202311775349.8A patent/CN117743491B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1450499A (en) * | 2003-04-29 | 2003-10-22 | 上海城市发展信息研究中心 | Geography information system based city basic entity coding method and automation algorithm |
| CN102289464A (en) * | 2011-07-18 | 2011-12-21 | 南京师范大学 | Encoding method based on spatial features of vector data |
| CN109000650A (en) * | 2018-05-30 | 2018-12-14 | 北京都在哪网讯科技有限公司 | Atural object relative position determines method and device |
| CN113010620A (en) * | 2020-11-18 | 2021-06-22 | 南通市测绘院有限公司 | Natural resource data index statistical method and system based on geographical multilevel grids |
| CN112579712A (en) * | 2021-01-25 | 2021-03-30 | 武大吉奥信息技术有限公司 | Method and equipment for constructing polymorphic geographic entity data model and storage equipment |
| WO2022193872A1 (en) * | 2021-03-16 | 2022-09-22 | 京东城市(北京)数字科技有限公司 | Method and apparatus for determining spatial relationship, computer device, and storage medium |
| WO2023209560A1 (en) * | 2022-04-27 | 2023-11-02 | Ecopia Tech Corporation | Machine learning for vector map generation |
Non-Patent Citations (2)
| Title |
|---|
| 王云帆;: "一种基于空间特征的地理实体编码方法", 测绘通报, no. 10, 25 October 2018 (2018-10-25), pages 70 - 74 * |
| 王家耀, 王建涛: "基于SVG的地理信息编码与DOM交互解析实现", 测绘学院学报, no. 02, 30 June 2005 (2005-06-30), pages 5 - 7 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117743491B (en) | 2024-07-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10034141B2 (en) | Systems and methods to identify home addresses of mobile devices | |
| CN110909093B (en) | Method and device for constructing intelligent landmark control network | |
| CN110263117B (en) | Method and device for determining POI (Point of interest) data | |
| CN114238384B (en) | Area positioning method, device, equipment and storage medium | |
| CN114563003B (en) | Path planning method and device, electronic device, and storage medium | |
| US11082802B2 (en) | Application of data structures to geo-fencing applications | |
| CN110633262A (en) | Calculation method and system of map intersecting area area based on Spark | |
| CN115900733B (en) | Road network matching method and device | |
| CN115858709A (en) | Multi-scale spatial data processing method, electronic equipment and storage medium | |
| CN117743491B (en) | Geographic entity coding method, device, computer equipment and medium | |
| CN112261093B (en) | Man-vehicle data matching method and device | |
| CN116383444A (en) | Serialization storage method and device of graph structure, electronic equipment and medium | |
| KR100540899B1 (en) | How to compress geospatial data | |
| CN113902874A (en) | Point cloud data processing method, device, computer equipment and storage medium | |
| CN112035465B (en) | A method and system for normalizing geographic spatial data | |
| CN117405130B (en) | Target point cloud map acquisition method, electronic equipment and storage medium | |
| Wen et al. | A storage method of ship trajectory data based on ClickHouse database | |
| CN112291713B (en) | Method for acquiring target potential user data | |
| CN113254565B (en) | Region identification method and device, computer equipment and computer readable storage medium | |
| CN118193586B (en) | Method and device for searching nearest neighbor point cloud in massive point cloud data scene | |
| US20080162035A1 (en) | Determining elevation values in a geocoding system | |
| Petrov | Practical approach for modifying existing geocoding system from equal angular to equal area | |
| CN116033548A (en) | Weighted centroid positioning method, system and storable medium | |
| CN108986234B (en) | Terrain data fusion method and device | |
| CN119377338A (en) | Geographic object processing method, device, electronic device and computer storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant |