CN105701204A - Road network based electronic map POI extraction method and display method - Google Patents
Road network based electronic map POI extraction method and display method Download PDFInfo
- Publication number
- CN105701204A CN105701204A CN201610018718.2A CN201610018718A CN105701204A CN 105701204 A CN105701204 A CN 105701204A CN 201610018718 A CN201610018718 A CN 201610018718A CN 105701204 A CN105701204 A CN 105701204A
- Authority
- CN
- China
- Prior art keywords
- point
- road
- interest
- segmental arc
- data
- 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
- 238000000034 method Methods 0.000 title claims abstract description 61
- 238000000605 extraction Methods 0.000 title claims abstract description 46
- 239000000725 suspension Substances 0.000 claims description 46
- 230000002093 peripheral effect Effects 0.000 claims description 23
- 238000012545 processing Methods 0.000 claims description 16
- 239000000284 extract Substances 0.000 claims description 9
- 230000010354 integration Effects 0.000 claims description 7
- 238000012856 packing Methods 0.000 claims description 7
- 238000012946 outsourcing Methods 0.000 claims description 6
- 230000000717 retained effect Effects 0.000 claims description 5
- 241001269238 Data Species 0.000 claims description 2
- 238000012217 deletion Methods 0.000 claims description 2
- 230000037430 deletion Effects 0.000 claims description 2
- 238000005192 partition Methods 0.000 claims description 2
- 238000010586 diagram Methods 0.000 description 20
- 230000008569 process Effects 0.000 description 10
- 230000015572 biosynthetic process Effects 0.000 description 2
- VMXUWOKSQNHOCA-UKTHLTGXSA-N ranitidine Chemical compound [O-][N+](=O)\C=C(/NC)NCCSCC1=CC=C(CN(C)C)O1 VMXUWOKSQNHOCA-UKTHLTGXSA-N 0.000 description 2
- 230000003139 buffering effect Effects 0.000 description 1
- 239000002131 composite material Substances 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000007781 pre-processing Methods 0.000 description 1
- 230000008439 repair process Effects 0.000 description 1
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
-
- 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/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Remote Sensing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Navigation (AREA)
Abstract
The present invention provides a road network based electronic map POI (point of interest) extraction method. The method comprises the following steps: A. collecting all POI data, and demonstrating the POI data in a point set form; B. gathering road data of a region which the POI data is in; C. using the road data to establish a topological structure of a road network; D. classifying the POI data according to the road network; and E. extracting the POI data according to the classification of the POI data. According to the extraction method provided by the present invention, more accurate extraction of an electronic map POI can be realized on the basis of no loss of efficiency. The present invention further provides a road network based electronic map POI display method.
Description
Technical field
The present invention relates to the extracting method of a kind of electronic map interest point and display packing, particularly relate to extracting method and the display packing of a kind of electronic map interest point based on road network。
Background technology
Point of interest (PointofInterest, POI) is requisite element in electronic chart, and the multiple dimensioned feature of electronic chart decides the POI quantity shown under different scale and type is otherwise varied。How to efficiently extract the POI of magnanimity, be meet electronic chart under different scale, optimize the important technical of display (expression)。
POI is extracted in the abbreviation being subordinated to point group data to a certain extent。The distribution of Grouped point object is defined four and describes parameter by Ai Tinghua et al., group's point is carried out abbreviation by the method using Voronoi diagram (being again Thiessen polygon or Dirichlet figure, it is made up of one group of continuous polygon being made up of the perpendicular bisector connecting two adjoint point straight lines) dynamic reconstruction。Sea, river convex hull algorithm formation multilayer nest does not reflect the successively distribution characteristics that group puts, and this process is divided into the merging of convex hull layer and comprehensive two subprocess of polygon broken line fixed point。Above method all take into account and maintains the distribution characteristics of point group and space structure, but implements more complicated and computationally intensive, is primarily adapted for use in the Generalization of Grouped Point Objects in small scale, is not suitable for the extraction of POI in large scale city map。
In addition, the thought that some are new is incorporated into extraction and the abbreviation of Grouped point object by some scholar。Wherein, Yan Haowen et al. is by the statistics comprised in point group, special topic, the topological sum metric selected quantificational description factor respectively, and these factors are applied in point group combined process, it is proposed that a map point group integration algorithm based on weighted Voronoi diagrams figure。
In general, arterial street, internal passageway both sides have the different classes of POI data such as commercial facility, communal facility, mechanism and residential area。The distribution of the point data such as street lamp in city, well lid is also affected by the constraint of road, it is common that carry out being distributed along road。For the POI data on large scale, the distribution of city POI data, density have important associating with the environment of road periphery, and therefore POI data is merely regarded as overall point group data is inappropriate。
Summary of the invention
In view of this, present invention is primarily targeted at extracting method and display packing that a kind of electronic map interest point based on road network is provided, to realize extraction and the display of more precisely electronic map interest point on the basis of not depletion efficiency。
A kind of electronic map interest point extracting method based on road network provided by the invention, comprises the following steps:
A, collect all interest point datas, and represent described interest point data with an aggregate form；
B, gather the road data of described interest point data region；
C, use described road data build road network topological structure；
D, according to described road network, described interest point data is classified；
E, classification according to described interest point data, extract described interest point data。
As seen from the above, said method has taken into account associating between the distribution of city POI data, density and the environment of road periphery, for the POI data on large scale, can realize the extraction of more precisely electronic map interest point on the basis of not depletion efficiency。
In the methods described above, described step B also includes: road data described in pretreatment, specific as follows:
Only retain in multiple nodes of the close together on each line object and same meaning；
Remove all nodes to overlap successively or internodal distance is less than in two line objects of node tolerance limit；
Remove the length suspension wire less than default suspension tolerance limit of line object；
Distance from nearest line object is extended to described nearest line object less than the suspension wire of predeterminable range。
As seen from the above, said method reparation or avoid the generation of Topology Error, thus can ensure quality and the availability of data, and then guarantee the accuracy that follow-up data processes and analyzes。
In the methods described above, described step C includes following sub-step:
C1, it is loaded into described road data, rejects the data of attribute error and calculate the minimum outsourcing rectangle of every segmental arc；
C2, judge whether Road intersects with himself, if intersected, then disconnect in point of intersection, thus road is divided into 3 segmental arcs；
C3, road intersection point of intersection disconnect intersect segmental arc, make view picture figure without crossing segmental arc；
C4, minimum outsourcing rectangle according to every segmental arc, be ranked up described segmental arc；
C5, deletion repeat segmental arc, and delete the short and small segmental arc that chain rupture is formed；
C6, the node within the scope of a fixed limit difference is merged into a node；Segmental arc corresponding for node is joined in the set of central node, the node corresponding to segmental arc is become central node simultaneously, and revises the corresponding coordinate of segmental arc；Wherein, corresponding two nodes of each segmental arc, each node is a corresponding segmental arc before merging, and the coordinate figure of the node after merging can be the meansigma methods of the coordinate of multiple node；
C7, with left-turn algorithm or right-hand rotation algorithm keeps track, generate polygon, set up the relation of polygon and segmental arc。
As seen from the above, sub-step C2 can make view picture figure without crossing segmental arc, and then can improve calculating effect。
In the methods described above, described sub-step C4 includes: the maximum Y-axis coordinate figure according to line target, descending all line targets is ranked up；When maximum y value is equal, the maximum X-axis coordinate figure according to line target, descending line target is ranked up, then according to segmental arc data are renumberd by new order。
As seen from the above, lookup retrieval can be made convenient based on the sequence of MBR (minimum outsourcing rectangle)。
In the methods described above, described step D includes:
Relation according to described point of interest Yu the topological structure of road network, by described Partition for Interest Points be: topological network ophthalmic boundary point, topology mesh external boundary point, suspension road peripheral point, topological network intraccular part point and discrete point。
In the methods described above, described step E includes:
The thinning method order of employing is extracted and is belonging respectively to mesh internal boundary points, mesh external boundary point and hangs the described point of interest of road peripheral point, specific as follows:
For current Road, the relief area of described Road is generated, it is judged which point falls into described relief area, namely finds the boundary point of described Road according to one fixed width, calculate each boundary point subpoint to Road, and set up the one-to-one relationship of described boundary point and described subpoint；
Calculate each described subpoint length along the described Road extremely starting point of described Road, according to this length, described subpoint is sorted, be consequently formed and project point set in order；
Point group integration algorithm obtains extraction coefficient K according to the map, and wherein, K=K1/K2, K1 needs counting of the described point of interest retained after being enforcement map point group integration algorithm, and K2 is counting of the described point of interest before implementing map point group integration algorithm；
After determining described extraction coefficient K, determine the extraction interval of projection point set along described Road, judge which point is in extraction interval further according to proximity principle, and then extract, be derived from result projection point set；
According to described one-to-one relationship, find out the described boundary point answered with described result subpoint set pair, thus completing for belonging to mesh internal boundary points, mesh external boundary point, hanging the extraction of described point of interest of road peripheral point。
In the methods described above, before extracting the described point of interest belonging to described suspension road peripheral point, also include:
Judge that belonging to the described point of interest of described suspension road peripheral point is positioned at left side or the right side of Road, and the described point of interest belonging to described suspension road peripheral point is divided into left and right side point set；
Wherein, for the place that road connects, the described point of interest forward for sequence of extraction gives greater weight。
In the methods described above, after having extracted the described point of interest belonging to mesh internal boundary points, mesh external boundary point and suspension road peripheral point, the described point of interest belonging to mesh internal point and discrete point is extracted；Specifically:
First judge the distribution pattern of this type of described point of interest, if this type of point exists certain distribution pattern, then implement to extract according to the method that can keep distribution pattern；If there is no certain distribution pattern, then adopt randomized to extract after setting quantitative index as requested。
In the methods described above, when extracting described point of interest, with road topology mesh or road segmental arc for minimal processing unit；For each processing unit, the described point of interest before extraction is put into and puts concentration temporarily, if the number of some centrostigma is less than a certain threshold value temporarily, then do not implement to extract；Otherwise implement to extract, and extraction result is put in result points set；After the extraction for current processing unit operates and terminates, empty described interim point set, then turn to next processing unit, move in circles according to this, operate completing the extraction to all processing units。
Present invention also offers the display packing of a kind of electronic map interest point based on road network, the method will be shown on electronic chart based on the above-mentioned point of interest arbitrarily extracted based on the extracting method of the electronic map interest point of road network。
Accompanying drawing explanation
Fig. 1 is the flow chart of the electronic map interest point extracting method based on road network of the present invention；
Fig. 2 is road data pretreatment (removal redundant points) schematic diagram, the wherein schematic diagram of (a) road represented by the road data before pretreatment, the schematic diagram of (b) road represented by the road data after pretreatment；
Fig. 3 is road data pretreatment (removal T1 Repeated Line Tl) schematic diagram, the wherein schematic diagram of (a) road represented by the road data before pretreatment, the schematic diagram of (b) road represented by the road data after pretreatment；
Fig. 4 is road data pretreatment (removing short suspension wire) schematic diagram, the wherein schematic diagram of (a) road represented by the road data before pretreatment, the schematic diagram of (b) road represented by the road data after pretreatment；
Fig. 5 is road data pretreatment (long suspension wire extension) schematic diagram, the wherein schematic diagram of (a) road represented by the road data before pretreatment, the schematic diagram of (b) road represented by the road data after pretreatment；
Fig. 6 is road data topological structure schematic diagram；
Fig. 7 is road buffering district schematic diagram；
Fig. 8 is " thinning method " schematic diagram；
Fig. 9 is the schematic diagram of the difference extraction result of road peripheral point；
Figure 10 be before and after the POI data in certain city's urban area is extracted according to schematic diagram, wherein, a () is the situation before extracting, (b) is the result extracted according to the ratio of 50%, and (c) is the result extracted according to the ratio of 20%。
Detailed description of the invention
With reference to the accompanying drawings, provided by the invention a kind of electronic map interest point extracting method based on road network is discussed in detail。Under the design of the present invention, need time the point data in Large-scale Urban is extracted to take into account two aspects: POI (point of interest), as the member of point group, will consider the overall distribution characteristics of comprehensive front and back, distribution density etc.；Except POI is regarded as the member of point group, as an independent some key element, it is also contemplated that its position feature and the constraint information etc. of surrounding atural object。
As it is shown in figure 1, the electronic map interest point extracting method based on road network provided by the invention comprises the following steps:
Step 100: prepare POI data。
In this step, collect all POI data, and represent all POI data with an aggregate form, it may be assumed that all POI data are put in set P, wherein P represent POI extract before the some set of all original POI。Another foundation set S, R, wherein S represents that (POI) point living through extracting is gathered, and R represents the result points set that extraction remains。The above point set is real-time update along with the carrying out extracted。
Step 200: gather the road data of POI data region, and when necessary this road data is implemented pretreatment, to guarantee the connectedness of road data。
In the collection and editing process of spatial data, some mistakes can inevitably occur。Such as, same node or the same line have been digitized twice, as the situation such as crack or crossing, not closing occur faced by adjacent。These mistakes often produce the Topology Errors such as false node, redundant node, suspension wire, T1 Repeated Line Tl, the topological relation thus causing topological relation between the spatial data collected and actual atural object does not meet, and affects the quality of data and availability and follow-up data processing and inversion。
In this step, so-called pretreatment refers to topology preprocessing, namely repairs Topology Error or the process avoiding Topology Error to produce, including checking and repairing two steps。Specifically include removal redundant points, remove T1 Repeated Line Tl, remove short suspension wire and the extension of long suspension wire。
Remove redundant points:
On a line object, when there is the node of multiple close together and same meaning due to operational issue, correct during only one of which node, all the other nodes are redundant node, referred to as redundant points。
As shown in Fig. 2 (a), on line object a, road data, less than node tolerance value, is implemented to be removed as redundant points by some A after topology processes by the distance between some A and some B, and only retention point B, result is such as shown in Fig. 2 (b)。The topology of road data processes the known general knowledge for this area, does not repeat them here。
Remove T1 Repeated Line Tl
When being left out line object direction, when all nodes in two line objects overlap successively (namely coordinate is identical) or internodal distance less than node tolerance limit time, then claim the two line object overlap。Wherein a line object is T1 Repeated Line Tl。Producing area during for avoiding building topology polygon is zero or the minimum polygon object of area, is processed by topology and deletes repetition therein。
As shown in Fig. 3 (a), line object AB overlaps with line object A ' B ', and wherein A ' B ' is T1 Repeated Line Tl。After topology processes, as shown in Fig. 3 (b), T1 Repeated Line Tl A ' B ' is removed。
Remove short suspension wire
If the end points of segmental arc is not connected with the end points of other any one segmental arc, then this end points is referred to as suspension point。The segmental arc comprising suspension point is called suspension wire。Wherein, short suspension wire is the line object that suspended portion is shorter。
As shown in Fig. 4 (a), line object a, b, c comprise suspension wire respectively, and wherein suspension wire a, b is short suspension wire, and the length of suspended portion is less than the tolerance limit arranged, and the length of the suspended portion of suspension wire c is more than the tolerance limit arranged。After topology processes, as shown in Fig. 4 (b), suspension wire a, b are removed, and suspension wire c is retained。
Long suspension wire extends
Relative with above-mentioned short suspension wire, long suspension wire is the line object that suspended portion is longer。
As shown in Fig. 5 (a), line object a, b, c be long suspension wire respectively, and wherein long suspension wire a, b extend to the distance of nearest line object d less than the tolerance limit arranged, and suspension wire c extends to the length of nearest line object d more than the tolerance limit arranged。After topology processes, as shown in Fig. 5 (b), long suspension wire a, b are extended on line object d, and suspension wire c is retained。
Step 300: use the road data processed through above-mentioned steps to build the topological structure of road network。
It is said that in general, the topological Road in road network topological structure can be divided into following three kinds:
1) be associated with other Road (arc), can make up topology mesh topological Road (arc)。This Road feature in topology shows themselves in that at least adjacent polygon of left and right sides of segmental arc。L1-L5 in Fig. 6 is mesh Road, constitutes topology mesh W。
2) be associated with other Road but do not constitute topology mesh Road, namely hang Road, the L6-L13 in Fig. 6。This Road feature in topology shows themselves in that the head and the tail node of segmental arc meets: have and only have the segmental arc that a node associates to only have himself。
3) road that is isolated and that be not associated with other Road is isolated Road, the L15 in Fig. 5。This Road feature in topology shows themselves in that the head and the tail node of segmental arc meets the segmental arc associated simultaneously and only has himself。Isolated Road can be regarded as a kind of special suspension Road。
Although the structure of road network topological structure belongs to techniques known, but in order to make it easy to understand, hereafter still the structure of road network topological structure has been done simple introduction。
Structure generally, for road network topological structure includes following seven steps:
1. the loading of road data and pretreatment, including rejecting the data of attribute error, calculating the MBR (minimum outsourcing rectangle) etc. of every segmental arc。
2. the self intersection chain rupture of road, mainly judges Road whether self intersection (intersecting with himself), if crossing, then in point of intersection disconnection, road is thus divided into 3 segmental arcs。
3. the crossing chain rupture between road, it may be assumed that disconnect in point of intersection and intersect segmental arc, make view picture figure without crossing segmental arc。
4. all line targets descending are ranked up by the MBR sequence of road segmental arc, maximum Y (axial coordinate) value according to line target。When maximum y value is equal, according to maximum X (axial coordinate) value, descending it is ranked up。Then according to segmental arc data are renumberd by new order。
5. the integrated treatment after chain rupture, mainly includes deleting the short and small segmental arc etc. repeating segmental arc, deleting chain rupture formation。
6. the foundation of Knot Searching and node, segmental arc relation。Before coupling, corresponding two nodes of each segmental arc, each node is a corresponding segmental arc before merging。Knot Searching is exactly that the node within the scope of a fixed limit difference is merged into a node, and its coordinate figure can be the meansigma methods of the coordinate of multiple node。So-called node merges, and is segmental arc corresponding for node joined in the set of central node, the node corresponding to segmental arc becomes central node simultaneously, and revises the corresponding coordinate of segmental arc。
7. build polygon。With left-turn algorithm or right-hand rotation algorithm keeps track, generate polygon, set up the relation of polygon and segmental arc。So far, topological transitiveness basically forms。
Step 400: treat, according to the data of above-mentioned road network, the POI data chosen and classify。
In GIS-Geographic Information System, the spatial relationship between each geographic element includes metric relation, direction relations and topological relation。Wherein, topological relation refers to the mutual relation between each spatial data meeting topological geometry principle, it may be assumed that with adjoining between the entity represented by node, segmental arc, polygon and island, associates, comprise and connected relation。Such as, with the coincidence relation etc. from relation, face and face in the syntopy of point, point and the inclusion relation in face, line and face。
In this step, according to the position relationship between point and road topology mesh, point can be divided into two big classes: the point of topological network ophthalmic and the point outside topology mesh。According to point and the relation of Road, point can be divided into: point that Road is distributed about and the point away from Road distribution。Generally speaking, point can be divided into following five classes: topological network ophthalmic boundary point, topology mesh external boundary point, suspension road peripheral point, topological network intraccular part point and discrete point。
For example, gamut as shown in Figure 7 is Q, and road topology mesh is W, and the scope that this mesh comprises is Q2, and the composition Road of road topology mesh W is Li；Set up the relief area with one fixed width for Road Li, the scope that this relief area comprises is Q3。Thus, according to above-mentioned spatial relationship, POI data is classified as follows:
1, will be located in Q3 and be positioned at the dot-dash of Q2 simultaneously being classified as mesh internal boundary points；
2, the dot-dash that will be located in Q3 and be positioned at outside Q2 is classified as mesh external boundary point；
3, taking suspension Road, set up the relief area of one fixed width, the scope that this relief area comprises is Q1, will be located in the dot-dash in Q1 and is classified as suspension road peripheral point；
4, the dot-dash that will be located in Q2 and be positioned at outside Q3 is classified as mesh internal point；
5, the dot-dash outside Q1, Q2, Q3 being classified as discrete point, this type of distant from road, the constraint by road is the most weak。
Step 500: the classification according to POI data, extracts POI data。
In this step, extract the requirement of quantity and distribution characteristics according to POI, and according to the spatial relationship between POI data and road, enforcement order extracted, and concrete grammar is as follows:
First, extracting the POI of road periphery, namely order is extracted mesh internal boundary points, mesh external boundary point, is hung road peripheral point。Concrete employing " thinning method " implements the extraction for above-mentioned POI。
What is called " thinning method " is above: by discrete point and road are carried out upright projection, discrete point is converted to the point being benchmark with road, so as to the distribution characteristics keeping preferably between points, putting between road realization。Concrete scheme is as follows:
For current Road (road topology line), the relief area of Road is generated according to one fixed width, judge which point falls into this relief area, (Road) boundary point can be found, calculate each boundary point subpoint to Road and (boundary point of Road is done vertical line to Road one by one, intersection point is subpoint), and set up the one-to-one relationship (as shown in Figure 8) of boundary point (original point) and subpoint。
Above-mentioned relief area is a kind of coverage or the service area of Geography spatial object, specifically refers to the polygon of the one fixed width set up around point, line, surface entity。
Calculate (being positioned on Road) each subpoint along the length of Road superior self-cultivation route start, according to this length, described subpoint is sorted, be consequently formed and project point set in order。
According to composite request calculate extraction coefficient K, K=K1/K2, K1 be comprehensive after need the POI retained to count, K2 be comprehensive before POI count。Use extraction coefficient K that projection point set in order is carried out interval to choose, and be derived from result projection point set。Specifically, after extraction coefficient K determines, first can determine the extraction interval of projection point set along Road, judge which point is in extraction interval further according to proximity principle, and then extract。
According to above-mentioned corresponding relation, find out the original point answered with result subpoint set pair, thus completing the extraction for boundary point type POI。
Additionally, " thinning method " represents the actual point of nonlinear Distribution with the subpoint of linear distribution, realize the extraction to actual point by subpoint being carried out the extraction of ordering interval。When the distribution hanging road peripheral point is situation shown on the left of Fig. 9, if suspension road peripheral point not being divided into two groups in advance, then the bigger result of the error as shown in Fig. 9 upper right side (point losing on side) can be produced。In view of this, for hanging road peripheral point, before adopting " thinning method " to implement to extract to it, need to first determine whether that hanging road peripheral point is positioned at left side or the right side of Road, suspension road peripheral point is divided into left and right sides totally two groups of point sets, and then adopts above-mentioned " thinning method " to implement to extract to these two groups of point sets respectively。
Furthermore, for the place that road connects, it may appear that the situation that relief area is overlapping。Now, point may be simultaneously in multiple relief area, thus produces attaching problem。So when extraction process, the point forward for sequence of extraction gives greater weight。
After having extracted the POI of road periphery, mesh internal point and discrete point are extracted。Specifically, first judge that the distribution pattern of this type of point (for the Point element set/point group on map, generally may be used to lower parameter and describes the spatial distribution characteristic of Point element set/point group: the importance degree value count, put, the neighbours of point, the difference scope of Point element set/point group and the region covered。Therefore, the distribution pattern of Point element set/point group has multiple, except except road distribution characteristics, also have uniform grid distribution, gather distribution, radial distribution and random distribution etc.), if this type of point exists certain distribution pattern, then implement to extract (extracting modes that different distribution patterns is corresponding different) according to the method that can keep its distribution pattern；If there is no certain distribution pattern (i.e. random distribution pattern), " randomized " is then adopted to extract after setting quantitative index as requested, specifically, the quantity that disclosure satisfy that extraction coefficient K only need to be extracted during extraction, without to take spatial distribution form into account, random function can be adopted to carry out extracting control, until it is qualified to extract quantity。
In said extracted step, when extracting for each type of point, with road topology mesh or road segmental arc for minimal processing unit。For each processing unit, the point before extracting is put in interim point set M, if the number at interim point set M midpoint is less than a certain threshold value, then do not implement to extract；Otherwise implement to extract, and extraction result is put in result points set R。After the extraction operation for current processing unit terminates, empty interim point set M, then turn to next processing unit。Move in circles according to this, operate completing the extraction to all processing units。
Present invention also offers the display packing of a kind of electronic map interest point based on road network, the point of interest extracted based on above-mentioned steps is shown on electronic chart by the method。Figure 10 illustrate the interest point data in certain city's urban area be extracted before and after according to schematic diagram, wherein, a () is the situation before extracting, (b) is the result extracted according to the ratio of 50%, and (c) is the result extracted according to the ratio of 20%。
The foregoing is only presently preferred embodiments of the present invention, not in order to limit the present invention, all within the spirit and principles in the present invention, any amendment of making, equivalent replacement, improvement etc., should be included within protection scope of the present invention。
Claims (10)
1. the electronic map interest point extracting method based on road network, it is characterised in that comprise the following steps:
A, collect all interest point datas, and represent described interest point data with an aggregate form；
B, gather the road data of described interest point data region；
C, use described road data build road network topological structure；
D, according to described road network, described interest point data is classified；
E, classification according to described interest point data, extract described interest point data。
2. method according to claim 1, it is characterised in that described step B also includes: road data described in pretreatment, specific as follows:
Only retain in multiple nodes of the close together on each line object and same meaning；
Remove all nodes to overlap successively or internodal distance is less than in two line objects of node tolerance limit；
Remove the length suspension wire less than default suspension tolerance limit of line object；
Distance from nearest line object is extended to described nearest line object less than the suspension wire of predeterminable range。
3. method according to claim 1 and 2, it is characterised in that described step C includes following sub-step:
C1, it is loaded into described road data, rejects the data of attribute error and calculate the minimum outsourcing rectangle of every segmental arc；
C2, judge whether Road intersects with himself, if intersected, then disconnect in point of intersection, thus road is divided into 3 segmental arcs；
C3, road intersection point of intersection disconnect intersect segmental arc, make view picture figure without crossing segmental arc；
C4, minimum outsourcing rectangle according to every segmental arc, be ranked up described segmental arc；
C5, deletion repeat segmental arc, and delete the short and small segmental arc that chain rupture is formed；
C6, the node within the scope of a fixed limit difference is merged into a node；Segmental arc corresponding for node is joined in the set of central node, the node corresponding to segmental arc is become central node simultaneously, and revises the corresponding coordinate of segmental arc；Wherein, corresponding two nodes of each segmental arc, each node is a corresponding segmental arc before merging, and the coordinate figure of the node after merging can be the meansigma methods of the coordinate of multiple node；
C7, with left-turn algorithm or right-hand rotation algorithm keeps track, generate polygon, set up the relation of polygon and segmental arc。
4. all line targets descending are ranked up by method according to claim 3, it is characterised in that described sub-step C4 includes: the maximum Y-axis coordinate figure according to line target；When maximum y value is equal, the maximum X-axis coordinate figure according to line target, descending line target is ranked up, then according to segmental arc data are renumberd by new order。
5. method according to claim 1, it is characterised in that described step D includes:
Relation according to described point of interest Yu the topological structure of road network, by described Partition for Interest Points be: topological network ophthalmic boundary point, topology mesh external boundary point, suspension road peripheral point, topological network intraccular part point and discrete point。
6. method according to claim 5, it is characterised in that described step E includes:
The thinning method order of employing is extracted and is belonging respectively to mesh internal boundary points, mesh external boundary point and hangs the described point of interest of road peripheral point, specific as follows:
For current Road, the relief area of described Road is generated, it is judged which point falls into described relief area, namely finds the boundary point of described Road according to one fixed width, calculate each boundary point subpoint to Road, and set up the one-to-one relationship of described boundary point and described subpoint；
Calculate each described subpoint length along the described Road extremely starting point of described Road, according to this length, described subpoint is sorted, be consequently formed and project point set in order；
Point group integration algorithm obtains extraction coefficient K according to the map, and wherein, K=K1/K2, K1 needs counting of the described point of interest retained after being enforcement map point group integration algorithm, and K2 is counting of the described point of interest before implementing map point group integration algorithm；
After determining described extraction coefficient K, determine the extraction interval of projection point set along described Road, judge which point is in extraction interval further according to proximity principle, and then extract, be derived from result projection point set；
According to described one-to-one relationship, find out the described boundary point answered with described result subpoint set pair, thus completing for belonging to mesh internal boundary points, mesh external boundary point, hanging the extraction of described point of interest of road peripheral point。
7. method according to claim 6, it is characterised in that before extracting the described point of interest belonging to described suspension road peripheral point, also include:
Judge that belonging to the described point of interest of described suspension road peripheral point is positioned at left side or the right side of Road, and the described point of interest belonging to described suspension road peripheral point is divided into left and right side point set；
Wherein, for the place that road connects, the described point of interest forward for sequence of extraction gives greater weight。
8. method according to claim 7, it is characterised in that after having extracted the described point of interest belonging to mesh internal boundary points, mesh external boundary point and suspension road peripheral point, the described point of interest belonging to mesh internal point and discrete point is extracted；Specifically:
First judge the distribution pattern of this type of described point of interest, if this type of point exists certain distribution pattern, then implement to extract according to the method that can keep its distribution pattern；If there is no certain distribution pattern, then adopt randomized to extract after setting quantitative index as requested。
9. the method according to any one in claim 6 to 8, it is characterised in that
When extracting described point of interest, with road topology mesh or road segmental arc for minimal processing unit；For each processing unit, the described point of interest before extraction is put into and puts concentration temporarily, if the number of some centrostigma is less than a certain threshold value temporarily, then do not implement to extract；Otherwise implement to extract, and extraction result is put in result points set；After the extraction for current processing unit operates and terminates, empty described interim point set, then turn to next processing unit, move in circles according to this, operate completing the extraction to all processing units。
10. the display packing based on the electronic map interest point of road network, it is characterised in that the point of interest extracted based on the extracting method based on the electronic map interest point of road network of any one in the claims 1 to 9 is shown on electronic chart。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610018718.2A CN105701204B (en) | 2016-01-12 | 2016-01-12 | The extracting method and display methods of electronic map interest point based on road network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610018718.2A CN105701204B (en) | 2016-01-12 | 2016-01-12 | The extracting method and display methods of electronic map interest point based on road network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105701204A true CN105701204A (en) | 2016-06-22 |
| CN105701204B CN105701204B (en) | 2018-11-13 |
Family
ID=56226354
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610018718.2A Expired - Fee Related CN105701204B (en) | 2016-01-12 | 2016-01-12 | The extracting method and display methods of electronic map interest point based on road network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105701204B (en) |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106202494A (en) * | 2016-07-19 | 2016-12-07 | 北京道亨时代科技有限公司 | A kind of method extracting line information from ArcGis data base |
| CN106484845A (en) * | 2016-09-30 | 2017-03-08 | 北京百度网讯科技有限公司 | Information point area determination method based on electronic chart and device |
| CN106815344A (en) * | 2017-01-17 | 2017-06-09 | 云南师范大学 | The amplification method of cutting out and device of a kind of electronic map |
| CN107291937A (en) * | 2017-07-05 | 2017-10-24 | 武汉大学 | A kind of isochronal method for visualizing of point of interest POI trips |
| CN107564077A (en) * | 2017-09-04 | 2018-01-09 | 济南浪潮高新科技投资发展有限公司 | A kind of method and device for drawing road network |
| CN107886535A (en) * | 2017-10-24 | 2018-04-06 | 南京师范大学 | A kind of take level road network into account the point amount of loading with computational methods under cloud platform |
| CN107945191A (en) * | 2016-10-11 | 2018-04-20 | 中国测绘科学研究院 | A kind of random Grouped point object Outside contour extraction and target simplify method |
| CN108241712A (en) * | 2016-12-27 | 2018-07-03 | 北京四维图新科技股份有限公司 | A kind of map data processing method and device |
| CN109389119A (en) * | 2018-10-23 | 2019-02-26 | 百度在线网络技术（北京）有限公司 | Point of interest area determination method, device, equipment and medium |
| CN109788498A (en) * | 2018-12-04 | 2019-05-21 | 天津大学 | Topological restorative procedure based on redundant node selection scheduling model in sensor network |
| CN109902134A (en) * | 2019-02-18 | 2019-06-18 | 北京市天元网络技术股份有限公司 | Accurate rendering method, device and the electronic equipment in failure section in engineering road |
| CN110348525A (en) * | 2019-07-15 | 2019-10-18 | 北京百度网讯科技有限公司 | Map point of interest acquisition methods, device, equipment and storage medium |
| CN110556049A (en) * | 2018-06-04 | 2019-12-10 | 百度在线网络技术（北京）有限公司 | map data processing method, device, server and storage medium |
| CN110727793A (en) * | 2018-06-28 | 2020-01-24 | 百度在线网络技术（北京）有限公司 | Method, device, terminal and computer readable storage medium for area identification |
| WO2020063815A1 (en) * | 2018-09-30 | 2020-04-02 | 长城汽车股份有限公司 | Road feature point extraction method and system |
| CN111932653A (en) * | 2019-05-13 | 2020-11-13 | 阿里巴巴集团控股有限公司 | Data processing method and device, electronic equipment and readable storage medium |
| CN112000757A (en) * | 2020-08-25 | 2020-11-27 | 北京四维图新科技股份有限公司 | Road boundary processing method and electronic equipment |
| CN112052549A (en) * | 2020-09-09 | 2020-12-08 | 中国测绘科学研究院 | Method for selecting roads in small mesh gathering area |
| CN112270266A (en) * | 2020-10-29 | 2021-01-26 | 中国测绘科学研究院 | Multi-feature constrained mesh river mainstream identification method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102073981A (en) * | 2011-02-23 | 2011-05-25 | 中国测绘科学研究院 | Point group geographic entity selection method under the restriction of correlated elements |
| CN102436481A (en) * | 2011-10-21 | 2012-05-02 | 武汉大学 | Automatic identification method for road network structure mode |
| CN103824510A (en) * | 2013-12-31 | 2014-05-28 | 厦门雅迅网络股份有限公司 | Voronoi diagram-based electronic map point element screening method |
-
2016
- 2016-01-12 CN CN201610018718.2A patent/CN105701204B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102073981A (en) * | 2011-02-23 | 2011-05-25 | 中国测绘科学研究院 | Point group geographic entity selection method under the restriction of correlated elements |
| CN102436481A (en) * | 2011-10-21 | 2012-05-02 | 武汉大学 | Automatic identification method for road network structure mode |
| CN103824510A (en) * | 2013-12-31 | 2014-05-28 | 厦门雅迅网络股份有限公司 | Voronoi diagram-based electronic map point element screening method |
Non-Patent Citations (1)
| Title |
|---|
| 张云菲等: "语义知识支持的城市ＰＯＩ与道路网集成方法", 《武汉大学学报 信息科学版》 * |
Cited By (34)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106202494A (en) * | 2016-07-19 | 2016-12-07 | 北京道亨时代科技有限公司 | A kind of method extracting line information from ArcGis data base |
| CN106202494B (en) * | 2016-07-19 | 2019-06-14 | 北京道亨时代科技有限公司 | A method of line information is extracted from ArcGis database |
| CN106484845A (en) * | 2016-09-30 | 2017-03-08 | 北京百度网讯科技有限公司 | Information point area determination method based on electronic chart and device |
| CN106484845B (en) * | 2016-09-30 | 2019-10-15 | 北京百度网讯科技有限公司 | Information point area determination method and device based on electronic map |
| CN107945191A (en) * | 2016-10-11 | 2018-04-20 | 中国测绘科学研究院 | A kind of random Grouped point object Outside contour extraction and target simplify method |
| CN108241712B (en) * | 2016-12-27 | 2021-04-20 | 北京四维图新科技股份有限公司 | Map data processing method and device |
| CN108241712A (en) * | 2016-12-27 | 2018-07-03 | 北京四维图新科技股份有限公司 | A kind of map data processing method and device |
| CN106815344B (en) * | 2017-01-17 | 2019-08-16 | 云南师范大学 | A kind of the amplification method of cutting out and device of electronic map |
| CN106815344A (en) * | 2017-01-17 | 2017-06-09 | 云南师范大学 | The amplification method of cutting out and device of a kind of electronic map |
| CN107291937A (en) * | 2017-07-05 | 2017-10-24 | 武汉大学 | A kind of isochronal method for visualizing of point of interest POI trips |
| CN107291937B (en) * | 2017-07-05 | 2021-04-20 | 武汉大学 | Point of interest (POI) travel isochrone visualization method |
| CN107564077B (en) * | 2017-09-04 | 2019-12-10 | 浪潮集团有限公司 | method and device for drawing road network |
| CN107564077A (en) * | 2017-09-04 | 2018-01-09 | 济南浪潮高新科技投资发展有限公司 | A kind of method and device for drawing road network |
| CN107886535A (en) * | 2017-10-24 | 2018-04-06 | 南京师范大学 | A kind of take level road network into account the point amount of loading with computational methods under cloud platform |
| CN107886535B (en) * | 2017-10-24 | 2020-05-05 | 南京师范大学 | Point load calculation method considering hierarchical road network constraint under cloud platform |
| CN110556049B (en) * | 2018-06-04 | 2021-11-12 | 百度在线网络技术（北京）有限公司 | Map data processing method, device, server and storage medium |
| CN110556049A (en) * | 2018-06-04 | 2019-12-10 | 百度在线网络技术（北京）有限公司 | map data processing method, device, server and storage medium |
| CN110727793B (en) * | 2018-06-28 | 2023-03-24 | 百度在线网络技术（北京）有限公司 | Method, device, terminal and computer readable storage medium for area identification |
| CN110727793A (en) * | 2018-06-28 | 2020-01-24 | 百度在线网络技术（北京）有限公司 | Method, device, terminal and computer readable storage medium for area identification |
| WO2020063815A1 (en) * | 2018-09-30 | 2020-04-02 | 长城汽车股份有限公司 | Road feature point extraction method and system |
| CN109389119A (en) * | 2018-10-23 | 2019-02-26 | 百度在线网络技术（北京）有限公司 | Point of interest area determination method, device, equipment and medium |
| CN109389119B (en) * | 2018-10-23 | 2021-10-26 | 百度在线网络技术（北京）有限公司 | Method, device, equipment and medium for determining interest point region |
| CN109788498A (en) * | 2018-12-04 | 2019-05-21 | 天津大学 | Topological restorative procedure based on redundant node selection scheduling model in sensor network |
| CN109902134B (en) * | 2019-02-18 | 2021-10-22 | 北京市天元网络技术股份有限公司 | Method and device for accurately presenting fault road section in engineering road and electronic equipment |
| CN109902134A (en) * | 2019-02-18 | 2019-06-18 | 北京市天元网络技术股份有限公司 | Accurate rendering method, device and the electronic equipment in failure section in engineering road |
| CN111932653B (en) * | 2019-05-13 | 2023-12-15 | 阿里巴巴集团控股有限公司 | Data processing method, device, electronic equipment and readable storage medium |
| CN111932653A (en) * | 2019-05-13 | 2020-11-13 | 阿里巴巴集团控股有限公司 | Data processing method and device, electronic equipment and readable storage medium |
| CN110348525B (en) * | 2019-07-15 | 2022-02-22 | 北京百度网讯科技有限公司 | Map interest point acquisition method, device, equipment and storage medium |
| CN110348525A (en) * | 2019-07-15 | 2019-10-18 | 北京百度网讯科技有限公司 | Map point of interest acquisition methods, device, equipment and storage medium |
| CN112000757A (en) * | 2020-08-25 | 2020-11-27 | 北京四维图新科技股份有限公司 | Road boundary processing method and electronic equipment |
| CN112000757B (en) * | 2020-08-25 | 2024-05-28 | 北京四维图新科技股份有限公司 | Road boundary processing method and electronic equipment |
| CN112052549B (en) * | 2020-09-09 | 2021-03-05 | 中国测绘科学研究院 | Method for selecting roads in small mesh gathering area |
| CN112052549A (en) * | 2020-09-09 | 2020-12-08 | 中国测绘科学研究院 | Method for selecting roads in small mesh gathering area |
| CN112270266A (en) * | 2020-10-29 | 2021-01-26 | 中国测绘科学研究院 | Multi-feature constrained mesh river mainstream identification method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105701204B (en) | 2018-11-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105701204A (en) | Road network based electronic map POI extraction method and display method | |
| Hillier | Spatial sustainability in cities: Organic patterns and sustainable forms | |
| CN106203491A (en) | A kind of fusion update method of highway vector data | |
| US20100277481A1 (en) | Method and apparatus of animation planning for a dynamic graph | |
| CN110232078B (en) | Enterprise group relationship acquisition method and system | |
| CN106204446B (en) | Building merging method for topographic map | |
| CN110111410A (en) | A kind of two three-dimensional pipe network data organizations and display methods based on spatial database | |
| CN111858810B (en) | Modeling elevation point screening method for road DEM construction | |
| CN110008602B (en) | Road network selection method considering multi-feature coordination under large scale | |
| CN104836711A (en) | Construction method of command control network generative model | |
| CN109636870A (en) | A kind of long and narrow figure spot piecemeal melts method and device | |
| KR101394976B1 (en) | Generating methodology of multi-scale model for the attached cadastral map | |
| CN110442994A (en) | A kind of 3D printing sliced sheet processing method based on graph theory | |
| CN110309248A (en) | A method of the traffic route network based on Voronoi diagram divides traffic zone automatically | |
| CN102881039A (en) | Method for building three-dimensional vector models of trees based on three-dimensional laser scanning data | |
| CN107543553A (en) | A kind of point of interest update method and device | |
| CN107358640A (en) | A kind of landform of hill shading target area and the method and device of atural object | |
| CN115757604B (en) | GDP space-time evolution analysis method based on noctilucent image data | |
| CN107945191A (en) | A kind of random Grouped point object Outside contour extraction and target simplify method | |
| CN111814528A (en) | Connectivity analysis noctilucent image city grade classification method | |
| Goldin et al. | Georouting and delta-gathering: Efficient data propagation techniques for geosensor networks | |
| US7181377B1 (en) | Method of modifying a volume mesh using sheet extraction | |
| CN111553566A (en) | Method for defining service range of urban public service facility | |
| de Berg et al. | Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model | |
| CN107045732A (en) | Digital terrain model simplifying method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20181113 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |