CN106153030A - A kind of data in navigation electronic map storage method and device - Google Patents
A kind of data in navigation electronic map storage method and device Download PDFInfo
- Publication number
- CN106153030A CN106153030A CN201510133272.3A CN201510133272A CN106153030A CN 106153030 A CN106153030 A CN 106153030A CN 201510133272 A CN201510133272 A CN 201510133272A CN 106153030 A CN106153030 A CN 106153030A
- Authority
- CN
- China
- Prior art keywords
- grid
- triangle
- pixel
- sub
- triangle sub
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/005—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 with correlation of navigation data from several sources, e.g. map or contour matching
Abstract
The invention discloses a kind of data in navigation electronic map storage method and device, according to default grid scope, be square net by DTM pixel map cutting；Carry out triangle cutting to square net, and the apex coordinate to the triangle sub-grid generating carries out Coordinate Conversion, generates the opposed apexes coordinate of triangle sub-grid；Obtain the height value on each summit of triangle sub-grid；Height value to the opposed apexes coordinate of the triangle sub-grid of above-mentioned acquisition, each summit of triangle sub-grid, and the vertex sequence of triangle sub-grid stores.Use technical solution of the present invention, the meshes number needing storage reduces, and the relevant information of each pixel when storing data in navigation electronic map, need not be stored, only needing the storage of opposed apexes coordinate, the height value on each summit and the vertex sequence of diabolo sub-grid, memory space shared by data in navigation electronic map is less.
Description
Technical field
The present invention relates to data processing field, particularly relate to a kind of data in navigation electronic map storage method and dress
Put.
Background technology
At present, map of navigation electronic industry storage DTM (Digital Terrain Model, digital terrain model)
During data, use the method storing low precision or high-precision DTM pixel map, specifically include:
It is series of rules grid by DTM pixel map cutting in units of pixel, corresponding one of each grid cell
Latitude and longitude coordinates and height value.When storing DTM pixel map, should store in DTM pixel map each
The height value of individual grid cell, the latitude and longitude coordinates of each grid cell in DTM pixel map also to be stored.
When in units of pixel by the whole nation each city DTM pixel map cutting for series of rules grid when,
Substantial amounts of grid cell can be produced, this need all grid cells of very big memory space storage height value and
Latitude and longitude coordinates, therefore, prior art storage DTM pixel map existence takies the excessive problem of memory space.
For example, with the DTM pixel map that resolution ratio is each city of the 90m*90m storage whole nation, when, needs take
Memory space is about 10G, even if storing after the compression of DTM pixel map, bigger memory space again
Terminal device still can be caused bigger burden by occupancy.
Content of the invention
The embodiment of the present invention provides a kind of data in navigation electronic map storage method and device, in order to solve at present
DTM pixel map takies the big problem of memory space.
The concrete technical scheme that the embodiment of the present invention provides is as follows:
A kind of data in navigation electronic map storage method, comprising:
It according to default grid scope, is square net by digital terrain model DTM pixel map cutting；
Use tangle bintree method, triangle cutting is carried out to described square net, obtains triangle
Sub-grid and the apex coordinate of described triangle sub-grid；
According to the latitude and longitude coordinates of each triangle sub-grid place square net central point, respectively to institute
The apex coordinate stating each triangle sub-grid is changed, and obtains each triangle sub-grid phase described
Opposed apexes coordinate for described triangle sub-grid place square net central point；
The height value of the pixel according to corresponding to each each summit of triangle sub-grid described, obtains institute
State the height value on each summit of each triangle sub-grid, and obtain each triangle sub-grid described
Vertex sequence；
By the opposed apexes coordinate of described triangle sub-grid, the height on each summit of described triangle sub-grid
Journey value, and the vertex sequence of described triangle sub-grid stores to the corresponding triangle of described triangle sub-grid
In shape band.
A kind of data in navigation electronic map storage device, comprising:
Square net cutting unit, for according to the grid scope preset, by digital terrain model DTM
Pixel map cutting is square net；
Triangle sub-grid acquiring unit, is used for using tangle bintree method, to described square net
Carry out triangle cutting, obtain triangle sub-grid and the apex coordinate of described triangle sub-grid；
Opposed apexes coordinate acquiring unit, for according in each triangle sub-grid place square net
The latitude and longitude coordinates of heart point, changes to the apex coordinate of each triangle sub-grid described respectively,
To each triangle sub-grid described relative to described triangle sub-grid place square net central point
Opposed apexes coordinate；
Height value and vertex sequence acquiring unit, for according to each each summit of triangle sub-grid described
The height value of corresponding pixel, obtains the elevation on each summit of each triangle sub-grid described
Value, and obtain the vertex sequence of each triangle sub-grid described；
Memory cell, for by the opposed apexes coordinate of described triangle sub-grid, described triangle sub-grid
The height value on each summit, and the vertex sequence of described triangle sub-grid stores to described triangle
In the corresponding triangle strip of grid.
It in the embodiment of the present invention, according to default grid scope, is square net by DTM pixel map cutting
Lattice；Carry out triangle cutting to square net, and the apex coordinate of the triangle sub-grid generating is carried out
Coordinate Conversion, generates the opposed apexes coordinate of triangle sub-grid；According to each summit institute of triangle sub-grid
The height value of corresponding pixel, obtains the height value on each summit of triangle sub-grid；To above-mentioned acquisition
The opposed apexes coordinate of triangle sub-grid, the height value on each summit of triangle sub-grid, Yi Jisan
The vertex sequence of dihedral sub-grid stores.Owing to the technical scheme is that according to the grid model preset
Enclose, be square net by DTM pixel map cutting, then triangle cutting is carried out to square net obtain
Triangle sub-grid, each the triangle sub-grid so obtaining can comprise multiple pixel, therefore, phase
Use the number that The present invention reduces grid to prior art, meanwhile, the present invention is to data in navigation electronic map
The relevant information of each pixel need not be stored, it is only necessary to diabolo sub-grid relative when storing
The storage of apex coordinate, the height value on each summit and vertex sequence, it can be seen that, the present invention compared to
Prior art, memory space shared by data in navigation electronic map is less, thus alleviates navigator storage
The burden of data in navigation electronic map.
Brief description
Fig. 1 is data in navigation electronic map Stored Procedure figure in the embodiment of the present invention；
Fig. 2 is to the square net schematic diagram after DTM pixel map cutting in the embodiment of the present invention；
Fig. 3 is adjacent two the square net schematic diagrames pre-processing in the embodiment of the present invention；
Fig. 4 a and Fig. 4 b be square net is carried out by the embodiment of the present invention generate after triangle cutting at the beginning of
Beginning Right-Triangle Irregular Network lattice schematic diagram；
Fig. 5 a and Fig. 5 b be the embodiment of the present invention carries out cutting to initial Right-Triangle Irregular Network lattice after
Schematic diagram；
Fig. 6 is the schematic diagram after carrying out cutting to the adjacent triangle that there is crack limit in the embodiment of the present invention；
Fig. 7 is data in navigation electronic map storage device schematic diagram in the embodiment of the present invention；
Fig. 8 is height value updating block structural representation in the embodiment of the present invention；
Fig. 9 is embodiment of the present invention intermediate cam shape sub-grid acquiring unit structural representation；
Figure 10 is opposed apexes coordinate acquiring unit structural representation in the embodiment of the present invention.
Detailed description of the invention
In order to solve at present in DTM model storing process, there are DTM data and take memory space
Big problem.In the embodiment of the present invention, according to default grid scope, by DTM pixel map cutting for just
Square net；Carry out triangle cutting to square net, and the summit of the triangle sub-grid generating is sat
Mark carries out Coordinate Conversion, generates the opposed apexes coordinate of triangle sub-grid；According to triangle sub-grid each
The height value of the pixel corresponding to summit, obtains the height value on each summit of triangle sub-grid；To upper
State the opposed apexes coordinate of the triangle sub-grid of acquisition, the height value on each summit of triangle sub-grid,
And the vertex sequence of triangle sub-grid stores.It due to technical solution of the present invention, is that basis is preset
Grid scope, is square net by DTM pixel map cutting, then carries out triangle to square net and cut
Get triangle sub-grid, each the triangle sub-grid so obtaining can comprise multiple pixel,
Use the number that The present invention reduces grid accordingly, with respect to prior art, meanwhile, the present invention is to navigation electricity
The relevant information of each pixel need not be stored, it is only necessary to diabolo when sub-map datum stores
The storage of the opposed apexes coordinate of grid, the height value on each summit and vertex sequence, it can be seen that, this
Invention is compared to prior art, and memory space shared by data in navigation electronic map is less, thus alleviates and lead
The burden of boat equipment storage data in navigation electronic map.
Below in conjunction with the accompanying drawings the preferred embodiment of the present invention is described in detail.
Refering to shown in Fig. 1, being in the embodiment of the present invention, the process of storage data in navigation electronic map is:
Step 100: according to default grid scope, be square net by DTM pixel map cutting.
In the embodiment of the present invention, the geographic range that DTM pixel map is characterized is relatively big, needs basis to preset
Grid scope, carries out cutting to above-mentioned DTM pixel map, generates at least one square net, this generation
Square net in comprise multiple pixel, and pixel corresponding on each limit in square net
Number is identical, show in the embodiment of the present invention to the pros generating after DTM pixel map cutting refering to Fig. 2
Shape grid schematic diagram；Wherein, above-mentioned grid scope is more than the scope corresponding to a pixel, and can root
Pre-set according to concrete application scenarios.
Optionally, it refering to shown in table 1, is locally generated DTM form, for preserving to DTM pixel
After figure carries out cutting, each square net mark of generation and the gridding information of square net.
Table 1
| ID (major key) | BLOB (DTM pixel map) | Gridding information |
| 1 | …… | A |
In table 1 above, BLOB represents the set of all pixels comprising in square net, this picture
Vegetarian refreshments set comprises latitude and longitude coordinates and the height value of each pixel；Gridding information is square
Grid corresponding index mark.
Step 110: use tangle bintree method, triangle cutting is carried out to square net, obtains
Triangle sub-grid and the apex coordinate of this triangle sub-grid.
In the embodiment of the present invention, terminal, for each square net, all uses tangle bintree method,
Triangle cutting is carried out to this square net, generates multiple triangle sub-grid, and obtain each generation
The apex coordinate of triangle sub-grid.
Due in the adjacent edge of every adjacent two square nets in all square nets after cutting, may
There is the different situation of the height value of the pixel being positioned at adjacent position, in map of navigation electronic, work as phase
When the height value of the pixel being positioned at adjacent position in the adjacent edge of adjacent two square nets is different, will lead
There is discontinuous problem in the map of navigation electronic causing to generate；Therefore, in order to ensure often adjacent two after cutting
The continuity at individual square net edge, it is also preferred that the left before triangle cutting is carried out to square net,
Also needing to pre-process the square net after cutting, this preprocessing process is i.e. obtain according to cutting
In square net every adjacent two square nets every a pair adjacent edge on the height value of pixel, more
The height value of the pixel on newly every a pair adjacent edge.
Optionally, the process pre-processing the square net after cutting, specifically includes: for cutting
After all square nets in often adjacent two square nets, be performed both by operating as follows, obtain this phase
The adjacent edge of adjacent two square nets；According to the position coordinates of the pixel on adjacent edge, obtain this adjacent
In limit, to the distance of the pixel on another adjacent edge and another is adjacent for the pixel on an adjacent edge
Pixel on limit is to the distance of the pixel on said one adjacent edge；Between the pixel obtaining
Distance, obtains the pixel on another nearest adjacent edge of the pixel on distance said one adjacent edge,
And the pixel on the closest said one adjacent edge of the pixel on another adjacent edge；Will
The height value of the pixel on said one adjacent edge is updated to and the pixel on this adjacent edge
The height value of the nearest pixel on another adjacent edge and the mean value of value；By the picture on another adjacent edge
The height value of vegetarian refreshments updates the picture on the said one adjacent edge nearest with the pixel on this another side
The height value of vegetarian refreshments and the mean value of value.For example, refer to shown in Fig. 3, square net ABCD and pros
Shape grid C ' D ' EF is two adjacent square nets, wherein, for square net ABCD, its
Adjacent edge with square net C ' D ' EF is CD, for square C ' D ' EF, and itself and square ABCD
Adjacent edge for and C ' D ', the corresponding pixel of adjacent edge CD is pixel a, pixel b and pixel
The corresponding pixel of c, adjacent edge C ' D ' is respectively pixel a ', pixel b ' and pixel c ', pixel
The height value of a is a1, and the height value of pixel b is b1, and the height value of pixel c is c1, pixel a '
Height value be a2, the height value of pixel b ' is b2, and the height value of pixel c ' is c2, at adjacent edge
Pixel closest with pixel a in all pixels of C ' D ' is pixel a ', at adjacent edge C ' D '
All pixels in the pixel closest with pixel b be pixel b ', adjacent edge C ' D's '
Pixel closest with pixel c in all pixels is pixel c ', therefore, and above-mentioned adjacent edge
The height value of the pixel a of CD is (a1+a2) ÷ 2, and the height value of pixel b is (b1+b2) ÷ 2,
The height value of pixel c is (c1+c2) ÷ 2.In like manner can obtain: the pixel a ' of adjacent edge C ' D '
Height value be (a1+a2) ÷ 2, the height value of pixel b ' be (b1+b2) ÷ 2, the height of pixel c '
Journey value is (c1+c2) ÷ 2.
Use technique scheme, the square net after cutting is pre-processed, make often adjacent two just
The pixel height value being positioned at adjacent position on the adjacent edge of square net is identical, thus after ensure that cutting
The continuity of square net marginal position, and then ensure that the continuous of the map of navigation electronic that ultimately generates
Property.
In the embodiment of the present invention, for above-mentioned pretreated square net, use tangle bintree side
Method carries out cutting, generates triangle sub-grid.
Optionally, for each square net pretreated (such as the square net in Fig. 3
ABCD), it is performed both by operating as follows: carry out triangle cutting to square net, generate 2kIndividual size phase
Deng initial Right-Triangle Irregular Network lattice, k for preset cutting level；When the initial isosceles right angle three of judgement
When hexagonal lattice meets default cutting condition, by the warp on this initial three summits of Right-Triangle Irregular Network lattice
Latitude coordinate is as the apex coordinate of triangle sub-grid；Initial Right-Triangle Irregular Network lattice after cutting
When being unsatisfactory for the cutting condition preset, triangle is proceeded to this initial Right-Triangle Irregular Network lattice and cuts
Point, during until the triangular mesh that cutting obtains meets above-mentioned default cutting condition, three that cutting is obtained
Hexagonal lattice is defined as the triangle sub-grid generating, three summits of the triangular mesh obtaining cutting
Latitude and longitude coordinates is defined as the apex coordinate of triangle sub-grid.Wherein, above-mentioned default cutting condition is
Highest elevation value and minimum elevation in all pixel height value comprising in the triangular mesh that cutting obtains
The difference of value is not up to predetermined threshold value, or above-mentioned default cutting condition is that the triangular mesh that cutting obtains is appointed
The pixel number anticipated in a waist edge meets preset number, and wherein, this preset number could be arranged to 2.
Above-mentioned triangle cutting is carried out to square net during, preset level number can basis
Concrete application pre-sets, and the number of the corresponding initial Right-Triangle Irregular Network lattice of k-th level is the
Two times of the number of the corresponding initial Right-Triangle Irregular Network lattice of k-1 level；For example, Fig. 4 a institute is referred to
Show, square net ABCD makes any one diagonal (such as AC), by square net ABCD
Cutting is two initial Right-Triangle Irregular Network lattice；And refering to shown in Fig. 4 b, for square net
ABCD, makes any one diagonal (such as AC), then makes another in this square net ABCD
Article one, diagonal (such as BD), carries out twice three successively by two diagonal to square net ABCD
Dihedral cutting, generates four equal-sized initial Right-Triangle Irregular Network lattice；In above process, cut
Corresponding first level of 2 initial Right-Triangle Irregular Network lattice after Fen, the initial isosceles in 4 after cutting are straight
Corresponding second level of angle triangular mesh, and ground floor level is positioned on second layer level.Further, according to
Concrete application demand, can also again carry out cutting, generate the initial of more level to above-mentioned square net
Right-Triangle Irregular Network lattice, the initial Right-Triangle Irregular Network lattice number obtaining after the superiors' level cutting is
Few, the initial Right-Triangle Irregular Network lattice number obtaining after lowest level cutting is most；At the beginning of next level
Beginning Right-Triangle Irregular Network lattice number is the two of the initial Right-Triangle Irregular Network lattice number of last layer level
Times.
Based on above-mentioned default cutting condition, optionally, cutting is carried out to square net obtain three above-mentioned
After dihedral sub-grid, when judging that initial Right-Triangle Irregular Network lattice meet default cutting condition, should
The latitude and longitude coordinates on initial three summits of Right-Triangle Irregular Network lattice is sat as the summit of triangle sub-grid
Mark, specifically includes: obtain in the height value of all pixels that initial Right-Triangle Irregular Network lattice are comprised
Highest elevation value and minimum height value；When the difference of highest elevation value and minimum height value is not up to predetermined threshold value
When, using initial Right-Triangle Irregular Network lattice as triangle sub-grid, and by this initial isosceles right angle trigonometry
The latitude and longitude coordinates on three summits of shape grid is as the apex coordinate of triangle sub-grid；For example, Fig. 4 b is referred to
Shown in, after square net ABCD is carried out triangle cutting, generate four initial isosceles right triangles
Grid, respectively △ AED, △ AEB, △ BEC, △ CED, for aforementioned four initial isosceles right angle
Any one in triangular mesh initial Right-Triangle Irregular Network lattice (such as △ AED), obtains this △ AED
The height value of all pixels comprising, if the height value of the pixel of height value maximum and height value minimum
The difference of the height value of pixel is not up to predetermined threshold value (such as 90 meters), then △ AED is defined as triangle
Sub-grid, and the latitude and longitude coordinates by △ AED tri-summits A, E, D is defined as triangle sub-grid
Apex coordinate.Or, obtain the pixel number in any one waist edge of initial Right-Triangle Irregular Network lattice；
When in any one waist edge, pixel number is preset number, using initial Right-Triangle Irregular Network lattice as three
Dihedral sub-grid, and using the latitude and longitude coordinates on this initial three summits of Right-Triangle Irregular Network lattice as triangle
The apex coordinate of shape sub-grid；For example, refering to shown in Fig. 4 b, for aforementioned four initial isosceles right angle three
Any one in hexagonal lattice initial Right-Triangle Irregular Network lattice (such as △ AEB), obtains this △ AEB
The pixel number comprising in any one waist edge AE, if the pixel number comprising on AE is equal to present count
Mesh, then be defined as triangle sub-grid by △ AEB, and by the longitude and latitude of tri-summits A, E, B of △ AEB
Degree coordinate is defined as the apex coordinate of triangle sub-grid.
Optionally, when there is the cutting condition that any one initial Right-Triangle Irregular Network lattice are unsatisfactory for presetting
When, this any one initial Right-Triangle Irregular Network lattice are carried out triangle cutting again, specifically includes: if
Pixel number in this any one waist edge of any one initial Right-Triangle Irregular Network lattice is for more than present count
Purpose odd number, then connect this midpoint, any one initial Right-Triangle Irregular Network lattice base any one initially with this
Corresponding summit, Right-Triangle Irregular Network lattice base, and then by this any one initial Right-Triangle Irregular Network
Lattice cutting is two triangular mesh, and again judges whether the triangular mesh after cutting meets default cutting
The condition of dividing, if being unsatisfactory for, then should carry out further cutting, if meeting, then using grid as triangle subnet
Lattice, and obtain the apex coordinate of this triangle sub-grid；For example, refering to shown in Fig. 5 a, if it is determined that need
Further cutting is carried out to △ CED, adds up the number of pixel in this any one waist edge of △ CED, when
When the number of the pixel in any one waist edge of △ CED is 5, connect the midpoint on summit E and base CD
F, is two triangular mesh by △ CED cutting；If this any one initial Right-Triangle Irregular Network lattice are appointed
The pixel number anticipated in a waist edge is the even number more than preset number, then at this any one initial isosceles right angle
Inserting an interpolated point on triangular mesh base, this interpolated point is positioned at this any one initial isosceles right triangle
The midpoint on grid base, and the height value of this interpolated point is equal at this any one initial Right-Triangle Irregular Network
The mean value of two pixels adjacent with this interpolated point on lattice base, connects interpolated point and corresponding top, base
This any one initial Right-Triangle Irregular Network lattice cutting is two triangular mesh, and again judges by point
Whether the triangular mesh after cutting meets the cutting condition preset, if being unsatisfactory for, then should cut further
Point, if meeting, then using the triangular mesh that ultimately generates as triangle sub-grid, and obtain this triangle
The apex coordinate of sub-grid, for example, refering to shown in Fig. 5 b, if it is determined that need to carry out △ CED further
Cutting, adds up the number of pixel in this any one waist edge of △ CED, when in any one waist edge of △ CED
The number of pixel when being 4, owing to this pixel number is more than preset number, therefore, at the bottom of △ CED
Limit adds interpolated point F, connects the midpoint F on summit E and base CD, be two by △ CED cutting
Triangular mesh.
Optionally, can be according to each summit institute according to the apex coordinate of each triangle sub-grid
The latitude and longitude coordinates of corresponding pixel obtains.
Optionally, above-mentioned predetermined threshold value is the value pre-setting according to concrete application scenarios, and, this is preset
The difference of LOD in the BDAM ultimately generating for the threshold value (display at many levels) level and different, i.e.
Various level predetermined threshold value all differs, and the predetermined threshold value of accurate level is little, the predetermined threshold value of coarse level
Greatly.For example, for the situation generating two initial Right-Triangle Irregular Network lattice after cutting, these two initial
The i.e. corresponding coarse level of Right-Triangle Irregular Network lattice, for four initial isosceles right angle trigonometries of generation after cutting
The situation of shape grid, the corresponding accurate levels of these four initial Right-Triangle Irregular Network lattice, then two initial etc.
The predetermined threshold value of the corresponding level of waist right angled triangle grid is more than four initial Right-Triangle Irregular Network lattice pair
Answer the predetermined threshold value of level.
Further, to the initial Right-Triangle Irregular Network lattice of the above-mentioned cutting condition being unsatisfactory for and presetting or
During person's triangular mesh carries out cutting, often generate a new triangular mesh, be intended to detection with newly
Whether the adjacent triangular mesh of raw triangular mesh is the triangular mesh that there is coarse limit, if so, then true
The limit that there is crack, now, Ying Jiang is comprised between fixed above-mentioned newborn triangular mesh and adjacent triangle grid
The triangular mesh at the limit place in this crack forces to be split into two triangular mesh, i.e. connects newborn triangle
In all summits of the triangular mesh on the singular point in grid and coarse limit with this singular point corresponding summit,
It is two triangular mesh by the above-mentioned triangular mesh cutting that there is coarse limit；When judge cutting after each
When individual triangular mesh meets default cutting condition, the triangular mesh after cutting is defined as triangle
Grid, and obtain the coordinate on three summits of this triangle sub-grid；Wherein, above-mentioned singular point is newborn three
The summit of hexagonal lattice, and singular point is adjacent with a limit of the above-mentioned triangular mesh comprising coarse limit.Example
As, refering to shown in Fig. 6, square net ABCD comprises initial Right-Triangle Irregular Network lattice △ OCD,
Carry out generating after cutting twice △ OCM and △ OMD to △ OCD, owing to △ OCM is unsatisfactory for presetting
Cutting condition, therefore, generates the △ OEF meeting above-mentioned default cutting condition after carrying out cutting to △ OCM,
The triangular mesh adjacent with this △ OEF is △ OMD, comprises F in △ OEF, owing to this F can
Can be positioned above OM limit, if the height value of M point is unequal with the height on OM limit, then OM limit goes out
Crack between existing OF and OM, therefore, by some F as singular point, owing to a F is above OM limit,
Therefore, relative with a F in △ OMD summit is the corresponding summit in OM limit D, tie point D and
Point F, is two triangular mesh by △ OMD cutting.
Use technique scheme, be all made whether there is crack for each newly-generated triangular mesh
The judgement on limit, it is to avoid the crack caused in triangular mesh dicing process, it is ensured that final determine three
Continuity between dihedral sub-grid and adjacent triangle sub-grid.
Optionally, after cutting being carried out to above-mentioned any one initial Right-Triangle Irregular Network lattice, can also be by life
The vertex sequence of the triangle sub-grid becoming stores to corresponding triangle strip, and according to triangle subnet
Lattice and the corresponding triangle strip of triangle sub-grid generate BDAM (Batched Dynamic Adaptive
Meshes, dynamic self-adapting grid) pixel map, preserve to the local BDAMTIN table pre-setting；
Wherein, the corresponding initial Right-Triangle Irregular Network lattice of triangle strip, are used for preserving this initial etc.
The description information of each the triangle sub-grid comprising in waist right angled triangle grid, this describes information is three
The information such as the vertex sequence of dihedral sub-grid, for example, refering to shown in table 2, corresponding for storage △ OCD
The BDAMTIN of triangle strip.
Table 2
| ID (major key) | BDAMTINID | Triangle sub-grid | Gridding information |
| 1 | 1 | (O,M,D) | A |
| 2 | 1 | (M,E,C) | A |
| 3 | 1 | (E,F,M) | A |
| 4 | 1 | (E,F,O) | A |
In table 2, BDAMTINID represents the triangle strip mark of generation；Triangle sub-grid represents
The vertex sequence of the triangle sub-grid comprising in this triangle strip；Gridding information represents square net pair
The index mark answered.
Step 120: according to the latitude and longitude coordinates of each triangle sub-grid place square net central point,
Respectively the apex coordinate of each triangle sub-grid is changed, obtain this each triangle sub-grid
Opposed apexes coordinate relative to described triangle sub-grid place square net central point.
In the embodiment of the present invention, obtain the apex coordinate of each triangle sub-grid respectively, each triangle
The latitude and longitude coordinates of shape sub-grid place square net central point, and the precision unit preset；For often
One triangle sub-grid, is performed both by operating as follows: the apex coordinate according to triangle sub-grid respectively, and three
The latitude and longitude coordinates of dihedral sub-grid place square net central point, and the precision unit preset, respectively
Obtain the latitude and longitude coordinates relative to place square net central point for each summit of triangle sub-grid；
By each summit of triangle sub-grid relative to the latitude and longitude coordinates of square net central point, as three
Dihedral sub-grid is relative to the opposed apexes coordinate of described triangle sub-grid place square net central point.
Optionally, (i.e. triangle sub-grid is relative to pros for the opposed apexes coordinate of above-mentioned triangle sub-grid
The latitude and longitude coordinates of shape grid element center point) equation below can be used to calculate:
The opposed apexes coordinate of triangle sub-grid=[(first summit of triangle sub-grid and this triangle
The distance of grid place square net central point)/precision unit, (second summit of triangle sub-grid with
The distance of this triangle sub-grid place square net central point)/precision unit, (triangle sub-grid
Three summits and the distance of this triangle sub-grid place square net central point)/precision unit]
Wherein, the longitude and latitude on three summits of triangle sub-grid can be from locally stored DTM data
Obtain；Precision unit is the value pre-setting according to concrete application scenarios, as this value could be arranged to 30 meters
Distance.
Optionally, store the memory space required for opposed apexes coordinate of triangle sub-grid, can arrange
It is 2int, wherein, the pixel number that this int value comprises according to square net determines, is traditionally arranged to be
11, and, positive and negative values represents the cartesian coordinate system centered on square net.
Step 130: the height value of the pixel according to corresponding to each each summit of triangle sub-grid,
Obtain the height value on each summit of each triangle sub-grid, and obtain this each triangle sub-grid
Vertex sequence.
In the embodiment of the present invention, a triangle sub-grid comprises multiple pixel, for triangle subnet
Any one summit of lattice, determines this pixel corresponding to any one summit, by the elevation of the pixel of determination
Value is as the height value on this any one summit.
Step 140: by the opposed apexes coordinate of triangle sub-grid, each summit of triangle sub-grid
Height value, and the vertex sequence of triangle sub-grid stores to this triangle sub-grid corresponding triangle bar
In band.
Optionally, the opposed apexes storing the triangle sub-grid comprising respectively in all triangle strip is sat
Mark, the height value of triangle sub-grid, and the vertex sequence of triangle sub-grid；Wherein, above-mentioned triangle
The limit that shape sub-grid meets predetermined threshold value by the height value of the comprised pixel in inside and there is not crack, or
The pixel number comprising in any one waist edge is equal to preset number and the limit that there is not crack.
Table 3
| ID (major key) | BDAMTINID | Gridding information |
| 1 | 1 | A |
| 2 | 2 | A |
| 3 | 3 | A |
| 4 | 4 | A |
The sealene triangle sub-grid of final storage is as shown in table 3.In above-mentioned table 3, BDAMTINID
Represent the triangle strip mark generating, the corresponding triangle strip of this triangle strip mark comprises triangle
The opposed apexes coordinate of the summit mark of shape sub-grid and triangle sub-grid, summit height value and summit sequence
Row；Gridding information represents square net corresponding index mark.
Optionally, above-mentioned triangle strip can also comprise the relative of initial Right-Triangle Irregular Network lattice
Apex coordinate, presents to meet the image under different accuracy grade.
Further, above-mentioned all triangle sub-grids and corresponding triangle strip thereof are stored as dynamic from
Adaptive mess (BDAM).
Use technique scheme, use batch dynamic self-adapting grid mode to DTM data at
Reason, remain the features of terrain of DTM pixel map so that the precision of the dynamic self-adapting grid of generation with
DTM pixel map is compared, and loss of significance naked eyes are difficult to perceive；Further, owing to using the side of grid inner position
Method generates the opposed apexes coordinate of triangle sub-grid, significantly reduces shared by data in navigation electronic map
The size of memory space, data in navigation electronic map compression ratio reaches about 98.5%.Further, since will
The data in navigation electronic map generating is stored as dynamic self-adapting grid (BDAM), more conducively OPENGL
Deng the drafting of Rendering software, so that rendering efficiency and display effect are significantly larger than grid type DTM pixel map.
Based on technique scheme, refering to shown in Fig. 7, the embodiment of the present invention also provides a kind of navigation through electronic ground
Diagram data stores device, including square net cutting unit 70, triangle sub-grid acquiring unit 71,
Opposed apexes coordinate acquiring unit 72, height value and vertex sequence acquiring unit 73, and memory cell 74,
Wherein:
Square net cutting unit 70, for according to the grid scope preset, by digital terrain model DTM
Pixel map cutting is square net；
Triangle sub-grid acquiring unit 71, is used for using tangle bintree method, to described square net
Lattice carry out triangle cutting, obtain triangle sub-grid and the apex coordinate of described triangle sub-grid；
Opposed apexes coordinate acquiring unit 72, for according to each triangle sub-grid place square net
The latitude and longitude coordinates of central point, changes to the apex coordinate of each triangle sub-grid described respectively,
Obtain each triangle sub-grid described relative to square net center, described triangle sub-grid place
The opposed apexes coordinate of point；
Height value and vertex sequence acquiring unit 73, for according to each top of each triangle sub-grid described
The height value of the corresponding pixel of point, obtains the elevation on each summit of each triangle sub-grid described
Value, and obtain the vertex sequence of each triangle sub-grid described；
Memory cell 74, for by the opposed apexes coordinate of described triangle sub-grid, described triangle subnet
The height value on each summit of lattice, and the vertex sequence of described triangle sub-grid stores to described triangle
In the corresponding triangle strip of sub-grid.
Further, said apparatus also includes height value updating block 75, is used for: use tangle bintree
Method, before respectively triangle cutting being carried out to described square net, the square net that obtains according to cutting
In lattice every adjacent two square nets every a pair adjacent edge on the height value of pixel, update every a pair
The height value of the pixel on adjacent edge.
Optionally, refering to shown in Fig. 8, it is single that described height value updating block 75 also includes that adjacent edge obtains son
Unit's the 750th, distance obtains subelement the 751st, pixel and obtains subelement the 752nd, the first renewal subelement 753
Update subelement 754 with second, wherein:
Adjacent edge obtains subelement 750, for obtaining in the square net of generation often adjacent two squares
Every a pair adjacent edge of grid；
Distance obtains subelement 751, for the position coordinates according to the pixel on every a pair adjacent edge, obtains
The pixel taking in every a pair adjacent edge on an adjacent edge is to the distance of the pixel on another adjacent edge
And the pixel on described another adjacent edge is to the distance of the pixel on one adjacent edge；
Pixel obtains subelement 752, for according to the distance between described pixel, obtains apart from described
Pixel on nearest another adjacent edge described of pixel on one adjacent edge and apart from described separately
Pixel on the closest one adjacent edge of the pixel on one adjacent edge；
First renewal subelement 753, for being updated to the height value of the pixel on one adjacent edge
Its height value with the pixel on another adjacent edge described in its nearest neighbours and the mean value of value；
Second renewal subelement 754, for updating it by the height value of the pixel on another adjacent edge described
Mean value with the height value of the pixel on the one adjacent edge away from its nearest neighbours and value.
Optionally, refering to shown in Fig. 9, described triangle sub-grid acquiring unit 71 also includes initial isosceles
Right angled triangle mess generation subelement 710 and determination subelement 711, wherein:
Initial Right-Triangle Irregular Network lattice generate subelement 710, for carrying out three to described square net
Dihedral cutting, generates 2kIndividual equal-sized initial Right-Triangle Irregular Network lattice, k is the sliced layer preset
Level；
Determine subelement 711, preset for judging that whether described initial Right-Triangle Irregular Network lattice meet
If so, described initial Right-Triangle Irregular Network lattice are then defined as the triangle subnet generating by cutting condition
Lattice, and the latitude and longitude coordinates by described initial three summits of Right-Triangle Irregular Network lattice be defined as triangle
The apex coordinate of grid, cuts if it is not, then proceed triangle to described initial Right-Triangle Irregular Network lattice
Point, during until the triangular mesh that cutting obtains meets described default cutting condition, three that cutting is obtained
Hexagonal lattice is defined as the triangle sub-grid generating, three summits of the triangular mesh obtaining cutting
Latitude and longitude coordinates is defined as the apex coordinate of triangle sub-grid.
Optionally, described determination subelement 711, specifically for: obtain described initial isosceles right triangle
Highest elevation value in the height value of all pixels that grid is comprised and minimum height value；When described maximum
When the difference of height value and described minimum height value is not up to predetermined threshold value, by described initial isosceles right triangle
Grid is defined as the triangle sub-grid generating, and by described three summits of initial Right-Triangle Irregular Network lattice
Latitude and longitude coordinates be defined as the apex coordinate of triangle sub-grid；Or, obtain described initial isosceles right angle
Pixel number in any one waist edge of triangular mesh；When in described any one waist edge, pixel number is pre-
If during number, described initial Right-Triangle Irregular Network lattice are defined as the triangle sub-grid generating, and will
The latitude and longitude coordinates on described initial three summits of Right-Triangle Irregular Network lattice is defined as triangle sub-grid
Apex coordinate.
Optionally, refering to shown in Figure 10, described opposed apexes coordinate acquiring unit 72 also includes triangle
Gridding information obtains subelement 720 and opposed apexes coordinate obtains subelement 721, wherein:
Triangle sub-grid acquisition of information subelement 720, for obtaining each triangle sub-grid respectively
Apex coordinate, the latitude and longitude coordinates of each triangle sub-grid place square net central point, and in advance
If precision unit；
Opposed apexes coordinate obtains subelement 721, for for each triangle sub-grid, be performed both by as
Lower operation: according to the apex coordinate of described triangle sub-grid, described triangle sub-grid place square net
The latitude and longitude coordinates of lattice central point, and the precision unit preset, obtain described triangle sub-grid respectively
Each summit is relative to the latitude and longitude coordinates of place square net central point；By described triangle sub-grid
Each summit relative to the latitude and longitude coordinates of place square net central point, as described triangle
Grid is relative to the opposed apexes coordinate of place square net central point.
In sum, in the embodiment of the present invention, according to default grid scope, by DTM pixel map cutting
For square net；Use tangle bintree method, triangle cutting is carried out to square net, obtains
Triangle sub-grid and the apex coordinate of this triangle sub-grid；According to each triangle sub-grid place
The latitude and longitude coordinates of square net central point, is carried out to the apex coordinate of each triangle sub-grid respectively
Conversion, obtains this each triangle sub-grid relative in the square net of described triangle sub-grid place
The opposed apexes coordinate of heart point；The height of the pixel according to corresponding to each each summit of triangle sub-grid
Journey value, obtains the height value on each summit of each triangle sub-grid, and obtains this each triangle
The vertex sequence of sub-grid；By the opposed apexes coordinate of triangle sub-grid, each top of triangle sub-grid
The height value of point, and the vertex sequence of triangle sub-grid stores to this corresponding triangle of triangle sub-grid
In shape band.Owing to the technical scheme is that according to the grid scope preset, by DTM pixel map cutting
For square net, then triangle cutting is carried out to square net obtain triangle sub-grid, so obtain
Each triangle sub-grid can comprise multiple pixel, therefore, hinge structure uses the present invention to subtract
Lack the number of grid, meanwhile, need not store each when data in navigation electronic map is stored by the present invention
The relevant information of individual pixel, it is only necessary to the opposed apexes coordinate of diabolo sub-grid, the height on each summit
Journey value and the storage of vertex sequence, it can be seen that, the present invention is compared to prior art, map of navigation electronic
Shared by data, memory space is less, thus alleviates the negative of navigator storage data in navigation electronic map
Load.
Those skilled in the art are it should be appreciated that embodiments of the invention can be provided as method, system or meter
Calculation machine program product.Therefore, the present invention can use complete hardware embodiment, complete software implementation or knot
The form of the embodiment in terms of closing software and hardware.And, the present invention can use and wherein wrap one or more
Computer-usable storage medium containing computer usable program code (including but not limited to magnetic disc store,
CD-ROM, optical memory etc.) form of the upper computer program implemented.
The present invention is with reference to method according to embodiments of the present invention, equipment (system) and computer program product
The flow chart of product and/or block diagram describe.It should be understood that can by computer program instructions flowchart and
/ or block diagram in each flow process and/or the flow process in square frame and flow chart and/or block diagram and/
Or the combination of square frame.These computer program instructions can be provided to all-purpose computer, special-purpose computer, embed
The processor of formula processor or other programmable data processing device is to produce a machine so that by calculating
The instruction that the processor of machine or other programmable data processing device performs produces for realizing at flow chart one
The device of the function specified in individual flow process or multiple flow process and/or one square frame of block diagram or multiple square frame.
These computer program instructions may be alternatively stored in and computer or the process of other programmable datas can be guided to set
In the standby computer-readable memory working in a specific way so that be stored in this computer-readable memory
Instruction produce and include the manufacture of command device, this command device realizes in one flow process or multiple of flow chart
The function specified in flow process and/or one square frame of block diagram or multiple square frame.
These computer program instructions also can be loaded in computer or other programmable data processing device, makes
Sequence of operations step must be performed to produce computer implemented place on computer or other programmable devices
Reason, thus the instruction performing on computer or other programmable devices provides for realizing flow chart one
The step of the function specified in flow process or multiple flow process and/or one square frame of block diagram or multiple square frame.
Although preferred embodiments of the present invention have been described, but those skilled in the art once know base
This creativeness concept, then can make other change and modification to these embodiments.So, appended right is wanted
Ask all changes and the modification being intended to be construed to include preferred embodiment and fall into the scope of the invention.
Obviously, those skilled in the art can carry out various change and modification and not take off to the embodiment of the present invention
Spirit and scope from the embodiment of the present invention.So, if these modifications of the embodiment of the present invention and modification belong to
Within the scope of the claims in the present invention and equivalent technologies thereof, then the present invention be also intended to comprise these change and
Including modification.
Claims (12)
1. a data in navigation electronic map storage method, it is characterised in that include:
It according to default grid scope, is square net by digital terrain model DTM pixel map cutting；
Use tangle bintree method, triangle cutting is carried out to described square net, obtains triangle
Sub-grid and the apex coordinate of described triangle sub-grid；
According to the latitude and longitude coordinates of each triangle sub-grid place square net central point, respectively to institute
The apex coordinate stating each triangle sub-grid is changed, and obtains each triangle sub-grid phase described
Opposed apexes coordinate for described triangle sub-grid place square net central point；
The height value of the pixel according to corresponding to each each summit of triangle sub-grid described, obtains institute
State the height value on each summit of each triangle sub-grid, and obtain each triangle sub-grid described
Vertex sequence；
By the opposed apexes coordinate of described triangle sub-grid, the height on each summit of described triangle sub-grid
Journey value, and the vertex sequence of described triangle sub-grid stores to the corresponding triangle of described triangle sub-grid
In shape band.
2. the method for claim 1, it is characterised in that use tangle bintree method is right
Before described square net carries out triangle cutting, farther include:
On every a pair adjacent edge according to every adjacent two square nets in the square net that cutting obtains
The height value of pixel, update the height value of pixel on every a pair adjacent edge.
3. method as claimed in claim 2, it is characterised in that the described square obtaining according to cutting
In grid every adjacent two grids every a pair adjacent edge on the height value of pixel, update every a pair adjacent
The height value of the pixel on limit, specifically includes:
Obtain every a pair adjacent edge of often adjacent two square nets in the square net generating；
According to the position coordinates of the pixel on every a pair adjacent edge, obtain in every a pair adjacent edge one adjacent
Pixel on limit is to the picture in the distance and another adjacent edge described of the pixel on another adjacent edge
Vegetarian refreshments is to the distance of the pixel on one adjacent edge；
According to the distance between described pixel, obtain the pixel on distance one adjacent edge nearest
The distance of the pixel on another adjacent edge described and the pixel on another adjacent edge described is
The near pixel on one adjacent edge；
The height value of the pixel on one adjacent edge is updated to its with away from its nearest neighbours described separately
The height value of the pixel on one adjacent edge and the mean value of value；
The height value of the pixel on another adjacent edge described is updated itself and the one away from its nearest neighbours
The height value of the pixel on adjacent edge and the mean value of value.
4. the method as described in any one of claim 1-3, it is characterised in that use tangle bintree
Method, carries out triangle cutting to described square net, obtains triangle sub-grid and described triangle
The apex coordinate of sub-grid, specifically includes:
Carry out triangle cutting to described square net, generate 2kIndividual equal-sized initial isosceles right angle three
Hexagonal lattice, k is the cutting level preset；
Judge whether described initial Right-Triangle Irregular Network lattice meet the cutting condition preset, if so, then will
Described initial Right-Triangle Irregular Network lattice are defined as the triangle sub-grid generating, and by described initial isosceles
The latitude and longitude coordinates on three summits of right angled triangle grid is defined as the apex coordinate of triangle sub-grid, if
No, then triangle cutting is proceeded to described initial Right-Triangle Irregular Network lattice, until what cutting obtained
When triangular mesh meets described default cutting condition, the triangular mesh obtaining cutting is defined as generating
Triangle sub-grid, the latitude and longitude coordinates on three summits of the triangular mesh obtaining cutting is defined as three
The apex coordinate of dihedral sub-grid.
5. method as claimed in claim 4, it is characterised in that when the described initial isosceles right angle three of judgement
When hexagonal lattice meets default cutting condition, described initial Right-Triangle Irregular Network lattice are defined as generate
Triangle sub-grid, and by true for the latitude and longitude coordinates on described initial three summits of Right-Triangle Irregular Network lattice
It is set to the apex coordinate of triangle sub-grid, specifically include:
Obtain in the height value of all pixels that described initial Right-Triangle Irregular Network lattice are comprised
Big height value and minimum height value；When the difference of described highest elevation value and described minimum height value is not up to preset
During threshold value, described initial Right-Triangle Irregular Network lattice are defined as the triangle sub-grid generating, and by institute
The latitude and longitude coordinates stating initial three summits of Right-Triangle Irregular Network lattice is defined as the top of triangle sub-grid
Point coordinates；Or,
Obtain the pixel number in any one waist edge of described initial Right-Triangle Irregular Network lattice；When described
When in a waist edge of anticipating, pixel number is preset number, described initial Right-Triangle Irregular Network lattice are defined as
The triangle sub-grid generating, and the longitude and latitude on described initial three summits of Right-Triangle Irregular Network lattice is sat
Mark is defined as the apex coordinate of triangle sub-grid.
6. the method for claim 1, it is characterised in that square according to each triangle place
The latitude and longitude coordinates of shape grid element center point, carries out to the apex coordinate of each triangle sub-grid turning respectively
Change, obtain each triangle sub-grid relative to described triangle sub-grid place square net central point
Opposed apexes coordinate, specifically include:
Obtaining the apex coordinate of each triangle sub-grid respectively, each triangle sub-grid place is square
The latitude and longitude coordinates of shape grid element center point, and the precision unit preset；
It for each triangle sub-grid, is performed both by operating as follows:
According to the apex coordinate of described triangle sub-grid, in the square net of described triangle sub-grid place
The latitude and longitude coordinates of heart point, and the precision unit preset, obtain each of described triangle sub-grid respectively
Individual summit is relative to the latitude and longitude coordinates of place square net central point；
By each summit of described triangle sub-grid relative to the longitude and latitude of place square net central point
Degree coordinate, sits relative to the opposed apexes of place square net central point as described triangle sub-grid
Mark.
7. a data in navigation electronic map storage device, it is characterised in that include:
Square net cutting unit, for according to the grid scope preset, by digital terrain model DTM
Pixel map cutting is square net；
Triangle sub-grid acquiring unit, is used for using tangle bintree method, to described square net
Carry out triangle cutting, obtain triangle sub-grid and the apex coordinate of described triangle sub-grid；
Opposed apexes coordinate acquiring unit, for according in each triangle sub-grid place square net
The latitude and longitude coordinates of heart point, changes to the apex coordinate of each triangle sub-grid described respectively,
To each triangle sub-grid described relative to described triangle sub-grid place square net central point
Opposed apexes coordinate；
Height value and vertex sequence acquiring unit, for according to each each summit of triangle sub-grid described
The height value of corresponding pixel, obtains the elevation on each summit of each triangle sub-grid described
Value, and obtain the vertex sequence of each triangle sub-grid described；
Memory cell, for by the opposed apexes coordinate of described triangle sub-grid, described triangle sub-grid
The height value on each summit, and the vertex sequence of described triangle sub-grid stores to described triangle
In the corresponding triangle strip of grid.
8. device as claimed in claim 7, it is characterised in that also include height value updating block, use
In:
Use tangle bintree method, before respectively triangle cutting being carried out to described square net, root
According to the pixel on every a pair adjacent edge of every adjacent two square nets in the square net that cutting obtains
The height value of point, updates the height value of pixel on every a pair adjacent edge.
9. device as claimed in claim 8, it is characterised in that described height value updating block includes:
Adjacent edge obtains subelement, for obtaining in the square net of generation often adjacent two square nets
Every a pair adjacent edge；
Distance obtains subelement, for the position coordinates according to the pixel on every a pair adjacent edge, obtains every
In a pair adjacent edge the pixel on an adjacent edge to the pixel on another adjacent edge distance and
Pixel on another adjacent edge described is to the distance of the pixel on one adjacent edge；
Pixel obtains subelement, for according to the distance between described pixel, obtains distance one
Pixel on nearest another adjacent edge described of pixel on adjacent edge and apart from another phase described
Pixel on the closest one adjacent edge of the pixel on adjacent side；
First renewal subelement, for the height value of the pixel on one adjacent edge is updated to its with
The height value of the pixel on another adjacent edge described in its nearest neighbours and the mean value of value；
Second renewal subelement, for the height value of the pixel on another adjacent edge described updated its with away from
The height value of the pixel on the one adjacent edge of its nearest neighbours and the mean value of value.
10. the device as described in any one of claim 7-9, it is characterised in that described triangle sub-grid
Acquiring unit includes:
Initial Right-Triangle Irregular Network lattice generate subelement, for carrying out triangle to described square net
Cutting, generates 2kIndividual equal-sized initial Right-Triangle Irregular Network lattice, k is the cutting level preset；
Determine subelement, for judging whether described initial Right-Triangle Irregular Network lattice meet the cutting preset
If so, described initial Right-Triangle Irregular Network lattice are then defined as the triangle sub-grid generating by condition,
And the latitude and longitude coordinates by described initial three summits of Right-Triangle Irregular Network lattice is defined as triangle subnet
The apex coordinate of lattice, if it is not, then triangle cutting is proceeded to described initial Right-Triangle Irregular Network lattice,
During until the triangular mesh that cutting obtains meets described default cutting condition, the triangle that cutting is obtained
Grid is defined as the triangle sub-grid generating, the longitude and latitude on three summits of the triangular mesh obtaining cutting
Degree coordinate is defined as the apex coordinate of triangle sub-grid.
11. devices as claimed in claim 10, it is characterised in that described determination subelement, specifically use
In:
Obtain in the height value of all pixels that described initial Right-Triangle Irregular Network lattice are comprised
Big height value and minimum height value；When the difference of described highest elevation value and described minimum height value is not up to preset
During threshold value, described initial Right-Triangle Irregular Network lattice are defined as the triangle sub-grid generating, and by institute
The latitude and longitude coordinates stating initial three summits of Right-Triangle Irregular Network lattice is defined as the top of triangle sub-grid
Point coordinates；Or,
Obtain the pixel number in any one waist edge of described initial Right-Triangle Irregular Network lattice；When described
When in a waist edge of anticipating, pixel number is preset number, described initial Right-Triangle Irregular Network lattice are defined as
The triangle sub-grid generating, and the longitude and latitude on described initial three summits of Right-Triangle Irregular Network lattice is sat
Mark is defined as the apex coordinate of triangle sub-grid.
12. devices as claimed in claim 7, it is characterised in that described opposed apexes coordinate acquiring unit
Including:
Triangle sub-grid acquisition of information subelement, for obtaining the summit of each triangle sub-grid respectively
Coordinate, the latitude and longitude coordinates of each triangle sub-grid place square net central point, and preset
Precision unit；
Opposed apexes coordinate obtains subelement, for for each triangle sub-grid, is performed both by grasping as follows
Make: according to the apex coordinate of described triangle sub-grid, in the square net of described triangle sub-grid place
The latitude and longitude coordinates of heart point, and the precision unit preset, obtain each of described triangle sub-grid respectively
Individual summit is relative to the latitude and longitude coordinates of place square net central point；Every by described triangle sub-grid
One summit is relative to the latitude and longitude coordinates of place square net central point, as described triangle sub-grid
Opposed apexes coordinate relative to place square net central point.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510133272.3A CN106153030A (en) | 2015-03-25 | 2015-03-25 | A kind of data in navigation electronic map storage method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510133272.3A CN106153030A (en) | 2015-03-25 | 2015-03-25 | A kind of data in navigation electronic map storage method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106153030A true CN106153030A (en) | 2016-11-23 |
Family
ID=57339584
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510133272.3A Pending CN106153030A (en) | 2015-03-25 | 2015-03-25 | A kind of data in navigation electronic map storage method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106153030A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109598793A (en) * | 2018-11-27 | 2019-04-09 | 武大吉奥信息技术有限公司 | The production method and device of quickly modification vegetation and water body are measured based on oblique photograph |
| CN110136262A (en) * | 2019-05-17 | 2019-08-16 | 中科三清科技有限公司 | Water body virtual visualization method and apparatus |
| CN113066151A (en) * | 2020-01-02 | 2021-07-02 | 沈阳美行科技有限公司 | Map data processing method, device, equipment and storage medium |
| CN113254567A (en) * | 2021-06-25 | 2021-08-13 | 智道网联科技(北京)有限公司 | Variable-precision high-precision map data storage method and storage device |
| CN113838202A (en) * | 2021-09-27 | 2021-12-24 | 北京百度网讯科技有限公司 | Method, device and equipment for processing three-dimensional model in map and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1866299A (en) * | 2006-06-27 | 2006-11-22 | 北京航空航天大学 | Three-dimensional model simplifying method based on visual feature measurement |
| CN102930594A (en) * | 2012-09-20 | 2013-02-13 | 中国科学院自动化研究所 | Rendering method for computer three-dimensional terrain grid based on boundary maintenance |
| CN103150758A (en) * | 2013-02-06 | 2013-06-12 | 河北钢铁集团矿业有限公司 | Method for highly fine three-dimensional modeling of complex earth surface |
-
2015
- 2015-03-25 CN CN201510133272.3A patent/CN106153030A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1866299A (en) * | 2006-06-27 | 2006-11-22 | 北京航空航天大学 | Three-dimensional model simplifying method based on visual feature measurement |
| CN102930594A (en) * | 2012-09-20 | 2013-02-13 | 中国科学院自动化研究所 | Rendering method for computer three-dimensional terrain grid based on boundary maintenance |
| CN103150758A (en) * | 2013-02-06 | 2013-06-12 | 河北钢铁集团矿业有限公司 | Method for highly fine three-dimensional modeling of complex earth surface |
Non-Patent Citations (2)
| Title |
|---|
| 张恒国: ""基于ROAM算法的数字地面模型研究与实现"", 《信息技术》 * |
| 曹晓磊: ""基于树结构的地形简化和漫游"", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109598793A (en) * | 2018-11-27 | 2019-04-09 | 武大吉奥信息技术有限公司 | The production method and device of quickly modification vegetation and water body are measured based on oblique photograph |
| CN109598793B (en) * | 2018-11-27 | 2022-04-12 | 武大吉奥信息技术有限公司 | Manufacturing method and device for quickly modifying vegetation and water body based on oblique photogrammetry |
| CN110136262A (en) * | 2019-05-17 | 2019-08-16 | 中科三清科技有限公司 | Water body virtual visualization method and apparatus |
| CN113066151A (en) * | 2020-01-02 | 2021-07-02 | 沈阳美行科技有限公司 | Map data processing method, device, equipment and storage medium |
| CN113066151B (en) * | 2020-01-02 | 2024-02-02 | 沈阳美行科技股份有限公司 | Map data processing method, device, equipment and storage medium |
| CN113254567A (en) * | 2021-06-25 | 2021-08-13 | 智道网联科技(北京)有限公司 | Variable-precision high-precision map data storage method and storage device |
| CN113838202A (en) * | 2021-09-27 | 2021-12-24 | 北京百度网讯科技有限公司 | Method, device and equipment for processing three-dimensional model in map and storage medium |
| CN113838202B (en) * | 2021-09-27 | 2023-09-26 | 北京百度网讯科技有限公司 | Method, device, equipment and storage medium for processing three-dimensional model in map |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106153030A (en) | A kind of data in navigation electronic map storage method and device | |
| CN107481311B (en) | Three-dimensional city model rendering method and device | |
| CN107767375A (en) | One kind point cloud method for evaluating quality and device | |
| CN110163064A (en) | A kind of recognition methods of Sign for road, device and storage medium | |
| CN105023283A (en) | Power grid bird trouble map drawing method and system based on winter visitor migration route and habitat | |
| CN109887073B (en) | Method and device for building three-dimensional digital model of rock core | |
| CN110084894B (en) | Local amplification display method and device of three-dimensional model and electronic equipment | |
| CN111862292A (en) | Data rendering method and device for power transmission line corridor and computer equipment | |
| CN109872394A (en) | Long-narrow triangular mesh grid optimization method based on least square method supporting vector machine | |
| CN113793333A (en) | Defect picture generation method and device applied to industrial quality inspection | |
| CN113420458A (en) | Wind field data refining processing method and device, terminal and medium | |
| CN106251400A (en) | A kind of method and device building topography based on many quadrilateral mesh | |
| CN102750734B (en) | The method and system that a kind of virtual three-dimensional earth system is shown | |
| CN108074279B (en) | Three-dimensional meteorological data display method, device and equipment | |
| CN111046475B (en) | Method and device for calculating building area and storage medium | |
| CN106023317B (en) | A kind of weighted Voronoi diagrams drawing generating method for big data test | |
| US20160245896A1 (en) | Method and device for positioning terminal location | |
| CN111145328A (en) | Three-dimensional character surface texture coordinate calculation method, medium, equipment and device | |
| CN107478217B (en) | A kind of POI display methods and device | |
| KR101396395B1 (en) | Apparatus and method for calculating design wind speed using regression analysis | |
| CN110956696B (en) | Submarine topography simulation method based on multi-scale chart data | |
| CN115272594A (en) | Iso-surface generation method based on geotools | |
| CN115588086A (en) | Map dividing method, map dividing device, computer readable storage medium and processor | |
| CN108053475A (en) | A kind of three-dimensional terrain display method and device | |
| KR20120106429A (en) | Method of digital filtering using fourier-legendre function for 3-dimensional space data processing |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20161123 |