JP5356711B2 - Map information correction apparatus, map information correction method, and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a map information correcting device capable of, when the area obtained from map information is different from the area managed separately from the map information, eliminating the inconsistency. <P>SOLUTION: The map information correcting device comprises: a map information storage section 11 for storing map information including graphic information indicating at least the position of each vertex of one or more regions and scale information indicating a scale; an area information storage section 12 for storing area information indicating the area of one or more regions; an area calculating section 13 for calculating the area of a region indicated by the graphic information; a judging section 14 for judging whether the area of the region calculated by the area calculating section 13 coincides with the area of the area information corresponding to the region; a correcting section 15 for correcting, when it is judged that both areas do not coincide, the map information so that both areas coincide; and an output section 16 for outputting the information after correction. <P>COPYRIGHT: (C)2010,JPO&amp;INPIT

Description

  The present invention relates to a map information correction apparatus that corrects map information including graphic information and scale information.

  Conventionally, a map stored in a paper medium, such as a map attached to an old land register called a public map, is read by an optical device and digitized.

As a related prior art, a method has been developed in which a map is photographed with a digital camera and a copy drawing of the original drawing to be photographed is corrected by correcting errors due to the photographing direction, lens aberration, and the like ( For example, see Patent Document 1).
JP 2004-295423 A

  On the other hand, the land area and distance may be managed separately from the map. If it is the area of land, for example, it may be managed by a public book, a land ticket, a land survey map or the like. In addition, the distance may be managed by, for example, a geodetic survey map, a turnbook, a field book, or the like. In such a case, the area and distance of the map may be different from the area and distance shown separately in the managed public books, territory tickets, land area survey maps, and the like.

  Generally speaking, the area and distance obtained from the map information may be different from the area and distance managed separately from the map information.

  The present invention has been made in consideration of the above circumstances, and eliminates inconsistencies between the area and distance obtained from the map information and the area and distance managed separately from the map information. An object of the present invention is to provide a map information correction device and the like capable of performing the above.

  In order to achieve the above object, a map information correction apparatus according to the present invention stores a map information having graphic information at least indicating the position of each vertex of one or more areas and scale information which is information indicating a scale. An information storage unit; an area information storage unit that stores area information that is information indicating an area of the one or more regions; an area calculation unit that calculates an area of the region indicated by the graphic information; and the area calculation unit When the area of the area calculated by and the area indicated by the area information corresponding to the area coincides with each other, and when both areas are determined not to coincide with each other, the both areas And a correction unit that corrects the map information so as to match, and an output unit that outputs information after correction by the correction unit.

  With such a configuration, if there is a mismatch between the area of the region obtained from the map information and the area managed separately from the map information, the mismatch can be eliminated. As a result, for example, by using the map indicated by the corrected map information when the parties discuss the boundary, etc., the discussion using a map whose area is consistent with the measured value, the public directory, etc. Will be able to do.

  In the map information correction apparatus according to the present invention, the correction unit may move each corrected vertex on a bisector of each corner of each vertex indicated by the graphic information.

  With such a configuration, by correcting the graphic information, inconsistency between the area of the region obtained from the map information and the area managed separately from the map information can be eliminated. In addition, by performing correction by moving each vertex on the bisector of the corner of each vertex indicated by the graphic information, the shape of the area before correction and the shape of the area after correction are similar. Can be done. If both shapes are similar, for example, the possibility that a person who has seen a figure corresponding to the corrected area has a sense of incongruity can be reduced.

  In the map information correction apparatus according to the present invention, the correction unit may move each vertex so that the distance from the vertex before correction to the vertex after correction becomes equal for each vertex.

  With such a configuration, by moving each vertex, the area can be expanded or contracted uniformly outward or inward, so the shape of the area before correction is similar to the shape of the area after correction Can be a thing.

  In the map information correction apparatus according to the present invention, the correction unit may move each vertex so that the side between the vertices before correction and the side between the vertices after correction are parallel.

  With such a configuration, the parallelism of each side can be maintained for the area before the change and the area after the change. As a result, for example, it is possible to reduce the possibility that a person who has seen a graphic corresponding to the corrected area has a sense of incongruity.

  In the map information correction apparatus according to the present invention, the map information further includes restriction information that is information indicating a restriction on movement of one or more vertices indicated by the graphic information, and the correction unit includes: When there is a restriction by the restriction information with respect to the vertex, the one vertex may be moved within a restriction range indicated by the restriction information.

  With such a configuration, a limit can be imposed on the movement of the vertex. For example, when the vertices of a certain region are along a river, it is possible to avoid a situation in which correction for moving the vertices into the river is performed by appropriately restricting the movement of the vertices by the restriction information.

In the map information correction apparatus according to the present invention, the correction unit may correct the scale information.
With such a configuration, by correcting the scale information, it is possible to eliminate the inconsistency between the area of the region obtained from the map information and the area managed separately from the map information.

  In the map information correction apparatus according to the present invention, the area information may be public book information, land ticket information, or actual measurement information.

  A map information correction apparatus according to the present invention includes a map information storage unit that stores map information having graphic information indicating at least one side and scale information that is information indicating a scale, and a distance between the one or more sides. A distance information storage unit that stores distance information that is information indicating a distance, a distance calculation unit that calculates a distance of the side indicated by the graphic information, a distance of the side calculated by the distance calculation unit, and the corresponding side A determination unit that determines whether the distance indicated by the distance information matches, and a correction that corrects the scale information so that the two distances match when the determination unit determines that both distances do not match And an output unit that outputs information after correction by the correction unit.

  With such a configuration, when there is a mismatch between a side distance obtained from map information and a side distance managed separately from the map information, the mismatch can be eliminated.

  According to the map information correction apparatus and the like according to the present invention, it is possible to eliminate inconsistency between the area and distance obtained from the map information and the area and distance managed separately from the map information.

  Hereinafter, a map information correction apparatus according to the present invention will be described using embodiments. In the following embodiments, components and steps denoted by the same reference numerals are the same or equivalent, and repetitive description may be omitted.

(Embodiment 1)
A map information correction apparatus according to Embodiment 1 of the present invention will be described with reference to the drawings. The map information correction apparatus according to the present embodiment eliminates the mismatch when there is a mismatch between the area obtained from the map information and the area managed separately from the map information.

  FIG. 1 is a block diagram showing a configuration of a map information correction apparatus 1 according to this embodiment. The map information correction apparatus 1 according to the present embodiment includes a map information storage unit 11, an area information storage unit 12, an area calculation unit 13, a determination unit 14, a correction unit 15, and an output unit 16.

  The map information storage unit 11 stores map information having graphic information and scale information. The graphic information is information indicating at least the position of each vertex in one or more regions (for example, information on vertex coordinates). The graphic information may include information other than information indicating the position of the vertex. For example, it may include information indicating a side that connects the vertices (the side may be a straight line or a curved line). This graphic information is digitized by, for example, reading a map such as a public map with an optical device, and then manually inputting the coordinate value of the position of the vertex of the area on the map, or automatically This is data generated by detecting the coordinate value of the position of the vertex of the area on the map. The optical device is, for example, a digital still camera or a scanner. In addition, when a map is read by an optical device, image correction may be performed in order to make the image data of the read map exactly match a map such as a paper medium. Therefore, the image data of the map may be data created by using the technique of Patent Document 1, for example. Further, when the coordinate value of the vertex position is manually input, for example, the user specifies the position of the vertex of the map image displayed on the monitor with a mouse pointer or the like, so that the coordinate value is determined. It may be entered. In addition, when the coordinate value of the vertex position is automatically detected, the boundary value of the area is detected, and the coordinate value of the vertex is detected by detecting the position where two or more boundary lines intersect. Good. These processes are well-known and will not be described in detail. Moreover, as long as graphic information can be configured as a result, the graphic information may be configured using a method other than those described above. For example, the coordinate value of each vertex may be input by the user operating a keyboard or the like by overlaying a transparent graph paper or the like on a map of a paper medium.

  The scale information is information indicating the scale. This scale is the scale of the map corresponding to the graphic information. The map corresponding to the graphic information is a map from which information indicated by the graphic information is acquired. In addition, when creating the map information, if the scale of the map is changed, the scale information takes the change into consideration. For example, when creating the graphic information, if the scale of the map is doubled, the scale information is a scale that is twice the scale of the original map. The scale information may be, for example, manually input by the user, or information indicating the scale displayed on the map image data read by the optical device is recognized and converted into text. It may be obtained by doing this. The scale information is, for example, information such as “1/25000” or “one part of 25,000”.

  The map information may include graphic information and information other than scale information. For example, the map information may further include restriction information that is information indicating restrictions on movement of one or more vertices indicated by the graphic information. For example, when the correction unit 15 to be described later moves the position of the vertex of the area, there is an area where the vertex should not be moved (for example, the side of the area is a river or the sea, and the area is expanded there). In the case where it is impossible to do so, an area that should not be moved may be designated by this restriction information. This restriction information may be, for example, information indicating an area where the vertex cannot move, or information indicating an area where the vertex can move. In addition, the restriction information may be information indicating a point where the vertex can move or a region where the vertex cannot move, as a point, information indicating a line (which may be a straight line or a curve), or information indicating a surface. There may be. For example, the map information may further include map image data (which may be raster data or vector data obtained by vectorizing the raster data) itself.

  The process in which map information is memorize | stored in the map information storage part 11 is not ask | required. For example, map information may be stored in the map information storage unit 11 via a recording medium, and map information transmitted via a communication line or the like is stored in the map information storage unit 11. Alternatively, the map information input via the input device may be stored in the map information storage unit 11. The storage in the map information storage unit 11 may be temporary storage in a RAM or the like, or may be long-term storage. The map information storage unit 11 can be realized by a predetermined recording medium (for example, a semiconductor memory, a magnetic disk, an optical disk, etc.).

  The area information storage unit 12 stores area information that is information indicating the area of one or more regions. This area information is managed separately from the map information. To be managed separately from the map information means that the map information is obtained from information other than the acquired map. The area information is obtained from, for example, a public book, a land ticket, a land survey map, or the like. Therefore, the area information may be, for example, information on the area indicated by the public book, information on the area indicated by the territory ticket, or information on the area obtained by actual measurement. In the case where the public book, the ground ticket, and the land surveying map are digitized, the area information may be information of the public book, the ground ticket, and the ground surveying map itself. In addition, the area information may be information input by the user operating a keyboard or the like with reference to a book, a land ticket, a land surveying map, or the like, for example. In addition, it is preferable that the area indicated by the area information and the area formed by the vertices indicated by the graphic information included in the map information are associated with each other. That is, when the area information indicates two or more areas, it is preferable to know which area indicated by the area information corresponds to the area of the region formed by the vertices indicated by the graphic information. For this purpose, for example, both graphic information and area information include information for identifying a region, and the two may be associated through information for identifying the region. More specifically, in the graphic information, the area identification information is associated with the coordinates of the vertex of the area identified by the area identification information. In the area information, the area identification information and the area identification information The area of the region to be identified may be associated.

  “Associating region identification information with an area” means that it is only necessary to acquire the other information from one information of region identification information and area. Therefore, the area information may include information including the area identification information and the area as a set, or may be information that links the area identification information and the area. In the latter case, the area information may be, for example, information that associates region identification information with a pointer or address indicating the position where the area is stored. In the present embodiment, the former case will be described. Further, the area identification information and the area may not be directly associated with each other. For example, the third information may correspond to the region identification information, and the area may correspond to the third information. The same applies when other information is associated.

  The process in which the area information is stored in the area information storage unit 12 does not matter. For example, the area information may be stored in the area information storage unit 12 via a recording medium, and the area information transmitted via a communication line or the like is stored in the area information storage unit 12. Alternatively, the area information input via the input device may be stored in the area information storage unit 12. Storage in the area information storage unit 12 may be temporary storage in a RAM or the like, or may be long-term storage. The area information storage unit 12 can be realized by a predetermined recording medium (for example, a semiconductor memory, a magnetic disk, an optical disk, etc.).

  The area calculation unit 13 calculates the area of the region indicated by the graphic information. For example, when the coordinates of the vertexes of a polygon are indicated by graphic information, the area calculating unit 13 calculates the area of the polygon using the graphic information. For example, the area calculation unit 13 may calculate the area of the polygon by dividing the polygon into a plurality of triangles and calculating and summing the areas of the divided triangles. When calculating the area of the triangle, for example, the Heron formula may be used. Further, the graphic information also shows information indicating a vertex and a side extending from the vertex. If the side is not a straight line, the area may be calculated using the information indicating the side. In the case of having the sides of the curve, for example, the area calculation unit 13 subtracts the area of the area to be obtained into a plurality of polygons, calculates the area for each of the plurality of polygons, and totals the obtained areas. The desired area may be calculated. The area calculation unit 13 may calculate the area by using coordinate area calculation. The area calculation unit 13 may calculate the area by performing integration. Note that, when calculating the area of the region, the area calculation unit 13 calculates the area of the region using the scale information. For example, the area calculation unit 13 converts the length of the side indicated by the graphic information into the actual distance (distance in the real space) using the scale information, and calculates the area of the region using the converted distance. It is also possible to calculate the area of the area itself (area on the map) indicated by the graphic information using the length of the side indicated by the graphic information, and then calculate the area of the real land ( It may be converted into (area in real space). Therefore, the area indicated by the graphic information may be an actual area (an area in the real space) corresponding to the area indicated by the graphic information. In addition, when the outline of a region is determined, a method for calculating the area of the region is known, and the description thereof is omitted.

  The determination unit 14 determines whether the area of the region calculated by the area calculation unit 13 matches the area indicated by the area information corresponding to the region. For a certain region, the determination unit 14 receives the area of the region calculated by the area calculation unit 13 from the area calculation unit 13 and reads the area corresponding to the region from the area information storage unit 12. Then, the two are compared to determine whether or not they match. Note that “matching” may be exact matching or may include a case where there is some error. In the latter case, for example, an error threshold value (allowable area error) is set, and the determination unit 14 sets the difference between the two areas to be determined. If it is smaller than the value, it may be determined that the two match. This threshold value may be stored, for example, in a recording medium (not shown) or may be generated at the time of determination. In the latter case, for example, a value obtained by multiplying one of the areas to be determined by a coefficient (for example, 0.0001) may be used as the threshold value.

  When the determination unit 14 determines that the two areas do not match, the correction unit 15 corrects the map information so that the two areas match. “Match” in this case may be exactly matched as described above, or may include a case where there is some error. The correction unit 15 may correct the graphic information or may correct the scale information when correcting the map information so that both areas coincide with each other. Hereinafter, these two cases will be described separately. The correction of the map information may be generation of corrected graphic information or corrected scale information.

[Correction of figure information]
When the correction unit 15 corrects the graphic information, the correction unit 15 may move each corrected vertex on the bisector of each corner of each vertex indicated by the graphic information. By doing this, it is possible to increase the possibility that the region formed by the vertex after movement, that is, the shape of the corrected region is similar to the shape of the region before correction, and the shape of the region is corrected by the correction. Large changes can be avoided. As a result, for example, it is possible to reduce the possibility that the user who sees the graphic corresponding to the corrected area has a sense of incongruity. When the area is increased by this correction, for example, the correction unit 15 may or may not move each vertex on the bisector so as to go outward from the original region. When the area is reduced by this correction, for example, the correction unit 15 may or may not move each vertex on the bisector so as to go inside the original region. Good.

  The correcting unit 15 may or may not move each vertex so that the distance from the vertex before correction to the vertex after correction is the same for each vertex. In the former case, by moving each vertex, the area can be expanded or contracted uniformly outward or inward, so the shape of the area before correction is similar to the shape of the area after correction Can be a thing.

  Further, the correction unit 15 may or may not move each vertex so that the side between the vertices before correction and the side between the vertices after correction are parallel to each other. In the former case, each side is parallel to the area before the change and the area after the change. In maps, it may be preferable to maintain parallelism, such as the borders on both sides of the road. Therefore, by correcting so that each side becomes parallel in this way, it is possible to maintain such parallelism, and for example, a user who sees a figure corresponding to the corrected region feels uncomfortable. The possibility of having it can be reduced.

  When there is a restriction based on the restriction information for one vertex that the correction unit 15 is to move, the correction unit 15 moves one vertex within the restriction range indicated by the restriction information. “Within the limit range indicated by the limit information” means within a range allowed by the limit indicated by the limit information. For example, when the restriction information indicates that a vertex is in contact with a river and can move only on the boundary line with the river, the correction unit 15 moves the vertex only on the boundary line with the river. In this case, for example, as described above, even when correction is performed so that the distance from the vertex before correction to the vertex after correction is the same for each vertex, this is the case for the vertex. May or may not be. Further, for example, as described above, even when correction is performed so that the side between the vertices before correction and the side between the vertices after correction are parallel, You may or may not become.

  Further, the method of correcting the graphic information by the correction unit 15 is not limited to these methods, and it goes without saying that the graphic information may be corrected by other methods.

[Correction of scale information]
When the correction unit 15 corrects the scale information, the correction unit 15 changes the scale information so that the area of the region calculated by the area calculation unit 13 matches the area indicated by the area information corresponding to the region. to correct. For example, when the area (area in real space) calculated by the area calculation unit 13 is “SQ001” and the area of the area indicated by the area information (area in real space) is “SQ002”, The scale after correction by the correction unit 15 can be as follows.

Scale after correction = Scale before correction × (SQ001 / SQ002) ^1/2

  The output unit 16 outputs information after correction by the correction unit 15. The corrected information is, for example, corrected graphic information when the correction unit 15 corrects the graphic information, and is corrected scale information when the correction unit 15 corrects the scale information. Further, the corrected information may be, for example, map information having graphic information corrected by the correction unit 15 and scale information not corrected by the correction unit 15, and the correction unit 15 performs correction. It may be map information having graphic information that has not been performed and scale information that has been corrected by the correction unit 15.

  Here, the output may be, for example, display on a display device (for example, a CRT or a liquid crystal display), transmission via a communication line to a predetermined device, printing by a printer, or output to a recording medium. It may be accumulated or delivered to another component. When the output unit 16 stores the corrected information, for example, it may be stored in the map information storage unit 11. In this case, for example, graphic information and scale information may be accumulated by overwriting, or graphic information before correction and graphic information after correction may be accumulated in association with each other. The output unit 16 may or may not include an output device (for example, a display device or a printer). The output unit 16 may be realized by hardware, or may be realized by software such as a driver that drives these devices.

  The map information storage unit 11 and the area information storage unit 12 may be realized by the same recording medium or may be realized by separate recording media. In the former case, the area storing the map information is the map information storage unit 11, and the area storing the area information is the area information storage unit 12.

Next, operation | movement of the map information correction apparatus 1 by this Embodiment is demonstrated using the flowchart of FIG.
(Step S101) The area calculation unit 13 sets the counter i to 1.

  (Step S102) The area calculation unit 13 refers to the map information storage unit 11 and calculates the area of the i-th region. In the present embodiment, this area is assumed to be an area in real space.

  (Step S <b> 103) The determination unit 14 refers to the area information storage unit 12 and reads area information corresponding to the i-th region.

  (Step S104) The determination unit 14 determines whether the area calculated by the area calculation unit 13 in step S102 matches the area read from the area information storage unit 12 in step S103. If they match, the process proceeds to step S107, and if they do not match, the process proceeds to step S105.

  (Step S105) The correction unit 15 corrects the map information corresponding to the i-th region so that both areas match. During this process, area calculation by the area calculation unit 13, determination by the determination unit 14, and the like may be performed. As described above, the correction unit 15 may correct the graphic information included in the map information, or may correct the scale information. In the present embodiment, a case where the correction unit 15 corrects graphic information included in map information will be described. Details of the correction process will be described later with reference to the flowchart of FIG.

  (Step S106) The output unit 16 outputs the corrected information corrected by the correction unit 15.

  (Step S107) The area calculation unit 13 increments the counter i by 1.

  (Step S108) The area calculation unit 13 refers to the map information storage unit 11 and determines whether or not the i-th region exists. And when it exists, it returns to step S102, and when it does not exist, a series of processes which correct | amend map information are complete | finished.

  FIG. 3 is a flowchart showing an example of details of the correction processing (step S105) in the flowchart of FIG. In the flowchart of FIG. 3, the case where the vertices of the regions are indicated as P1, P2,... Clockwise or counterclockwise will be described.

  (Step S201) The correction unit 15 sets n to the number of vertices in the i-th region.

  (Step S202) The correction unit 15 sets the counter j to 1.

  (Step S203) The correction unit 15 calculates a straight line PjIj that is a bisector of the corner of the vertex Pj. Ij is a point on the bisector of the corner of the vertex Pj (a point different from Pj). An example of a method for calculating the position of Ij will be described later.

  (Step S204) The correction unit 15 determines the position of the vertex TPj which is the vertex after correction of the vertex Pj. Here, a distance between the vertex P1 and the vertex TP1 (this distance is referred to as “correction amount C”) is set in advance, and the correction unit 15 is a position separated from the vertex P1 by C, and in step S203, The position of TP1, which is the position on the calculated straight line P1I1, is determined. It is assumed that C = ε is set in the initial state. It is assumed that ε is a minute amount. When the counter j is a value other than 1, and the distance from the vertex before correction to the vertex after correction is equal for each vertex, the correction unit 15 is at a position away from the vertex Pj by C. The position of TPj, which is the position on the straight line PjIj calculated in step S203, is determined. On the other hand, when the counter j is a value other than 1, and the side between the vertices before correction and the side between the vertices after correction are parallel, the correction unit 15 calculates the straight line calculated in step S203. A position of TPj, which is a position on PjIj, is determined such that side P (j−1) Pj and side TP (j−1) TPj are parallel to each other.

  Determining the position of TPj may be, for example, storing the coordinates of TPj in a recording medium (not shown). When the area calculated by the area calculation unit 13 is larger than the area indicated by the area information, TPj exists inside the region formed by the vertex Pj and the like. On the other hand, when the area calculated by the area calculation unit 13 is smaller than the area indicated by the area information, TPj exists outside the region formed by the vertex Pj and the like.

  (Step S205) The correction unit 15 determines whether the value of the counter j is equal to n. If they are equal, the correction process has been completed for all the vertices, so the process proceeds to step S207. Otherwise, the vertices that have not been corrected remain, and the process proceeds to step S206. .

  (Step S206) The correction unit 15 increments the counter j by 1. Then, the process returns to step S203.

  (Step S207) The area calculation unit 13 calculates the area of the region formed by the corrected vertices TP1, TP2,.

  (Step S208) The determination unit 14 determines whether the area of the corrected region matches the area indicated by the area information. If they match, the process returns to the flowchart of FIG. 2, and if they do not match, the process proceeds to step S209. When returning to the flowchart of FIG. 2, the positions of TP1, TP2,..., TPn calculated last are the corrected vertex positions.

  (Step S209) The correction unit 15 resets the correction amount C and returns to step S202. At the time of this resetting, the correction unit 15 updates the correction amount C by adding ε to the correction amount C (C ← C + ε).

  In the flowchart of FIG. 3, the case where the correction amount C is changed by ε has been described, but this need not be the case. For example, the value of the correction amount C may be obtained using a binary search algorithm. Specifically, a correction amount C that is somewhat large is set first, and the correction amount C is larger than the target value (the value of the correction amount C that makes the calculated area equal to the area indicated by the area information) (the area is expanded). In this case, the calculated area is larger than the area indicated by the area information, and when the area is reduced, the calculated area is smaller than the area indicated by the area information). The correction amount C is repeatedly halved until it becomes. On the other hand, when the correction amount C is smaller than the target value (when the area is expanded, the calculated area is smaller than the area indicated by the area information. When the area is reduced, the calculated area is the area. When the correction amount C is larger than the area indicated by the information), the correction amount C is doubled until the correction amount C increases. The new correction amount C is set in the middle between the minimum value of the correction amount C larger than the target value and the maximum value of the correction amount C smaller than the target value obtained in the previous search. For example, when the correction amount C at the counter j = m is large and the correction amount C at the counter j = m + 1 is small, or the correction amount C at the counter j = m is small and the correction at the counter j = m + 1 When the amount C is large, the correction amount C at the counter j = m + 2 is set to the middle value between the correction amount at the counter j = m and the correction amount at the counter j = m + 1. Thus, by searching for the value of the correction amount C using the binary search, the optimal correction amount C can be found earlier.

  Further, in the flowchart of FIG. 3, the case where the corrected region is searched while changing the correction amount has been described. However, when the region is limited to a simple shape such as a rectangle, the area indicated by the area information May be used to calculate how much each vertex indicated by the graphic information should be moved, and the graphic value may be corrected using the calculated value.

  Further, in step S203 of the flowchart of FIG. 3, the inner center of a triangle formed by the vertex Pj and two polygon sides extending from the vertex is calculated, and a straight line connecting the inner center and the vertex Pj is calculated. May calculate the straight line PjIj. In this case, the inner center may be Ij.

Next, operation | movement of the map information correction apparatus 1 by this Embodiment is demonstrated using a specific example.
In this specific example, it is assumed that the map information storage unit 11 stores the map information shown in FIG. This map information includes scale information, region ID, graphic information, and restriction information. The area ID, which is information for identifying the area, the graphic information, and the restriction information are associated with each other. For example, the graphic information of the area identified by the area ID “A101” (this area may be referred to as “area A101”. The same applies to other areas) is indicated by P1 (x1, x2) or the like. ing. Accordingly, the area A101 is a quadrangle surrounded by four vertices P1 (x1, y1), P2 (x2, y2), P3 (x3, y3), and P4 (x4, y4). Restriction information is not set for the area A101, but restriction information is set for the area A102, and the movement range of the vertices P2 and P3 is restricted.

  In this specific example, it is assumed that the area information storage unit 12 stores the area information shown in FIG. In this area information, the region ID is associated with the area. For example, the area of the region A101 is “SQ01”.

  FIG. 6 is an image showing two regions indicated by the map information in FIG. In this specific example, as shown in FIG. 6, it is assumed that the vertices of the area are designated clockwise from P1. In FIG. 6, the vertices P <b> 2 and P <b> 3 of the area A <b> 102 cannot move to the right any more, and thus restriction information is set as shown by the map information in FIG. 4.

  Here, a method of calculating the angle bisector will be briefly described. As shown in FIG. 7, the case where the bisector of the corner of the apex P formed by the line segments PA and PB is calculated will be described. First, an arbitrary point Q is set on the line segment PB. Next, the point R is set on the line segment PA so that the length of the line segment PQ is equal to the length of the line segment PR. Thereafter, a vector PR having the start point as the point P and the end point as the point R is obtained. The position of the end point of the vector PR when the start point of the vector PR is the point Q is defined as a point I. Then, the straight line connecting the point P and the point I becomes a straight line that bisects the corner of the vertex P. Therefore, by obtaining the formula of the straight line PI in this way, the formula of the straight line that bisects the corner of the vertex P can be calculated.

  Note that the method of calculating the angle bisector is not limited to the description using FIG. 7, and it goes without saying that other methods may be used. For example, in FIG. 7, if the coordinate values of point P, point A, and point B are known, the angle of vertex P can be calculated. Then, half of the calculated angle is an angle formed by the bisector of the angle of the vertex P and the line segment PA or the line segment PB. Therefore, by using a half angle of the calculated vertex P, an equation of a bisector of the corner of the vertex P can be calculated.

  A method of calculating the polygonal area by dividing it into triangles will be briefly described. FIG. 8 is a diagram showing a pentagon P1P2P3P4P5. As shown in FIG. 8, the pentagon can be divided into three triangles having a vertex P1 as one vertex, that is, a triangle P1P2P3, a triangle P1P3P4, and a triangle P1P4P5. If the coordinates of each vertex are known, the distance between the vertices can be calculated, and the area of each triangle can be calculated by substituting the distance into Heron's formula. By summing the calculated areas of the respective triangles, the area of the pentagon P1P2P3P4P5 can be obtained. Thus, the area of the polygon P1P2... Pn is calculated by dividing the polygon into triangles P1P2P3, triangles P1P3P4, triangles P1P4P5,. You can ask for it. Needless to say, as described above, the area of the region may be obtained by other methods. Moreover, when calculating the area in real space, after converting the distance between each vertex into the distance in real space using scale information, the area of each triangle should be calculated.

  Next, a specific process for correcting the map information will be described. First, it is assumed that the user inputs an instruction to start correction of map information to the map information correction apparatus 1 by operating an input device such as a mouse or a keyboard. The instruction is accepted by the map information correction apparatus 1, and a series of processes for correcting the map information is started. And the area calculation part 13 calculates the length on the map between each vertex using the graphical information of area | region A101 shown by the 1st record of FIG. Moreover, the area calculation part 13 calculates the distance between the vertices in real space by multiplying each length by the reciprocal of the scale information 1/600. Thereafter, the area of each triangle is calculated using the Heron formula as described above, and the areas are added to calculate the area of the region A101 indicated by the map information (steps S101 and S102). It is assumed that the area thus calculated is SQ101. The area calculation unit 13 passes the calculated area SQ101 and the region ID “A101” of the region A101 to the determination unit 14.

  Then, the determination unit 14 searches the area information using the area ID “A101” as a search key, and reads the area SQ01 from the hit record (step S103). Then, the determination unit 14 compares the area SQ101 received from the area calculation unit 13 with the read area SQ01. In this case, it is assumed that the area SQ01 is larger and the two do not match (step S104). Then, the determination unit 14 passes to the correction unit 15 the region ID “A101” of the region A101 and the fact that the area indicated by the area information is larger.

  The correction unit 15 starts a process of correcting the graphic information (step S105). Specifically, the correction unit 15 refers to the graphic information corresponding to the region ID “A101”, and sets n to 4 because the number of vertices is four (step S201). Then, as described above, the formula of the bisector P1I1 of the corner of the vertex P1 is calculated (steps S202 and S203). Further, the correction unit 15 reads the correction amount C = ε stored in advance on a recording medium (not shown), and determines the vertex TP1 after moving on the straight line P1I1 so that the distance between P1 and TP1 becomes ε. Then, the coordinates of the vertex TP1 are temporarily stored in a recording medium (not shown) (step S204). In this case, since the area indicated by the area information is larger, the moved vertex TP1 is set outside the region A101. FIG. 9 is a diagram illustrating the moved vertex TP1 set in such a manner. Similarly, for the other vertices P2, P3, and P4, the vertices after movement are determined similarly (steps S205, S206, S203, and S204). When the vertices TP1 to TP4 are determined, the correction unit 15 passes the coordinates of the vertices TP1 to TP4 and an instruction to calculate the area to the area calculation unit 13 through a path (not shown). Then, the area calculation unit 13 calculates the area of the region formed by the vertices TP1 to TP4 (step S207). Then, the determination unit 14 compares the area SQ01 previously read from the area information storage unit 12 with the newly calculated area. Also in this case, it is assumed that the area indicated by the area information is still larger and the two do not match (step S208).

  Then, the correction unit 15 updates the correction amount C to 2ε (step S209), and performs a process of determining the vertices TP1 to TP4 after the new movement (steps S202 to S206). Then, as in the case described above, area calculation by the area calculation unit 13 and determination by the determination unit 14 are performed (steps S207 and S208). In this case, it is assumed that the determination unit 14 determines that both areas match. Then, the correction unit 15 passes the area ID “A101” and the coordinates of the corrected vertices TP1 to TP4 to the output unit 16. When the output unit 16 receives the information, the output unit 16 accesses the map information storage unit 11, and receives the coordinates of each vertex of the graphic information corresponding to the area ID “A101” from each of the moved vertices TP <b> 1 to TP <b> 1. The coordinates of TP4 are changed by overwriting (step S106). As a result, the map information is updated as shown in FIG. FIG. 11 is a diagram illustrating a region A101 before correction and a region A101 after correction. As shown in FIG. 11, the position of each vertex is moved and the area of the area A101 is expanded, so that the area of the area A101 indicated by the map information matches the area of the area A101 indicated by the area information. It has become.

  Thereafter, the region A102 and the like are also corrected as appropriate (steps S107, S108, S102 to S106). Details of the processing are omitted. In the case of the area A102, since the restriction information is set, the vertices P2 and P3 are moved within the restriction range indicated by the restriction information. As a specific moving method, for example, as in the case of the region A101, after moving each vertex assuming that the restriction information does not exist, only the vertices TP2 and TP3 are moved again so as to satisfy the restriction information. It may be. More specifically, as in the case of the area A101, as indicated by the arrow (1) shown in FIG. 12, the vertices P1 to P4 are moved assuming that there is no restriction information. Thereafter, since the x coordinate exceeds “x102”, the two vertices TP2 and TP3 that do not satisfy the restriction indicated by the restriction information may be moved again so as to satisfy the restriction. For example, TP2 and TP3 may be moved as indicated by an arrow (2) shown in FIG. In the movement, as shown by an arrow (2) shown in FIG. 12, the movement may be within a minimum range satisfying the restriction, or may be a movement beyond that. Further, the vertices TP2 and TP3 to be moved may be moved on each side of the area before the movement of the arrow (2) (rectangular area formed by the vertices TP1, TP2, TP3, and TP4). It does n’t have to be.

  The restriction information in FIG. 4 is the restriction information for P2 and P3, but the restriction is the same for the vertices TP2 and TP3 after the movement. Another specific method for moving the vertices within the restriction range indicated by the restriction information is that if the vertex having the restriction information is moved on the bisector of the corner, the restriction is not satisfied. For example, there may be a method of moving the vertex so as to satisfy the restriction information from the beginning. For example, in FIG. 12, P2 and P3 may be moved directly to the positions of TP2 and TP3 after the movement by the arrow (2). At that time, if there is a rule to move each vertex so that the distance from the vertex before correction to the vertex after correction is the same for each vertex, all the vertices should follow that rule. (For example, including TP2 and TP3 in FIG. 12) may be moved, or for vertices (for example, TP2 and TP3 in FIG. 12) that perform irregular movement according to the restriction information, There is no need to impose such restrictions. If there is a rule that moves each vertex so that the side between the vertices before correction and the side between the corrected vertices are parallel, all vertices (for example, 12 (including TP2 and TP3 in FIG. 12) may be moved, or such a restriction is applied to vertices (for example, TP2 and TP3 in FIG. 12) that perform irregular movement according to the restriction information. It is not necessary to impose. As described above, when the restriction based on the restriction information is imposed on at least one of the vertices to be moved, there are various modes for the method of moving each vertex.

In this specific example, the case where the graphic information is corrected has been described. However, as described above, by correcting the scale information, the area of the area indicated by the graphic information matches the area indicated by the area information. You may make it take. Such a case will be briefly described. Note that the processing (steps S101 to S104) until the determination by the determination unit 14 is the same as in the above specific example, and the description thereof is omitted. When the determination unit 14 determines that the two areas do not match, the correction unit 15 calculates the corrected scale as follows (step S105).
Scale after correction = (1/600) × (SQ101 / SQ01) ^1/2

  In this specific example, it is assumed that the scale after the correction is 1/700. Then, the output unit 16 overwrites the scale information with the scale after the correction (step S106). As a result, the map information is updated as shown in FIG. When the scale information is corrected, it is not necessary to perform correction for each of a plurality of areas as shown in the flowchart of FIG. It is sufficient to perform correction only for one area. Therefore, a series of processing may be ended after it is determined Yes in step S104 and after the processing in step S106. In such a case, the scale information may be corrected using the area of the first region, and the scale information may be corrected using the areas of other regions. Further, for example, scale information after correction may be calculated using areas of a plurality of regions, and final scale information after correction that is an average value may be calculated.

  In the present embodiment, a case has been described in which the vertex before correction is indicated by P1 and the vertex after correction is indicated by TP1 and the like so that the vertex before correction and the vertex after correction can be easily distinguished. Both vertices may be indicated by the same symbol.

  Moreover, although this specific example demonstrated the case where restriction | limiting information existed in map information, restriction | limiting information does not need to exist in map information.

  Also, in this specific example, the case where only the vertex is moved has been described. However, when the position of the vertex and the position and shape of the side between the vertices are indicated by the graphic information, the movement of the position of the vertex is accompanied. The sides between the vertices may be moved and the sides may be deformed. For example, when the distance between the vertices after the movement becomes narrower than the distance between the vertices before the movement, the side between the vertices may be reduced so as to fit between the vertices after the movement. When the distance between the vertices after the movement becomes larger than the distance between the vertices before the movement, the side between the vertices may be enlarged so as to fit between the vertices after the movement. In reducing or enlarging the sides, the size may be reduced or enlarged so that the shape after deformation and the shape before deformation are similar to each other.

  As described above, according to the map information correction apparatus 1 according to the present embodiment, when there is a mismatch between the area obtained from the map information and the area managed separately from the map information, the map information By correcting the graphic information or correcting the scale information, it is possible to eliminate the inconsistency between the two. As a result, for example, the map information can be corrected so as to be consistent with information such as a public book, a land ticket, and a land survey map.

  In the present embodiment, the area calculation unit 13 calculates the actual area (area in real space) indicated by the graphic information, and the determination unit 14 determines the calculated area and the actual information indicated by the area information. Although the case where the area in space is compared has been described, this need not be the case. For example, the area calculation unit 13 calculates the area (area in the map space) of the region indicated by the graphic information, and the determination unit 14 determines the calculated area and the real space indicated by the area information. You may compare with the area which converted the area into the area on a map.

(Embodiment 2)
A map information correction apparatus according to Embodiment 2 of the present invention will be described with reference to the drawings. The map information correction apparatus according to the present embodiment eliminates the mismatch when there is a mismatch between a distance obtained from the map information and a distance managed separately from the map information.

  FIG. 14 is a block diagram showing the configuration of the map information correction apparatus 2 according to this embodiment. The map information correction apparatus 2 according to the present embodiment includes a map information storage unit 11, a distance information storage unit 21, a distance calculation unit 22, a determination unit 23, a correction unit 24, and an output unit 25. The map information storage unit 11 is the same as that in the first embodiment, and a description thereof is omitted. In the present embodiment, the map information stored in the map information storage unit 11 is map information having graphic information indicating at least one side and scale information. The side may be a straight line or a curved line. The side may be indicated by, for example, the coordinates of the positions of the vertices at both ends, or may be indicated by the coordinates of a plurality of points included in the side. In the former case, the distance between the vertices at both ends may be a straight line or a curved line. In the case where a curve is used, the graphic information may include a function indicating the curve.

  The distance information storage unit 21 stores distance information that is information indicating the distance of one or more sides. This distance information is the same as the area information described in the first embodiment except that the distance information is information indicating the distance of one or more sides. For example, this distance information may be obtained from a land survey map or the like. In addition, the distance indicated by the distance information may be, for example, information on a distance indicated by a turnbook or a field book, or may be information on a distance obtained by actual measurement. In addition, it is preferable that the distance indicated by the distance information is associated with the side indicated by the graphic information included in the map information. That is, when the distance information indicates two or more sides, it is preferable to know which distance indicated by the distance information corresponds to the distance indicated by the graphic information. For this purpose, for example, both the graphic information and the distance information include information for identifying a side, and the two may be associated through the information for identifying the side.

  The process in which distance information is stored in the distance information storage unit 21 does not matter. For example, distance information may be stored in the distance information storage unit 21 via a recording medium, and distance information transmitted via a communication line or the like is stored in the distance information storage unit 21. Alternatively, the distance information input via the input device may be stored in the distance information storage unit 21. The storage in the distance information storage unit 21 may be temporary storage in a RAM or the like, or may be long-term storage. The distance information storage unit 21 can be realized by a predetermined recording medium (for example, a semiconductor memory, a magnetic disk, an optical disk, etc.).

  The distance calculation unit 22 calculates the distance of the side indicated by the graphic information. For example, when a straight side is indicated by two vertices indicated by the graphic information, the distance calculation unit 22 calculates the distance between the two vertices by using the Pythagorean theorem, the coordinate difference calculation, or the like. The distance may be calculated. Further, for example, when the sides of the curve are indicated by the graphic information, the distance calculation unit 22 subdivides the sides into a plurality of straight sides, calculates the distance for each of the plurality of straight sides, and totals the distances. Thus, the desired distance may be calculated. When calculating the side distance, the distance calculation unit 22 calculates the side distance using the scale information. For example, the distance calculation unit 22 may convert the length of the side indicated by the graphic information into an actual distance (a distance in the real space) using the scale information. Note that a method for calculating the side distance is well known, and a description thereof will be omitted.

  The determination unit 23 determines whether the distance of the side calculated by the distance calculation unit 22 matches the distance indicated by the distance information corresponding to the side. The determination unit 23 receives the distance of the side calculated by the distance calculation unit 22 for a certain side from the distance calculation unit 22 and reads the distance corresponding to the side from the distance information storage unit 21. Then, the two are compared to determine whether or not they match. As with the determination unit 14 in the first embodiment, “matching” may be strictly matching or may include a case where there is some error (tolerance).

  When the determination unit 23 determines that the two distances do not match, the correction unit 24 corrects the scale information so that the two distances match. For example, when the side distance (distance in real space) calculated by the distance calculation unit 22 is “L001” and the side distance (distance in real space) indicated by the distance information is “L002”, The scale of the correction unit 24 after correction can be as follows.

  Scale after correction = Scale before correction × (L001 / L002)

  The output unit 25 outputs information after correction by the correction unit 24. The corrected information may be, for example, corrected scale information or map information including the corrected scale information.

  Here, the output may be, for example, display on a display device (for example, a CRT or a liquid crystal display), transmission via a communication line to a predetermined device, printing by a printer, or output to a recording medium. It may be accumulated or delivered to another component. When the output unit 25 accumulates the corrected information, for example, accumulation in the map information storage unit 11 may be performed. In this case, the scale information may be accumulated by overwriting, or the scale information before correction and the scale information after correction may be stored in association with each other. Note that the output unit 25 may or may not include a device that performs output (for example, a display device or a printer). The output unit 16 may be realized by hardware, or may be realized by software such as a driver that drives these devices.

  The map information storage unit 11 and the distance information storage unit 21 may be realized by the same recording medium, or may be realized by separate recording media. In the former case, the area storing map information is the map information storage unit 11, and the area storing distance information is the distance information storage unit 21.

Next, operation | movement of the map information correction apparatus 2 by this Embodiment is demonstrated using the flowchart of FIG.
(Step S301) The distance calculation unit 22 refers to the map information storage unit 11 and calculates the distance of the first side. In the present embodiment, this distance is assumed to be a distance in real space.

  (Step S302) The determination unit 23 refers to the distance information storage unit 21 and reads the distance information corresponding to the first side.

  (Step S303) The determination unit 23 determines whether or not the distance calculated by the distance calculation unit 22 in step S301 matches the distance read from the distance information storage unit 21 in step S302. If they match, there is no need to correct the scale information, so the series of processes ends. If they do not match, the process proceeds to step S304.

  (Step S304) The correction unit 24 corrects the scale information included in the map information so that both distances coincide with each other.

  (Step S305) The output unit 25 outputs the corrected information corrected by the correction unit 24. And a series of processes which correct | amend map information are complete | finished.

  In this flowchart, the case where the scale information is corrected using the distance of the first side is described, but this need not be the case. For example, the scale information may be corrected using the distances of other sides, or the corrected scale information is calculated using the distances of a plurality of sides and the final corrected scale, which is an average value thereof. Information may be calculated.

Next, operation | movement of the map information correction apparatus 2 by this Embodiment is demonstrated using a specific example.
In this specific example, it is assumed that the map information storage unit 11 stores the map information shown in FIG. This map information includes scale information, side IDs, and graphic information. Except that the area ID is replaced by the side ID, the map information is the same as the map information in the specific example of the first embodiment, and detailed description thereof is omitted. Note that the graphic information is information indicating the coordinates of both ends P1 and P2 of the side, and the ends of the side are separated by a straight line.

  Further, in this specific example, it is assumed that the distance information storage unit 21 stores the distance information shown in FIG. In this distance information, the side ID is associated with the distance. For example, the distance of the side identified by the side ID “SI101” (this side may be referred to as side SI101. The same applies to other sides) is “L01”.

  First, it is assumed that the user inputs an instruction to start correction of map information to the map information correction apparatus 2 by operating an input device such as a mouse or a keyboard. The instruction is accepted by the map information correction device 2, and a series of processes for correcting the map information is started. Then, the distance calculation unit 22 calculates the side distance using the graphic information of the side SI101 indicated by the first record in FIG. 16 (step S301). Assume that the distance thus calculated is L101. The distance calculation unit 22 passes the calculated distance L101 and the side ID “SI101” of the side SI101 to the determination unit 23.

  Then, the determination unit 23 searches the distance information using the side ID “SI101” as a search key, and reads the distance “L01” from the hit record (step S302). Then, the determination unit 23 compares the distance L101 received from the distance calculation unit 22 with the read distance L01. In this case, it is assumed that the two do not match (step S303). Then, the determination unit 23 passes the side ID “SI101” and the fact that the distances do not match to the correction unit 24.

The correction unit 24 calculates the corrected scale as follows (step S304).
Scale after correction = Scale before correction × (L101 / L01)

  In this specific example, it is assumed that the scale after the correction is 1/500. Then, the output unit 25 overwrites the scale information with the scale after the correction (step S305). As a result, the map information is updated as shown in FIG.

  As described above, according to the map information correction apparatus 2 according to the present embodiment, when there is a mismatch between the distance obtained from the map information and the distance managed separately from the map information, the map information By correcting the scale information, it is possible to eliminate the mismatch. As a result, for example, the map information can be corrected so as to be consistent with information such as a turnbook, field book, and land survey map.

  In the present embodiment, the case has been described where the scale information is corrected when there is a mismatch between the distance obtained from the map information and the distance indicated by the distance information. However, as in the case of the first embodiment. In addition, the graphic information may be corrected. For example, the distance indicated by the map information and the distance indicated by the distance information may be matched by extending or shortening the side indicated by the graphic information. In that case, when the length of the side is shortened, the correction unit 24 may use a part of the side before correction as the side after correction. Further, the correction unit 24 may extend the length of the side, and if the side before correction is a straight line, the correction unit 24 may extend the length of the side so that the linearity is maintained. When a repeated pattern exists on the previous side (for example, when a waveform pattern or a zigzag pattern exists), the length of the side may be extended so that the repeated pattern is maintained. Further, when extending the length of the side, only one end of the side may be extended, or both ends of the side may be extended. When extending the both ends of a side, you may extend equally and it may not be so.

  In the present embodiment, the distance calculation unit 22 calculates the actual distance (distance in real space) of the region indicated by the graphic information, and the determination unit 23 calculates the calculated distance and the actual information indicated by the distance information. Although the case where the distance in the space is compared has been described, this need not be the case. For example, the distance calculation unit 22 calculates the distance on the map of the area indicated by the graphic information (distance in the map space), and the determination unit 23 calculates the calculated distance and the real space indicated by the distance information. The distance converted to the distance on the map may be compared.

  Further, in each of the above embodiments, the area information and the distance information may be information other than those obtained from a public book, a land ticket, a land surveying map, a turnbook, and a field book. For example, the area information and the distance information may be information obtained by actual surveying. In each of the above embodiments, the unit of area or distance may be appropriately converted in the process of comparison, area calculation, or the like. For example, for the area and distance, the unit of the shank method and R, hectares, square meters, meters, etc. may be converted.

  In each of the above embodiments, it goes without saying that the map information may be corrected by a method other than that described. For example, the corrected vertex may be moved to a position other than the bisector of the corner of each vertex.

  In each of the above-described embodiments, the case where the map information correction apparatuses 1 and 2 are stand-alone has been described. However, the map information correction apparatuses 1 and 2 may be stand-alone apparatuses, or servers in a server / client system. It may be a device. In the latter case, the output unit outputs information via a communication line, for example.

  In each of the above embodiments, each processing or each function may be realized by centralized processing by a single device or a single system, or distributed processing by a plurality of devices or a plurality of systems. May be realized.

  Also, in each of the above embodiments, information related to processing executed by each component, for example, each component received, acquired, selected, generated, transmitted, or received Information and information such as threshold values, mathematical formulas, addresses, etc. used by each component in processing are retained temporarily or over a long period of time on a recording medium (not shown) even if not explicitly stated in the above description. May be. Further, the storage of information in the recording medium (not shown) may be performed by each component or a storage unit (not shown). Further, reading of information from the recording medium (not shown) may be performed by each component or a reading unit (not shown).

  In each of the above embodiments, when information used by each component, for example, information such as a threshold value, an address, and various setting values used by each component may be changed by the user Even if it is not specified in the above description, the user may be able to change the information as appropriate, or it may not be. If the information can be changed by the user, the change is realized by, for example, a not-shown receiving unit that receives a change instruction from the user and a changing unit (not shown) that changes the information in accordance with the change instruction. May be. The change instruction received by the receiving unit (not shown) may be received from an input device, information received via a communication line, or information read from a predetermined recording medium, for example. .

  In each of the above embodiments, when two or more constituent elements included in the map information correction apparatuses 1 and 2 have a communication device, an input device, etc., the two or more constituent elements are physically single devices. You may have, or you may have a separate device.

  In each of the above embodiments, each component may be configured by dedicated hardware, or a component that can be realized by software may be realized by executing a program. For example, each component can be realized by a program execution unit such as a CPU reading and executing a software program recorded on a recording medium such as a hard disk or a semiconductor memory. In addition, the software which implement | achieves the map information correction apparatus 1 in the said embodiment is the following programs. In other words, this program is stored in a map information storage unit in which map information having at least graphic information indicating the position of each vertex of one or more areas and scale information which is information indicating the scale is stored. Information indicating the area of the area indicated by the graphic information included in the map information, the area of the area calculated by the area calculation section, and the area of the one or more areas corresponding to the area When determining that the areas indicated by the area information stored in the area information storage unit in which the area information is stored and the area indicated by the area information match, and when the determination unit determines that both areas do not match, This is to function as a correction unit that corrects the map information so that the two areas coincide with each other, and an output unit that outputs information after correction by the correction unit.

  Moreover, the software which implement | achieves the map information correction apparatus 2 in the said embodiment is the following programs. That is, this program includes the computer in the map information stored in the map information storage unit in which the map information having the graphic information indicating at least one or more sides and the scale information indicating the scale is stored. A distance calculation unit that calculates a distance of the side indicated by the graphic information, a distance of the side calculated by the distance calculation unit, and distance information that is information indicating a distance of the one or more sides corresponding to the side. When the distance determined by the distance information stored in the stored distance information storage unit matches the distance indicated by the distance information storage unit and the distance determined by the determination unit does not match, the both distances match. As described above, the correction unit corrects the scale information and functions as an output unit that outputs information corrected by the correction unit.

  In the program, the functions realized by the program do not include functions that can be realized only by hardware. For example, a function that can be realized only by hardware such as a modem or an interface card in an output unit that outputs information is not included in at least the function realized by the program.

  Further, this program may be executed by being downloaded from a server or the like, and a program recorded on a predetermined recording medium (for example, an optical disk such as a CD-ROM, a magnetic disk, a semiconductor memory, or the like) is read out. May be executed by Further, this program may be used as a program constituting a program product.

  Further, the computer that executes this program may be singular or plural. That is, centralized processing may be performed, or distributed processing may be performed.

  FIG. 19 is a schematic diagram illustrating an example of an external appearance of a computer that executes the program and realizes the map information correction apparatuses 1 and 2 according to the embodiment. The above-described embodiment can be realized by computer hardware and a computer program executed on the computer hardware.

  In FIG. 19, a computer system 900 includes a computer 901 including a CD-ROM (Compact Disk Read Only Memory) drive 905 and an FD (Floppy (registered trademark) Disk) drive 906, a keyboard 902, a mouse 903, a monitor 904, and the like. Is provided.

  FIG. 20 is a diagram illustrating an internal configuration of the computer system 900. 20, in addition to the CD-ROM drive 905 and the FD drive 906, a computer 901 is connected to an MPU (Micro Processing Unit) 911, a ROM 912 for storing a program such as a bootup program, and the MPU 911. A RAM (Random Access Memory) 913 that temporarily stores program instructions and provides a temporary storage space, a hard disk 914 that stores application programs, system programs, and data, and an MPU 911 and a ROM 912 are interconnected. And a bus 915. The computer 901 may include a network card (not shown) that provides connection to the LAN.

  A program for causing the computer system 900 to execute the functions of the map information correction apparatuses 1 and 2 according to the above embodiments is stored in the CD-ROM 921 or FD 922 and inserted into the CD-ROM drive 905 or FD drive 906. It may be transferred to the hard disk 914. Instead, the program may be transmitted to the computer 901 via a network (not shown) and stored in the hard disk 914. The program is loaded into the RAM 913 when executed. The program may be loaded directly from the CD-ROM 921, the FD 922, or the network.

  The program does not necessarily include an operating system (OS) or a third-party program that causes the computer 901 to execute the functions of the map information correction apparatuses 1 and 2 according to the above embodiments. The program may include only a part of an instruction that calls an appropriate function (module) in a controlled manner and obtains a desired result. How the computer system 900 operates is well known and will not be described in detail.

  Further, the present invention is not limited to the above-described embodiment, and various modifications are possible, and it goes without saying that these are also included in the scope of the present invention.

  As described above, according to the map information correction apparatus and the like according to the present invention, when the area and distance obtained from the map information and the area and distance managed separately from the map information are different, those inconsistencies are resolved. For example, it is useful as a system for managing map information.

The block diagram which shows the structure of the map information correction apparatus by Embodiment 1 of this invention. The flowchart which shows operation | movement of the map information correction apparatus by the embodiment The flowchart which shows operation | movement of the map information correction apparatus by the embodiment The figure which shows an example of the map information in the embodiment The figure which shows an example of the area information in the embodiment The figure which shows an example of the area | region in the embodiment The figure for demonstrating the bisector of a corner in the embodiment The figure for demonstrating the calculation of the area of the polygon in the embodiment The figure for demonstrating the correction | amendment of the vertex in the embodiment The figure which shows an example of the map information after correction | amendment in the embodiment The figure which shows an example of the area | region before correction | amendment in the same embodiment, and the area | region after correction | amendment The figure for demonstrating the correction | amendment of the vertex in the embodiment The figure which shows an example of the map information after correction | amendment in the embodiment The block diagram which shows the structure of the map information correction apparatus by Embodiment 2 of this invention. The flowchart which shows operation | movement of the map information correction apparatus by the embodiment The figure which shows an example of the map information in the embodiment The figure which shows an example of the distance information in the embodiment The figure which shows an example of the map information after correction | amendment in the embodiment Schematic diagram showing an example of the appearance of the computer system in the embodiment The figure which shows an example of a structure of the computer system in the embodiment

Explanation of symbols

DESCRIPTION OF SYMBOLS 1, 2 Map information correction apparatus 11 Map information storage part 12 Area information storage part 13 Area calculation part 14, 23 Judgment part 15, 24 Correction part 16, 25 Output part 21 Distance information storage part 22 Distance calculation part

Claims (9)

A map information storage unit for storing map information having at least graphic information indicating the position of each vertex of one or more areas and scale information which is information indicating a scale;
An area information storage unit that stores area information that is information indicating the area of the one or more regions;
An area calculation unit for calculating the area of the region indicated by the graphic information;
A determination unit that determines whether the area of the region calculated by the area calculation unit matches the area indicated by the area information corresponding to the region;
A correction unit that corrects the map information so that the areas match when the areas are determined not to match by the determination unit;
An output unit that outputs information after correction by the correction unit. The map information correction apparatus according to claim 1, wherein the correction unit moves each corrected vertex on a bisector of each corner of each vertex indicated by the graphic information. The map information correction apparatus according to claim 2, wherein the correction unit moves each vertex so that the distance from the vertex before correction to the vertex after correction is equal for each vertex. The map information correction apparatus according to claim 2, wherein the correction unit moves each vertex such that a side between the vertices before correction and a side between the vertices after correction are parallel to each other. The map information further includes restriction information that is information indicating a restriction on movement of one or more vertices indicated by the graphic information.
The map according to any one of claims 2 to 4, wherein the correction unit moves the one vertex within a restriction range indicated by the restriction information when there is a restriction by the restriction information for one vertex. Information correction device. The correction unit converts the scale information ,
Scale after correction = Scale before correction × (Area calculated by the area calculation unit / Area indicated by the area information) ^1/2
The map information correction apparatus according to claim 1 , wherein correction is performed so that The map information correction apparatus according to any one of claims 1 to 6, wherein the area information is information on a public directory, information on a land ticket, or information on actual measurement. A map information storage unit for storing map information having graphic information indicating at least the position of each vertex of one or more areas, and scale information that is information indicating the scale; and information indicating the area of the one or more areas A map information correction method that is processed using an area information storage unit that stores certain area information, an area calculation unit, a determination unit, a correction unit, and an output unit,
An area calculating step in which the area calculating unit calculates an area of a region indicated by the graphic information;
A determination step of determining whether the area of the region calculated in the area calculation step matches the area indicated by the area information corresponding to the region;
A correction step for correcting the map information so that the two areas match when the correction unit determines that the two areas do not match in the determination step;
An output step in which the output unit outputs information after correction in the correction step. Computer
By graphic information included in the map information stored in the map information storage unit in which map information having at least graphic information indicating the position of each vertex of one or more regions and scale information that is information indicating the scale is stored An area calculation unit for calculating the area of the indicated region;
The area indicated by the area information stored in the area information storage unit storing the area of the area calculated by the area calculation unit and the area information corresponding to the area and indicating the area of the one or more areas. A determination unit for determining whether or not matches,
A correction unit that corrects the map information so that the areas match when the areas are determined not to match by the determination unit;
The program for functioning as an output part which outputs the information after correction | amendment by the said correction | amendment part.

Images