CN113656653B - Method and device for constructing network territory map and electronic equipment - Google Patents
Method and device for constructing network territory map and electronic equipment Download PDFInfo
- Publication number
- CN113656653B CN113656653B CN202111211648.XA CN202111211648A CN113656653B CN 113656653 B CN113656653 B CN 113656653B CN 202111211648 A CN202111211648 A CN 202111211648A CN 113656653 B CN113656653 B CN 113656653B
- Authority
- CN
- China
- Prior art keywords
- point
- coordinates
- coordinate
- map
- area
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/904—Browsing; Visualisation therefor
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/20—Network architectures or network communication protocols for network security for managing network security; network security policies in general
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/52—Network services specially adapted for the location of the user terminal
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Signal Processing (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Computing Systems (AREA)
- Computer Hardware Design (AREA)
- Software Systems (AREA)
- Processing Or Creating Images (AREA)
- Image Processing (AREA)
Abstract
The invention discloses a method and a device for constructing a network territory map and electronic equipment, wherein the method comprises the following steps: constructing initial classification data of region dimensions; generating initial map coordinates by the data based on sfdp undirected graph generation technology of grapeviz; after initial coordinate adjustment is carried out on the initial map coordinate, continuously adjusting the map coordinate subjected to the initial coordinate adjustment through the gvmap of the grapeviz; adjusting the coordinates of the continuously adjusted map coordinates according to the edge intersection in and among the areas; and overlapping and expanding the map coordinates after coordinate adjustment is carried out on the edge intersection in and among the areas by a Fast overlay Removal method, namely generating the territory map. The method comprises the steps of sequentially carrying out initial coordinate adjustment, continuity coordinate adjustment and edge crossing coordinate adjustment on data acquired by taking an area as a dimension, and finally, overlapping and expanding map coordinates by a Fast overlay Removal method to generate a network territory map, so that the network scale, the network relation and the main body association degree between networks can be well reflected.
Description
Technical Field
The invention relates to the technical field of data processing of network maps, in particular to a method and a device for constructing a network territory map and electronic equipment.
Background
With the continuous increase of network scale, the network distribution and relationship on the internet are complicated, the network is global and national, the influence on the internet ecology and the people life is far, and especially under the background that the network security problem is more and more, the management and maintenance of the network are more important.
The rapid laying of the 5G internet brings about explosive growth of network access equipment, service and application, and also brings about highly centralized network risks, and the rapid laying of the 5G internet is particularly important for systematic supervision of a network domain as a key facility for the operation of the internet. However, with the lack of supervision means and the increasing severity of security risks, how to effectively reflect the scale, location and distribution of networks and devices, describe network risks, and establish a set of visual maps describing the network territory is a huge challenge facing current enterprises, organizations and countries.
Disclosure of Invention
An object of the present invention is to solve at least the above problems and to provide at least the advantages described later.
The invention also aims to provide a construction method of the network territory map, which is characterized in that the initial coordinate adjustment, the continuity coordinate adjustment and the side crossing coordinate adjustment are sequentially carried out on the data acquired by taking the area as the dimensionality, and finally the map coordinates are overlapped and expanded by a Fast overlay Removal method to generate the network territory map, so that the network scale, the network relation and the main body relevance between the networks can be well reflected.
To achieve these objects and other advantages in accordance with the present invention, there is provided a method of constructing a network territory map, including:
constructing initial classification data of region dimensions;
generating initial map coordinates by the data based on sfdp undirected graph generation technology of grapeviz;
after the initial coordinate adjustment is carried out on the initial map coordinate, continuously adjusting the map coordinate subjected to the initial coordinate adjustment through the gvmap of the grapeviz;
adjusting the coordinates of the continuously adjusted map coordinates according to the edge intersection in and among the areas;
and overlapping and expanding the map coordinates after coordinate adjustment is carried out on the edge intersection in and among the areas by a Fast overlay Removal method, namely generating the territory map.
Preferably, in the method for constructing the network territory map, the initial coordinate of the initial map coordinate is adjusted through a continuity clustering adjustment algorithm of grapeviz.
Preferably, in the method for constructing a network territory map, the continuity adjustment of the map coordinates adjusted by the initial coordinates is performed through the gvmap of the grapeviz, and the method specifically includes:
obtaining the area center of the map coordinate after the initial coordinate adjustment by summing and averaging coordinate points in each area represented by the map coordinate after the initial coordinate adjustment;
creating a polygonal area based on the area center, and determining the edge and vertex coordinates of the polygonal area;
and after the polygon areas are subjected to de-overlapping and unfolding through a Fast overlay Removal method, adjusting coordinate points in each polygon area into the corresponding polygon area in a diagonal manner.
Preferably, in the method for constructing the network territory map, coordinate points of the map coordinates after the continuity adjustment are adjusted according to the edge intersection between the areas through an improved Impred algorithm based on the areas;
wherein the improved region Impred algorithm comprises:
defining the area represented by the map coordinates after the continuity adjustment as a new area, and calculating boundary points and boundary edges of the new areas;
acquiring coordinates of a target point in the new area, coordinates of a boundary point of the new area where the target point is located, other coordinates of the target point in the new area, and coordinates of coordinate points in other new areas related to the target point;
taking the coordinates of the boundary point of the new area where the target point is located, other coordinates in the new area where the target point is located, and coordinates of coordinate points in other new areas related to the target point as the surrounding information of the target point;
and based on the new region, the region boundary point and the surrounding information, the method is used as a calculation basis of an Impred algorithm, and the Impred algorithm is used for carrying out multi-region edge cross check and coordinate adjustment.
Preferably, in the method for constructing a network territory map, the improved region Impred algorithm further includes:
inputting all points of a plurality of regions, wherein the points comprise four vertexes of the regions, and selecting a point v in any region;
obtaining 1 third party point v2 of the point v, and judging whether v2 is empty;
if yes, reselecting the point v;
if not, judging whether the edge formed by the v to the v2 is crossed with other edges edge; if yes, acquiring all the points same as v2 in the same area, namely same _ v 2; if not, the third party point v2 of the point v is obtained again;
judging whether the same _ v2 is empty; if yes, a third party point v2 of the point v is obtained again; if not, judging whether a point v3 of the edge consisting of v to v2 and intersecting edge is contained in the same _ v 2;
if yes, the coordinates of v2 and v3 are exchanged, and then a third party point v2 of the point v is obtained again;
if not, calculating the direction of v2 on edge, and moving in the reverse direction of the direction to obtain a new coordinate point of v 2;
judging whether the edge formed by the new coordinate point of v2 and v2 intersects with the boundary of the area where v2 is located;
if yes, reducing the moving distance;
if not, after the coordinate point of v2 is updated by the new coordinate point of v2, whether the edge formed by v and the updated v2 intersects with edge is continuously judged.
A construction device of a network territory map comprises the following components:
the data construction module is used for constructing initial classification data of the region dimension;
the initial processing module is used for generating initial map coordinates by the data based on the sfdp undirected graph generation technology of the grapeviz;
the first coordinate adjusting module is used for carrying out initial coordinate adjustment on the initial map coordinate and then carrying out continuous adjustment on the map coordinate subjected to the initial coordinate adjustment through the gvmap of the grapeviz;
the second coordinate adjusting module is used for adjusting the coordinates of the continuously adjusted map coordinates according to the edge intersection in the area and between the areas;
and the map building module is used for overlapping and expanding the map coordinates after coordinate adjustment is carried out on the edge intersection in the region and between the regions by a Fast overlay Removal method, and then the territory map is generated.
An electronic device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, the processor implementing the steps of the method as described above when executing the computer program.
A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the method as set forth above.
The invention at least comprises the following beneficial effects:
the method for constructing the network territory map generates initial map coordinates by initial classification data of construction area dimensionality based on an sfdp undirected graph generation technology of grapeviz, then performs initial coordinate adjustment on the initial map coordinates, and performs continuity adjustment on the map coordinates subjected to the initial coordinate adjustment through a gvmap of the grapeviz; then, adjusting the coordinates of the continuously adjusted map according to the edge intersection in and among the areas; and finally, overlapping and expanding the map coordinates after coordinate adjustment aiming at the edge intersection in and among the areas by a Fast overlay Removal method, namely generating the territory map, filling the blank of constructing the network territory map, and better reflecting the network scale, the network relation and the main body association degree among the networks by the network territory map.
Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention.
Drawings
FIG. 1 is a flow chart of a method for constructing a network territory map according to the present invention;
FIG. 2 is a flow chart of the improved region Impred algorithm of the present invention;
FIG. 3 is an initial coordinate diagram generated by an sdfp undirected graph generation technique using grapeviz in an embodiment of the present invention;
FIG. 4 is a graph after adjustment by a modular clustering algorithm of grapeviz according to an embodiment of the present invention;
FIG. 5 is a graph illustrating continuous coordinate adjustment performed on the data shown in FIG. 3 according to an embodiment of the present invention;
FIG. 6 is a graph of improved region Impred adjustment and Fast overlay Removal de-Overlap and unfolding in accordance with an embodiment of the present invention;
FIG. 7 is a schematic structural diagram of a device for constructing a network territory map according to the present invention.
Detailed Description
The present invention is further described in detail below with reference to the attached drawings so that those skilled in the art can implement the invention by referring to the description text.
It will be understood that terms such as "having," "including," and "comprising," as used herein, do not preclude the presence or addition of one or more other elements or groups thereof.
As shown in fig. 1, the invention provides a method for constructing a network territory map, which comprises the following steps:
constructing initial classification data of region dimensions;
generating initial map coordinates by the data based on sfdp undirected graph generation technology of grapeviz;
after the initial coordinate adjustment is carried out on the initial map coordinate, continuously adjusting the map coordinate subjected to the initial coordinate adjustment through the gvmap of the grapeviz;
adjusting the coordinates of the continuously adjusted map coordinates according to the edge intersection in and among the areas;
and overlapping and expanding the map coordinates after coordinate adjustment is carried out on the edge intersection in and among the areas by a Fast overlay Removal method, namely generating the territory map.
In the scheme, initial map coordinates are generated by initial classification data for constructing regional dimensions based on an sfdp undirected graph generation technology of grapeviz, wherein the initial data can be IP data, IP asset data, AS data, other network data, region network related data and the like, and after initial coordinate adjustment is carried out on the initial map coordinates, the continuity adjustment is carried out on the map coordinates subjected to the initial coordinate adjustment through a gvmap of the grapeviz, gaps among the regions are removed, and the adjacent regions are kept; then, adjusting the coordinates of the continuously adjusted map according to the edge intersection in and among the areas; and finally, overlapping and expanding the map coordinates after coordinate adjustment aiming at the edge intersection in and among the areas by a Fast overlay Removal method, namely generating the territory map, filling the blank of constructing the network territory map, and better reflecting the network scale, the network relation and the main body association degree among the networks by the network territory map.
In a preferred embodiment, the initial coordinate adjustment is performed on the initial map coordinate by using a continuity clustering adjustment algorithm of grapeviz.
In the above scheme, the data acquired by taking the region as the dimension first needs to ensure the continuity of the region, so before further continuity coordinate adjustment is performed on the data, coordinate adjustment of an initial map coordinate is performed, and here, initial coordinate adjustment is preferably performed on the initial map coordinate by using a continuity cluster adjustment algorithm of grapeviz.
In a preferred embodiment, the continuously adjusting the map coordinates subjected to the initial coordinate adjustment by the gvmap of the grapeviz specifically includes:
obtaining the area center of the map coordinate after the initial coordinate adjustment by summing and averaging coordinate points in each area represented by the map coordinate after the initial coordinate adjustment;
creating a polygonal area based on the area center, and determining the edge and vertex coordinates of the polygonal area;
and after the polygon areas are subjected to de-overlapping and unfolding through a Fast overlay Removal method, adjusting coordinate points in each polygon area into the corresponding polygon area in a diagonal manner.
In the scheme, after summing and averaging coordinate points in each area represented by the map coordinate adjusted by the initial coordinate, the area center of the map coordinate adjusted by the initial coordinate is obtained; then, a polygonal area is created based on the area center, and the side and vertex coordinates of the polygonal area are determined; and finally, after the polygon areas are subjected to de-overlapping and unfolding through a Fast overlay Removal method, coordinate points in each polygon area are adjusted into the corresponding polygon area in a diagonal manner, and the continuity adjustment of the map coordinates subjected to the initial coordinate adjustment is completed, so that the problem of regional dispersion of data acquired by taking the areas as dimensions is solved, and the continuity of regional data is ensured.
In a preferred scheme, coordinate points of the map coordinates subjected to continuity adjustment are adjusted according to edge intersection among the regions through a region-based improved Impred algorithm;
wherein the improved region Impred algorithm comprises:
defining the area represented by the map coordinates after the continuity adjustment as a new area, and calculating boundary points and boundary edges of the new areas;
acquiring coordinates of a target point in the new area, coordinates of a boundary point of the new area where the target point is located, other coordinates of the target point in the new area, and coordinates of coordinate points in other new areas related to the target point;
taking the coordinates of the boundary point of the new area where the target point is located, other coordinates in the new area where the target point is located, and coordinates of coordinate points in other new areas related to the target point as the surrounding information of the target point;
and based on the new region, the region boundary point and the surrounding information, the method is used as a calculation basis of an Impred algorithm, and the Impred algorithm is used for carrying out multi-region edge cross check and coordinate adjustment.
In the above scheme, the coordinates of the intersecting edge points of the areas represented by the continuously adjusted map coordinates are adjusted by the improved area Impred algorithm, so that overlapped points or coordinates between adjacent areas can be removed, and irrelevant edge intersections are reduced, so that the boundaries between adjacent areas are clear and continuous.
In a preferred embodiment, as shown in fig. 2, the modified region Impred algorithm further includes:
inputting all points of a plurality of regions, wherein the points comprise four vertexes of the regions, and selecting a point v in any region;
obtaining 1 third party point v2 of the point v, and judging whether v2 is empty;
if yes, reselecting the point v;
if not, judging whether the edge formed by the v to the v2 is crossed with other edges edge; if yes, acquiring all the points same as v2 in the same area, namely same _ v 2; if not, the third party point v2 of the point v is obtained again;
judging whether the same _ v2 is empty; if yes, a third party point v2 of the point v is obtained again; if not, judging whether a point v3 of the edge consisting of v to v2 and intersecting edge is contained in the same _ v 2;
if yes, the coordinates of v2 and v3 are exchanged, and then a third party point v2 of the point v is obtained again;
if not, calculating the direction of v2 on edge, and moving in the reverse direction of the direction to obtain a new coordinate point of v 2;
judging whether the edge formed by the new coordinate point of v2 and v2 intersects with the boundary of the area where v2 is located;
if yes, reducing the moving distance;
if not, after the coordinate point of v2 is updated by the new coordinate point of v2, whether the edge formed by v and the updated v2 intersects with edge is continuously judged.
In the scheme, overlapped points or coordinates between adjacent regions can be effectively removed, so that irrelevant edge intersection is reduced, and the boundary between the adjacent regions is clear.
Examples
The construction method of the network territory map of the invention is adopted to construct a network territory map example, which specifically comprises the following steps:
1. initial coordinates: fig. 3 shows an initial coordinate graph generated by the sdfp undirected graph generation technique using grapeviz, where input data of the initial graph is network data, not limited to AS autonomous domain data, IP data, and network-related attribute data such AS ports, and is in units of areas, companies, or organizations. The present embodiment takes the area as a unit. The grapeviz data format is as follows, where cluster =1 is an area classification identifier, 1 represents an area number, label = "Node 1" represents a description of a point, fontsize =6 represents a font size of display point description information, pos = "100.1, 200.2" represents coordinates x and y of a point, and the detailed data of this embodiment is omitted:
Graph {
Node1 [cluster=1, label=’Node1’, fontsize=6, pos=”100.1, 200.2”]
……
}
2. clustering adjustment: the graph and the coordinates adjusted by the modular clustering algorithm of grapeviz are adopted, as shown in fig. 4, the region connectivity of the territory map is adjusted aiming at fig. 3 by adjusting the clustering parameters of the clustering algorithm, and the adjacency and large-area continuity between the regions are ensured. As shown in fig. 4, the areas in the figure are adjacent to each other, and the coordinates of points in the areas are basically in the areas, but the areas are included, overlapped and crossed.
3. After the continuous coordinate adjustment, as shown in fig. 5, the continuous coordinate adjustment of fig. 4 is performed to adjust the coordinates to the corresponding region mainly in a diagonal manner, so as to improve the overlapping, crossing and inclusion phenomena of the regions. The areas in the figure are kept adjacent, the coordinates of points in the areas are basically in the areas, the conditions that the areas are contained, overlapped and crossed are basically eliminated, and gaps, intervals and edge line crossing exist among the areas.
After the improved region Impred adjustment and Fast overlay Removal de-overlapping and unfolding, as shown in fig. 6, by checking and adjusting the edge lines of fig. 5 and de-overlapping and unfolding the coordinate points, the gaps and spaces between the regions can be eliminated, and the crossing condition of the edge lines can be improved. The method comprises the steps of reducing edge line intersection through an improved Impred algorithm based on a region, de-overlapping coordinate points through Fast overlay Removal, expanding the coordinate points and increasing the distance between the coordinate points.
As shown in fig. 7, a device for constructing a network territory map comprises:
the data construction module 1 is used for constructing initial classification data of region dimensions;
the initial processing module 2 is used for generating initial map coordinates by the data based on sfdp undirected graph generation technology of grapeviz;
the first coordinate adjusting module 3 is used for performing initial coordinate adjustment on the initial map coordinate and then performing continuity adjustment on the map coordinate subjected to the initial coordinate adjustment through the gvmap of the grapeviz;
the second coordinate adjusting module 4 is used for adjusting the coordinates of the continuously adjusted map coordinates according to the edge intersections in the areas and among the areas;
and the map building module 5 is used for overlapping and expanding the map coordinates after coordinate adjustment is carried out on the edge intersection in the region and between the regions by a Fast overlay Removal method, so that the territory map is generated.
In the scheme, initial classification data of regional dimensions are constructed through a data construction module, initial map coordinates are generated by an initial processing module on the basis of a grapeviz sfdp undirected graph generation technology, initial coordinate adjustment is carried out on the initial map coordinates through a first coordinate adjustment module, and then continuity adjustment is carried out on the map coordinates subjected to the initial coordinate adjustment through a gvmap of the grapeviz; then, the second coordinate adjusting module adjusts the coordinates of the continuously adjusted map coordinates according to the edge intersection in the area and between the areas; and finally, a map building module is used for overlapping through a Fast overlay Removal method and expanding map coordinates after coordinate adjustment is carried out on the edge intersection between the areas and the areas, namely, an area map is generated, the blank of constructing the network area map is filled, and the network scale, the network relation and the main body association degree between the networks are better reflected through the network area map.
An electronic device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, the processor implementing the steps of any of the methods as previously described when executing the computer program.
In the above scheme, the electronic device may be a robot. The electronic device may include, but is not limited to, a processor, a memory, for example, the electronic device may also include an input output device, a network access device, a bus, and the like. The processor may be a central processing unit, other general purpose processors, etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The memory may be an internal storage unit of the electronic device, such as a hard disk or a memory of the electronic device. The memory may also be an external storage device of the electronic device, such as a plug-in hard disk, a smart card, a secure digital card, a flash memory card, etc. provided on the electronic device.
A computer-readable storage medium, storing a computer program which, when executed by a processor, implements the steps of any one of the methods described above.
In the above solution, the memory may also include both an internal storage unit and an external storage device of the electronic device, and the memory is used for storing the computer program and other programs and data required by the electronic device.
While embodiments of the invention have been described above, it is not limited to the applications set forth in the description and the embodiments, which are fully applicable in various fields of endeavor to which the invention pertains, and further modifications may readily be made by those skilled in the art, it being understood that the invention is not limited to the details shown and described herein without departing from the general concept defined by the appended claims and their equivalents.
Claims (5)
1. A method for constructing a network territory map is characterized by comprising the following steps:
constructing initial classification data of region dimensions;
generating initial map coordinates by the data based on sfdp undirected graph generation technology of grapeviz;
after the initial coordinate adjustment is carried out on the initial map coordinate, continuously adjusting the map coordinate subjected to the initial coordinate adjustment through the gvmap of the grapeviz;
adjusting the coordinates of the continuously adjusted map coordinates according to the edge intersection in and among the areas;
overlapping and expanding map coordinates after coordinate adjustment is carried out on the edge intersection in and among the areas through a Fast overlay Removal method, namely generating a territory map;
performing initial coordinate adjustment on the initial map coordinate through a continuity clustering adjustment algorithm of the grapeviz;
continuously adjusting the map coordinates subjected to initial coordinate adjustment through the gvmap of the grapeviz, specifically including:
obtaining the area center of the map coordinate after the initial coordinate adjustment by summing and averaging coordinate points in each area represented by the map coordinate after the initial coordinate adjustment;
creating a polygonal area based on the area center, and determining the edge and vertex coordinates of the polygonal area;
after the polygon areas are subjected to de-overlapping and unfolding through a Fast overlay Removal method, coordinate points in each polygon area are adjusted to the corresponding polygon area in a diagonal manner;
adjusting coordinate points of the map coordinates subjected to continuity adjustment according to edge intersection among the regions through a region-based improved Impred algorithm;
wherein the region-based improved Impred algorithm comprises:
defining the area represented by the map coordinates after the continuity adjustment as a new area, and calculating boundary points and boundary edges of the new areas;
acquiring coordinates of a target point in the new area, coordinates of a boundary point of the new area where the target point is located, other coordinates of the target point in the new area, and coordinates of coordinate points in other new areas related to the target point;
taking the coordinates of the boundary point of the new area where the target point is located, other coordinates in the new area where the target point is located, and coordinates of coordinate points in other new areas related to the target point as the surrounding information of the target point;
and based on the new region, the region boundary point and the surrounding information, the method is used as a calculation basis of an Impred algorithm, and the Impred algorithm is used for carrying out multi-region edge cross check and coordinate adjustment.
2. The method of constructing a network territory map of claim 1, wherein the modified regional Impred algorithm further comprises:
step 1, inputting all points of a plurality of areas, wherein the points comprise four vertexes of the areas, and selecting a point v in any area;
step 2, the point v and the point v2 form an edge, and the point v2 is a third party point of the point v, so that a third party point v2 of the point v is obtained;
step 3, judging whether the third party point v2 is empty, if yes, executing the step 1 to reselect the point v; if not, executing the step 4;
step 4, judging whether the edge formed by the [ v, v2] is crossed with other edges edge, if not, executing the step 2 to obtain a third party point v2 of the point v again; if yes, executing step 5;
step 5, acquiring other points same as the point v2 in the same area, namely same _ v 2;
step 6, judging whether the same _ v2 is empty, if yes, executing step 2 to obtain a third party point v2 of the point v again; if not, executing step 7;
step 7, setting a point at which an edge formed by the point v to the point v2 and other edges are crossed as v3, judging whether the point v3 is contained in the same _ v2, and if so, executing a step 8; if not, executing step 9;
8, exchanging the coordinates of the point v2 and the point v3, and continuing to execute the step 2;
step 9, calculating the direction of the point v2 on the edge of the edge, and moving the point v2 according to the direction to obtain a new coordinate point of the point v 2;
step 10, judging whether the new and old coordinates of the point v2 and the area boundary of the point v2 are crossed, if so, executing step 11; if not, executing step 12;
step 11, reducing the moving distance of the midpoint v2 in the step 9 according to the direction, obtaining a new coordinate point v2 again, and continuing to execute the step 10;
and step 12, updating the coordinates of the point v2 and continuing to execute the step 4.
3. A device for constructing a network territory map is characterized by comprising:
the data construction module is used for constructing initial classification data of the region dimension;
the initial processing module is used for generating initial map coordinates by the data based on the sfdp undirected graph generation technology of the grapeviz;
the first coordinate adjusting module is used for carrying out initial coordinate adjustment on the initial map coordinate and then carrying out continuity adjustment on the map coordinate subjected to the initial coordinate adjustment through the gvmap of the grapeviz;
the second coordinate adjusting module is used for adjusting the coordinates of the continuously adjusted map coordinates according to the edge intersection in the area and between the areas;
the map building module is used for overlapping by a Fast overlay Removal method and expanding map coordinates after coordinate adjustment is carried out on the edge intersection in and among the areas, namely, a territory map is generated;
performing initial coordinate adjustment on the initial map coordinate through a continuity clustering adjustment algorithm of the grapeviz;
continuously adjusting the map coordinates subjected to initial coordinate adjustment through the gvmap of the grapeviz, specifically including:
obtaining the area center of the map coordinate after the initial coordinate adjustment by summing and averaging coordinate points in each area represented by the map coordinate after the initial coordinate adjustment;
creating a polygonal area based on the area center, and determining the edge and vertex coordinates of the polygonal area;
after the polygon areas are subjected to de-overlapping and unfolding through a Fast overlay Removal method, coordinate points in each polygon area are adjusted to the corresponding polygon area in a diagonal manner;
adjusting coordinate points of the map coordinates subjected to continuity adjustment according to edge intersection among the regions through a region-based improved Impred algorithm;
wherein the region-based improved Impred algorithm comprises:
defining the area represented by the map coordinates after the continuity adjustment as a new area, and calculating boundary points and boundary edges of the new areas;
acquiring coordinates of a target point in the new area, coordinates of a boundary point of the new area where the target point is located, other coordinates of the target point in the new area, and coordinates of coordinate points in other new areas related to the target point;
taking the coordinates of the boundary point of the new area where the target point is located, other coordinates in the new area where the target point is located, and coordinates of coordinate points in other new areas related to the target point as the surrounding information of the target point;
and based on the new region, the region boundary point and the surrounding information, the method is used as a calculation basis of an Impred algorithm, and the Impred algorithm is used for carrying out multi-region edge cross check and coordinate adjustment.
4. An electronic device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the steps of the method according to any of claims 1 to 2 are implemented when the computer program is executed by the processor.
5. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111211648.XA CN113656653B (en) | 2021-10-18 | 2021-10-18 | Method and device for constructing network territory map and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111211648.XA CN113656653B (en) | 2021-10-18 | 2021-10-18 | Method and device for constructing network territory map and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113656653A CN113656653A (en) | 2021-11-16 |
| CN113656653B true CN113656653B (en) | 2022-02-18 |
Family
ID=78484208
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111211648.XA Active CN113656653B (en) | 2021-10-18 | 2021-10-18 | Method and device for constructing network territory map and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113656653B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7983949B1 (en) * | 2005-10-27 | 2011-07-19 | Google Inc. | System and method for selecting targeted information for serving with a map view |
| CN107817802A (en) * | 2017-11-09 | 2018-03-20 | 北京进化者机器人科技有限公司 | The construction method and device of hybrid double-layer map |
| CN112612933A (en) * | 2021-01-05 | 2021-04-06 | 同方知网(北京)技术有限公司 | Classified data visualization method |
-
2021
- 2021-10-18 CN CN202111211648.XA patent/CN113656653B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7983949B1 (en) * | 2005-10-27 | 2011-07-19 | Google Inc. | System and method for selecting targeted information for serving with a map view |
| CN107817802A (en) * | 2017-11-09 | 2018-03-20 | 北京进化者机器人科技有限公司 | The construction method and device of hybrid double-layer map |
| CN112612933A (en) * | 2021-01-05 | 2021-04-06 | 同方知网(北京)技术有限公司 | Classified data visualization method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113656653A (en) | 2021-11-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Pu et al. | A three‐dimensional distance transform for optimizing constrained mountain railway alignments | |
| Justo et al. | Scan-to-BIM for the infrastructure domain: Generation of IFC-compliant models of road infrastructure assets and semantics using 3D point cloud data | |
| CN106530170B (en) | Boundary optimization method for regional ecological protection red line | |
| Murray et al. | A computational approach for eliminating error in the solution of the location set covering problem | |
| EP4116935B1 (en) | High-definition map creation method and device, and electronic device | |
| Yang et al. | A map‐algebra‐based method for automatic change detection and spatial data updating across multiple scales | |
| CN112329789B (en) | Point cloud extraction method and device, computer equipment and storage medium | |
| CN113704583B (en) | Coordinate continuity adjusting method and device for network territory map | |
| Pilehforooshha et al. | An integrated framework for linear pattern extraction in the building group generalization process | |
| CN113656653B (en) | Method and device for constructing network territory map and electronic equipment | |
| KR102130922B1 (en) | 3D Solid Cut / Fill Terrain and Corridor Structure Objects by Station by Automatic Extraction of Station and Object Information by Location of 3D Surface Terrain and Corridor Structures Automatic conversion and quantity automatic generation system and method | |
| Li et al. | An area merging method in map generalization considering typical characteristics of structured geographic objects | |
| Basaraner | A zone-based iterative building displacement method through the collective use of Voronoi Tessellation, spatial analysis and multicriteria decision making | |
| He et al. | Contour line simplification method based on the two‐level Bellman–Ford algorithm | |
| CN110569546A (en) | Traffic cell division method and device | |
| Siejka et al. | Correction of topological errors in geospatial databases | |
| Du | Construction cost simulation based on artificial intelligence and BIM | |
| CN111199357B (en) | Express delivery point electronic fence diagnosis method and device | |
| Graser | Tessellating urban space based on street intersections and barriers to movement | |
| Held et al. | Creating electrical distribution boundaries using computational geometry | |
| CN112686468A (en) | Public facility stability optimization method | |
| CN111368468A (en) | Method for solving two-dimensional boundary of centralized village based on mathematical method and programming algorithm | |
| Xu et al. | An automatic boundary tracking algorithm for Rural Buildings Based on Row and Column Searching Method | |
| CN117723073B (en) | Elevation adjustment method, apparatus, device, storage medium, and computer program product | |
| CN103186709B (en) | A kind of method and system determining risk value of security incident |
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 |