CN112686468B - Public facility stability optimization method - Google Patents
Public facility stability optimization method Download PDFInfo
- Publication number
- CN112686468B CN112686468B CN202110048291.1A CN202110048291A CN112686468B CN 112686468 B CN112686468 B CN 112686468B CN 202110048291 A CN202110048291 A CN 202110048291A CN 112686468 B CN112686468 B CN 112686468B
- Authority
- CN
- China
- Prior art keywords
- facility
- key
- facilities
- public
- attribute
- 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.)
- Active
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method for optimizing stability of public facilities. In order to solve the problem of optimizing the stability of public facilities, the invention provides a method for excavating key structures on a two-dimensional attribute facility graph. In order to quickly calculate a key structure on a two-dimensional attribute facility map, the invention firstly provides a new pruning strategy for a method for generating the two-dimensional attribute facility map for a public facility data set with two-dimensional coordinates, thereby effectively reducing the calculated amount. Secondly, the invention provides a calculation method of the key structure, which can effectively excavate the key structure on the two-dimensional attribute facility map. Finally, the invention establishes a key structure maintenance strategy for the two-dimensional attribute facility map which is dynamically changed, and the key structure is rapidly maintained on the two-dimensional attribute facility map which is dynamically changed through a plurality of pruning methods.
Description
Technical Field
The invention belongs to the technical field of public facility layout, and particularly relates to a public facility stability optimization method.
Background
With the increase of GPS-equipped devices, a large number of GPS devices are increasing, and the public facility attribute information is also rapidly increasing in reality. For example, for a gas station, the attribute value may be the geographic coordinates of the gas station, the type of fuel added to the gas station, the number of internal fuelling rooms, etc. An important issue for public facility layout analysis is to search for critical structures on a two-dimensional attribute facility map, which will help to improve the radius of radiation for public facility groups and public facility layout decisions for the relevant departments.
In recent research literature, scholars have proposed various structures (e.g., minimum coverage circles and spatial clusters) to capture information in multi-attribute data. However, computing these structures is often time consuming. For example, a space bolus structure requires that every pair of facilities in the identification structure be neighbors of each other, i.e., not more than r from each other. In addition, the problem of maximum spatial community enumeration is NP-hard and difficult to use in applications where time efficiency requirements are high.
The key structure is one of the most widely used structures for measuring structural stability in the current public facility layout analysis. The critical structure is a subset of the two-dimensional attribute facility map in which each facility has at least k neighbors. The key structure is widely used because it can be calculated in linear time, greatly improving the calculation efficiency compared to the space mass.
On the other hand, the existing research work on most mathematical facility diagrams is only focused on static diagrams, but the evolving facility diagrams are ignored. This is not practical because the relevant departments may remove the facilities because they are scrapped or add to the facilities because of the increased number of surrounding residents, resulting in a change in the size and geometry of the critical structures previously searched. Thus, in order to dynamically monitor the size and geometry changes of the critical structures, information of the two-dimensional attribute facility data is maintained, and maintenance and update work on the critical structures is required when the two-dimensional attribute facility map evolves over time.
Disclosure of Invention
The invention aims to provide a method for optimizing stability of public facilities, aiming at the defects of the prior art.
The invention aims at realizing the following technical scheme: a utility stability optimization method, comprising:
(1) And acquiring a public facility coordinate attribute data set from a real GPS information website, and filtering invalid data to obtain an input data set.
(2) Pruning and filtering are carried out on an input data set, redundant calculation is reduced, and a two-dimensional attribute facility map is rapidly generated, and the method specifically comprises the following steps:
(2.1) placing the input dataset V in a grid L having two layers 1 And L 2 In a two-dimensional coordinate system of (2), wherein L 1 Is r, L 2 Each grid side length is
(2.2) for each facility v, at L 1 Only the facilities in the 3 x 3 grid around v are possible neighbors of v, calculating the attribute distance between v and the facilities in the 3 x 3 grid around v, and adding the attribute distance to the neighbor set of v if the attribute distance is smaller than the attribute distance threshold r; at L 2 Facilities in the same grid as v must be neighbors of v;
(2.3) calculating neighbor sets E of all public facilities, and generating a two-dimensional attribute facility graph G.
(3) Searching a two-dimensional attribute facility map for a public facility key structure, wherein the key structure meets two conditions: 1. each facility in the critical structure has at least k neighbors; 2. the critical structure is extremely large, i.e. any larger structure containing the structure cannot meet the former condition; the key structure searching process is as follows: calculating a key value of each public facility according to the number of neighbors of the public facility, wherein the key value is a k value corresponding to a key structure of the maximum k value which the public facility possibly belongs to; the key structure represents a collection of all public facilities with a key value of k; and iteratively removing facilities with key values smaller than k from the two-dimensional attribute facility map until no facilities can be removed, wherein the rest of the two-dimensional attribute facility map is the key structure.
(4) And (3) quickly maintaining the key structure searched in the step (3) after removing one public facility on the two-dimensional attribute facility map: removing a facility u in the two-dimensional attribute facility map, and removing u from a neighbor set of neighbors of u; if the key value of facility u is k, then all facilities with key values greater than k will not change until u is removed, otherwise the key value of the public facility is updated using a k-sequence structure.
(5) And (3) quickly maintaining the key structure searched in the step (3) after adding a public facility to the two-dimensional attribute facility map: adding a facility u into the two-dimensional attribute facility diagram, generating a neighbor set corresponding to the u, and adding the u into neighbor sets of all neighbors of the facility u; if the upper or lower bound of the key value of the newly added facility u is k, all the facilities with the key value greater than or equal to k have the key value unchanged before and after u is added, otherwise, the key value of the public facility is updated by adopting a k-sequence structure.
(6) And searching corresponding key structures according to the updated key values of each public facility.
Further, in the step 2, in order to determine the neighbor set of the facilities, it is only necessary to calculate that each facility is in L 1 Attribute distance from facilities in the surrounding 3 x 3 grid; and save calculating each facility at L 2 Time from the property distance of the facility in the same grid as it is.
Further, in the step 2, the attribute distance is a euclidean distance between two facility attribute vectors.
Further, in the step 2, each facility in the key structure has at least k neighbors, and the k value is set according to the density of the traffic flow or population density, and takes 5-15.
Further, in the steps 4 and 5, the key value of the public facilities is updated by using the pruning strategy, and a plurality of facilities which do not need to update the key value after the facilities are removed or added are filtered.
Further, in the step 5, an upper limit k of the key value of the facility u up And lower bound k low The calculation formula of (2) is as follows:
k low ＝max{k：D k (u)≥k}
k up ＝max{k：D k-1 (u)≥k}
wherein, |k low -k up |≤1，D k-1 (u) represents the number of neighbors with a key value greater than or equal to k-1 in the neighbor set of u; d (D) k And (u) represents the number of neighbors with the key value greater than or equal to k in the neighbor set of u.
Further, the step 6 specifically includes: after removing old facilities or adding new facilities, the key values of all facilities in the two-dimensional attribute facility map are updated, and all facilities with key values of k are returned as key structures.
The invention also provides a computer device comprising a memory and a processor, the memory having stored therein computer readable instructions which, when executed by the processor, cause the processor to perform the steps of the utility stability optimization method described above.
The present invention also provides a storage medium storing computer readable instructions that, when executed by one or more processors, cause the one or more processors to perform the steps of the above-described utility stability optimization method.
The beneficial effects of the invention are as follows: the invention researches the stability optimization problem of public facilities, which is widely applied to the analysis of public facility layout and improves the radius of the radiation network of public facility groups. In order to efficiently identify key structures in a two-dimensional property facility graph, the present invention first developed a new technique to accelerate the generation process of the two-dimensional property facility graph. Then, when an old facility is removed or a new facility is added, that is, a two-dimensional attribute facility map is changed, the invention proposes several pruning rules for maintenance of the facility key values, thereby further reducing the calculation cost of searching the key structure. Therefore, the application of the public facility stability optimization method provided by the invention has great benefit for the layout analysis of public facilities by related departments.
Drawings
FIG. 1 is a flow chart of a method for optimizing the stability of a public facility provided by an embodiment of the invention;
fig. 2 is a schematic diagram of an obtained key structure according to an embodiment of the present invention.
Detailed Description
In order that the above objects, features and advantages of the invention will be readily understood, a more particular description of the invention will be rendered by reference to the appended drawings.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention, but the present invention may be practiced in other ways other than those described herein, and persons skilled in the art will readily appreciate that the present invention is not limited to the specific embodiments disclosed below.
As shown in fig. 1, the method for optimizing the stability of a public facility provided by the embodiment of the invention comprises the following steps:
step one, acquiring a public facility coordinate attribute data set from a real GPS information website, and filtering invalid data from the acquired data set to obtain the input data set.
Step two, pruning and filtering the input data set, reducing redundant calculation, and rapidly generating a two-dimensional attribute facility map, wherein the specific method comprises the following steps:
placing the input dataset V in a grid L with two layers 1 And L 2 In a two-dimensional coordinate system of (2), wherein L 1 Is r, L 2 Is of the grid side length of each grid
(1) For each facility v, at L 1 Only facilities located in a 3 x 3 grid around facility v are likely neighbors of v while at L 2 Points in the same lattice as v must be neighbors of v;
(2) In order to determine the neighbor set of the facilities, the invention only needs to calculate the L position of each facility 1 If the attribute distance is smaller than the attribute distance threshold r, adding the attribute distance to the neighbor set of v; and save calculating each facility at L 2 Time of the attribute distance of the facility in the same grid as the facility; the attribute distance is a euclidean distance between two facility attribute vectors, for example, a geographic location two-dimensional coordinate value may be selected as the two attributes of the facility.
The method is applied to all public facilities in the map, and the neighbor set E of all public facilities can be rapidly calculated, so that a two-dimensional attribute facility map G is generated.
Step three, finding a key structure of the public facilities through a key structure searching algorithm in the two-dimensional attribute facility map generated in the step two, wherein the key structure meets two conditions: 1. each facility in the key structure has at least k neighbors (the k value is set according to the density of traffic flow or population density, and generally, the greater the density, the greater the k value, generally, 5-15 is taken); 2. the critical structure is extremely large, i.e. any larger structure containing the structure cannot meet the former condition.
The specific method comprises the following steps: calculating a key value of each public facility according to the number of neighbors of the public facility, wherein the key value is a k value corresponding to a key structure of the maximum k value which the public facility possibly belongs to; the key structure represents a collection of all public facilities with a key value of k; in order to search for the key structure, the facilities with the key value smaller than k are iteratively removed in the two-dimensional attribute facility map until no facilities can be removed, and the rest of the two-dimensional attribute facility map is the key structure.
Step four, quickly maintaining the key structure searched in the step three after removing one public facility on the two-dimensional attribute facility map, wherein the specific method comprises the following steps: firstly, removing a facility u from a two-dimensional attribute facility map, and removing u from a neighbor set of a neighbor of u; secondly, updating key values of public facilities by using a pruning strategy, wherein the key values are specifically as follows: if the key value of facility u is k, then all facilities with key values greater than k will not change until u is removed, otherwise the key value of the public facility is updated using a k-sequence structure. The k-sequence structure is the most advanced algorithm currently used to maintain key values in a two-dimensional attribute map. The present invention proposes a new pruning strategy by which the present invention filters many facilities that do not need to update key values after the facilities are removed.
Step five, adding a public facility to the two-dimensional attribute facility map, and then rapidly maintaining the key structure searched in the step three, wherein the specific method comprises the following steps: firstly, adding a facility u into a two-dimensional attribute facility diagram, generating a neighbor set corresponding to u, and adding u into neighbor sets of all neighbors of the facility u; secondly, updating key values of public facilities by using a pruning strategy, wherein the key values are specifically as follows: if the upper or lower bound of the key value of the newly added facility u is k, all the facilities with the key value greater than or equal to k have the key value unchanged before and after u is added, otherwise, the key value of the public facility is updated by adopting a k-sequence structure. Upper bound k of key value of facility u up And lower bound k low The calculation formula of (2) is as follows:
k low ＝max{k：D k (u)≥k}
k up ＝max{k：D k-1 (u)≥k}
wherein, |k low -k up |≤1，D k-1 (u) represents the number of neighbors with a key value greater than or equal to k-1 in the neighbor set of u; d (D) k (u) represents the number of neighbors with a key value greater than or equal to k in the neighbor set of u;
the present invention proposes a new pruning strategy by which the present invention filters many facilities that do not need to update key values after the facilities are added.
Step six, searching corresponding key structures according to the updated key values of each public facility, wherein the specific method comprises the following steps: after removing old facilities or adding new facilities, the key values of all facilities in the two-dimensional attribute facility map are updated, and all facilities with key values of k are returned as key structures.
As shown in FIG. 2, there is a set of public facilities on the map, each facility being associated with a two-dimensional attribute. If the attribute distance of two facilities is smaller than a given threshold r, the two facilities are neighbors of each other, and the constructed graph is called a two-dimensional attribute facility graph. Assuming k=3, then the key structure is the set of facilities covered by a light gray solid circle, i.e., { v 1 ，v 2 ，v 3 ，v 4 ，v 5 ，v 6 ，v 7 Each facility has at least 3 neighbors and there is no superset of it satisfying the constraint, that is, this critical structure is extremely large.
In one embodiment, a computer device is provided that includes a memory and a processor, where the memory stores computer readable instructions that, when executed by the processor, cause the processor to perform the steps in the method for optimizing utility stability in each of the embodiments described above.
In one embodiment, a storage medium storing computer readable instructions that, when executed by one or more processors, cause the one or more processors to perform the steps in the utility stability optimization method in each of the above embodiments is presented. Wherein the storage medium may be a non-volatile storage medium.
Those of ordinary skill in the art will appreciate that all or part of the steps in the various methods of the above embodiments may be implemented by a program to instruct related hardware, the program may be stored in a computer readable storage medium, and the storage medium may include: read Only Memory (ROM), random access Memory (RAM, random Access Memory), magnetic or optical disk, and the like.
The foregoing is merely a preferred embodiment of the present invention, and the present invention has been disclosed in the above description of the preferred embodiment, but is not limited thereto. Any person skilled in the art can make many possible variations and modifications to the technical solution of the present invention or modifications to equivalent embodiments using the methods and technical contents disclosed above, without departing from the scope of the technical solution of the present invention. Therefore, any simple modification, equivalent variation and modification of the above embodiments according to the technical substance of the present invention still fall within the scope of the technical solution of the present invention.
Claims (9)
1. A method of optimizing stability of a utility, the method comprising the steps of:
(1) Acquiring a public facility coordinate attribute data set from a real GPS information website, and filtering invalid data to obtain an input data set;
(2) Pruning and filtering are carried out on an input data set, redundant calculation is reduced, and a two-dimensional attribute facility map is rapidly generated, and the method specifically comprises the following steps:
(2.1) placing the input dataset V in a grid L having two layers 1 And L 2 In a two-dimensional coordinate system of (2), wherein L 1 Is r, L 2 Each grid side length is
(2.2) for each facility v, at L 1 Only in 3X 3 lattices around vThe facility may be a neighbor of v, calculate the attribute distance of v from the facility in the surrounding 3 x 3 grid, if the attribute distance is less than the attribute distance threshold r, add it to the neighbor set of v; at L 2 Facilities in the same grid as v must be neighbors of v;
(2.3) calculating neighbor sets E of all public facilities to generate a two-dimensional attribute facility graph G;
(3) Searching a two-dimensional attribute facility map for a public facility key structure, wherein the key structure meets two conditions: 1. each facility in the critical structure has at least k neighbors; 2. the critical structure is extremely large, i.e. any larger structure containing the structure cannot meet the former condition; the key structure searching process is as follows: calculating a key value of each public facility according to the number of neighbors of the public facility, wherein the key value is a k value corresponding to a key structure of the maximum k value which the public facility possibly belongs to; the key structure represents a collection of all public facilities with a key value of k; iteratively removing facilities with key values smaller than k from the two-dimensional attribute facility map until no facilities can be removed, wherein the rest of the two-dimensional attribute facility map is a key structure;
(4) And (3) quickly maintaining the key structure searched in the step (3) after removing one public facility on the two-dimensional attribute facility map: removing a facility u in the two-dimensional attribute facility map, and removing u from a neighbor set of neighbors of u; if the key value of the facility u is k, all the facilities with key values larger than k are not changed before and after the u is removed, otherwise, the key values of the public facilities are updated by adopting a k-sequence structure;
(5) And (3) quickly maintaining the key structure searched in the step (3) after adding a public facility to the two-dimensional attribute facility map: adding a facility u into the two-dimensional attribute facility diagram, generating a neighbor set corresponding to the u, and adding the u into neighbor sets of all neighbors of the facility u; if the upper or lower bound of the key value of the newly added facility u is k, all the key values of the facilities with the key value larger than or equal to k are unchanged before and after u is added, otherwise, the key values of the public facilities are updated by adopting a k-sequence structure;
(6) And searching corresponding key structures according to the updated key values of each public facility.
2. A method for optimizing stability of public facilities according to claim 1, wherein in step 2, in order to determine the neighbor set of the facilities, only the calculation of each facility at L is needed 1 Attribute distance from facilities in the surrounding 3 x 3 grid; and save calculating each facility at L 2 Time from the property distance of the facility in the same grid as it is.
3. A method of optimizing the stability of a public facility according to claim 1, wherein in step 2, the attribute distance is a euclidean distance between two facility attribute vectors.
4. A method for optimizing stability of a public facility according to claim 1, wherein in the step 2, each facility in the key structure has at least k neighbors, and k is set according to the density of traffic flow or population density, and takes 5-15.
5. A method for optimizing the stability of a utility according to claim 1, wherein in steps 4 and 5, the key value of the utility is updated by using a pruning strategy, and a plurality of facilities which do not need to update the key value after removing or adding the facilities are filtered.
6. A method for optimizing the stability of a public facility according to claim 1, wherein in said step 5, the upper limit k of the key value of the facility u up And lower bound k low The calculation formula of (2) is as follows:
k low ＝max{k：D k (u)≥k}
k up ＝max{k：D k-1 (u)≥k}
wherein, |k low -k up |≤1，D k-1 (u) represents the number of neighbors with a key value greater than or equal to k-1 in the neighbor set of u; d (D) k And (u) represents the number of neighbors with the key value greater than or equal to k in the neighbor set of u.
7. The method for optimizing the stability of a public facility according to claim 1, wherein the step 6 is specifically: after removing old facilities or adding new facilities, the key values of all facilities in the two-dimensional attribute facility map are updated, and all facilities with key values of k are returned as key structures.
8. A computer device comprising a memory and a processor, the memory having stored therein computer readable instructions that, when executed by the processor, cause the processor to perform the steps of the utility stability optimization method of any of claims 1-7.
9. A storage medium storing computer readable instructions which, when executed by one or more processors, cause the one or more processors to perform the steps of the utility stability optimization method of any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110048291.1A CN112686468B (en) | 2021-01-14 | 2021-01-14 | Public facility stability optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110048291.1A CN112686468B (en) | 2021-01-14 | 2021-01-14 | Public facility stability optimization method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112686468A CN112686468A (en) | 2021-04-20 |
| CN112686468B true CN112686468B (en) | 2023-05-26 |
Family
ID=75458081
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110048291.1A Active CN112686468B (en) | 2021-01-14 | 2021-01-14 | Public facility stability optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112686468B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113268558B (en) * | 2021-07-19 | 2021-09-24 | 智广海联(天津)大数据技术有限公司 | Public facility management system and method based on two-dimensional code and geographic space coordinate |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017065795A1 (en) * | 2015-10-16 | 2017-04-20 | Hewlett Packard Enterprise Development Lp | Incremental update of a neighbor graph via an orthogonal transform based indexing |
| CN109067587A (en) * | 2018-08-20 | 2018-12-21 | 腾讯科技（深圳）有限公司 | The determination method and device of key message infrastructure |
| CN111861022A (en) * | 2020-07-28 | 2020-10-30 | 国网天津市电力公司滨海供电分公司 | Method for optimizing electric vehicle charging station site selection based on big data analysis |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10157239B2 (en) * | 2013-12-23 | 2018-12-18 | Oracle International Corporation | Finding common neighbors between two nodes in a graph |
-
2021
- 2021-01-14 CN CN202110048291.1A patent/CN112686468B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017065795A1 (en) * | 2015-10-16 | 2017-04-20 | Hewlett Packard Enterprise Development Lp | Incremental update of a neighbor graph via an orthogonal transform based indexing |
| CN109067587A (en) * | 2018-08-20 | 2018-12-21 | 腾讯科技（深圳）有限公司 | The determination method and device of key message infrastructure |
| CN111861022A (en) * | 2020-07-28 | 2020-10-30 | 国网天津市电力公司滨海供电分公司 | Method for optimizing electric vehicle charging station site selection based on big data analysis |
Non-Patent Citations (1)
| Title |
|---|
| 基于事例推理的城市公共设施应急管理决策支持系统的研究;李赟;北京交通大学;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112686468A (en) | 2021-04-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7080065B1 (en) | Query pruning using interior rectangles in an R-tree index | |
| Papadias et al. | Qualitative representation of spatial knowledge in two-dimensional space | |
| US9336273B2 (en) | Range query methods and apparatus | |
| CN107766433B (en) | Range query method and device based on Geo-BTree | |
| US7239989B2 (en) | Within-distance query pruning in an R-tree index | |
| US7181467B2 (en) | Delayed distance computations for nearest-neighbor queries in an R-tree index | |
| CN106777351A (en) | Computing system and its method are stored based on ART tree distributed systems figure | |
| CN105630988A (en) | Method and system for rapidly detecting space data changes and updating data | |
| CN107515952A (en) | The method and its system of cloud data storage, parallel computation and real-time retrieval | |
| CN108009265B (en) | Spatial data indexing method in cloud computing environment | |
| CN113268557B (en) | Rapid spatial index method suitable for display-oriented visual analysis | |
| CN112035586A (en) | Spatial range query method based on extensible learning index | |
| CN103714124B (en) | Ultra-large-scale low-voltage data processing method | |
| CN113326343B (en) | Road network data storage method and system based on multi-level grids and file indexes | |
| CN112686468B (en) | Public facility stability optimization method | |
| Tian et al. | A learned index for exact similarity search in metric spaces | |
| Bao et al. | Mining non-redundant co-location patterns | |
| Faloutsos et al. | Analysis of n-dimensional quadtrees using the Hausdorff fractal dimension | |
| CN111080080B (en) | Village geological disaster risk prediction method and system | |
| Jones et al. | The implicit triangulated irregular network and multiscale spatial databases | |
| Alis et al. | Parallel processing of big point clouds using Z-Order-based partitioning | |
| CN116049521A (en) | Space-time data retrieval method based on space grid coding | |
| CN112380267B (en) | Community discovery method based on privacy graph | |
| Huang et al. | Processing continuous K-nearest skyline query with uncertainty in spatio-temporal databases | |
| Gorawski et al. | AEC algorithm: a heuristic approach to calculating density-based clustering Eps parameter |
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 | ||
| GR01 | Patent grant |