CN102298640A - Method for preprocessing map display data - Google Patents
Method for preprocessing map display data Download PDFInfo
- Publication number
- CN102298640A CN102298640A CN2011102709466A CN201110270946A CN102298640A CN 102298640 A CN102298640 A CN 102298640A CN 2011102709466 A CN2011102709466 A CN 2011102709466A CN 201110270946 A CN201110270946 A CN 201110270946A CN 102298640 A CN102298640 A CN 102298640A
- Authority
- CN
- China
- Prior art keywords
- grid
- highway section
- bottom grid
- threshold value
- distance
- 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
Images
Landscapes
- Instructional Devices (AREA)
- Processing Or Creating Images (AREA)
Abstract
The invention relates to a method for preprocessing map display data. The method is characterized by comprising the following steps of: 1) establishing a multi-resolution secondary grid index storage structure, and realizing an estimate read policy on the basis of the index storage structure; 2) controlling the density of a display object of each grid individually to select the reasonable display object; and 3) simplifying the display object in each grid by combining the resolution of human eyes. In the method, the high loading efficiency can be obtained in the directional movement display of a map, the density of display contents in each measuring scale and each area is reasonable, the display objects are simplified on the premise of ensuring the visual effect of the human eyes, and the display data volume is reduced. The method can be widely applied to various vehicle-mounted navigation systems to realize the efficient loading of the map display data.
Description
Technical field
The present invention relates to a kind of data preprocessing method, particularly about a kind of map video data preprocess method in onboard navigation system.
Background technology
One of major function of vehicle-mounted autonomous navigation system is exactly to show in real time to provide relevant navigation information by electronic chart.At present, along with the continuous development of Geographic Information System, show that the required data volume of electronic chart is also in continuous expansion.And vehicle-mounted autonomous navigation system is based upon on the hardware platform based on embedded device mostly, the computing power of its processor and file read-write speed are very limited, if these view data are not carried out in advance tissue and processing, the irrational phenomenon of displaying contents might appear, as very few, accumulation or phenomenon such as overlapping appear, sometimes even can be difficult to realize the real-time demonstration of electronic chart.For addressing this problem, can carry out pre-service to the view data that needs in the electronic chart to show usually.Existing disposal route mainly contains: 1, set up multistage grid index or tree structure, binding cache mechanism, realize the quick location and the loading of data, its shortcoming is: caching mechanism more is applicable to the situation that map moves at random, and orientation commonly used in the navigation is moved the demonstration bad adaptability; 2, utilize the administrative hierarchy of display object, for it specifies display level, the object that under each engineer's scale, shows specific grade, choose the displaying contents of each engineer's scale with this, its shortcoming is: in the zones of different of same ratio chi, it shows that density may differ greatly, sometimes may be overstocked, sometimes may be rare excessively, the quantity of information that provides to the user is very little; 3, the geometric attribute (being generally curve) to display object carries out suitable compression, simplification, reach the purpose of simplifying displaying contents, its shortcoming is: do not make full use of the closeness relation of display object on all directions, compressibility is not high, and the error parameter that uses during compression does not combine with the resolution characteristic of human eye, overcompression phenomenon (display effect variation) or the under-voltage phenomenon that contracts (compressibility reduction) may occur.
Summary of the invention
At the problems referred to above, the purpose of this invention is to provide a kind of map video data preprocess method in onboard navigation system, this method can 1, set up rational map gridding tissue and indexed mode, and consider that orientation commonly used in the navigation moves the demonstration demand, load quick location and the loading that strategy is realized data in conjunction with estimating, move in the demonstration in orientation and can obtain better loading efficiency; 2, control map grid framing size is controlled separately the display object density of each grid, guarantees that the displaying contents density in each engineer's scale, each zone is all comparatively reasonable, for the user provides rational geography information; 3, in conjunction with resolution of eye, the display object in each grid is simplified processing, avoid occurring overcompression or the under-voltage phenomenon that contracts.
For achieving the above object, the present invention takes following technical scheme: a kind of map video data preprocess method, and it comprises three parts: set up the grid index storage organization, select display object and simplify display object for each grid;
1) set up the grid index storage organization, may further comprise the steps:
1. the map under each grade engineer's scale all is divided into two-grid: bottom grid and top layer grid, the size of described bottom grid equals the size of screen, and each top layer grid comprises several bottom grids;
2. the top layer grid of 1. being divided acquisition by step is set up grid index;
3. for four summits of current screen, determine the top layer grid at place respectively according to the grid index of 2. setting up by step, in the top layer grid, further determine the bottom grid at its place;
4. in buffer memory, deposit the data that several bottom grids are comprised, for being provided with one, each bottom grid abandons index simultaneously, and empty buffer unit also is provided with one and abandons index, its size be set to one than other all bottom grids abandon index all big on the occasion of;
5. screen whenever refreshes once, and system update also writes down the index of abandoning of all bottom grids in the current cache:
If system sends the instruction that loads more than one bottom grid in buffer memory, execution in step 6.;
If system does not send the instruction that loads the bottom grid in buffer memory, execution in step 7.;
6. i) load a bottom grid, search for one time buffer memory:
If there has been the bottom grid that will load in the buffer memory, then directly extract this bottom grid data;
If do not deposit the bottom grid that will load to some extent in the buffer memory, then from file, read this bottom grid data, put it in the buffer memory, replace the bottom grid of abandoning the index maximum in the current cache;
Ii) return step I), load another bottom grid, until all bottom grid loadeds that need load;
7. i) to each the bottom grid in the current cache all search for one time it in abutting connection with the bottom grid, i.e. search has an adjacent mesh that overlaps the limit with this bottom grid, and writes down and abandon index accordingly;
Ii) by step I) obtain in the bottom grid, choose the bottom grid of abandoning the index minimum, its data load is put into buffer memory, replacement step 5. in the bottom grid of abandoning the index maximum of institute's mark;
2) select display object for each grid, may further comprise the steps:
1. set a curve density zone of reasonableness for all bottom grids;
2. to display object mark display level;
3. to a bottom grid, the highest level from display level begins, and fills display object from high to low step by step in this bottom grid:
If after finishing other filling of a level, the curve density of this bottom grid just enters by the 1. given curve density zone of reasonableness of step, then stops the filling to this bottom grid, returns step 3., another bottom grid is filled, finish until all bottom grids fillings;
If after finishing other filling of a level, the curve density of this bottom grid is greater than the maximal value by the 1. given curve density zone of reasonableness of step, then abandon this other filling of level, and the filling result of reservation upper level is as net result, return step 3., another bottom grid is filled, finish until all bottom grids fillings;
If after finishing other filling of a level, the curve density of this bottom grid then continues this bottom grid is hanged down other filling of one-level still less than the minimum value by the 1. given curve density zone of reasonableness of step;
3) simplify display object for each grid, may further comprise the steps:
1. adopt end to end highway section in the orientation preferentially method splicing bottom grid, promptly join end to end, and when connecting acute angle that the place constitutes, splice this two highway sections less than given angle threshold when two highway sections;
2. adopt not political reform of node to simplify original broken line in the display result that is 1. obtained by step, cut down the redundant shape value point in highway section, concrete steps are as follows:
I) from original broken line, find out the node of all splicings, the record node location;
Ii) original broken line is carried out the Douglas-Peucker vacuate and simplify, action all is reduced to straight-line segment less than the son section of given action threshold value in every broken line;
Iii) according to step I) record node location, all nodes are inserted into corresponding position;
3. adopt the dynamic thresholding method act of union to the close highway section of distance:
Specify merging preceding highway section set to be F=F
i, merge the set of highway section, back and be G=G
k, the original state that merges the set of highway section, back is an empty set, merges that highway section to be combined is F among the preceding highway section set F
i, P
iBe F
iOn a shape point, new branch highway section is U, merges among highway section, the back set G and P
iNearest point is L
iIf P
iAnd L
i2 distance is less than the value of current dynamic distance threshold value, and the difference of 2 tangential angle is less than the value of current dynamic angle threshold value, and 2 can merge.Merging process is as follows:
I) from merge preceding highway section set F, find out a highway section F to be combined
i
Ii) from highway section F to be combined
iIn find out a shape point P
i
Iii) after merging, find out and shape point P among the highway section set G
iNearest some L
i:
If P
iAnd L
iMerge successfully, then add some P at new branch highway section U afterbody
i, and among this highway section U adding merging back highway section set G, and then empty the highway section U of new branch;
If P
iAnd L
iMerge failure, then only add some P at new branch highway section U afterbody
i
Iv) return step I i), from highway section F to be combined
iIn find out another shape point P
I+1, until handling highway section F to be combined
iOn all shape points;
V) return step I), from merge preceding highway section set F, find out another highway section F to be combined
I+1, finish in all highway sections in handling set F in highway section to be combined.
Above-mentioned part 1) step 4. in, the described index of abandoning is a variable, size is the distance between this underlying network center of a lattice point and screen center's point.
Above-mentioned part 2) step 1. in, described curve density zone of reasonableness is meant that in a bottom grid, curve quantity is in [50,150] interval.
Above-mentioned part 2) step 2. in, according to the administrative hierarchy of described display object it is marked display level.
Above-mentioned part 3) step 1. in, described angle threshold is 30 °.
Above-mentioned part 3) step 2. in, according to human vision in intermediate light, limiting resolution 1.5 ' under the condition of medium-contrast, converse the resolving limit distance of human eye on screen, the conversion of proportion of utilization chi is offered an explanation critical distance with current screen and is transferred corresponding geographical yardstick distance to, as described action threshold value.
Above-mentioned part 3) step 3. in, the method to set up of described dynamic distance threshold value and described dynamic angle threshold value is:
, be used for the dynamic distance threshold value of current judgement and the value of dynamic angle threshold value and get 110% of reference range threshold value and benchmark angle threshold respectively when merging successfully when last;
When last merging is failed, be used for the dynamic distance threshold value of current judgement and the value of dynamic angle threshold value and get 90% of reference range threshold value and benchmark angle threshold respectively.
According to human vision in intermediate light, limiting resolution 1.5 ' under the condition of medium-contrast, converse the resolving limit distance of human eye on screen, the conversion of proportion of utilization chi transfers screen explanation critical distance at this moment to corresponding geographical yardstick distance, as the said reference distance threshold;
The said reference angle threshold is 30 °.
The present invention is owing to take above technical scheme, it has the following advantages: 1, because the secondary grid index storage organization that the present invention constructed location is quick, simple, its cache policy fully takes into account the directed mobile operating mode that often occurs in the navigation procedure, in appropriate loading on the opportunity that does not have loading tasks estimate the grid of abandoning the index minimum, thereby in orientation moves, reduced the situation of once answering demand loading bottom grid, thereby reduced the time to peak consumption of data load.2, because the present invention controls display object density separately for each grid of each engineer's scale, thereby can guarantee that the displaying contents density in each engineer's scale, each zone is all comparatively reasonable, avoided local problem overstocked or that dredge excessively to take place, thereby shown for the user provides rational geography information.3, because the present invention determines the reduced parameter of display object in conjunction with resolution of eye, the display object in each grid is simplified processing, thereby avoided overcompression or the under-voltage phenomenon that contracts to take place, reduced the processing burden of display engine.The present invention can be widely used in the various onboard navigation systems, realizes that the high-level efficiency of map video data loads.
Description of drawings
Fig. 1 is a workflow diagram of the present invention
Fig. 2 is a data store organisation synoptic diagram of the present invention
Fig. 3 is the index and the ordering synoptic diagram of top layer grid of the present invention
Fig. 4 is that buffer memory of the present invention loads synoptic diagram
Fig. 5 is the constant rough schematic view of node of the present invention
Fig. 6 is that curve of the present invention merges synoptic diagram
Embodiment
Below in conjunction with drawings and Examples the present invention is described in detail.
As shown in Figure 1 and Figure 2, the present invention may further comprise the steps the pre-service of each grade engineer's scale map datum:
1) sets up the grid index storage organization;
2) select display object for each grid;
3) simplify display object for each grid.
After finishing above three steps, can be file with the data storage of each grid according to the grid index storage organization of setting up in the step 1), and then can set up the map video data storehouse of multiresolution.
The specific implementation method of above-mentioned steps is described as follows:
1) setting up the grid index storage organization is that map is divided grid, sets up secondary grid index storage organization, and in conjunction with estimating the loading strategy, realizes the quick location of data and loading fast, and it may further comprise the steps:
1. the map under each grade engineer's scale all is divided into two-grid: bottom grid and top layer grid, wherein, and the equal and opposite in direction of each bottom sizing grid and screen, each top layer grid comprises four bottom grids, also can comprise six, number is not limited thereto.
2. as shown in Figure 3, to 1. divide the top layer grid of acquisition by step, set up grid index according to existing technical scheme: promptly all top layer grids are specified a grid numbering successively according to its longitude and latitude order from small to large, thereby setting up the grid numbering concerns one to one with the longitude and latitude interval, thus, by the latitude and longitude value of given geographic coordinate point, just can navigate to the top layer grid at its place fast, to avoid reading of redundant data.Wherein, if given geographic coordinate point is on the common edge of two top layer grids just, then will put along the line direction of itself and screen center's point and move a unit distance e to screen center, obtain a new point, with the top layer grid at this place top layer grid as given geographic coordinate point place.
3. for four summits of current screen, pass through geographic coordinate latitude and longitude value separately respectively, determine the top layer grid at place, and in the top layer grid, further determine the bottom grid at its place according to the grid index that 2. step is set up; Four bottom grids at the place, four summits of current screen have just comprised the video data of current screen demonstration needs.
4. set up the grid buffer memory: promptly deposit the data that several bottom grids are comprised in buffer memory, abandon index for each bottom grid is provided with one simultaneously, this abandons index is variable, and size is the distance between this underlying network center of a lattice point and screen center's point.Wherein, the bottom grid data of abandoning the index maximum will be buffered management system at first and clear out of buffer memory.And abandon index for empty buffer unit also is provided with one, its size be set to one than other all bottom grids abandon index all big on the occasion of, as 100000.
5. as shown in Figure 4, screen whenever refreshes once, and system update also writes down the index of abandoning of all bottom grids in the current cache:
If system sends the instruction that loads more than one bottom grid in buffer memory, execution in step 6.;
If system does not send the instruction that loads the bottom grid in buffer memory, execution in step 7..
6. i) load a bottom grid, search for one time buffer memory:
If there has been the bottom grid that will load in the buffer memory, then directly extract this bottom grid data;
If do not deposit the bottom grid that will load to some extent in the buffer memory, then from file, read this bottom grid data, put it in the buffer memory, replace the bottom grid of abandoning the index maximum in the current cache.
Ii) return step I), load another bottom grid, until all bottom grid loadeds that need load.
7. i) to each the bottom grid in the current cache all search for one time it in abutting connection with the bottom grid, i.e. search has an adjacent mesh that overlaps the limit with this bottom grid, and writes down and abandon index accordingly.
Ii) by step I) obtain in the bottom grid, choose the bottom grid of abandoning the index minimum, its data load is put into buffer memory, replacement step 5. in the bottom grid of abandoning the index maximum of mark.
2) selecting display object for each grid is in given curve density zone of reasonableness, selects for the bottom grid under each engineer's scale to show the highway section object, and it may further comprise the steps:
1. be that all bottom grids are set a curve density zone of reasonableness;
The zone of reasonableness of curve density is meant that in a bottom grid curve quantity is in [50,150] interval, and this interval is determined by practical experience usually.
2. according to the administrative hierarchy of display object, to its mark display level, for example, national highway is a highest level highway section display object, also can carry out classification according to other character of display object, is not limited thereto.
3. to a bottom grid, highest level begins from display level, fills display object from high to low step by step in this bottom grid:
If after finishing other filling of a level, the curve density of this bottom grid just enters by the 1. given curve density zone of reasonableness of step, then stops the filling to this bottom grid, returns step 3., another bottom grid is filled, finish until all bottom grids fillings;
If after finishing other filling of a level, the curve density of this bottom grid is greater than the maximal value by the 1. given curve density zone of reasonableness of step, then abandon this other filling of level, and the filling result of reservation upper level is as net result, return step 3., another bottom grid is filled, finish until all bottom grids fillings;
If after finishing other filling of a level, the curve density of this bottom grid then continues this bottom grid is hanged down other filling of one-level still less than the minimum value by the 1. given curve density zone of reasonableness of step.
3) simplifying display object for each grid is to determine the reduced parameter of display object in conjunction with resolution of eye, and the display object in each bottom grid is simplified processing, reduces highway section quantity to reach, the amount of compressed data purpose, and it may further comprise the steps:
1. adopt end to end highway section in the orientation preferentially method splicing bottom grid, to reduce the quantity that shows the highway section:
Regulation joins end to end when two highway sections, and when connecting acute angle that the place constitutes less than given angle threshold, splices this two highway sections.This angle threshold can be set at 30 °, and it is according to being: when angle threshold is provided with when excessive, the curve shape that splicing is obtained is too complicated, is unfavorable for drawing; When angle threshold is provided with when too small, can reduce the beneficial effect that uses above-mentioned splicing method to reduce highway section quantity; Experiment shows: angle threshold is made as 30 ° can obtains counterbalance effect preferably by between.
Specify the set of original highway section to be E=E
i, wait to expand the highway section set and be D=D
k, waiting that expanding the original state of gathering in the highway section is empty set, i and k are the element subscript.
Carry out taking turns lax splicing: at first from original highway section set E, extract a highway section E
iIf, wait to expand exist among the highway section set D can and E
iThe highway section D of splicing
k, then with E
iAnd D
kPut to D after the splicing, otherwise, directly E
iPut into D, and then from original highway section set E, extract another highway section E
I+1Proceed splicing, light is all got in all highway sections in E.
Execute one take turns lax splicing after, waiting of obtaining expanded the original highway section set E of set D in highway section as the lax splicing of next round, the lax splicing of beginning next round is not till having the highway section that can splice.
2. adopt not political reform of node to simplify original broken line in the display result that 1. obtains by step,, reduce unnecessary resolution to cut down the redundant shape value point in highway section.Therefore it should be noted that wherein that if the node of original broken line splicing place is simplified algorithm to be deleted then splicing place may produce and the discontinuous phenomenon in other highway sections, influence attractive in appearancely, need after simplification finishes, node be put back.As shown in Figure 5, its concrete steps are as follows:
I) from original broken line, find out the node of all splicings, the record node location.
Ii) original broken line is carried out the Douglas-Peucker vacuate and simplify, in this process, an action threshold value is set, action all is reduced to straight-line segment less than the son section of given action threshold value in every broken line; The method to set up of this action threshold value is as follows: human vision is in intermediate light, under the condition of medium-contrast, limiting resolution is 1.5 ', thus, converse the resolving limit distance of human eye on screen, the conversion of proportion of utilization chi is offered an explanation critical distance with current screen and is transferred corresponding geographical yardstick distance to, promptly can be used as the action threshold value.
Iii) according to step I) record node location, all nodes are turned back to corresponding position.
3. as shown in Figure 6, adopt the dynamic thresholding method act of union to the close highway section of distance, with further reduction highway section quantity:
Specify merging preceding highway section set to be F=F
i, merge the set of highway section, back and be G=G
k, the original state that merges the set of highway section, back is an empty set, merges that highway section to be combined is F among the preceding highway section set F
i, P
iBe F
iOn a shape point, new branch highway section is U, merges among highway section, the back set G and P
iNearest point is L
iIf P
iAnd L
i2 distance is less than the value of current dynamic distance threshold value, and the difference of 2 tangential angle is less than the value of current dynamic angle threshold value, and 2 can merge.The detailed process that merges is as follows:
I) from merge preceding highway section set F, find out a highway section F to be combined
i
Ii) from highway section F to be combined
iIn find out a shape point P
i
Iii) after merging, find out and shape point P among the highway section set G
iNearest some L
i:
If P
iAnd L
iMerge successfully, then add some P at new branch highway section U afterbody
i, and among this highway section U adding merging back highway section set G, and then empty the highway section U of new branch;
If P
iAnd L
iMerge failure, then only add some P at new branch highway section U afterbody
i
Iv) return step I i), from highway section F to be combined
iIn find out another shape point P
I+1, until handling highway section F to be combined
iOn all shape points;
V) return step I), from merge preceding highway section set F, find out another highway section F to be combined
I+1, finish in all highway sections in handling set F in highway section to be combined.
Wherein, the method to set up of dynamic distance threshold value and dynamic angle threshold value is as follows:
When merging successfully, the distance threshold and the angle threshold that are used for current judgement are got 110% of reference range threshold value and benchmark angle threshold respectively when last;
When last merging was failed, the distance threshold and the angle threshold that are used for current judgement were got 90% of reference range threshold value and benchmark angle threshold respectively.
Reference range threshold value determination method and the step action threshold value in 2. determines that method is identical; The benchmark angle threshold can be set to 30 ° according to experiment experience.
Claims (14)
1. map video data preprocess method, it comprises three parts: set up the grid index storage organization, select display object and simplify display object for each grid;
1) set up the grid index storage organization, may further comprise the steps:
1. the map under each grade engineer's scale all is divided into two-grid: bottom grid and top layer grid, the size of described bottom grid equals the size of screen, and each top layer grid comprises several bottom grids;
2. the top layer grid of 1. being divided acquisition by step is set up grid index;
3. for four summits of current screen, determine the top layer grid at place respectively according to the grid index of 2. setting up by step, in the top layer grid, further determine the bottom grid at its place;
4. in buffer memory, deposit the data that several bottom grids are comprised, for being provided with one, each bottom grid abandons index simultaneously, and empty buffer unit also is provided with one and abandons index, its size be set to one than other all bottom grids abandon index all big on the occasion of;
5. screen whenever refreshes once, and system update also writes down the index of abandoning of all bottom grids in the current cache:
If system sends the instruction that loads more than one bottom grid in buffer memory, execution in step 6.;
If system does not send the instruction that loads the bottom grid in buffer memory, execution in step 7.;
6. i) load a bottom grid, search for one time buffer memory:
If there has been the bottom grid that will load in the buffer memory, then directly extract this bottom grid data;
If do not deposit the bottom grid that will load to some extent in the buffer memory, then from file, read this bottom grid data, put it in the buffer memory, replace the bottom grid of abandoning the index maximum in the current cache;
Ii) return step I), load another bottom grid, until all bottom grid loadeds that need load;
7. i) to each the bottom grid in the current cache all search for one time it in abutting connection with the bottom grid, i.e. search has an adjacent mesh that overlaps the limit with this bottom grid, and writes down and abandon index accordingly;
Ii) by step I) obtain in the bottom grid, choose the bottom grid of abandoning the index minimum, its data load is put into buffer memory, replacement step 5. in the bottom grid of abandoning the index maximum of institute's mark;
2) select display object for each grid, may further comprise the steps:
1. set a curve density zone of reasonableness for all bottom grids;
2. to display object mark display level;
3. to a bottom grid, the highest level from display level begins, and fills display object from high to low step by step in this bottom grid:
If after finishing other filling of a level, the curve density of this bottom grid just enters by the 1. given curve density zone of reasonableness of step, then stops the filling to this bottom grid, returns step 3., another bottom grid is filled, finish until all bottom grids fillings;
If after finishing other filling of a level, the curve density of this bottom grid is greater than the maximal value by the 1. given curve density zone of reasonableness of step, then abandon this other filling of level, and the filling result of reservation upper level is as net result, return step 3., another bottom grid is filled, finish until all bottom grids fillings;
If after finishing other filling of a level, the curve density of this bottom grid then continues this bottom grid is hanged down other filling of one-level still less than the minimum value by the 1. given curve density zone of reasonableness of step;
3) simplify display object for each grid, may further comprise the steps:
1. adopt end to end highway section in the orientation preferentially method splicing bottom grid, promptly join end to end, and when connecting acute angle that the place constitutes, splice this two highway sections less than given angle threshold when two highway sections;
2. adopt not political reform of node to simplify original broken line in the display result that is 1. obtained by step, cut down the redundant shape value point in highway section, concrete steps are as follows:
I) from original broken line, find out the node of all splicings, the record node location;
Ii) original broken line is carried out the Douglas-Peucker vacuate and simplify, action all is reduced to straight-line segment less than the son section of given action threshold value in every broken line;
Iii) according to step I) record node location, all nodes are inserted into corresponding position;
3. adopt the dynamic thresholding method act of union to the close highway section of distance:
Specify merging preceding highway section set to be F=F
i, merge the set of highway section, back and be G=G
k, the original state that merges the set of highway section, back is an empty set, merges that highway section to be combined is F among the preceding highway section set F
i, P
iBe F
iOn a shape point, new branch highway section is U, merges among highway section, the back set G and P
iNearest point is L
iIf P
iAnd L
i2 distance is less than the value of current dynamic distance threshold value, and the difference of 2 tangential angle is less than the value of current dynamic angle threshold value, and 2 can merge.Merging process is as follows:
I) from merge preceding highway section set F, find out a highway section F to be combined
i
Ii) from highway section F to be combined
iIn find out a shape point P
i
Iii) after merging, find out and shape point P among the highway section set G
iNearest some L
i:
If P
iAnd L
iMerge successfully, then add some P at new branch highway section U afterbody
i, and among this highway section U adding merging back highway section set G, and then empty the highway section U of new branch;
If P
iAnd L
iMerge failure, then only add some P at new branch highway section U afterbody
i
Iv) return step I i), from highway section F to be combined
iIn find out another shape point P
I+1, until handling highway section F to be combined
iOn all shape points;
V) return step I), from merge preceding highway section set F, find out another highway section F to be combined
I+1, finish in all highway sections in handling set F in highway section to be combined.
2. a kind of map video data preprocess method as claimed in claim 1 is characterized in that: step described part 1) 4. in, the described index of abandoning is a variable, size is the distance between this underlying network center of a lattice point and screen center's point.
3. a kind of map video data preprocess method as claimed in claim 1 is characterized in that: step described part 2) 1. in, described curve density zone of reasonableness is meant that in a bottom grid, curve quantity is in [50,150] interval.
4. a kind of map video data preprocess method as claimed in claim 2 is characterized in that: step described part 2) 1. in, described curve density zone of reasonableness is meant that in a bottom grid, curve quantity is in [50,150] interval.
5. as each described a kind of map video data preprocess method of claim 1～4, it is characterized in that: step described part 2) 2. in, according to the administrative hierarchy of described display object it is marked display level.
6. as each described a kind of map video data preprocess method of claim 1～4, it is characterized in that: step described part 3) 1. in, described angle threshold is 30 °.
7. a kind of map video data preprocess method as claimed in claim 5 is characterized in that: step described part 3) 1. in, described angle threshold is 30 °.
8. as claim 1 or 2 or 3 or 4 or 7 each described a kind of map video data preprocess methods, it is characterized in that: step described part 3) 2. in, according to human vision in intermediate light, limiting resolution 1.5 ' under the condition of medium-contrast, converse the resolving limit distance of human eye on screen, the conversion of proportion of utilization chi is offered an explanation critical distance with current screen and is transferred corresponding geographical yardstick distance to, as described action threshold value.
9. a kind of map video data preprocess method as claimed in claim 5, it is characterized in that: step described part 3) 2. in, according to human vision in intermediate light, limiting resolution 1.5 ' under the condition of medium-contrast, converse the resolving limit distance of human eye on screen, the conversion of proportion of utilization chi is offered an explanation critical distance with current screen and is transferred corresponding geographical yardstick distance to, as described action threshold value.
10. a kind of map video data preprocess method as claimed in claim 6, it is characterized in that: step described part 3) 2. in, according to human vision in intermediate light, limiting resolution 1.5 ' under the condition of medium-contrast, converse the resolving limit distance of human eye on screen, the conversion of proportion of utilization chi is offered an explanation critical distance with current screen and is transferred corresponding geographical yardstick distance to, as described action threshold value.
11., it is characterized in that as the described a kind of map video data preprocess method of claim 1～10: step described part 3) 3. in, the method to set up of described dynamic distance threshold value and described dynamic angle threshold value is:
, be used for the dynamic distance threshold value of current judgement and the value of dynamic angle threshold value and get 110% of reference range threshold value and benchmark angle threshold respectively when merging successfully when last;
When last merging is failed, be used for the dynamic distance threshold value of current judgement and the value of dynamic angle threshold value and get 90% of reference range threshold value and benchmark angle threshold respectively.
12. a kind of map video data preprocess method as claimed in claim 11, it is characterized in that: according to human vision in intermediate light, limiting resolution 1.5 ' under the condition of medium-contrast, converse the resolving limit distance of human eye on screen, the conversion of proportion of utilization chi transfers screen explanation critical distance at this moment to corresponding geographical yardstick distance, as described reference range threshold value;
13. a kind of map video data preprocess method as claimed in claim 11, it is characterized in that: described benchmark angle threshold is 30 °.
14. a kind of map video data preprocess method as claimed in claim 12, it is characterized in that: described benchmark angle threshold is 30 °.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110270946 CN102298640B (en) | 2011-09-14 | 2011-09-14 | Method for preprocessing map display data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110270946 CN102298640B (en) | 2011-09-14 | 2011-09-14 | Method for preprocessing map display data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102298640A true CN102298640A (en) | 2011-12-28 |
| CN102298640B CN102298640B (en) | 2013-07-10 |
Family
ID=45359054
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110270946 Active CN102298640B (en) | 2011-09-14 | 2011-09-14 | Method for preprocessing map display data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102298640B (en) |
Cited By (25)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104077326A (en) * | 2013-03-29 | 2014-10-01 | 北京图盟科技有限公司 | Road data processing method and device |
| CN104077311A (en) * | 2013-03-28 | 2014-10-01 | 国际商业机器公司 | Vehicle position index method and device |
| CN104142156A (en) * | 2014-08-26 | 2014-11-12 | 天津市普迅电力信息技术有限公司 | Path navigation method |
| CN104662540A (en) * | 2012-09-26 | 2015-05-27 | 阿尔卡特朗讯 | Method and apparatus for region sampling and estimation in location based networks |
| CN105260366A (en) * | 2014-06-10 | 2016-01-20 | 中兴通讯股份有限公司 | Method and system for determining offset distance |
| CN105512312A (en) * | 2015-12-11 | 2016-04-20 | 中国航空工业集团公司西安航空计算技术研究所 | Accelerating method for two-dimensional map library |
| CN105574194A (en) * | 2015-12-28 | 2016-05-11 | 江苏鸿信系统集成有限公司 | Coordinate point processing method and device for electronic map interface |
| CN106067072A (en) * | 2016-05-30 | 2016-11-02 | 清华大学 | A kind of path self adaptation fast acquiring method under logic road net model |
| CN106153064A (en) * | 2015-04-17 | 2016-11-23 | 高德信息技术有限公司 | The display packing of a kind of intersection and device |
| CN106294407A (en) * | 2015-05-22 | 2017-01-04 | 高德软件有限公司 | A kind of coincidence section determines method and apparatus |
| CN106649653A (en) * | 2016-12-12 | 2017-05-10 | 中国航空工业集团公司西安航空计算技术研究所 | Preprocessing method for onboard vector map data |
| WO2017117703A1 (en) * | 2016-01-04 | 2017-07-13 | 薛俊华 | Navigation advertisement pushing system based on geographical location |
| CN107358649A (en) * | 2017-06-07 | 2017-11-17 | 腾讯科技（深圳）有限公司 | The treating method and apparatus of terrain file |
| CN107545012A (en) * | 2016-06-29 | 2018-01-05 | 高德软件有限公司 | A kind of road end points angle determination method and device |
| CN107766516A (en) * | 2017-10-24 | 2018-03-06 | 浙江工业大学 | A kind of geographical map retained based on border deforms method for visualizing |
| CN108540534A (en) * | 2018-03-16 | 2018-09-14 | 青岛海信移动通信技术股份有限公司 | A kind of determination method and device in the full frame region of terminal |
| CN108573652A (en) * | 2017-03-09 | 2018-09-25 | 腾讯科技（深圳）有限公司 | A kind of road area display methods and device |
| CN110019633A (en) * | 2018-07-20 | 2019-07-16 | 深圳大学 | Line density statistical method and system based on ArcGIS secondary development |
| CN110442575A (en) * | 2019-07-01 | 2019-11-12 | 中山大学 | A kind of index generation method and search method towards scientific big data |
| CN110887499A (en) * | 2018-09-11 | 2020-03-17 | 高德信息技术有限公司 | Method and terminal for processing road data and interest point data in map |
| CN111627204A (en) * | 2020-03-10 | 2020-09-04 | 蘑菇车联信息科技有限公司 | Path determining method and device, electronic equipment and storage medium |
| CN111737392A (en) * | 2020-06-22 | 2020-10-02 | 北京百度网讯科技有限公司 | Method, device and equipment for merging building block data and storage medium |
| CN112131331A (en) * | 2020-09-24 | 2020-12-25 | 腾讯科技（深圳）有限公司 | Map data processing method, map data processing device, computer equipment and storage medium |
| CN112579719A (en) * | 2020-12-18 | 2021-03-30 | 国网福建省电力有限公司经济技术研究院 | High-voltage line multi-loop display method based on power map and storage medium |
| CN114048610A (en) * | 2021-11-15 | 2022-02-15 | 中科三清科技有限公司 | Data output method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009123975A1 (en) * | 2008-03-31 | 2009-10-08 | The Boeing Company | System and method for forming optimized perimeter surveillance |
| CN101630366A (en) * | 2009-07-31 | 2010-01-20 | 中国科学院地理科学与资源研究所 | Method for extracting dynamic inundated area of large numbers of block topographic data, device and system thereof |
-
2011
- 2011-09-14 CN CN 201110270946 patent/CN102298640B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009123975A1 (en) * | 2008-03-31 | 2009-10-08 | The Boeing Company | System and method for forming optimized perimeter surveillance |
| CN101630366A (en) * | 2009-07-31 | 2010-01-20 | 中国科学院地理科学与资源研究所 | Method for extracting dynamic inundated area of large numbers of block topographic data, device and system thereof |
Non-Patent Citations (1)
| Title |
|---|
| 王轩等: "基于分区索引方法的地图快速显示的设计与实现", 《测绘通报》 * |
Cited By (38)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104662540A (en) * | 2012-09-26 | 2015-05-27 | 阿尔卡特朗讯 | Method and apparatus for region sampling and estimation in location based networks |
| US9613528B2 (en) | 2013-03-28 | 2017-04-04 | International Business Machines Corporation | Vehicle position indexing |
| CN104077311A (en) * | 2013-03-28 | 2014-10-01 | 国际商业机器公司 | Vehicle position index method and device |
| CN104077311B (en) * | 2013-03-28 | 2017-11-14 | 国际商业机器公司 | Vehicle location indexing means and device |
| CN104077326B (en) * | 2013-03-29 | 2019-02-19 | 高德软件有限公司 | A kind of processing method and processing device of road data |
| CN104077326A (en) * | 2013-03-29 | 2014-10-01 | 北京图盟科技有限公司 | Road data processing method and device |
| CN105260366A (en) * | 2014-06-10 | 2016-01-20 | 中兴通讯股份有限公司 | Method and system for determining offset distance |
| CN104142156A (en) * | 2014-08-26 | 2014-11-12 | 天津市普迅电力信息技术有限公司 | Path navigation method |
| CN106153064B (en) * | 2015-04-17 | 2020-04-14 | 高德信息技术有限公司 | Display method and device for intersection |
| CN106153064A (en) * | 2015-04-17 | 2016-11-23 | 高德信息技术有限公司 | The display packing of a kind of intersection and device |
| CN106294407A (en) * | 2015-05-22 | 2017-01-04 | 高德软件有限公司 | A kind of coincidence section determines method and apparatus |
| CN106294407B (en) * | 2015-05-22 | 2019-08-13 | 高德软件有限公司 | A kind of coincidence section determines method and apparatus |
| CN105512312A (en) * | 2015-12-11 | 2016-04-20 | 中国航空工业集团公司西安航空计算技术研究所 | Accelerating method for two-dimensional map library |
| CN105574194B (en) * | 2015-12-28 | 2018-12-04 | 江苏鸿信系统集成有限公司 | A kind of coordinate points processing method and processing device for electronic map interface |
| CN105574194A (en) * | 2015-12-28 | 2016-05-11 | 江苏鸿信系统集成有限公司 | Coordinate point processing method and device for electronic map interface |
| WO2017117703A1 (en) * | 2016-01-04 | 2017-07-13 | 薛俊华 | Navigation advertisement pushing system based on geographical location |
| CN106067072A (en) * | 2016-05-30 | 2016-11-02 | 清华大学 | A kind of path self adaptation fast acquiring method under logic road net model |
| CN106067072B (en) * | 2016-05-30 | 2020-01-14 | 清华大学 | Path self-adaptive rapid acquisition method under logic road network model |
| CN107545012A (en) * | 2016-06-29 | 2018-01-05 | 高德软件有限公司 | A kind of road end points angle determination method and device |
| CN107545012B (en) * | 2016-06-29 | 2020-03-13 | 高德软件有限公司 | Road endpoint angle determination method and device |
| CN106649653A (en) * | 2016-12-12 | 2017-05-10 | 中国航空工业集团公司西安航空计算技术研究所 | Preprocessing method for onboard vector map data |
| CN108573652A (en) * | 2017-03-09 | 2018-09-25 | 腾讯科技（深圳）有限公司 | A kind of road area display methods and device |
| CN107358649B (en) * | 2017-06-07 | 2020-11-10 | 腾讯科技（深圳）有限公司 | Processing method and device of terrain file |
| CN107358649A (en) * | 2017-06-07 | 2017-11-17 | 腾讯科技（深圳）有限公司 | The treating method and apparatus of terrain file |
| CN107766516A (en) * | 2017-10-24 | 2018-03-06 | 浙江工业大学 | A kind of geographical map retained based on border deforms method for visualizing |
| CN108540534A (en) * | 2018-03-16 | 2018-09-14 | 青岛海信移动通信技术股份有限公司 | A kind of determination method and device in the full frame region of terminal |
| CN110019633A (en) * | 2018-07-20 | 2019-07-16 | 深圳大学 | Line density statistical method and system based on ArcGIS secondary development |
| CN110019633B (en) * | 2018-07-20 | 2021-08-10 | 深圳大学 | Line density statistical method and system based on ArcGIS secondary development |
| CN110887499A (en) * | 2018-09-11 | 2020-03-17 | 高德信息技术有限公司 | Method and terminal for processing road data and interest point data in map |
| CN110887499B (en) * | 2018-09-11 | 2021-11-02 | 阿里巴巴（中国）有限公司 | Method and terminal for processing road data and interest point data in map |
| CN110442575A (en) * | 2019-07-01 | 2019-11-12 | 中山大学 | A kind of index generation method and search method towards scientific big data |
| CN110442575B (en) * | 2019-07-01 | 2023-07-18 | 中山大学 | Index generation method and retrieval method for scientific big data |
| CN111627204A (en) * | 2020-03-10 | 2020-09-04 | 蘑菇车联信息科技有限公司 | Path determining method and device, electronic equipment and storage medium |
| CN111737392A (en) * | 2020-06-22 | 2020-10-02 | 北京百度网讯科技有限公司 | Method, device and equipment for merging building block data and storage medium |
| CN111737392B (en) * | 2020-06-22 | 2024-04-02 | 北京百度网讯科技有限公司 | Method, device, equipment and storage medium for merging building data |
| CN112131331A (en) * | 2020-09-24 | 2020-12-25 | 腾讯科技（深圳）有限公司 | Map data processing method, map data processing device, computer equipment and storage medium |
| CN112579719A (en) * | 2020-12-18 | 2021-03-30 | 国网福建省电力有限公司经济技术研究院 | High-voltage line multi-loop display method based on power map and storage medium |
| CN114048610A (en) * | 2021-11-15 | 2022-02-15 | 中科三清科技有限公司 | Data output method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102298640B (en) | 2013-07-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102298640B (en) | Method for preprocessing map display data | |
| CN103106152B (en) | Based on the data dispatching method of level storage medium | |
| CN102117500B (en) | Three-dimensional modeling method and system | |
| EP0838764B1 (en) | Map data base management method and system therefor | |
| CN102012232B (en) | Method for updating map data of vehicle-mounted navigation system | |
| CN101339570A (en) | Efficient distributed organization and management method for mass remote sensing data | |
| EP2565583B1 (en) | Navigation device, method of outputting a map, and method of generating a database | |
| CN102141406B (en) | Method for depicting electronic navigation map and server | |
| CN1979488A (en) | Image managing apparatus and image display apparatus | |
| CN102855322B (en) | A kind of map data storage method based on space exploration technology | |
| CN102541418B (en) | Processing method and device for realizing map display | |
| CN103106284B (en) | Subdivision middleware for three-dimensional data global information correlation and information correlation method | |
| CN103279487A (en) | Organization and management method of map tile caching | |
| CN101782399A (en) | Method and device for topologically partitioning road network in navigation electronic map | |
| CN102013991B (en) | Method, management equipment and system for automatically expanding capacity | |
| CN106201355A (en) | Data processing method and device and storage system | |
| CN105378716B (en) | A kind of conversion method and device of data memory format | |
| CN101706809A (en) | Method, device and system for processing multi-source map data | |
| CN102169494A (en) | Distributed remotely-sensed data managing system and method | |
| CN102435200A (en) | Rapid path planning method | |
| CN103309943A (en) | Three-dimensional geographic information platform and topographic data processing method thereof | |
| CN105528460A (en) | Establishing method of tile pyramid model and tile reading method | |
| CN101702245A (en) | Extensible universal three-dimensional terrain simulation system | |
| CN104598394A (en) | Data caching method and system capable of conducting dynamic distribution | |
| CN104778077A (en) | High-speed extranuclear graph processing method and system based on random and continuous disk access |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |