CN108090134B - Management map expression method based on virtual and real POI tree - Google Patents

Abstract

The invention discloses a management map expression method based on a virtual POI tree and a real POI tree, which is characterized in that the virtual POI tree and the real POI tree are defined as a tree structure set which is provided with virtual POI nodes and real POI hanging connection at the same time, wherein the virtual POI nodes are nodes with one or more real POI aggregations with the same attribution, and each real POI represents a sensor device, a control node and other real signal points which are actually used. Has the advantages that: the POI is expressed by using a virtual tree instead of a list/array in combination with the multi-dimensional content of the POI and the multi-level structure of the electronic map, so that the map display problem of the complex POI is fundamentally solved, the speed and the effect of displaying the POI are greatly improved, each virtual POI node can look up the total number of all real POI managed or controlled under the virtual POI node and the number of each different type, the portable supervision statistics is realized, and the display speed is greatly increased.

Description

Management map expression method based on virtual and real POI tree

Technical Field

The invention relates to the technical field of POI (point of interest) management maps, in particular to a management map expression method based on a virtual and real POI tree.

Background

POI (Point of Interest) is one of the most important display parts of the electronic map, and is characterized by mass data and various types, and how to quickly display and locate related POI becomes an important chip for the successful application of the electronic map.

The existing electronic management map has the defects that: the prior electronic management map takes POI as a basic point to search and process, does not consider the display of the map, but does have hierarchy, does not consider the hierarchy problem of the POI, and can not express POI data of mixed hierarchy, which is particularly important in the vertical application field, such as a city security system and a forestry alarm system.

Disclosure of Invention

The invention aims to provide a management map expression method based on a virtual and real POI tree by combining the multi-dimensional content of the POI and the multi-level structure of an electronic map, and the POI is expressed by using the virtual and real POI tree instead of a list/array, so that the map display problem of complex POI is fundamentally solved, and the speed and the effect of displaying the POI are greatly improved.

In order to achieve the purpose, the invention adopts the following specific technical scheme:

a management map expression method based on a virtual POI tree and a real POI tree is firstly defined as a tree structure set which is provided with virtual POI nodes and real POI hanging connection at the same time, wherein the virtual POI nodes are nodes with one or more real POI aggregation with the same attribution, and each real POI represents a sensor device, a control node and other real signal points which are actually used;

each virtual POI node can refer to the total number of all real POIs governed or controlled under it and the number of each different type, enabling portable supervision statistics and a greatly increased display speed.

Further, the method includes a virtual and real POI tree generation method a and a generated display method B, where the generation method a specifically includes the following steps:

a1, inputting a real POI set V to an initial map M0, wherein each real POI in the set V is a real node managed by a current region and is provided with type and region attributes;

building administrative tree E ═ E₁，e₂，…，e_iIn which e_iRepresenting the administrative region of the current region, establishing a map hierarchy table D of the tree E_map＝{D₁，D₂，…，D_jJ is less than or equal to i, wherein D_j＝[a_j，b_j]Then the map hierarchy table D_mapEach element D_jDenotes e_iAt the corresponding map level b_jAdministrative district rating a displayed within range_j，D_jGenerally empirical data, e.g. [1, 1-4 ]]、[2，5-8]、[3，9-12]、[4，13-16]、[5，16-20]；

A2, creating set E_newCopy the contents of the tree E to the set E one by one_newIs a union of set E_newEach node e of_newAdding virtual attribute, node e_newNamely the virtual POI nodes are obtained;

a3, hanging each real POI of the set V to a node e of a corresponding attribution_newThe above step (1);

a4, update set E_new: statistics of each node e_newIf the node is empty and has no real POI to be directly or indirectly connected, deleting the node;

a5, output set E_newSaid set E_newI.e. a virtual-real POI tree, the initial map M0 becomes the base map M1.

Through the design, each real POI is correspondingly hung to the directly administered superior virtual POI node, and different types of the real POI recurse on the direct or indirect virtual POI nodes, so that each virtual POI node can visually look up the total number and the number of each type of the currently managed real POI.

Further, the display method B specifically adopts the following steps:

b1, inputting the coordinate range [ (x) to be inquired into the basic map M1_start，y_start)，(x_end，y_end)]And map level D_level；

B2, creating a new set Q and expanding the coordinate range [ (x)_start，y_start)，(x_end，y_end)]；

B3, call set E_newWill be set E_newAll of the extended coordinate ranges and map levels D satisfied_levelPutting the nodes into a set Q;

b4, outputting a set Q, wherein the set Q is a display result: the generated target map M2.

Through the design, the range to be consulted is input during consultation, and the map can quickly show the virtual POI nodes in the current range in the relevant area of the specified range, so that the inquiry and the display of irrelevant POI data are greatly reduced, and the consultation speed is accelerated.

Further, the specific content of step a2 is as follows:

a2.1, creating set E_new＝{e_new1，e_new2，…，e_newiGet node E out of tree E in turn_iLet e_newi＝e_iAnd e is combined_iMap level D of_jAddition to e_newiI.e. e_newiNew added level attribute d_level＝D_j；

A2.2 is e_newiSetting a virtual attribute isVirtual to indicate that the node is a virtual POI node, and setting a type set [ { type ═ type [ ]₁，Count_type1＝0}，{type＝type₂，Count_type2＝0}，…，{type＝type_i，Count_typei＝0}]Wherein { type ═ type_i，Count_typei0 represents that the type of direct and indirect hanging under the virtual POI node is type_iThe number of the real POI is Count_typeiAnd is initialized to 0;

a2.3, return A2.1 until all nodes E of the tree E_iAre taken out once.

Through the design, each administrative point on the map is set as a virtual POI node, and all the nodes are combined into a tree structure with distinct hierarchy, so that real POI hooking of management is facilitated.

Further, the specific content of step a3 is as follows:

a3.1, grouping the set V according to types, and marking the set V as a binary group [ (V)₁，type₁)，(V₂，type₂)，…，(V_i，type_i)]In which V is_i＝{v_i1，v_i2，…，v_ijEvery v_ijIs a real POI, V_iFor all types in the set V as type_iV is_ijA set of (a);

a3.2, extracting V of the set V in sequence_ijAnd finds the set E according to the region attribute_newNode e of middle corresponding to home_newm；

A3.3, at said node e_newmLast new node e_newvLet e_newv＝v_ij；

Is node e_newvSetting a virtual attribute isVirtual as false, and indicating that the node is a real POI;

let e_newv.parent＝e_newm，e_newviCount ═ 1, and represents node e_newvTo a parent node e_newmThe real POI under node count is 1;

a3.4, let the node e_newmReal POI total e_newmiCount plus 1, the type of the direct and indirect connection of the node is type_vThe total number Count of the real POI_typevPlus 1, the type_vIs node e_newvType of (d);

a3.5, return A3.2 until all real POI in set V are hooked to set E_newUntil now.

Through the design, each real POI is directly hung on the corresponding virtual POI node, and the type of the real POI is classified and the count of the real POI of the same type directly hung on each virtual POI node is calculated.

Further, the specific content of step a4 is as follows:

a4.1, from set E_newNode e of the lowest level_newmAt the beginning, the sequence from low to high is each node e_newmUpdating a counter:

e_newm.iCount＝e_newm.iCount+∑e_child.iCount

wherein e_newmiCount is node e_newmTotal number of real POIs directly and indirectly attached, e_childiCount is node e_newmThe real POI total number of the directly connected sub-nodes;

a4.2, from set E_newNode e of the lowest level_newmAt the beginning, each node e is updated in sequence from low to high_newmType set of [ { t [ ]ype₁，Count_type1}，{type₂，Count_type2}，…，{type_i，Count_typei}]：

e_newm.Count_typei＝e_newm.Count_typei+∑e_child.Count_typei

Wherein e_newm.Count_typeiIs node e_newmThe type of direct and indirect hitching is type_iTrue POI total number, e_child.Count_typeiIs node e_newmType on the sub-node directly connected_iThe total number of real POIs;

a4.3, delete all e_newmNode of iCount ═ 0, i.e., any node e_newmIf no child node and real POI hooking are available, deleting;

delete all e_newm.Count_typeiType attribute of 0 { [ type ]_i，Count_typeiI.e. any node e_newmIf there is no direct or indirect hanging type as type_iThe real POI of (1) deletes the type attribute.

Through the design, the number of the real POI indirectly connected with each virtual POI node is reduced and calculated, and classification recursion is carried out according to different types.

Further, the step B2 is specifically as follows:

b2.1, calculating the coordinate range [ (x)_start，y_start)，(x_end，y_end)]Central point (x) of_o，y_o) Calculating the range length: d_x＝|x_end-x_start|，d_y＝|y_end-y_start|；

B2.2, extended range length: d_x＝d_x*2，d_y＝d_y*2。

Further, the step B3 is specifically as follows:

b3.1, sequentially taking out the set E_newNode e of_newiJudging the map level D_levelWhether or not in e_newiCorresponding map level b_iIf so, entering the step B3.2, otherwise, jumping to the step B3.3;

b3.2, calculating node e_newiCoordinate (x)_i，y_i) And the center point (x)_o，y_o) The distance of (c):

d_i＝|x_i-x_o|+|y_i-y_o|，

if d is_i<(d_x+d_y) Then the node e is connected_newiPutting the obtained product into a set Q;

b3.3, returning to the judgment set E of B3.1_newAll the nodes are judged once until each node is judged once.

The invention has the beneficial effects that: the method is characterized in that a virtual tree and a real tree are used instead of a list/array to express the POI by combining the multi-dimensional content of the POI and the multi-level structure of the electronic map, so that the map display problem of the complex POI is fundamentally solved, the speed and the effect of displaying the POI are greatly improved, each real POI is correspondingly connected to a higher-level virtual POI node directly administered by the real POI, different types of the real POI recur on the direct or indirect virtual POI node, and each virtual POI node can directly look up the total number and the number of the types of the real POI currently managed.

Drawings

FIG. 1 is a flow chart of a generation method A

FIG. 2 is a flow chart diagram of a display method B

FIG. 3 is a schematic illustration of a management map obtained in accordance with the present invention

Detailed Description

The invention is described in further detail below with reference to the following figures and specific embodiments:

a management map expression method based on a virtual POI tree and a real POI tree is defined as a tree structure set which is provided with virtual POI nodes and real POI hanging connections at the same time, wherein the virtual POI nodes are nodes with one or more real POI aggregations with the same attribution;

the method comprises a virtual POI tree generation method A and a virtual POI tree generation display method B.

As shown in fig. 1, the generation method a specifically includes the following steps:

a1, inputting a real POI set V to an initial map M0, wherein each real POI in the set V is a real node managed by a current region and is provided with type and region attributes;

building administrative tree E ═ E₁，e₂，…，e_iIn which e_iRepresenting the administrative region of the current region, establishing a map hierarchy table D of the tree E_map＝{D₁，D₂，…，D_jJ is less than or equal to i, wherein D_j＝[a_j，b_j]Then the map hierarchy table D_mapEach element D_jDenotes e_iAt the corresponding map level b_jAdministrative district rating a displayed within range_j；

A2, creating set E_newCopy the contents of the tree E to the set E one by one_newIs a union of set E_newEach node e of_newAdding virtual attribute, node e_newNamely the virtual POI nodes:

a2.1, creating set E_new＝{e_new1，e_new2，…，e_newiGet nodes from the tree E in turn

e_iLet e_newi＝e_iAnd e is combined_iMap level D of_jAddition to e_newiI.e. e_newiNew added level attribute d_level＝D_j；

A2.2 is e_newiSetting the virtual attribute isVirtual to true, indicating that the node is a virtual POI node,

and sets a type set [ { type ═ type [ ]₁，Count_type1＝0}，{type＝type₂，Count_type2＝0}，…，

{type＝type_i，Count_typei＝0}]Wherein { type ═ type_i，Count_typei0 represents the virtual POI

The type of direct and indirect hanging under the node is type_iThe number of the real POI is Count_typeiAnd is initialized

Is 0;

a2.3, return A2.1 until all nodes E of the tree E_iAll are taken out once;

a3, hanging each real POI of the set V to a node e of a corresponding attribution_newThe method comprises the following steps:

a3.1, grouping the set V according to types, and marking the set V as a binary group [ (V)₁，type₁)，(V₂，

type₂)，…，(V_i，type_i)]In which V is_i＝{v_i1，v_i2，…，v_ijEvery v_ijIs a real thing

POI，V_iFor all types in the set V as type_iV is_ijA set of (a);

a3.2, extracting V of the set V in sequence_ijAnd finds the set E according to the region attribute_newChinese corresponding to Gui

Node e of home_newm；

A3.3, at said node e_newmLast new node e_newvLet e_newv＝v_ij；

Is node e_newvSetting a virtual attribute isVirtual as false, and indicating that the node is a real POI;

let e_newv.parent＝e_newm，e_newviCount ═ 1, and represents node e_newvTo a parent node e_newm，

The real POI under the node count is 1;

a3.4, let the node e_newmReal POI total e_newmiCount plus 1, the junction is direct

Type of indirect connection_vThe total number Count of the real POI_typevPlus 1, the type_vIs a knot

Point e_newvType of (d);

a3.5, return A3.2 until all real POI in set V are hooked to set E_newUntil the end;

a4, update setAnd E_new: statistics of each node e_newAnd if the node is empty and has no real POI directly or indirectly connected, deleting the node:

a4.1, from set E_newNode e of the lowest level_newmBeginning in the order of low to high

Next to each node e_newmUpdating a counter:

e_newm.iCount＝e_newm.iCount+∑e_child.iCount

wherein e_newmiCount is node e_newmThe total number of real POIs directly and indirectly hooked,

e_childiCount is node e_newmThe real POI total number of the directly connected sub-nodes;

a4.2, from set E_newNode e of the lowest level_newmBeginning in the order of low to high

Updating each node e_newmType set of [ { type [ ]₁，Count_type1}，{type₂，Count_type2}，…，

{type_i，Count_typei}]：

e_newm.Count_typei＝e_newm.Count_typei+∑e_child.Count_typei

Wherein e_newm.Count_typeiIs node e_newmThe type of direct and indirect hitching is type_iIs true of

Total number of POIs, e_child.Count_typeiIs node e_newmType on the sub-node directly connected_iIs

(ii) a real POI total number;

a4.3, delete all e_newmNode of iCount ═ 0, i.e., any node e_newmIf there is no child node and

real POI hitches are deleted;

delete all e_newm.Count_typei0 beingType attribute { type_i，Count_typeiI.e. any node

e_newmIf there is no direct or indirect hanging type as type_iThe real POI of (1) deletes the type attribute.

A5, output set E_newSaid set E_newI.e. a virtual-real POI tree, the initial map M0

Becomes the base map M1;

the generated base map M1 is as shown in fig. 3.

As shown in fig. 2, the display method B specifically includes the following steps:

b1, inputting the coordinate range [ (x) to be inquired into the basic map M1_start，y_start)，(x_end，y_end)]And map level D_level；

B2, creating a new set Q and expanding the coordinate range [ (x)_start，y_start)，(x_end，y_end)]：

B2.1, calculating the coordinate range [ (x)_start，y_start)，(x_end，y_end)]Central point (x) of_o，y_o) Calculating

Range length: d_x＝|x_end-x_start|，d_y＝|y_end-y_start|；

B2.2, extended range length: d_x＝d_x*2，d_y＝d_y*2；

B3, call set E_newWill be set E_newAll of the extended coordinate ranges and map levels D satisfied_levelPut into set Q:

b3.1, sequentially taking out the set E_newNode e of_newiJudging the map level D_levelWhether or not to be at

e_newiCorresponding map level b_iIf so, entering the step B3.2, otherwise, jumping to the step B3.3;

b3.2, calculating node e_newiCoordinate (x)_i，y_i) Andthe center point (x)_o，y_o) The distance of (c):

d_i＝|x_i-x_o|+|y_i-y_o|，

if d is_i<(d_x+d_y) Then the node e is connected_newiPutting the obtained product into a set Q;

b3.3, returning to the judgment set E of B3.1_newAll nodes are judged once until each node is judged once;

b4, outputting a set Q, wherein the set Q is a display result: the generated target map M2.

Claims (6)

1. A management map expression method based on virtual and real POI trees is characterized in that: defining the virtual and real POI trees as a tree structure set simultaneously provided with virtual POI nodes and real POI hanging connections, wherein the virtual POI nodes are nodes provided with one or more real POI aggregations with the same attribution;

the method comprises a virtual and real POI tree generation method A and a generated display method B, wherein the generation method A specifically comprises the following steps:

a1, inputting a real POI set V to an initial map M0, wherein each real POI in the set V is a real node managed by a current region and is provided with type and region attributes;

building administrative tree E ═ E₁，e₂，…，e_iIn which e_iRepresenting the administrative region of the current region, establishing a map hierarchy table D of the tree E_map＝{D₁，D₂，…，D_jJ is less than or equal to i, wherein D_j＝[a_j，b_j]Then the map hierarchy table D_mapEach element D_jDenotes e_iAt the corresponding map level b_jAdministrative district rating a displayed within range_j；

A2, creating set E_newCopy the contents of the tree E to the set E one by one_newIs a union of set E_newEach node e of_newAdding virtual attribute, node e_newNamely the virtual POI nodes are obtained;

a3, hanging each real POI of the set V to a node e of a corresponding attribution_newThe above step (1);

a4, update set E_new: statistics of each node e_newIf the node is empty and has no real POI to be directly or indirectly connected, deleting the node;

a5, output set E_newSaid set E_newI.e. a virtual-real POI tree, the initial map M0 becomes the base map M1;

the display method B specifically comprises the following steps:

b1, inputting the coordinate range [ (x) to be inquired into the basic map M1_start，y_start)，(x_end，y_end)]And map level D_level；

B2, creating a new set Q and expanding the coordinate range [ (x)_start，y_start)，(x_end，y_end)]；

B3, call set E_newWill be set E_newAll of the extended coordinate ranges and map levels D satisfied_levelPutting the nodes into a set Q;

b4, outputting a set Q, wherein the set Q is a display result: the generated target map M2.

2. The method for managing map expression based on virtual and real POI tree as claimed in claim 1, wherein: the step a2 specifically comprises the following steps:

a2.1, creating set E_new＝{e_new1，e_new2，…，e_newiGet node E out of tree E in turn_iLet e_newi＝e_iAnd e is combined_iMap level D of_jAddition to e_newiI.e. e_newiNew added level attribute d_level＝D_j；

A2.2 is e_newiSetting a virtual attribute isVirtual to indicate that the node is a virtual POI node, and setting a type set [ { type ═ type [ ]₁，Count_type1＝0}，{type＝type₂，Count_type2＝0}，…，{type＝type_i，Count_typei＝0}]Wherein { type ═ type_i，Count_typei0 represents that the type of direct and indirect hanging under the virtual POI node is type_iThe number of the real POI is Count_typeiAnd is initialized to 0;

a2.3, return A2.1 until all nodes E of the tree E_iAre taken out once.

3. The method of claim 2, wherein the method comprises: the step a3 specifically comprises the following steps:

a3.1, grouping the set V according to types, and marking the set V as a binary group [ (V)₁，type₁)，(V₂，type₂)，…，(V_i，type_i)]In which V is_i＝{v_i1，v_i2，…，v_ijEvery v_ijIs a real POI, V_iFor all types in the set V as type_iV is_ijA set of (a);

a3.2, extracting V of the set V in sequence_ijAnd finds the set E according to the region attribute_newNode e of middle corresponding to home_newm；

A3.3, at said node e_newmLast new node e_newvLet e_newv＝v_ij；

Is node e_newvSetting a virtual attribute isVirtual as false, and indicating that the node is a real POI;

let e_newv.parent＝e_newm，e_newviCount ═ 1, and represents node e_newvTo a parent node e_newmNode e_newvThe lower real POI count is 1;

a3.4, let the node e_newmReal POI total e_newmiCount plus 1, the type of the direct and indirect connection of the node is type_vThe total number Count of the real POI_typevPlus 1, the type_vIs node e_newvType of (d);

a3.5, return A3.2 until all real POI in set V are hooked to set E_newUntil now.

4. The method for managing map expression based on virtual and real POI tree as claimed in claim 3, wherein: the step a4 specifically comprises the following steps:

a4.1, from set E_newNode e of the lowest level_newmAt the beginning, the sequence from low to high is each node e_newmUpdating a counter:

e_newm.iCount＝e_newm.iCount+∑e_child.iCount

wherein e_newmiCount is node e_newmTotal number of real POIs directly and indirectly attached, e_childiCount is node e_newmThe real POI total number of the directly connected sub-nodes;

a4.2, from set E_newNode e of the lowest level_newmAt the beginning, each node e is updated in sequence from low to high_newmType set of [ { type [ ]₁，Count_type1}，{type₂，Count_type2}，…，{type_i，Count_typei}]：

e_newm.Count_typei＝e_newm.Count_typei+∑e_child.Count_typei

Wherein e_newm.Count_typeiIs node e_newmThe type of direct and indirect hitching is type_iTrue POI total number, e_child.Count_typeiIs node e_newmType on the sub-node directly connected_iThe total number of real POIs;

a4.3, delete all e_newmNode of iCount ═ 0, i.e., any node e_newmIf no child node and real POI hooking are available, deleting;

delete all e_newm.Count_typeiType attribute of 0 { [ type ]_i，Count_typeiI.e. any node e_newmIf there is no direct or indirect hanging typetype_iThe real POI of (1) deletes the type attribute.

5. The method for managing map expression based on virtual and real POI tree as claimed in claim 1, wherein: the step B2 specifically includes the following steps:

b2.1, calculating the coordinate range [ (x)_start，y_start)，(x_end，y_end)]Central point (x) of_o，y_o) Calculating the range length: d_x＝|x_end-x_start|，d_y＝|y_end-y_start|；

B2.2, extended range length: d_x＝d_x*2，d_y＝d_y*2。

6. The method for managing map expression based on virtual and real POI tree as claimed in claim 5, wherein: the step B3 specifically includes the following steps:

b3.1, sequentially taking out the set E_newNode e of_newiJudging the map level D_levelWhether or not in e_newiCorresponding map level b_iIf so, entering the step B3.2, otherwise, jumping to the step B3.3;

b3.2, calculating node e_newiCoordinate (x)_i，y_i) And the center point (x)_o，y_o) The distance of (c):

d_i＝|x_i-x_o|+|y_i-y_o|，

if d is_i<(d_x+d_y) Then the node e is connected_newiPutting the obtained product into a set Q;

b3.3, returning to the judgment set E of B3.1_newAll the nodes are judged once until each node is judged once.

Images