CN102636174A - Road data inheriting method and device - Google Patents

Abstract

The invention provides a road data inheriting method and device. The road data inheriting method comprises the following steps: obtaining two versions of road data, calculating a diversity factor of links in the two versions of road data, establishing the mapping relation between two links the diversity factor of which meets the preset requirements, forming the integration of link mapping relations, and inheriting the processing operation of the old version road data links to the corresponding links of the new version road data. Compared with the prior art, the road data inheriting method provided by the invention can be used for inheriting the processing operation of other batches of road data, and repeatedly processing the existing data without spending a large amount of manpower and material resources, thus the efficiency is enhanced, and the cost is saved.

Description

A kind of road data inheritance method and device

[technical field]

The present invention relates to map and field of navigation technology, particularly a kind of road data inheritance method and device.

[background technology]

At present, the road data that the Map Services provider in the internet can adopt map company or mapping navigation company to be provided usually, road data mainly comprises point data and highway section data.The highway section data adopt link (link) to represent each bar road usually, and every road is made up of several links, and the point coordinate of each chain route some constitutes.Point data can be represented the co-ordinate position information of each building, terrestrial reference, shop or the like each object, also can be the point coordinate that is used to represent link.Be that point data or highway section data all have the characteristics that develop slowly, these data can become but can not become everyday.According to these characteristics; Map, mapping navigation company be to road data renewal slowly with developing, after after a while, the road data of part upgraded; Then offer the client in batches, the road data of different batches has different station location marker information and version information usually.

For the data that map or mapping navigation company are provided, need do further processing and just can be used to provide service.Handle road data and need spend lot of manpower and material resources, and the road data that present map or mapping navigation company are provided, the data of each batch are separate, and the relation between each lot data is not provided.Therefore, for the user of map datum, all need spend a large amount of manpower and materials costs, and the result before can't effectively utilizing causes unnecessary cost consumption to each batch data.

[summary of the invention]

In view of this; The invention provides a kind of road data inheritance method and device, set up the mapping relations between each batch road data, when using new road data; Can inherit the processing operation of other batches road data; Avoid spending a large amount of manpower and materials data with existing is carried out re-treatment, raise the efficiency, practice thrift cost.

Concrete technical scheme is following:

A kind of road data inheritance method, this method may further comprise the steps:

S1, obtain the road data of two versions;

S2, respectively the link in two version road datas is carried out diversity factor and calculate, diversity factor is satisfied between two links of preset requirement and set up mapping relations, form the link maps set of relationship.

According to one preferred embodiment of the present invention, also comprise:

S3, according to said link maps set of relationship, will inherit in the redaction road data on the link corresponding the processing of legacy version road data link operation.

According to one preferred embodiment of the present invention, saidly each link in two version road datas carried out diversity factor calculate, specifically comprise:

Obtain link A and link B respectively from two version road datas, wherein, link A is point set { A _i(i=1,2 ... I), link B is point set { B _j(j=1,2 ... J), I, J are respectively the number of data point among link A and the link B;

Calculate link A to the distance H of link B (A → B), be specially:

Calculate the point { A among the link A _i(i=1,2 ... I) with link B in the { B that has a few _jJ=1,2 ... J) apart from the maximal value in the minimum value, promptly $H(A\→B)=\underset{i}{\mathrm{Max}}\left\{{\mathrm{Min}}_j\right\{\mathrm{Dis}\mathrm{Tan}\mathrm{Ce}(A_i,B_j)\left\}\right\};$

Calculate link B to the distance H of link A (B → A), be specially:

Calculate the point { B among the link B _j(j=1,2 ... J) with link A in the { A that has a few _i(i=1,2 ... I) apart from the maximal value in the minimum value, promptly $H(B\→A)=\underset{j}{\mathrm{Max}}\left\{{\mathrm{Min}}_i\right\{\mathrm{Dis}\mathrm{Tan}\mathrm{Ce}(B_j,A_i)\left\}\right\};$

With the maximal value in the distance that calculates, promptly H (AB)=max{H (A → B), H (B → A) } as this link A to the diversity factor between the link B.

According to one preferred embodiment of the present invention, between said step S1 and the S2, also comprise: the road data to two versions that obtain carries out a set detection; To put the identical respective links of set and directly set up mapping relations;

Said step S2 is specially: only to remaining link execution in step S2.

According to one preferred embodiment of the present invention, after the said step S2, also comprise:

The link that does not have mapping relations in two version road datas is added in the set to be verified.

A kind of road data legacy devices, this device comprises:

Data acquisition module is used to obtain the road data of two versions;

Matching module is used for respectively link to two version road datas and carries out diversity factor and calculate, and diversity factor is satisfied between two links of preset requirement and sets up mapping relations, forms the link maps set of relationship.

According to one preferred embodiment of the present invention, also comprise:

Module is inherited in operation, is used for based on said link maps set of relationship, will inherit in the redaction data on the link corresponding the processing operation of legacy data link.

According to one preferred embodiment of the present invention, in the said matching module each link in two version road datas is carried out diversity factor and calculates, specifically comprise:

Obtain link A and link B respectively from two version road datas, wherein, link A is point set { A _i(i=1,2 ... I), link B is point set { B _j(j=1,2 ... J), I, J are respectively the number of data point among link A and the link B;

Calculate link A to the distance H of link B (A → B), be specially:

Calculate the point { A among the link A _i(i=1,2 ... I) with link B in the { B that has a few _j(j=1,2 ... J) apart from the maximal value in the minimum value, promptly $H(A\→B)=\underset{i}{\mathrm{Max}}\left\{{\mathrm{Min}}_j\right\{\mathrm{Dis}\mathrm{Tan}\mathrm{Ce}(A_i,B_j)\left\}\right\};$

Calculate link B to the distance H of link A (B → A), be specially:

Calculate the point { B among the link B _j(j=1,2 ... J) with link A in the { A that has a few _i(i=1,2 ... I) apart from the maximal value in the minimum value, promptly $H(B\→A)=\underset{j}{\mathrm{Max}}\left\{{\mathrm{Min}}_i\right\{\mathrm{Dis}\mathrm{Tan}\mathrm{Ce}(B_j,A_i)\left\}\right\};$

With the maximal value in the distance that calculates, promptly H (AB)=max{H (A → B), H (B → A) } as this link A to the diversity factor between the link B.

According to one preferred embodiment of the present invention, also comprise:

Pre-processing module is used for carrying out a set detection to the road data of two versions that obtain; To put the identical respective links of set and directly set up mapping relations;

Said pre-processing module only offers said matching module with remaining each link.

According to one preferred embodiment of the present invention, said matching module also is used for:

The link that does not have mapping relations in two version road datas is added in the set to be verified.

Can find out by above technical scheme; Road data inheritance method provided by the invention and device utilize geometric algorithm to calculate the correlativity of road data, set up the mapping relations between each batch road data; Feasible processing operation to each batch can obtain inheriting; Avoid spending a large amount of manpower and materials data with existing is carried out re-treatment, raise the efficiency, practice thrift cost.

[description of drawings]

The road data inheritance method process flow diagram that Fig. 1 provides for the embodiment of the invention one;

Two link synoptic diagram that Fig. 2 provides for the embodiment of the invention one;

The road data inheritance method process flow diagram that Fig. 3 provides for the embodiment of the invention two;

The road data legacy devices synoptic diagram that Fig. 4 provides for the embodiment of the invention three;

The road data legacy devices synoptic diagram that Fig. 5 provides for the embodiment of the invention four;

[embodiment]

In order to make the object of the invention, technical scheme and advantage clearer, describe the present invention below in conjunction with accompanying drawing and specific embodiment.

Embodiment one,

Fig. 1 is the road data inheritance method process flow diagram that present embodiment provides, and as shown in Figure 1, this method comprises:

S101, obtain the road data of two versions.

The road data of different editions has different version informations and different station location marker information.Even for same real object, in the road data of different editions, also possibly adopt different identification informations to represent.And because mapping worker is adopted a position difference when different batches is measured, it is variant also possibly to make front and back describe the coordinate data of same real object for twice.

Obtain the road data of new and old two versions, comprise point data and link data.Said point data and link data are generally the data acquisition of point coordinate form.

S102, respectively the link in two version road datas is carried out diversity factor and calculate, diversity factor is satisfied between two links of preset requirement and set up mapping relations, form the link maps set of relationship.

To the difference of data between new and old two versions, the present invention finds out two corresponding relations between the version through calculating each link diversity factor.

Saidly each link in two version road datas carried out diversity factor calculate, specifically comprise:

Step S102_1, obtain link A and link B respectively from two version road datas, wherein, link A is point set { A _i(i=1,2 ... I), link B is point set { B _j(j=1,2 ... J), I, J are respectively the number of data point among link A and the link B.

Step S102_2, calculate link A to the distance H of link B (A → B), be specially:

Calculate the point { A among the link A _i(i=1,2 ... I) with link B in the { B that has a few _j(j=1,2 ... J) apart from the maximal value in the minimum value, promptly $H(A\→B)=\underset{i}{\mathrm{Max}}\left\{{\mathrm{Min}}_j\right\{\mathrm{Dis}\mathrm{Tan}\mathrm{Ce}(A_i,B_j)\left\}\right\}.$

Particularly, the some A among the calculating link A ₁With { the B that has a few among the link B _j(j=1,2 ... J) between apart from distance (A ₁, B _j).

Said distance can but be not limited to adopt Euclidean distance to calculate.For example, calculate A ₁With B ₁Between distance, postulated point A ₁Coordinate be (X _A1, Y _A1) some B ₁Coordinate be (X _B1, Y _B1), then can calculate an A ₁With a B ₁Apart from distance (A ₁, B ₁):

$\mathrm{dis}\tan \mathrm{ce}(A_1,B_1)=\sqrt{{(X_{A1}-X_{B1})}^2+{(Y_{A1}-Y_{B1})}^2}$

By that analogy, calculate an A ₁With a B ₁～B _JDistance { distance (A ₁, B ₁), distance (A ₁, B ₂) ..., distance (A ₁, B _J).

With calculate apart from minimum value min _j{ distance (A ₁, B _j) as the distance of putting A1 and link B.

The rest may be inferred, calculates the point { A among the link A _i(i=1,2 ... I) with the distance of link B.

Choose the maximal value in each point of calculating among the link A and the distance of link B, promptly

as link A to the distance H of link B (A → B).

Step S102_3, calculate link B to the distance H of link A (B → A), be specially:

Calculate the point { B among the link B _j(j=1,2 ... J) with link A in the { A that has a few _i(i=1,2 ... I) apart from the maximal value in the minimum value, promptly $H(B\→A)=\underset{j}{\mathrm{Max}}\left\{{\mathrm{Min}}_i\right\{\mathrm{Dis}\mathrm{Tan}\mathrm{Ce}(B_j,A_i)\left\}\right\}.$

Concrete similar with step S102_2, the some B among the calculating link B ₁With { the A that has a few among the link A _i(i=1,2 ... I) between apart from distance (B ₁, A _i), with calculate apart from minimum value min _i{ distance (B _j, A _i) as putting B ₁Distance with link A.The rest may be inferred, calculates the point { B among the link A _j(j=1,2 ... J) with the distance of link A.Choose the maximal value in each point of calculating and the distance of link A, promptly

as link B to the distance H of link A (B → A).

Maximal value in step S102_4, the distance that will calculate, promptly H (AB)=max{H (A → B), H (B → A) } as this link A to the diversity factor between the link B.

Give an example, as shown in Figure 2, wherein, some A1～A7 representes article one link, and some B1～B8 representes the second link.

At first, calculation level A1 and the distance of point between B1～B8, choose calculate apart from minimum value, as an A1 and second link apart from minimum value, be some A1 and the distance A 1-B1 that puts B1 among the figure.

And the like, can calculate an A2～A7 each the point with the second link apart from minimum value, be respectively { A2-B2, A3-B3, A4-B4, A5-B5, A6-B7, A7-B8}.

Adopt and use the same method, calculation level B1～B8 and article one link apart from minimum value, be respectively { B1-A1, B2-A2, B3-A3, B4-A4, B5-A5, B6-A5, B7-A6, B8-A7}.

Choose calculated all apart from the maximal value in the minimum value, i.e. max{A1-B1, A2-B2, A3-B3, A4-B4, A5-B5, A6-B7, A7-B8, B1-A1, B2-A2, B3-A3, B4-A4, B5-A5, B6-A5, B7-A6, B8-A7}.Shown in figure, obtain all apart from the distance of the maximal value in the minimum value, as the diversity factor of article one link and second link for some B8 and some A7.

What deserves to be mentioned is; Calculating link A is to find in the link each maximal value in the distance of another link to the diversity factor fundamental purpose between the link B; In step S102_2 and step S102_3, can not choose maximal value earlier, in step S102_4, choose in the link maximal value in each distance (minimum value) of putting another link again as the diversity factor of two links.In addition, the sequencing of said step S102_2 and step S102_3 can be changed.

Further judge whether the diversity factor between two links satisfies preset requirement, judge that promptly whether two diversity factoies between the link are less than predetermined threshold value.Diversity factor is corresponding each other less than the identification information of two links of predetermined threshold value, thus the mapping relations of this two link set up, form the link maps set of relationship.

If diversity factor less than predetermined threshold value, is then set up mapping relations, add in the link maps set of relationship.If diversity factor, explains then that difference is big between these two links greater than predetermined threshold value.

Said predetermined threshold value can be set according to the empirical value that actual computation demand or iteration obtain.

From the road data of two versions, respectively take out a link one by one and calculate, until end.

If one link in the data of another version, can not find any one with the link of its diversity factor less than predetermined threshold value, explain that then this link does not have mapping relations.

In the said link maps set of relationship, can adopt same identification information to represent corresponding relation two links of describing same real object.

Embodiment two,

Fig. 3 is the road data inheritance method process flow diagram that present embodiment provides, and as shown in Figure 3, this method comprises:

S201, obtain the road data of two versions.

This step is identical with step S101 among the embodiment one, repeats no more in this.

S202, carry out a set to the road data of two versions obtaining and detect; To put the identical respective links of set and directly set up mapping relations.

In this step, find out the link that can accurately mate, can reduce the data volume of subsequent calculations.If the point of new and old two links set identical (being that point coordinate is identical) thinks that then these two links can accurately mate.

S203, respectively remaining link in two version road datas is carried out diversity factor and calculate, diversity factor is satisfied between two links of preset requirement and set up mapping relations, form the link maps set of relationship.

It is identical with step S102 among the embodiment one to carry out the diversity factor calculation process to remaining link, repeats no more in this.

S204, according to said link maps set of relationship, will inherit in the redaction data on the link corresponding the processing of legacy data link operation.

Said processing operation comprises carries out subsequent treatment such as coordinate conversion, splicing, layering, classification to road data, and those post-treatment operations generally realize through software program code.Through link maps relation, can be with these are handled operation and inherit in the redaction data link to the legacy data link.Particularly, the line information that can adopt the identification information of redaction data link to replace corresponding legacy data chain realizes handling the succession of operation.

S205, the link that does not have mapping relations in two version road datas is added in the set to be verified.

For the link in the set to be verified, can carry out through the mode of desk checking.

Experiment showed, that through method of the present invention road is inherited coverage rate and can be reached about 90%, inherit accuracy rate and surpass 80%.Like this, reduce the data volume of desk checking significantly, practiced thrift cost.

More than be the detailed description that method provided by the present invention is carried out, be described in detail in the face of road data legacy devices provided by the invention down.

Embodiment three

Fig. 4 is the road data legacy devices synoptic diagram that present embodiment provides.As shown in Figure 4, this device comprises:

Data acquisition module 401 is used to obtain the road data of two versions.

The road data of different editions has different version informations and different station location marker information.Even for same real object, in the road data of different editions, also possibly adopt different identification informations to represent.And because mapping worker is adopted a position difference when different batches is measured, it is variant also possibly to make front and back describe the coordinate data of same real object for twice.

Data acquisition module 401 obtains the road data of new and old two versions, comprises point data and link data.Said point data and link data are generally the data acquisition of point coordinate form.

Matching module 402 is used for respectively link to two version road datas and carries out diversity factor and calculate, and diversity factor is satisfied between two links of preset requirement and sets up mapping relations, forms the link maps set of relationship.

Matching module 402 is found out two corresponding relations between the version to the difference of data between new and old two versions through calculating each link diversity factor.

In the matching module 402 each link in two version road datas is carried out diversity factor and calculates, specifically comprise:

Matching module 402 obtains link A and link B respectively from two version road datas earlier, and wherein, link A is point set { A _i(i=1,2 ... I), link B is point set { B _j(j=1,2 ... J), I, J are respectively the number of data point among link A and the link B.

Secondly, matching module 403 calculate link A to the distance H of link B (A → B), be specially:

Calculate the point { A among the link A _i(i=1,2 ... I) with link B in the { B that has a few _j(j=1,2 ... J) apart from the maximal value in the minimum value, promptly $H(A\→B)=\underset{i}{\mathrm{Max}}\left\{{\mathrm{Min}}_j\right\{\mathrm{Dis}\mathrm{Tan}\mathrm{Ce}(A_i,B_j)\left\}\right\}.$

Particularly, the some A among the calculating link A ₁With { the B that has a few among the link B _j(j=1,2 ... J) between apart from distance (A ₁, B _j).

Said distance can but be not limited to adopt Euclidean distance to calculate.For example, calculate A ₁With B ₁Between distance, postulated point A ₁Coordinate be (X _A1, Y _A1) some B ₁Coordinate be (X _B1, Y _B1), then can calculate an A ₁With a B ₁Apart from distance (A ₁, B ₁):

$\mathrm{dis}\tan \mathrm{ce}(A_1,B_1)=\sqrt{{(X_{A1}-X_{B1})}^2+{(Y_{A1}-Y_{B1})}^2}$

By that analogy, calculate an A ₁With a B ₁～B _JDistance { distance (A ₁, B ₁), distance (A ₁, B ₂) ..., distance (A ₁, B _J).

With calculate apart from minimum value min _j{ distance (A ₁, B _j) as the distance of putting A1 and link B.

The rest may be inferred, calculates the point { A among the link A _i(i=1,2 ... I) with the distance of link B.

Choose the maximal value in each point of calculating among the link A and the distance of link B, promptly as link A to the distance H of link B (A → B).

Once more, matching module 403 calculate link B to the distance H of link A (B → A), be specially:

Calculate the point { B among the link B _j(j=1,2 ... J) with link A in the { A that has a few _i(i=1,2 ... I) apart from the maximal value in the minimum value, promptly $H(B\→A)=\underset{j}{\mathrm{Max}}\left\{{\mathrm{Min}}_i\right\{\mathrm{Dis}\mathrm{Tan}\mathrm{Ce}(B_j,A_i)\left\}\right\}.$

Particularly, the some B among the calculating link B ₁With { the A that has a few among the link A _i(i=1,2 ... I) between apart from distance (B ₁, A _i), with calculate apart from minimum value min _i{ distance (B _j, A _i) as putting B ₁Distance with link A.The rest may be inferred, calculates the point { B among the link A _j(j=1,2 ... J) with the distance of link A.Choose the maximal value in each point of calculating and the distance of link A, promptly

as link B to the distance H of link A (B → A).

At last, the maximal value in the distance that matching module 402 will calculate, promptly H (AB)=max{H (A → B), H (B → A) } as this link A to the diversity factor between the link B.

What deserves to be mentioned is; Calculating link A is to find in the link each maximal value in the distance of another link to the diversity factor fundamental purpose between the link B; In computation process, can not choose maximal value earlier yet, to the last choose in the link maximal value in each distance (minimum value) of putting another link again as the diversity factor of two links.

Further judge whether the diversity factor between two links satisfies preset requirement, judge that promptly whether two diversity factoies between the link are less than predetermined threshold value.Diversity factor is corresponding each other less than the identification information of two links of predetermined threshold value, thus the mapping relations of this two link set up, form the link maps set of relationship.

If diversity factor less than predetermined threshold value, is then set up mapping relations, add in the link maps set of relationship.If diversity factor, explains then that difference is big between these two links greater than predetermined threshold value.

Said predetermined threshold value can be set according to the empirical value that actual computation demand or iteration obtain.

From the road data of two versions, respectively take out a link one by one and calculate, until end.

In the said link maps set of relationship, can adopt same identification information to represent corresponding relation two links of describing same real object.

In addition, matching module 402 also adds the link that does not have mapping relations in two version road datas in the set to be verified to.

If one link in the data of another version, can not find any one with the link of its diversity factor less than predetermined threshold value, explain that then this link does not have mapping relations.Those links are added in the set to be verified, treat desk checking.

Embodiment four

Fig. 5 is the road data legacy devices synoptic diagram that present embodiment provides.As shown in Figure 5, this device comprises:

Data acquisition module 501 is used to obtain the road data of two versions.

This data acquisition module 501 is identical with data acquisition module 401 among the embodiment three, repeats no more in this.

Pre-processing module 502 is used for carrying out a set detection to the road data of two versions that obtain; To put the identical respective links of set and directly set up mapping relations.

Utilize pre-processing module 502 to find out the link that can accurately mate earlier, to reduce the data volume of subsequent calculations.If the point of new and old two links set identical (being that point coordinate is identical) thinks that then these two links can accurately mate.

Pre-processing module 502 only offers matching module 503 with remaining each link.

Matching module 503 is used for respectively link to two version road datas and carries out diversity factor and calculate, and diversity factor is satisfied between two links of preset requirement and sets up mapping relations, forms the link maps set of relationship.

This matching module 503 only carries out diversity factor to remaining each link in the pre-processing module 502 and calculates, and matching module 402 is identical among concrete calculation process and the embodiment three, repeats no more in this.

Module 504 is inherited in operation, is used for based on said link maps set of relationship, will inherit in the redaction data on the link corresponding the processing operation of legacy data link.

Said processing operation comprises carries out subsequent treatment such as coordinate conversion, splicing, layering, classification to road data, and those post-treatment operations generally realize through software program code.Through link maps relation, can be with these are handled operation and inherit in the redaction data link to the legacy data link.Particularly, the line information that can adopt the identification information of redaction data link to replace corresponding legacy data chain realizes handling the succession of operation.

Road data inheritance method provided by the invention and device adopt geometric algorithm to calculate correlativity between the road data, set up the mapping relations between each batch road data, and feasible processing operation to each batch can obtain inheriting.Show that through the actual treatment data the present invention can guarantee higher succession coverage rate, inherits accuracy rate and inherit recall rate, can effectively avoid spending a large amount of manpower and materials data with existing is carried out re-treatment, raises the efficiency, and practices thrift cost.

The above is merely preferred embodiment of the present invention, and is in order to restriction the present invention, not all within spirit of the present invention and principle, any modification of being made, is equal to replacement, improvement etc., all should be included within the scope that the present invention protects.

Claims (10)

1. a road data inheritance method is characterized in that, comprising:

S1, obtain the road data of two versions;

S2, respectively the link in two version road datas is carried out diversity factor and calculate, diversity factor is satisfied between two links of preset requirement and set up mapping relations, form the link maps set of relationship.

2. method according to claim 1 is characterized in that, also comprises:

S3, according to said link maps set of relationship, will inherit in the redaction road data on the link corresponding the processing of legacy version road data link operation.

3. method according to claim 1 is characterized in that, saidly each link in two version road datas is carried out diversity factor calculates, and specifically comprises:

Obtain link A and link B respectively from two version road datas, wherein, link A is point set { A _i(i=1,2 ... I), link B is point set { B _j(j=1,2 ... J), I, J are respectively the number of data point among link A and the link B;

Calculate link A to the distance H of link B (A → B), be specially:

Calculate the point { A among the link A _i(i=1,2 ... I) with link B in the { B that has a few _j(j=1,2 ... J) apart from the maximal value in the minimum value, promptly $H(A\→B)=\underset{i}{\mathrm{Max}}\left\{{\mathrm{Min}}_j\right\{\mathrm{Dis}\mathrm{Tan}\mathrm{Ce}(A_i,B_j)\left\}\right\};$

Calculate link B to the distance H of link A (B → A), be specially:

Calculate the point { B among the link B _j(j=1,2 ... J) with link A in the { A that has a few _i(i=1,2 ... I) apart from the maximal value in the minimum value, promptly $H(B\→A)=\underset{j}{\mathrm{Max}}\left\{{\mathrm{Min}}_i\right\{\mathrm{Dis}\mathrm{Tan}\mathrm{Ce}(B_j,A_i)\left\}\right\};$

With the maximal value in the distance that calculates, promptly H (AB)=max{H (A → B), H (B → A) } as this link A to the diversity factor between the link B.

4. method according to claim 1 is characterized in that,

Between said step S1 and the S2, also comprise: the road data to two versions that obtain carries out a set detection; To put the identical respective links of set and directly set up mapping relations;

Said step S2 is specially: only to remaining link execution in step S2.

5. method according to claim 1 is characterized in that, after the said step S2, also comprises:

The link that does not have mapping relations in two version road datas is added in the set to be verified.

6. a road data legacy devices is characterized in that, this device comprises:

Data acquisition module is used to obtain the road data of two versions;

Matching module is used for respectively link to two version road datas and carries out diversity factor and calculate, and diversity factor is satisfied between two links of preset requirement and sets up mapping relations, forms the link maps set of relationship.

7. device according to claim 6 is characterized in that, also comprises:

Module is inherited in operation, is used for based on said link maps set of relationship, will inherit in the redaction data on the link corresponding the processing operation of legacy data link.

8. device according to claim 6 is characterized in that, in the said matching module each link in two version road datas is carried out diversity factor and calculates, and specifically comprises:

Obtain link A and link B respectively from two version road datas, wherein, link A is point set { A _i(i=1,2 ... I), link B is point set { B _j(j=1,2 ... J), I, J are respectively the number of data point among link A and the link B;

Calculate link A to the distance H of link B (A → B), be specially:

Calculate the point { A among the link A _i(i=1,2 ... I) with link B in the { B that has a few _j(j=1,2 ... J) apart from the maximal value in the minimum value, promptly $H(A\→B)=\underset{i}{\mathrm{Max}}\left\{{\mathrm{Min}}_j\right\{\mathrm{Dis}\mathrm{Tan}\mathrm{Ce}(A_i,B_j)\left\}\right\};$

Calculate link B to the distance H of link A (B → A), be specially:

Calculate the point { B among the link B _j(j=1,2 ... J) with link A in the { A that has a few _i(i=1,2 ... I) apart from the maximal value in the minimum value, promptly $H(B\→A)=\underset{j}{\mathrm{Max}}\left\{{\mathrm{Min}}_i\right\{\mathrm{Dis}\mathrm{Tan}\mathrm{Ce}(B_j,A_i)\left\}\right\};$

With the maximal value in the distance that calculates, promptly H (AB)=max{H (A → B), H (B → A) } as this link A to the diversity factor between the link B.

9. device according to claim 6 is characterized in that, also comprises:

Pre-processing module is used for carrying out a set detection to the road data of two versions that obtain; To put the identical respective links of set and directly set up mapping relations;

Said pre-processing module only offers said matching module with remaining each link.

10. device according to claim 6 is characterized in that, said matching module also is used for: the link that two version road datas are not had mapping relations adds in the set to be verified.

Images