CN108090134A - Management Map Expression method based on actual situation POI trees - Google Patents
Management Map Expression method based on actual situation POI trees Download PDFInfo
- Publication number
- CN108090134A CN108090134A CN201711195191.1A CN201711195191A CN108090134A CN 108090134 A CN108090134 A CN 108090134A CN 201711195191 A CN201711195191 A CN 201711195191A CN 108090134 A CN108090134 A CN 108090134A
- Authority
- CN
- China
- Prior art keywords
- poi
- node
- type
- newm
- true
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
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/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Remote Sensing (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention discloses a kind of management Map Expression method based on actual situation POI trees, the tree structure set that the actual situation POI trees are while have virtual POI nodes and true POI mountings is defined first, wherein, the virtual POI nodes are the node with the identical true POI polymerizations of one or more ownership place, and each true POI represents the object signals points such as the senser element of actual use, control node.Advantageous effect:With reference to multi-dimensional content and electronic map the multilayered structure in itself of POI, POI is expressed using actual situation tree rather than list/array, so as to fundamentally solve the problems, such as the map denotation of complexity POI, substantially increase the speed and effect of display POI, each virtual POI nodes can find the sum of its lower all true POI for administering or controlling and each different types of quantity, realize portable supervision statistics, and display speed greatly increases.
Description
Technical field
The present invention relates to POI to manage Cartographic Technique field, specifically, with being related to a kind of management based on actual situation POI trees
Graph expression method.
Background technology
POI (Point of Interest, point of interest) is one of most important exposition of electronic map, it is characterized in that
Mass data and various species, how quickly to show and position relevant POI becomes the important chip of electronic map successful application.
Existing e-management map defect:Existing e-management map is all searched for POI as a basic point
And processing, it did not accounted for the display of map in itself and had levels in fact, and do not accounted for the hierarchical structures of POI in itself yet and ask
Topic, the POI data for the hybrid hierarchy that is beyond expression, and this point is in vertical applications field, such as city safety-protection system, forestry alarm
It is particularly important in system.
The content of the invention
The purpose of the present invention is combining the multilayered structure of the multi-dimensional content and electronic map of POI in itself, a kind of base is proposed
In the management Map Expression method of actual situation POI trees, POI is expressed using actual situation tree rather than list/array, so as to fundamentally
It solves the problems, such as the map denotation of complexity POI, substantially increases the speed and effect of display POI.
In order to achieve the above objectives, the specific technical solution that the present invention uses is as follows:
A kind of management Map Expression method based on actual situation POI trees defines the actual situation POI trees and is while has void first
Intend the tree structure set of POI nodes and true POI mountings, wherein, the virtual POI nodes are with one or more
The node of the identical true POI polymerizations of ownership place, it is real that each true POI represents the senser element of actual use, control node etc.
Object signaling point;
Then each virtual POI nodes can find the total and each of its lower all true POI for administering or controlling
Different types of quantity realizes portable supervision statistics, and display speed greatly increases.
It further describes, the generation method A including actual situation POI trees and the display methods B, the generation method A after generation
Specifically use following steps:
A1 inputs true POI set V to initial map M0, and each true POI is current zone management in the set V
True node, and be both provided with type, area attribute;
Build the tree E={ e in administrative area1, e2..., ei, wherein, eiRepresent the fitting knot in current zone administrative area
Point establishes the map level table D of tree Emap={ D1, D2..., Dj, j≤i, wherein Dj=[aj, bj], then the map level table
DmapEach element DjRepresent eiIn corresponding map level bjIn the range of shown administrative area grade aj, DjUsually empirical data, example
Such as [1,1-4], [2,5-8], [3,9-12], [4,13-16], [5,16-20];
A2 creates set Enew, the content for setting E is copied into set E one by onenewIn and for set EnewEach node enew
Increase virtual attribute, then node enewAs described virtual POI nodes;
Each true POI of set V is articulated to the node e of corresponding ownership place by A3newOn;
A4, update set Enew:Count each node enewAll true POI sums directly or indirectly mounted, if the knot
Point is empty, is directly or indirectly mounted without any true POI, then deletes the node;
A5, output set Enew, the set EnewIt is actual situation POI trees, the initial map M0 becomes basic map M1.
By above-mentioned design, each true POI correspondences are articulated to the virtual POI nodes of higher level that it is directly administered, and true
The different type of POI recurrence on direct or indirect virtual POI nodes, allows each virtual POI nodes intuitively to look into
Read the true POI sums currently managed and all types of quantity.
It is further described, the display methods B specifically uses following steps:
B1 inputs coordinate range [(x to be checked to the basic map M1start, ystart), (xend, yend)] and map
Level Dlevel;
B2 creates set Q, and extends the coordinate range [(xstart, ystart), (xend, yend)];
B3 transfers set Enew, by set EnewIn it is all meet extension after coordinate ranges and map level DlevelKnot
Point is put into set Q;
B4, output set Q, the set Q are to show result:The target map M2 of generation.
By above-mentioned design, the scope that input needs are consulted when consulting, then map can be in the relevant range of specified range
The interior quick virtual POI nodes shown in present scope, greatly reduce the inquiry to incoherent POI data and displaying,
Accelerate the speed of access.
It is further described, the step A2 particular contents are as follows:
A2.1 creates set Enew={ enew1, enew2..., enewi, node e is taken out successively from tree EiMake enewi=ei,
And by eiMap level DjIt is added to enewi, i.e. enewiNewly-increased level attributes dlevel=Dj;
A2.2 is enewiVirtual attribute isVirtual=true is set, the node is represented as virtual POI nodes, and sets
Type set [{ type=type1, Counttype1=0 }, { type=type2, Counttype2=0 } ..., { type=typei,
Counttypei=0 }], wherein { type=typei, Counttypei=0 } represent directly or indirectly to mount under the virtual POI nodes
Type be typeiTrue POI quantity be CounttypeiAnd it is initialized as 0;
A2.3 returns to A2.1, all node e until setting EiUntil being all removed once.
By above-mentioned design, each administrative point is disposed as virtual POI nodes on map, and all nodes are combined into level
Clearly demarcated tree, the true POI mountings that it is facilitated to manage.
It is further described, the step A3 particular contents are as follows:
A3.1 by the set V according to type packet, is denoted as two tuple [(V1, type1), (V2, type2) ..., (Vi,
typei)], wherein Vi={ vi1, vi2..., vij, every vijFor a true POI, ViIt is type for all types in set Vi
VijSet;
A3.2 extracts the v of set V successivelyijAnd set E is found according to its area attributenewThe node of middle corresponding ownership place
enewm;
A3.3, in the node enewmUpper newly-increased node enewv, make enewv=vij;
For node enewvVirtual attribute isVirtual=false is set, it is true POI to represent the node;
Make enewv.parent=enewm, enewv.iCount=1, node e is representednewvIt is directed toward father node enewm, it is true under node
Real POI is counted as 1;
A3.4 makes the node enewmTrue POI sums enewm.iCount plus 1, what which directly or indirectly mounted
Type is typevTrue POI sums CounttypevAdd 1, the typevFor node enewvType;
A3.5 returns to A3.2, until all true POI are articulated to set E in set VnewUntil.
By above-mentioned design, each true POI is directly articulated on its corresponding virtual POI node, and its type is returned
Class and the counting for calculating the true POI of same type that each virtual POI nodes directly mount.
It is further described, the step A4 particular contents are as follows:
A4.1, from set EnewIn from the node e of minimum level-onenewmStart, order from low to high is followed successively by each node
enewmRefresh counter:
enewm.iCount=enewm.iCount+∑echild.iCount
Wherein enewm.iCount it is node enewmThe true POI sums directly or indirectly mounted, echild.iCount it is knot
Point enewmThe true POI sums of the child node directly mounted;
A4.2, from set EnewIn from the node e of minimum level-onenewmStart, order from low to high updates each knot successively
Point enewmType set [{ type1, Counttype1, { type2, Counttype2..., { typei, Counttypei}]:
enewm.Counttypei=enewm.Counttypei+∑echild.Counttypei
Wherein enewm.CounttypeiFor node enewmThe type directly or indirectly mounted is typeiTrue POI sum,
echild.CounttypeiFor node enewmType is type on the child node directly mountediTrue POI sum;
A4.3 deletes whole enewm.iCount=0 node, i.e., any node enewmIf no child node and true POI are hung
It connects, is deleted;
Delete whole enewm.Counttypei=0 type attribute { typei, Counttypei, i.e., any node enewmIf nothing
Directly or indirectly mounting type is typeiTrue POI then delete the type attribute.
By above-mentioned design, the true POI quantity that each virtual POI nodes are mounted indirectly, which sums up, to be calculated, and by not
Same type classification recurrence.
It is further described, the step B2 particular contents are as follows:
B2.1, coordinates computed scope [(xstart, ystart), (xend, yend)] central point (xo, yo), computer capacity length:
dx=| xend-xstart|, dy=| yend-ystart|;
B2.2, spreading range length:dx=dx* 2, dy=dy*2。
It is further described, the step B3 particular contents are as follows:
B3.1 takes out set E successivelynewNode enewi, judge the map level DlevelWhether in enewiAccordingly
Figure rank biIn the range of, it is to enter step B3.2, otherwise jumps to step B3.3;
B3.2 calculates node enewiCoordinate (xi, yi) and the central point (xo, yo) distance:
di=| xi-xo|+|yi-yo|,
If di<(dx+dy), then by node enewiIt is put into set Q;
B3.3 returns to B3.1 and judges set EnewAll nodes, until each node judges once.
Beneficial effects of the present invention:With reference to multi-dimensional content and electronic map the multilayered structure in itself of POI, actual situation is used
Tree rather than list/array express POI, so as to fundamentally solve the problems, such as the map denotation of complexity POI, substantially increase aobvious
Show the speed and effect of POI, each true POI correspondences are articulated to the virtual POI nodes of higher level that it is directly administered, and true POI
Different type on direct or indirect virtual POI nodes recurrence, each virtual POI nodes is allow intuitively to find
The true POI sums currently managed and all types of quantity.
Description of the drawings
Fig. 1 is the FB(flow block) of generation method A
Fig. 2 is the FB(flow block) of display methods B
Fig. 3 is the management map schematic diagram obtained according to the present invention
Specific embodiment
Below in conjunction with the accompanying drawings and specific embodiment is described in further detail the present invention:
A kind of management Map Expression method based on actual situation POI trees defines the actual situation POI trees and is while has virtual
POI nodes and the tree structure set of true POI mountings, wherein, the virtual POI nodes are to return with one or more
The node of the identical true POI polymerizations in possession;
Display methods B after generation method A and generation including actual situation POI trees.
As shown in Figure 1, the generation method A specifically uses following steps:
A1 inputs true POI set V to initial map M0, and each true POI is current zone management in the set V
True node, and be both provided with type, area attribute;
Build the tree E={ e in administrative area1, e2..., ei, wherein, eiRepresent the fitting knot in current zone administrative area
Point establishes the map level table D of tree Emap={ D1, D2..., Dj, j≤i, wherein Dj=[aj, bj], then the map level table
DmapEach element DjRepresent eiIn corresponding map level bjIn the range of shown administrative area grade aj;
A2 creates set Enew, the content for setting E is copied into set E one by onenewIn and for set EnewEach node enew
Increase virtual attribute, then node enewAs described virtual POI nodes:
A2.1 creates set Enew={ enew1, enew2..., enewi, node is taken out successively from tree E
eiMake enewi=ei, and by eiMap level DjIt is added to enewi, i.e. enewiNewly-increased level attributes dlevel=Dj;
A2.2 is enewiVirtual attribute isVirtual=true is set, represents the node as virtual POI nodes,
And set type set [{ type=type1, Counttype1=0 }, { type=type2, Counttype2=
0 } ...,
{ type=typei, Counttypei=0 }], wherein { type=typei, Counttypei=0 } the virtual POI is represented
The type directly or indirectly mounted under node is typeiTrue POI quantity be CounttypeiAnd it initializes
For 0;
A2.3 returns to A2.1, all node e until setting EiUntil being all removed once;
Each true POI of set V is articulated to the node e of corresponding ownership place by A3newOn:
A3.1 by the set V according to type packet, is denoted as two tuple [(V1, type1), (V2,
type2) ..., (Vi, typei)], wherein Vi={ vi1, vi2..., vij, every vijIt is true for one
POI, ViIt is type for all types in set ViVijSet;
A3.2 extracts the v of set V successivelyijAnd set E is found according to its area attributenewMiddle correspondence is returned
The node e in possessionnewm;
A3.3, in the node enewmUpper newly-increased node enewv, make enewv=vij;
For node enewvVirtual attribute isVirtual=false is set, it is true POI to represent the node;
Make enewv.parent=enewm, enewv.iCount=1, node e is representednewvIt is directed toward father node enewm,
True POI is counted as 1 under node;
A3.4 makes the node enewmTrue POI sums enewm.iCount plus 1, the node is direct
The type mounted indirectly is typevTrue POI sums CounttypevAdd 1, the typevFor knot
Point enewvType;
A3.5 returns to A3.2, until all true POI are articulated to set E in set VnewUntil;
A4, update set Enew:Count each node enewAll true POI sums directly or indirectly mounted, if the knot
Point is empty, is directly or indirectly mounted without any true POI, then deletes the node:
A4.1, from set EnewIn from the node e of minimum level-onenewmStart, order from low to high according to
Secondary is each node enewmRefresh counter:
enewm.iCount=enewm.iCount+∑echild.iCount
Wherein enewm.iCount it is node enewmThe true POI sums directly or indirectly mounted,
echild.iCount it is node enewmThe true POI sums of the child node directly mounted;
A4.2, from set EnewIn from the node e of minimum level-onenewmStart, order from low to high according to
The secondary each node e of updatenewmType set [{ type1, Counttype1, { type2, Counttype2...,
{typei, Counttypei}]:
enewm.Counttypei=enewm.Counttypei+∑echild.Counttypei
Wherein enewm.CounttypeiFor node enewmThe type directly or indirectly mounted is typeiIt is true
POI sums, echild.CounttypeiFor node enewmType is type on the child node directly mountediIt is true
Real POI sums;
A4.3 deletes whole enewm.iCount=0 node, i.e., any node enewmIf without child node and
True POI mountings are then deleted;
Delete whole enewm.Counttypei=0 type attribute { typei, Counttypei, i.e., any node
enewmIf it is type without direct or indirect mounting typeiTrue POI then delete the type attribute.
A5, output set Enew, the set EnewIt is actual situation POI trees, the initial map M0
Become basic map M1;
The basic map M1 then generated is as shown in Figure 3.
As shown in Fig. 2, the display methods B specifically uses following steps:
B1 inputs coordinate range [(x to be checked to the basic map M1start, ystart), (xend, yend)] and map
Level Dlevel;
B2 creates set Q, and extends the coordinate range [(xstart, ystart), (xend, yend)]:
B2.1, coordinates computed scope [(xstart, ystart), (xend, yend)] central point (xo, yo), it calculates
Extent length:dx=| xend-xstart|, dy=| yend-ystart|;
B2.2, spreading range length:dx=dx* 2, dy=dy*2;
B3 transfers set Enew, by set EnewIn it is all meet extension after coordinate ranges and map level DlevelKnot
Point is put into set Q:
B3.1 takes out set E successivelynewNode enewi, judge the map level DlevelWhether
enewiCorrespondence map level biIn the range of, it is to enter step B3.2, otherwise jumps to step B3.3;
B3.2 calculates node enewiCoordinate (xi, yi) and the central point (xo, yo) distance:
di=| xi-xo|+|yi-yo|,
If di<(dx+dy), then by node enewiIt is put into set Q;
B3.3 returns to B3.1 and judges set EnewAll nodes, until each node judges once;
B4, output set Q, the set Q are to show result:The target map M2 of generation.
Claims (6)
- A kind of 1. management Map Expression method based on actual situation POI trees, it is characterised in that:The actual situation POI trees are defined as simultaneously With the tree structure set that virtual POI nodes and true POI are mounted, wherein, the virtual POI nodes for tool there are one or one The node of the identical true POI polymerizations of a Yi Shang ownership place;Display methods B, the generation method A after generation method A and generation including actual situation POI trees are specifically using following step Suddenly:A1 inputs true POI set V to initial map M0, and each true POI is the true of current zone management in the set V Real node, and it is both provided with type, area attribute;Build the tree E={ e in administrative area1, e2..., ei, wherein, eiIt represents the fitting node in current zone administrative area, establishes Set the map level table D of Emap={ D1, D2..., Dj, j≤i, wherein Dj=[aj, bj], then the map level table DmapEach member Plain DjRepresent eiIn corresponding map level bjIn the range of shown administrative area grade aj;A2 creates set Enew, the content for setting E is copied into set E one by onenewIn and for set EnewEach node enewIncrease Virtual attribute, then node enewAs described virtual POI nodes;Each true POI of set V is articulated to the node e of corresponding ownership place by A3newOn;A4, update set Enew:Count each node enewAll true POI sums directly or indirectly mounted, if the node is It is empty, directly or indirectly mounted without any true POI, then delete the node;A5, output set Enew, the set EnewIt is actual situation POI trees, the initial map M0 becomes basic map M1;The display methods B specifically uses following steps:B1 inputs coordinate range [(x to be checked to the basic map M1start, ystart), (xend, yend)] and map level Dlevel;B2 creates set Q, and extends the coordinate range [(xstart, ystart), (xend, yend)];B3 transfers set Enew, by set EnewIn it is all meet extension after coordinate ranges and map level DlevelNode put Enter set Q;B4, output set Q, the set Q are to show result:The target map M2 of generation.
- 2. the management Map Expression method according to claim 1 based on actual situation POI trees, it is characterised in that:The step A2 particular contents are as follows:A2.1 creates set Enew={ enew1, enew2..., enewi, node e is taken out successively from tree EiMake enewi=ei, and by ei Map level DjIt is added to enewi, i.e. enewiNewly-increased level attributes dlevel=Dj;A2.2 is enewiVirtual attribute isVirtual=true is set, the node is represented as virtual POI nodes, and sets type Gather [{ type=type1, Counttype1=0 }, { type=type2, Counttype2=0 } ..., { type=typei, Counttypei=0 }], wherein { type=typei, Counttypei=0 } represent directly or indirectly to mount under the virtual POI nodes Type be typeiTrue POI quantity be CounttypeiAnd it is initialized as 0;A2.3 returns to A2.1, all node e until setting EiUntil being all removed once.
- 3. the management Map Expression method according to claim 2 based on actual situation POI trees, it is characterised in that:The step A3 particular contents are as follows:A3.1 by the set V according to type packet, is denoted as two tuple [(V1, type1), (V2, type2) ..., (Vi, typei)], wherein Vi={ vi1, vi2..., vij, every vijFor a true POI, ViIt is type for all types in set Vi VijSet;A3.2 extracts the v of set V successivelyijAnd set E is found according to its area attributenewThe node e of middle corresponding ownership placenewm;A3.3, in the node enewmUpper newly-increased node enewv, make enewv=vij;For node enewvVirtual attribute isVirtual=false is set, it is true POI to represent the node;Make enewv.parent=enewm, enewv.iCount=1, node e is representednewvIt is directed toward father node enewm, true POI under node It is counted as 1;A3.4 makes the node enewmTrue POI sums enewm.iCount plus 1, the type which directly or indirectly mounts For typevTrue POI sums CounttypevAdd 1, the typevFor node enewvType;A3.5 returns to A3.2, until all true POI are articulated to set E in set VnewUntil.
- 4. the management Map Expression method according to claim 3 based on actual situation POI trees, it is characterised in that:The step A4 particular contents are as follows:A4.1, from set EnewIn from the node e of minimum level-onenewmStart, order from low to high is followed successively by each node enewm Refresh counter:enewm.iCount=enewm.iCount+∑echild.iCountWherein enewm.iCount it is node enewmThe true POI sums directly or indirectly mounted, echild.iCount it is node enewm The true POI sums of the child node directly mounted;A4.2, from set EnewIn from the node e of minimum level-onenewmStart, order from low to high updates each node successively enewmType set [{ type1, Counttype1, { type2, Counttype2..., { typei, Counttypei}]:enewm.Counttypei=enewm.Counttypei+∑echild.CounttypeiWherein enewm.CounttypeiFor node enewmThe type directly or indirectly mounted is typeiTrue POI sum, echild.CounttypeiFor node enewmType is type on the child node directly mountediTrue POI sum;A4.3 deletes whole enewm.iCount=0 node, i.e., any node enewmIf no child node and true POI mount It is deleted;Delete whole enewm.Counttypei=0 type attribute { typei, Counttypei, i.e., any node enewmIf without direct Or mounting type is type indirectlyiTrue POI then delete the type attribute.
- 5. the management Map Expression method according to claim 1 based on actual situation POI trees, it is characterised in that:The step B2 particular contents are as follows:B2.1, coordinates computed scope [(xstart, ystart), (xend, yend)] central point (xo, yo), computer capacity length:dx=| xend-xstart|, dy=| yend-ystart|;B2.2, spreading range length:dx=dx* 2, dy=dy*2。
- 6. the management Map Expression method according to claim 5 based on actual situation POI trees, it is characterised in that:The step B3 particular contents are as follows:B3.1 takes out set E successivelynewNode enewi, judge the map level DlevelWhether in enewiCorrespondence map grade Other biIn the range of, it is to enter step B3.2, otherwise jumps to step B3.3;B3.2 calculates node enewiCoordinate (xi, yi) and the central point (xo, yo) distance:di=| xi-xo|+|yi-yo|,If di<(dx+dy), then by node enewiIt is put into set Q;B3.3 returns to B3.1 and judges set EnewAll nodes, until each node judges once.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201711195191.1A CN108090134B (en) | 2017-11-24 | 2017-11-24 | Management map expression method based on virtual and real POI tree |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201711195191.1A CN108090134B (en) | 2017-11-24 | 2017-11-24 | Management map expression method based on virtual and real POI tree |
Publications (2)
Publication Number | Publication Date |
---|---|
CN108090134A true CN108090134A (en) | 2018-05-29 |
CN108090134B CN108090134B (en) | 2020-07-24 |
Family
ID=62172954
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201711195191.1A Active CN108090134B (en) | 2017-11-24 | 2017-11-24 | Management map expression method based on virtual and real POI tree |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN108090134B (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111522819A (en) * | 2020-04-24 | 2020-08-11 | 上海用天网络科技有限公司 | Method and system for summarizing tree-structured data |
CN112667758A (en) * | 2020-12-17 | 2021-04-16 | 佳都新太科技股份有限公司 | Interest point aggregation method, map aggregation display method and processing terminal |
Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101216954A (en) * | 2008-01-21 | 2008-07-09 | 浙江大学 | A forest rendering method based on classified hierarchical deep mesh |
CN102359785A (en) * | 2011-09-02 | 2012-02-22 | 广西远长公路桥梁工程有限公司 | Method for automatically generating virtual navigation mark on electronic navigation channel chart according to water level change |
CN102999585A (en) * | 2012-11-15 | 2013-03-27 | 深圳先进技术研究院 | Geographical-position related hash virtual geocoding method and system |
CN105659295A (en) * | 2013-09-24 | 2016-06-08 | Metaio有限公司 | Method for representing points of interest in a view of a real environment on a mobile device and mobile device therefor |
CN106157373A (en) * | 2016-07-27 | 2016-11-23 | 中测高科(北京)测绘工程技术有限责任公司 | A kind of construction three-dimensional model building method and system |
CN107085599A (en) * | 2017-03-31 | 2017-08-22 | 百度在线网络技术(北京)有限公司 | POI recommends method, device, equipment and computer-readable recording medium |
CN107193980A (en) * | 2017-05-26 | 2017-09-22 | 电子科技大学 | Multi-User Dimension inquiry is lower to be realized and uses MRS data tree structures |
-
2017
- 2017-11-24 CN CN201711195191.1A patent/CN108090134B/en active Active
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101216954A (en) * | 2008-01-21 | 2008-07-09 | 浙江大学 | A forest rendering method based on classified hierarchical deep mesh |
CN102359785A (en) * | 2011-09-02 | 2012-02-22 | 广西远长公路桥梁工程有限公司 | Method for automatically generating virtual navigation mark on electronic navigation channel chart according to water level change |
CN102999585A (en) * | 2012-11-15 | 2013-03-27 | 深圳先进技术研究院 | Geographical-position related hash virtual geocoding method and system |
CN105659295A (en) * | 2013-09-24 | 2016-06-08 | Metaio有限公司 | Method for representing points of interest in a view of a real environment on a mobile device and mobile device therefor |
CN106157373A (en) * | 2016-07-27 | 2016-11-23 | 中测高科(北京)测绘工程技术有限责任公司 | A kind of construction three-dimensional model building method and system |
CN107085599A (en) * | 2017-03-31 | 2017-08-22 | 百度在线网络技术(北京)有限公司 | POI recommends method, device, equipment and computer-readable recording medium |
CN107193980A (en) * | 2017-05-26 | 2017-09-22 | 电子科技大学 | Multi-User Dimension inquiry is lower to be realized and uses MRS data tree structures |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111522819A (en) * | 2020-04-24 | 2020-08-11 | 上海用天网络科技有限公司 | Method and system for summarizing tree-structured data |
CN112667758A (en) * | 2020-12-17 | 2021-04-16 | 佳都新太科技股份有限公司 | Interest point aggregation method, map aggregation display method and processing terminal |
CN112667758B (en) * | 2020-12-17 | 2023-04-07 | 佳都科技集团股份有限公司 | Interest point aggregation method, map aggregation display method and processing terminal |
Also Published As
Publication number | Publication date |
---|---|
CN108090134B (en) | 2020-07-24 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN103714185B (en) | Subject event updating method base and urban multi-source time-space information parallel updating method | |
CN106649464B (en) | A kind of construction method and device of Chinese address tree | |
CN104063466B (en) | The 3 D displaying method and system of virtual reality integration | |
CN103473636B (en) | A kind of system data element of collection, analysis and distribution network business information | |
CN108712286A (en) | The determination method, apparatus and storage medium of network topology structure | |
CN104243193A (en) | Network topology dynamic allocation and display method and device | |
CN104572833B (en) | A kind of mapping ruler creation method and device | |
KR101858715B1 (en) | Management System for Service Resource and Method thereof | |
CN104183023A (en) | Multi-scene graph construction method in distributed virtual environment | |
CN104158748B (en) | A kind of topological detecting method towards system for cloud computing | |
CN107947977B (en) | A kind of configuration method of interchanger, device, electronic equipment and storage medium | |
US11989198B1 (en) | User interfaces for database visualizations | |
CN110738577A (en) | Community discovery method, device, computer equipment and storage medium | |
CN102306106A (en) | Method and system for automatically generating navigation chart in virtual space, and pathfinding method and system | |
CN103761276A (en) | Tree-structure data comparison displaying method and device | |
CN108090134A (en) | Management Map Expression method based on actual situation POI trees | |
CN112311571A (en) | Network topology generation method and device, electronic equipment and non-transient storage medium | |
CN108268614A (en) | A kind of distribution management method of forest reserves spatial data | |
CN110287508A (en) | A kind of visualization emerging system of multi-source D Urban model | |
CN112350872A (en) | Network architecture configuration information generation method and device, storage medium and electronic equipment | |
CN109189650A (en) | A kind of operation system topological diagram of IT operational system shows method | |
CN114529664A (en) | Three-dimensional scene model construction method, device, equipment and computer storage medium | |
US20150293971A1 (en) | Distributed queries over geometric objects | |
CN102833110A (en) | Topologic data relation management method in network management software on a large volume of data | |
CN104679904A (en) | Position point query method and device for road network |
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 |