Reference network-based geospatial network edge connection path re-planning method

Abstract

The invention provides a geospatial network edge connection path re-planning method based on a reference network, and relates to the technical field of cyberspace geography. The method comprises the following steps: preprocessing geographic space network data; constructing a vector reference network; and carrying out edge connection layout on the preprocessed geographic space network data based on the vector reference network. According to the method, on the basis of the pre-constructed reference network, the visual layout of the connection edges of the geographic space network can be realized, so that the visual disorder problem caused by a large-scale dense graph is effectively reduced, and the main body structure characteristics of the geographic space network can be recognized from the macroscopic category.

Description

Technical Field

[0001] The present invention relates to the fields of geographic information visualization, network information visualization and cyberspace geography technology, and in particular to a method for replanning geospatial network edge paths based on a reference network. Background Art

[0002] With the continuous expansion of human activity space and the rapid development of various information technologies, modern society has built a huge geographic space network, such as Figure 1 For example, the geo-social network formed by coupling the social relationship network with the geographic location data, the geo-network space formed by combining the cyberspace with the geographic space, the flow space network formed by the flow of people, logistics and information based on information technology, and the geo-geometric network formed by a group of interconnected nodes and edges. Understanding and recognizing the geo-spatial network plays a very important role in mining spatial association patterns and exploring spatial association laws.

[0003] A geospatial network is essentially composed of nodes V with spatial locations. i} and edge E={e i}, with the increase of the number of nodes |V| and the number of edges |E|, |E|>>|V|. However, the complex association relationship in large-scale dense graphs will lead to serious visual confusion, making it difficult to distinguish the association pattern and network structure, which is not conducive to exploring and mining the rules hidden behind the association big data. The main way to solve this problem is to keep the node position unchanged and continuously adjust the edge E={e| through the edge layout algorithm. i}, so that the edges with similar indicators are close to each other, thereby alleviating the visual confusion problem and discovering the main link paths and association patterns of the association network. Although the edge layout can alleviate the visual confusion problem of the geospatial network to a certain extent under the premise of ensuring the fixed node position, the existing edge layout method mainly adjusts the control point position based on spatial aesthetic standards, without considering the spatial distribution characteristics and network structure characteristics of the geospatial network, which is not conducive to exploring the connection and mechanism between the geospatial network and the geospatial environment and human behavior activities. Summary of the invention

[0004] In order to solve the problem of visual confusion caused by complex associations in geospatial networks, the present invention proposes a geospatial network edge path replanning method based on a reference network. Based on a pre-constructed reference network, the method can realize the visual layout of geospatial network edges through edge clustering, edge layout, edge smoothing and other processes, thereby effectively reducing the visual confusion problem caused by large-scale dense maps, and facilitating the recognition of the main structural characteristics of the geospatial network from a macro perspective.

[0005] In one aspect, the present invention provides a method for replanning a geospatial network edge path based on a reference network, comprising:

[0006] Step 1: Preprocessing of geospatial network data;

[0007] Step 2: Build a vector reference network;

[0008] Step 3: Perform edge layout on the pre-processed geospatial network data based on the vector reference network.

[0009] Furthermore, step 1 specifically includes: performing coordinate conversion processing on the geospatial network data and removing or completing duplicate values, default values ​​and attribute data in the geospatial network data.

[0010] Furthermore, the removal or completion of duplicate values, default values ​​and attribute data in the geospatial network data specifically includes:

[0011] Identify network space entities with the same name based on the similarity between network space entities in the geospatial network in terms of spatial location distance, attribute field information and topological connection relationship;

[0012] For a network space entity with incomplete attribute field information, if there is a corresponding network space entity with the same name, the attribute field information of the network space entity with the same name is used to supplement it; otherwise, the incomplete attribute field information in the network space entity is deleted;

[0013] For a cyberspace entity that lacks spatial location information, if its attribute field information contains place name information describing the cyberspace entity, the coordinates are matched through the place name information to complete the spatial location information of the cyberspace entity.

[0014] Furthermore, step 2 specifically includes: selecting the required vector reference network and simplifying the selected vector reference network data; thinning the vector reference network structure after data simplification; establishing a translation field for the vector reference network after the structure is thinned, and the translation field is used to indicate the movement direction of the edge control point approaching the vector reference network, and the edge control point refers to the point on the edge path of the geographic spatial network except the starting node and the ending node.

[0015] Furthermore, the simplification of the selected vector reference network data specifically includes: searching and constructing a path of the vector reference network according to the degree of each node in the selected vector reference network, and simplifying each searched path based on the Douglas-Peucker algorithm.

[0016] Furthermore, the thinning of the vector reference network structure after data simplification specifically includes:

[0017] Define the vector reference network G R Middle node v i and v j The correlation strength ω(i,j) between them is calculated, and the vector reference network G is calculated. R Any node v i The total strength of association S i :

[0018] ω(i,j)=ω ij +ω ji

[0019]

[0020] Among them, G R =(V R ,E R ), ω(i,j)=ω(j,i), ω ij and ω ji Respectively represent the edge e ij and edge ji The weight of ij ,e ji ∈E R ;

[0021] Define spatial compactness T ij , and according to the spatial compactness T ij and information entropy f(i,k) to define a network structure filter function to select data from the vector reference network; wherein the network structure filter function is from the node v i Start by iterating and adding k nodes v i The edges that are related and have high spatial density are selected, and the information entropy f(i,k) is calculated until the information entropy f(i,k) value is greater than the threshold ε, and all other edges are removed;

[0022]

[0023]

[0024] Among them, d ij For node v i and v j The spatial distance between them; α is the preset spatial distance damping coefficient.

[0025] Furthermore, the establishment of a translation field for the vector reference network after structural thinning specifically includes:

[0026] Generate a buffer zone Ω with a radius of σ around the vector reference network to serve as the layout and drawing area of ​​the edge control points;

[0027] Assume ei ∈E is the edge path of the geospatial network, e j ∈E R is the edge path of the vector reference network, for the edge path e i Any edge control point on By calculating its edge path e according to the following formula j The characteristic transformation points on To construct the translation field;

[0028]

[0029] Where λ(v) is the distance between node v and the starting point v of the edge to which it is connected. s The arc length distance, and They represent the edge path diameter e i and e j The end node of .

[0030] Furthermore, step 3 specifically includes:

[0031] Determine in the vector reference network the reference network path that needs to be approached corresponding to each edge path in the geospatial network;

[0032] Displace the connected control points in the preprocessed geospatial network so that they are located in the buffer zone Ω;

[0033] According to the translation field, the edge control points are adjusted to the corresponding reference network paths for position transformation to realize the layout of the geospatial network connection paths, and the laid out edge paths are smoothed.

[0034] Further, the connection control point v is calculated according to the following formula i The position of the position transformation

[0035]

[0036] Among them, β∈[0,1] is the control parameter. The larger the β value is, the closer the edge control point is to the vector reference network. d is the distance calculation function between two points. σ is the buffer radius of the vector reference network. i Represents the connection control point v i The position before the position change.

[0037] Furthermore, the edge path after layout is smoothed according to the following formula:

[0038]

[0039] Among them, p′ j and p jThey represent the positions of the jth edge control point before and after smoothing, s is a rigid parameter, the smaller its value, the smoother the edge layout result; N is the edge path e i The number of edge control points on , and They represent the edge paths e i The positions of the starting and ending nodes.

[0040] On the other hand, the present invention provides a reference network-based geospatial network edge path replanning system, including a data preprocessing module, a reference network construction module and an edge layout module;

[0041] A data preprocessing module, used to preprocess geospatial network data;

[0042] A reference network building module, used to build a vector reference network;

[0043] The edge layout module is used to perform edge layout on the pre-processed geospatial network data based on the vector reference network.

[0044] Beneficial effects of the present invention:

[0045] The edge path replanning method and system provided by the present invention can take into account the spatial distribution characteristics and network structure characteristics of the geospatial network, based on a pre-constructed reference network, through edge clustering, edge layout, edge smoothing and other processes, to achieve the visual layout of the geospatial network edges, thereby effectively reducing the visual confusion problem caused by large-scale dense maps, and is conducive to recognizing the main structural characteristics of the geospatial network from a macro perspective. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] Figure 1 A schematic diagram of a geospatial network provided by an embodiment of the present invention;

[0047] Figure 2 A schematic diagram of a flow chart of a method for replanning a geospatial network edge path based on a reference network provided by an embodiment of the present invention;

[0048] Figure 3 A vector reference network path simplification flow chart provided by an embodiment of the present invention;

[0049] Figure 4 A vector reference network translation field provided by an embodiment of the present invention;

[0050] Figure 5 This is a structural block diagram of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0051] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution in the embodiment of the present invention will be clearly described below in conjunction with the drawings in the embodiment of the present invention. Obviously, the described embodiment is a part of the embodiment of the present invention, not all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0052] The present invention provides a method for replanning the edge paths of a geospatial network based on a reference network. The method mainly realizes the edge path replanning of the geospatial network on the basis of taking into account the network structure characteristics and spatial distribution characteristics through key links such as geospatial network data preprocessing, reference network construction, and network edge layout. The method thus highlights the network skeleton structure characteristics and effectively alleviates the visual confusion problem caused by complex edge interweaving.

[0053] To achieve the above objectives, the overall technical solution adopted by the embodiment of the present invention is as follows: Figure 2 The specific process is as follows:

[0054] S101: Preprocessing the geospatial network data; specifically, including: performing coordinate conversion processing on the geospatial network data and removing or completing duplicate values, default values ​​and attribute data in the geospatial network data;

[0055] Specifically, the spatial reference of the data is unified through spatial coordinate conversion. Specifically, since the subsequent edge position translation needs to be performed in a plane rectangular coordinate system, the longitude and latitude coordinates of the geospatial network need to be converted into projection coordinates. For the geospatial network, since the edge is associated with the start node and the end node by reference, it is only necessary to convert the longitude and latitude coordinates of the node, that is, Convert to rectangular coordinates (x,y).

[0056] The elimination or completion of geospatial network data mainly involves the elimination or completion of data with duplicate nodes and edges (P1), incomplete attribute field information (P2), and missing spatial location information (P3), and the logical consistency of the data is checked based on the data structure characteristics of the graph model. It mainly includes the following processes:

[0057] For case P1, the network space entities with the same name are identified based on the similarity between the network space entities in the geospatial network in terms of spatial location distance, attribute field information, and topological connection relationship.

[0058] For cases P2 and P3, for cyberspace entities with incomplete attribute field information, if there is a corresponding cyberspace entity with the same name, the attribute field information of the cyberspace entity with the same name is used to supplement it; otherwise, the incomplete attribute field information in the cyberspace entity is deleted; in addition, for case P3, for cyberspace entities that lack spatial location information, if there is place name information describing the cyberspace entity in its attribute field information, the coordinates are matched through the place name information to complete the spatial location information of the cyberspace entity.

[0059] S102: constructing a vector reference network; specifically comprising: selecting a required vector reference network, simplifying the selected vector reference network data; thinning the vector reference network structure after data simplification, removing less important nodes and edges; generating a buffer zone of a specific radius for the vector reference network after the structure is thinned to establish a translation field, wherein the translation field is used to indicate the direction of movement of an edge control point approaching the vector reference network, wherein the edge control point refers to a point on the edge path of the geographic spatial network other than a start node and an end node.

[0060] S103: Performing edge layout on the preprocessed geospatial network data based on the vector reference network; specifically comprising: determining in the vector reference network the reference network path that needs to be approached corresponding to each edge path in the geospatial network, that is, finding a corresponding connection path in the reference network for each path in the geospatial network, to prepare for subsequent edge layout; displacing the connection control points in the preprocessed geospatial network so that they are located in the buffer zone; adjusting the position of the edge control points to the corresponding reference network paths according to the translation field to realize the layout of the geospatial network connection paths, and smoothing the laid out edge paths.

[0061] The reference network-based geospatial network edge path replanning method provided in an embodiment of the present invention can realize the visual layout of geospatial network edges through edge clustering, edge layout, edge smoothing and other processes on the basis of a pre-constructed vector reference network, thereby effectively reducing the visual confusion problem caused by large-scale dense maps, and is conducive to recognizing the main structural characteristics of the geospatial network from a macro perspective.

[0062] In one embodiment, the degree of similarity of the spatial position distance can be referred to Formula 1:

[0063]

[0064] The similarity judgment of attribute field information needs to be based on the hybrid attribute similarity method. The specific calculation method can be referred to Formula 2:

[0065]

[0066] in, Represents the kth attribute of the cyberspace entity x i and x j When k is a categorical attribute or a binary attribute, compare x i and x j In the value of the kth attribute, if they are equal, then otherwise When k is a numeric attribute, calculate the maximum and minimum values ​​of the kth attribute, then When k is a character attribute, the proportion of the same number of characters is calculated.

[0067] The similarity of topological connection relationships can be judged based on the degree or centrality index of the node.

[0068] In one embodiment, a geographic geometric network is used as a vector reference network. It can be understood that the vector reference network G R =(V R ,E R ) is essentially a graph structure, but E R It is a path composed of edges connected end to end. Except for the first and last points, the intermediate node degrees of the path are all 2. Therefore, according to this feature, the embodiment of the present invention searches and constructs the path of the vector reference network by node degree, and simplifies each path based on the Douglas Peucker (DP) algorithm. The process is as follows: Figure 3 shown.

[0069] First, according to the input vector reference network G R =(V R ,E R ) Build a "point-chain" topology structure, record the start and end nodes of each chain, and the list of chains passing through the nodes. Then, calculate and record the degree of each node. Again, start traversing from any node whose degree is not equal to 2, and perform a path search until the next node whose degree is not equal to 2, build a path and remove the nodes in the path from the node set. After the traversal is completed, determine whether the node set is empty. If it is empty, it means that all path searches are completed, and the traversed path set can be compressed according to the Douglas-Peucker algorithm; otherwise, it means that the remaining nodes in the set should all belong to closed paths, and the path search can be started from any node until the node is reached again.

[0070] In one embodiment, a thinning method that takes into account the spatial distribution characteristics and topological structure characteristics of the associated network (i.e., the geospatial network that requires edge path replanning) is used to simplify the structure of the vector reference network to facilitate subsequent edge clustering and displacement processing.

[0071] Definition ij and e ji The weights are ω ij and ω ji , then node v i and v j The strength of the association is defined as:

[0072] ω(i,j)=ω(j,i)=ω ij +ω ji (3)

[0073] will pass through node v i The sum of the weights of all edges of node v is defined as i The total strength of association:

[0074]

[0075] On the basis of network association strength, a spatial damping function is added to characterize the characteristic that the association strength between geographic elements or entities gradually decays with the increase of spatial distance, that is, the spatial density is obtained:

[0076]

[0077] Among them, d ij For node v i and v j α is the preset spatial distance damping coefficient, and its value is related to the semantic characteristics of the association network. For example, through massive data verification, the α value of social association networks is generally 0.5.

[0078] In order to facilitate the selection of data of the vector reference network, the embodiment of the present invention combines the spatial density T based on information entropy. ij , define the network structure filter function to select data from the vector reference network:

[0079]

[0080] The filter function This means that from node v i Start by iterating and adding k nodes v i The edges with high spatial density are selected and the information entropy f(i,k) is calculated until the value is greater than the threshold ε, and all other edges are removed.

[0081] In one embodiment, in order to facilitate the implementation of edge layout, this embodiment uses the following process to establish a translation field for the vector reference network after structural thinning. First, a buffer zone Ω is generated around the vector reference network with a radius of σ as the layout and drawing area of ​​the edge control points. The buffer zone Ω is:

[0082] Ω={p∈R 2 |d(p,G R )≤σ} (7)

[0083] Where p is any point in the buffer region Ω, d(p,G R ) represents the distance from p to the vector reference network, σ is the buffer radius, and the subsequent edge layout processing needs to be completed within the buffer Ω.

[0084] like Figure 4 As shown, let e i ∈E is the edge path of the associated network to be processed for layout, e j ∈E R The edge path of the vector reference network is a translation field established between the two to adjust the movement of the control point. i Any edge control point v on i x , by calculating its edge path e according to the following formula j The characteristic transformation points on To construct the translation field;

[0085]

[0086] Where λ(v) is the distance between node v and the starting point v of the edge to which it is connected. s The arc-length distance (arc-length), and They represent the edge path diameter e i and e j The terminal node

[0087] By calculating the characteristic transformation points corresponding to the edge control points, the translation field of the vector reference network can be constructed. The control point is translated in the direction of .

[0088] In one embodiment, the vector reference network path search is to determine the reference network path that each edge of the geospatial network needs to be close to. First, it is necessary to search for the vector reference network node that is closest to the start node and the end node of each edge of the geospatial network; then, the shortest path of the vector reference network is obtained according to the shortest path search algorithm as the reference network path that the current edge needs to be close to.

[0089] In one embodiment, based on the vector reference network translation field, a control point translation position model is constructed so that the control points are arranged within the buffer area Ω, and the compactness of the edge layout is regulated by a simple position parameter α. i The spatial position calculation model is:

[0090]

[0091] Among them, β∈[0,1] is a control parameter. The larger the value, the closer the edge control point (or its edge path) is to the vector reference network; d is the distance calculation function between two points; σ is the buffer radius of the vector reference network, p i Represents the connection control point v i The position before the position change.

[0092] Path replanning based on the vector reference network may lead to the so-called "skeleton effect", that is, a rigid spatial network structure is produced visually, which does not meet the requirements of spatial aesthetic standards and also destroys the continuity of the geographic spatial network in spatial perception. In one embodiment, the following model is used to smooth the edges after layout:

[0093]

[0094] Among them, p′ j and p j They represent the positions of the jth edge control point before and after smoothing, s is a rigid parameter, the smaller its value, the smoother the edge layout result; N is the edge path e i The number of edge control points on , and They represent the edge paths e i The positions of the starting and ending nodes.

[0095] Figure 5 An example of a physical structure diagram of an electronic device is shown in FIG. Figure 5 As shown, the electronic device may include: a processor 501, a communication interface 502, a memory 503 and a communication bus 504, wherein the processor 501, the communication interface 502 and the memory 503 communicate with each other through the communication bus 504. The processor 501 may call the logic instructions in the memory 503 to execute the edge path replanning method, which includes: step 1: preprocessing the geospatial network data; step 2: constructing a vector reference network; step 3: performing edge layout on the preprocessed geospatial network data based on the vector reference network.

[0096] In addition, when the logic instructions in the above-mentioned memory 503 are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0097] An embodiment of the present invention also provides a computer program product, which includes a computer program stored on a non-transitory computer-readable storage medium, and the computer program includes program instructions. When the program instructions are executed by a computer, the computer can execute the methods provided by the above-mentioned method embodiments, for example, including: Step 1: preprocessing geospatial network data; Step 2: constructing a vector reference network; Step 3: performing edge layout on the preprocessed geospatial network data based on the vector reference network.

[0098] An embodiment of the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the methods provided by the above-mentioned method embodiments are implemented, for example, including: Step 1: preprocessing the geospatial network data; Step 2: constructing a vector reference network; Step 3: performing edge layout on the preprocessed geospatial network data based on the vector reference network.

[0099] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0100] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for replanning edge paths of a geospatial network based on a reference network, characterized in that: include: Step 1: Preprocessing of geospatial network data; Step 2: Build a vector reference network; Step 3: Perform edge layout on the pre-processed geospatial network data based on the vector reference network.

2. According to the method for replanning the edge paths of a geographic space network based on a reference network according to claim 1, it is characterized in that: Step 1 specifically includes: performing coordinate conversion processing on the geospatial network data and removing or completing duplicate values, default values ​​and attribute data in the geospatial network data.

3. The method for replanning the edge paths of a geographic space network based on a reference network according to claim 2, characterized in that: The removal or completion of duplicate values, default values ​​and attribute data in the geospatial network data specifically includes: Identify network space entities with the same name based on the similarity between network space entities in the geospatial network in terms of spatial location distance, attribute field information and topological connection relationship; For a network space entity with incomplete attribute field information, if there is a corresponding network space entity with the same name, the attribute field information of the network space entity with the same name is used to supplement it; otherwise, the incomplete attribute field information in the network space entity is deleted; For a cyberspace entity that lacks spatial location information, if its attribute field information contains place name information describing the cyberspace entity, the coordinates are matched through the place name information to complete the spatial location information of the cyberspace entity.

4. The method for replanning geospatial network edge paths based on a reference network according to claim 1, characterized in that: Step 2 specifically includes: selecting the required vector reference network and simplifying the selected vector reference network data; thinning the vector reference network structure after data simplification; establishing a translation field for the vector reference network after the structure is thinned, and the translation field is used to indicate the movement direction of the edge control point approaching the vector reference network. The edge control point refers to a point on the edge path of the geographic spatial network other than the starting node and the ending node.

5. The method for replanning the edge paths of a geographic space network based on a reference network according to claim 4, characterized in that: The simplification of the selected vector reference network data specifically includes: searching and constructing the path of the vector reference network according to the degree of each node in the selected vector reference network, and simplifying each searched path based on the Douglas-Peucker algorithm.

6. The method for replanning the edge paths of a geographic space network based on a reference network according to claim 4, characterized in that: The thinning of the vector reference network structure after data simplification specifically includes: Define the vector reference network G R Middle node v i and v j The correlation strength ω(i,j) between them is calculated, and the vector reference network G is calculated. R Any node v i The total strength of association S i : ω(i,j)=ω ij +oh ji Among them, G R =(V R ,E R ), ω(i,j)=ω(j,i), ω ij and ω ji Respectively represent the edge e ij and edge ji The weight of ij ,e ji ∈E R ; Define spatial compactness T ij , and according to the spatial compactness T ij and information entropy f(i,k) to define a network structure filter function to select data from the vector reference network; wherein the network structure filter function is from the node v i Start by iterating and adding k nodes v i The edges that are related and have high spatial density are selected, and the information entropy f(i,k) is calculated until the information entropy f(i,k) value is greater than the threshold ε, and all other edges are removed; Among them, d ij For node v i and v j The spatial distance between them; α is the preset spatial distance damping coefficient.

7. The method for replanning geospatial network edge paths based on a reference network according to claim 4, characterized in that: The establishment of a translation field for the vector reference network after structural thinning specifically includes: Generate a buffer zone Ω with a radius of σ around the vector reference network to serve as the layout and drawing area of ​​the edge control points; Assume e i ∈E is the edge path of the geospatial network, e j ∈E R is the edge path of the vector reference network, for the edge path e i Any edge control point on By calculating its edge path e according to the following formula j The characteristic transformation points on To construct the translation field; Where λ(v) is the distance between node v and the starting point v of the edge to which it is connected. s The arc length distance, and They represent the edge path diameter e i and e j The end node of .

8. The method for replanning the edge paths of a geographic space network based on a reference network according to claim 7, characterized in that: Step 3 specifically includes: Determine in the vector reference network the reference network path that needs to be approached corresponding to each edge path in the geospatial network; Displace the connected control points in the preprocessed geospatial network so that they are located in the buffer zone Ω; According to the translation field, the edge control points are adjusted to the corresponding reference network paths for position transformation to realize the layout of the geospatial network connection paths, and the laid out edge paths are smoothed.

9. The method for replanning the edge paths of a geographic space network based on a reference network according to claim 8, characterized in that: The connection control point v is calculated as follows i The position of the position transformation Among them, β∈[0,1] is the control parameter. The larger the β value is, the closer the edge control point is to the vector reference network. d is the distance calculation function between two points. σ is the buffer radius of the vector reference network. i Represents the connection control point v i The position before the position change.

10. The method for replanning geospatial network edge paths based on a reference network according to claim 8, characterized in that: The edge path after layout is smoothed according to the following formula: Among them, p′ j and p j They represent the positions of the jth edge control point before and after smoothing, s is a rigid parameter, the smaller its value, the smoother the edge layout result; N is the edge path e i The number of edge control points on , and They represent the edge paths e i The positions of the starting and ending nodes.

Images