Map evaluation apparatus and map evaluation program

Abstract

To provide a map evaluation apparatus, a map evaluation method, and a map evaluation program configured to represent differences between multiple maps that are to be identical, with objective numerical values based on differences of boundary lines of adjacent lots to easily extract portions to be corrected preferentially.SOLUTION: When a lot designation unit 10 designates lots to be compared in a first map and a second map, an adjacent lot designation unit 12 designates at least one lot adjacent to the above lots, as adjacent lots. A boundary line extraction unit 16 extracts a first boundary line in the first map and a second boundary line in the second map, that are boundary lines between the lot to be compared and the adjacent lots, as coordinate values of vertices specifying the first and second boundary lines. An evaluation data generation unit 20 generates evaluation data based on the coordinate values of the vertices of the first and second boundary lines. An evaluation unit 22 evaluates differences of the boundary lines in the first map and the second map from the evaluation data.SELECTED DRAWING: Figure 1

Description

[Technical Field]

[0001] The present invention relates to a map evaluation device, a map evaluation method, and a map evaluation program. [Background technology]

[0002] There are maps kept at Legal Affairs Bureaus (hereinafter referred to as Legal Affairs Bureau official maps) that show the shape of each parcel of land, including its boundaries, location, and parcel number. Legal Affairs Bureau official maps include highly accurate maps based on the public coordinate system, with land boundaries determined through cadastral surveys (maps based on Article 14, Paragraph 1 of the Real Estate Registration Act: referred to as Article 14 maps), and maps based on maps (abutment maps) created during the land tax reform in the early Meiji period (maps attached to the old cadastral register: referred to as old official maps). Old official maps are created using arbitrary coordinates within the map, and the orientation of the map is also arbitrary.

[0003] Each city, town, and village has prepared current parcel number maps, similar to official maps from the Legal Affairs Bureau, which show the boundaries, location, and parcel shape of each parcel, including parcel numbers, as the basis for assessing fixed asset tax on land. If the official maps from the Legal Affairs Bureau are Article 14 maps, they are based on the current state of the land and can be used for tax purposes without any problems. However, in the case of old official maps, the orientation varies from map to map, and the shape of the parcels does not necessarily reflect the current state, which makes it difficult to use them as taxation information. Therefore, using accurately surveyed topographical maps and aerial photographs, etc., local governments have compiled current parcel number maps by editing the old official maps to match the current state.

[0004] For example, Patent Document 1 below discloses an invention of a map alignment device that semi-automates the work of embedding a legal affairs bureau official map into a residential map, thereby improving work efficiency. [Prior art documents] [Patent documents]

[0005] [Patent Document 1] Japanese Patent Application Laid-Open No. 2008-032810 Summary of the Invention [Problem to be solved by the invention]

[0006] While the official maps of the Legal Affairs Bureau and the current parcel number maps should be identical, since the current parcel number maps were created, the Legal Affairs Bureau and municipalities have been making additions and deletions to their respective maps to reflect changes over time in the boundaries of the parcels that make up the shape of the land due to subdivision and consolidation caused by factors such as residential development and the opening of new roads. This can lead to discrepancies between the two maps due to inconsistent editing accuracy and, in some cases, errors during correction. In particular, when adding new boundaries during subdivision, each institution performs the work separately, which can lead to errors in the location and shape of the two maps. Therefore, municipal tax officials or contracted contractors regularly inspect both maps, but depending on the municipality, visually inspecting every single parcel of land, which may consist of tens of thousands or even hundreds of thousands of parcels, requires considerable effort and skill.

[0007] Therefore, the object of the present invention is to provide a map evaluation device, a map evaluation method, and a map evaluation program that can easily extract areas that require priority correction by expressing the discrepancy (difference) between multiple maps that should be identical, such as official maps from the Legal Affairs Bureau and current land lot maps, in objective numerical values ​​based on the differences in the boundary lines between adjacent parcels. [Means for solving the problem]

[0008] In order to achieve the above object, the present invention includes the following embodiments. [1] A map evaluation device for evaluating differences in boundary lines between a plurality of adjacent strokes in a first map and a second map representing stroke shapes, comprising: a stroke designation unit for designating a stroke to be compared in the first map and the second map; an adjacent stroke designation unit for designating at least one stroke adjacent to the stroke to be compared designated by the stroke designation unit in the first map and the second map as an adjacent stroke; a boundary line extraction unit for defining and extracting a first boundary line in the first map and a second boundary line in the second map, which are the boundary lines between the stroke to be compared designated by the stroke designation unit and the adjacent stroke designated by the adjacent stroke designation unit, as coordinate values ​​of vertices of the first boundary line and the second boundary line; an evaluation data generation unit for generating evaluation data based on the coordinate values ​​of vertices of the first boundary line and the second boundary line; and an evaluation unit for evaluating differences in boundary lines between the stroke to be compared and the adjacent stroke in the first map and the second map from the evaluation data. A map evaluation device comprising: [2] The map evaluation device described in [1] further includes a matching processing unit that determines pairs of corresponding vertices between the first boundary line and the second boundary line, and determines whether there are any isolated vertices for which corresponding vertices cannot be determined, and the evaluation data generation unit calculates evaluation data based on the distance between vertices calculated from the coordinates of the vertices in the pairs of corresponding vertices determined by the matching processing unit, and the presence or absence of the isolated vertices. [3] The map evaluation device described in [1], wherein the evaluation data generation unit generates connecting lines whose endpoints are the vertices that are the starting points of the first boundary line and the second boundary line, and further generates connecting lines whose endpoints are the vertices that are the ending points of the first boundary line and the second boundary line, and calculates the area within the range enclosed by the connecting lines between the starting vertices and the ending vertices, and the first boundary line and the second boundary line, as evaluation data. [4] A map evaluation device described in any one of [1] to [3], further comprising an evaluation range designation unit that designates an evaluation range including a plurality of brush strokes, wherein the brush stroke designation unit sequentially designates brush strokes within the evaluation range designated by the evaluation range designation unit, and the adjacent brush stroke designation unit designates brush strokes excluding brush strokes that are adjacent to each other by an evaluated boundary line as adjacent brush strokes. [5] The map evaluation device according to [1] further comprises an outline coordinate value extraction unit that extracts, when the coordinate systems are different between the first map and the second map, a first outline from the first map and a second outline from the second map as the outline of a combined stroke formed by combining a stroke to be compared designated by the stroke designation unit and an adjacent stroke designated by the adjacent stroke designation unit, as coordinate values ​​of vertices defining each outline; and a conversion unit that converts the coordinate values ​​of the vertices of one or both of the first outline and the second outline so that the distance between the vertices defining the first outline and the vertices defining the second outline is minimized, converting the coordinate values ​​so that the first outline and / or the second outline whose coordinate values ​​have been converted maintain similar shapes before and after the conversion, and converting the coordinate values ​​of the vertices defining the first boundary line and the vertices defining the second boundary line by the same amount and rate as the coordinate values ​​of the vertices of one or both of the first outline and the second outline, wherein the boundary line extraction unit extracts the first boundary line and the second boundary line based on the coordinate values ​​after the conversion. [6] A map evaluation method for evaluating the differences in the boundary lines of multiple adjacent blocks in a first map and a second map representing block shapes, comprising the steps of: specifying a block to be compared in the first map and the second map; specifying at least one block adjacent to the block to be compared in the first map and the second map as an adjacent block; defining and extracting a first boundary line in the first map and a second boundary line in the second map, which are the boundary lines between the block to be compared and the adjacent block, as coordinate values ​​of the vertices of the first boundary line and the second boundary line; generating evaluation data based on the coordinate values ​​of the vertices of the first boundary line and the second boundary line; and evaluating the differences between the first map and the second map from the evaluation data. [7] A map evaluation program for evaluating the differences in the boundary lines of multiple adjacent strokes in a first map and a second map, characterized in that the program causes a computer to function as: a stroke designation unit that designates a stroke to be compared in a first map and a second map representing stroke shapes; an adjacent stroke designation unit that designates at least one stroke adjacent to the stroke to be compared designated by the stroke designation unit in the first map and the second map as an adjacent stroke; a boundary line extraction unit that defines and extracts a first boundary line in the first map and a second boundary line in the second map, which are the boundary lines between the stroke to be compared designated by the stroke designation unit and the adjacent stroke designated by the adjacent stroke designation unit, as coordinate values ​​of the vertices of the first boundary line and the second boundary line; an evaluation data generation unit that generates evaluation data based on the coordinate values ​​of the vertices of the first boundary line and the second boundary line; and an evaluation unit that evaluates the differences in the boundary lines between the stroke to be compared and the adjacent stroke in the first map and the second map from the evaluation data. [Effects of the Invention]

[0009] According to the present invention, by expressing the deviations (differences) between multiple maps that should be identical in principle as objective numerical values ​​based on the differences in the boundaries of adjacent plots, it is possible to easily extract areas that require priority correction. [Brief explanation of the drawings]

[0010] [Figure 1] FIG. 1 is a functional block diagram of an example of a map evaluation device according to an embodiment. [Figure 2] FIG. 2 is an explanatory diagram of an example of the operation of the map evaluation device according to the embodiment. [Figure 3] 10A and 10B are explanatory diagrams illustrating an example of the operation of a matching processing unit and an evaluation data generating unit according to the embodiment. [Figure 4] 10A and 10B are explanatory diagrams of another example of the operation of the matching processing unit and the evaluation data generating unit according to the embodiment. [Figure 5] FIG. 10 is a diagram illustrating an example of a table of evaluation points used by an evaluation unit according to the embodiment. [Figure 6] 10A and 10B are explanatory diagrams illustrating an example of the operation of an evaluation range designation unit according to the embodiment. [Figure 7] FIG. 3 is a flowchart of an example of the operation of the map evaluation device according to the embodiment. [Figure 8] FIG. 10 is a flowchart of another operation example of the map evaluation device according to the embodiment. DETAILED DESCRIPTION OF THE INVENTION

[0011] Hereinafter, modes for carrying out the present invention (hereinafter referred to as embodiments) will be described with reference to the drawings.

[0012] 1 shows a functional block diagram of an example of a map evaluation device 100 according to an embodiment. The map evaluation device 100 includes a stroke designation unit 10, an adjacent stroke designation unit 12, an outline coordinate value extraction unit 13, a conversion unit 14, a boundary extraction unit 16, a matching processing unit 18, an evaluation data generation unit 20, an evaluation unit 22, an evaluation range designation unit 24, a communication unit 26, a display control unit 28, a storage unit 30, an input unit 32, and a CPU 34, and is configured as a computer that controls the entire device and performs various calculations. The CPU 34 may include an accelerator such as a GPU in addition to the CPU.

[0013] The parcel designation unit 10 designates parcels to be compared between a first map, such as a public map issued by the Legal Affairs Bureau, and a second map, such as a parcel number status map, by parcel number or a reference number, which is a common number assigned to the same parcel on both maps. In this case, it is preferable to designate all parcels to be compared in order for all parcels in the first or second map. Information on the first and second maps may be acquired via the communication unit 26 from a server installed in, for example, a Legal Affairs Bureau or a municipality and stored in the storage unit 30. Alternatively, information pre-stored on a USB or other suitable storage medium may be read via the communication unit 26 and stored in the storage unit 30. The process by which the parcel designation unit 10 designates parcels to be compared is executed by storing information on the parcels to be compared (such as parcel numbers and reference numbers) included in instruction information input via the input unit 32 in the storage unit 30. The instruction information is input by the user via the input unit 32. In this case, the area to be compared may be specified using a pointing device or the like that constitutes the input unit 32 from the screen of the first map or the second map displayed on an LCD display or the like by the display control unit 28.

[0014] The adjacent stroke designation unit 12 reads information about the stroke to be compared designated by the stroke designation unit 10 and information about the first and second maps from the storage unit 30, and designates at least one stroke adjacent to the stroke to be compared designated by the stroke designation unit 10 as an adjacent stroke on each of the first and second maps. The adjacent stroke designation unit 12 designates the adjacent stroke by storing information about the adjacent stroke (such as a parcel address or serial number) included in instruction information input from the input unit 32 in the storage unit 30. The instruction information is input by the user via the input unit 32. In this case, the adjacent stroke may be designated using a pointing device or the like constituting the input unit 32 from the screen of the first or second map displayed on an LCD or the like by the display control unit 28. Alternatively, the adjacent stroke designation unit 12 may use the acquired information about the first or second map to search for one or more strokes that share part or all of the boundary lines constituting the stroke shape with the stroke to be compared designated by the stroke designation unit 10 using a geographic information system or the like, and designate adjacent strokes from among them in order as appropriate, and perform the subsequent processing to designate all adjacent strokes. The adjacent stroke designation unit 12 stores information about the designated adjacent stroke in the storage unit 30.

[0015] The boundary extraction unit 16 reads information about the stroke to be compared specified by the stroke designation unit 10, information about the adjacent stroke specified by the adjacent stroke designation unit 12, and information about the first and second maps from the storage unit 30. The boundary extraction unit 16 extracts the boundary between the stroke to be compared and the adjacent stroke (the first boundary line in the first map and the second boundary line in the second map) by defining the coordinate values ​​of the vertices that make up the start and end points of the first and second boundary lines, as well as their midpoints, if any. In this case, the boundary extraction unit 16 determines the start, end, and midpoints based on the coordinate values ​​of the vertices of the first and second boundary lines. For example, the boundary extraction unit 16 determines the end point of the first boundary line that is closest to a predetermined point (e.g., the upper left corner) on the first map as the start point, the other end point as the end point, and the vertices other than the start and end points as midpoints. Similarly, the boundary extraction unit 16 determines the end point of the second boundary line that is closest to a predetermined point on the second map as the start point, the other end point as the end point, and the vertices other than the start and end points as midpoints. The boundary extraction unit 16 stores the coordinate values ​​of the vertices of the extracted first boundary line and second boundary line in the storage unit 30. In this case, a vertex code that identifies the vertex position may be assigned to each vertex and stored together with the coordinate value. Here, the first boundary line and the second boundary line are defined as straight lines connecting the extracted vertices.

[0016] When the first map and the second map have different coordinate systems, the outline coordinate value extraction unit 13 reads information on the stroke to be compared designated by the stroke designation unit 10 and the adjacent stroke designated by the adjacent stroke designation unit 12 from the storage unit 30, and extracts a first outline from the first map and a second outline from the second map as the outline of a connected stroke formed by combining the stroke to be compared and the adjacent strokes, using the coordinate values ​​of the vertices defining each outline. Here, the first outline and the second outline are the outlines of a connected stroke formed by combining the same combination of strokes on the first and second maps. The outline of the connected stroke is the boundary of a closed area, such as a rectangle or polygon, representing a land parcel composed of multiple strokes, and is composed of multiple sides whose starting and ending points are the coordinate values ​​of each extracted vertex. The outline coordinate value extraction unit 13 stores the coordinate values ​​of the vertices defining the first outline and the second outline, contained in the information on the first and second maps read from the storage unit 30, in the storage unit 30 as a set of the first and second outlines of the same connected stroke. In this case, it is preferable to assign a vertex code for identifying the vertex position to each vertex of each contour and store it together with its coordinate value.

[0017] If the coordinate systems of the first and second maps are different, the conversion unit 14 reads from the storage unit 30 the coordinate values ​​of the vertices defining the first boundary line and the second boundary line, which are the boundary lines between the target parcel and the adjacent parcel extracted by the boundary line extraction unit 16, and the coordinate values ​​of the vertices defining the first and second outer contours of the connected parcel extracted by the outer contour coordinate value extraction unit 13, and converts the coordinate values ​​of one or both of the vertices defining the first boundary line and the first outer contour and the vertices defining the second boundary line and the second outer contour to the same coordinate system. Specifically, by adding, subtracting, and, if necessary, multiplying and dividing the coordinate values ​​of the vertices defining the connected parcel (first outer contour) and the first boundary line included therein on the first map (official map of the Legal Affairs Bureau), which is an arbitrary coordinate system, a certain number of times, the conversion unit 14 adjusts the coordinate values ​​to the coordinates of the vertices defining the connected parcel (second outer contour) and the second boundary line included therein on the second map (current parcel number map). At this point, it is sufficient to determine the approximate locations. Once the coordinate values ​​of each vertex are in the same coordinate system, the coordinate values ​​of the vertices defining the boundary and outline of one map are transformed to most closely match the coordinate values ​​of the vertices defining the outline of the other map, for example, by moving, rotating, enlarging, or shrinking the vertices while maintaining the similarity of the shapes of the outlines of the connected lines. In this case, for example, transformation processes such as movement and rotation are performed to minimize the sum of the errors in the coordinate values ​​of the corresponding vertices of the first and second outlines. The coordinate values ​​of the vertices defining the boundary are also transformed using the same movement amount and ratio as the coordinate values ​​of the vertices defining the outline, but without ensuring consistency between the first and second boundary lines, and the transformation is based only on the outline of the connected lines. Coordinate transformation methods, such as affine transformation and homography transformation, can be used. The rotation angle, movement amount, and magnification and shrinkage factors may be the same as those of other lines in the same first map (official map of the Legal Affairs Bureau) that have already been transformed. The coordinate values ​​of the vertices of the first boundary line and the second boundary line after the transformation, and of one or both of the first and second outer shapes, are stored in the storage unit 30 as a set for each connected stroke.

[0018] The matching processor 18 reads the coordinate values ​​of the vertices of the first and second boundary lines from the storage unit 30 and determines pairs of corresponding vertices between the first and second boundary lines based on the read coordinate values. If the number of vertices defining the first and second boundary lines differs, or if the positions of the vertices that should correspond, excluding the start and end points, are significantly separated, and corresponding vertices cannot be determined, the matching processor 18 determines whether or not the vertices are isolated vertices. In the case of the start and end points, the matching processor 18 automatically determines the pair of corresponding vertices, even if the positions of the vertices are significantly separated. If the converter 14 converts the coordinate values ​​of one or both of the vertices defining the first and second outlines of the connected stroke, the converted coordinate values ​​are read from the storage unit 30 and used as the coordinate values ​​of the vertices of the first and second boundary lines. The matching processor 18 stores the pairs of coordinate values ​​of the corresponding vertices between the first and second boundary lines determined by the matching processor 18, as well as the coordinate values ​​of the isolated vertices for which corresponding vertices cannot be determined, in the storage unit 30. In this case, information on the combination of the vertex codes of the vertices that form a pair of corresponding vertices and information on the vertex code of the vertex that becomes an isolated vertex may be recorded. The details of the processing of the matching processor 18 will be described later.

[0019] The evaluation data generation unit 20 reads the pairs of coordinate values ​​of the corresponding vertices, and if there is an isolated vertex for which a corresponding vertex cannot be determined, the coordinate values ​​of the vertices from the storage unit 30, and generates evaluation data regarding the difference between the first boundary line and the second boundary line based on the pairs of corresponding vertices and the presence or absence of an isolated vertex. Examples of the evaluation data include the distance between the vertices in the pairs of vertices. Furthermore, if an isolated vertex exists, the presence or absence of the isolated vertex itself, or the distance between the isolated vertex and the other boundary line, i.e., the boundary line on which the isolated vertex does not exist, may be used as evaluation data. The evaluation data generated by the evaluation data generation unit 20 is stored in the storage unit 30.

[0020] The evaluation unit 22 reads the evaluation data generated by the evaluation data generation unit 20 from the storage unit 30 and evaluates the differences in the boundary lines between the parcels to be compared and the adjacent parcels on the first and second maps based on the evaluation data. The evaluation unit 22 creates a table of evaluation scores based on the evaluation data in advance and performs the evaluation by converting the differences in the boundary lines between the parcels to be compared and the adjacent parcels based on this table. The evaluation results are tallied for each boundary line or parcel containing the boundary line and stored in the storage unit 30. If necessary, the evaluation unit 22 may also store in the storage unit 30 evaluation results in which the evaluation scores for each boundary line or parcel are tallied by block, official map, or town / district. The evaluation unit 22 may also rank the boundary lines or parcels, or the aggregation units such as blocks, in descending order of the evaluation scores for each boundary line or parcel or the tallied evaluation scores. This ranking indicates the degree of need for correction. In this way, the evaluation unit 22 evaluates the differences in the boundary lines between the parcels to be compared and the adjacent parcels on the first and second maps based on the tallied evaluation results and the ranked evaluation results. The evaluation results stored in the storage unit 30 are displayed on an appropriate display device by the display control unit 28, which will be described later.

[0021] The evaluation range designation unit 24 designates an evaluation range containing multiple parcels to be compared between the first and second maps by parcel number or a reference number, which is a common number assigned to the same parcels on both maps. In this case, the evaluation range containing multiple parcels to be compared can be all parcels in each city, town, or village, or the area of ​​a specific town or district map of a specific Legal Affairs Bureau. The evaluation range designation unit 24 designates the evaluation range by storing evaluation range information (parcel number, reference number, etc.) contained in instruction information input from the input unit 32 in the memory unit 30. The instruction information is input by the user via the input unit 32. In this case, multiple parcels may be designated using a pointing device or the like constituting the input unit 32 on the screen of the first or second map displayed on an LCD or other display by the display control unit 28. In this case, the parcel designation unit 10 sequentially designates parcels within the evaluation range.

[0022] The communication unit 26 is configured with an appropriate interface, and performs processing such as acquiring data such as information on the first map and the second map from an external server or the like, and storing the data in the storage unit 30.

[0023] The display control unit 28 controls a liquid crystal display device or other appropriate display device based on instructions from the parcel designation unit 10, the evaluation unit 22, etc., to display the first map, the second map, the evaluation results by the evaluation unit 22, etc. In particular, the display control unit 28 has a function to control the map display of the first map, the second map, etc., and can cause the liquid crystal display device, etc., to compare and display the first boundary line and the second boundary line of the relevant parcel to visually confirm the difference, or, for example, can display a current parcel number map, which is the second map, and then highlight the problematic parcel or boundary line, making it easy to confirm the priority areas for correction work.

[0024] The storage unit 30 is composed of nonvolatile memory such as a hard disk drive or solid-state drive (SSD), and stores the above data and information necessary for the various processes performed by the map evaluation device 100, such as programs for operating the CPU 34. The storage unit 30 may also be a digital versatile disc (DVD), compact disc (CD), magneto-optical disc (MO), flexible disk (FD), magnetic tape, electrically erasable and rewritable read-only memory (EEPROM), flash memory, or the like. The storage unit 30 preferably includes random access memory (RAM), which primarily functions as a working area for the CPU 34, and read-only memory (ROM), which stores control programs such as the BIOS and other data used by the CPU 34. The storage unit 30 may also include an external storage device.

[0025] The input unit 32 is composed of appropriate input means such as a keyboard, a pointing device such as a mouse, a touch panel, etc., and is used by the user to input instruction information, etc.

[0026] 2(a), (b), (c), and (d) are explanatory diagrams illustrating an example of the operation of the map evaluation device 100 according to the embodiment. FIG. 2(a) illustrates a plot A to be compared, designated by the plot designation unit 10 on the first map, and adjacent plots B, C, and D designated by the adjacent plot designation unit 12. FIG. 2(b) illustrates a plot A' to be compared, designated by the plot designation unit 10, and adjacent plots B', C', and D' designated by the adjacent plot designation unit 12 on the second map. This information is stored in the storage unit 30. The first and second maps are maps containing the same plots (e.g., a legal affairs bureau map and a land lot status map), plots A and A' are the same plots to be compared, and plots B, C, and D and plots B', C', and D' are the same adjacent plots adjacent to the plots to be compared. In this embodiment, a case where plots B and B' are designated as adjacent plots will be described. In the example of Figure 2(a), vertices a1, a2, a3, and a4 that define the outline of brush A and vertices b1, b2, b3, and b4 that define the outline of adjacent brush B are shown as black circles. Note that vertices a1 and a2 overlap with vertices b1 and b2, and vertices b1 and b2 are shown in parentheses. Similarly, in the example of Figure 2(b), vertices a1', a2', a3', and a4' that define the outline of brush A' and vertices b1', b2', b3', and b4' that define the outline of adjacent brush B' are shown as black circles. Note that vertices a1' and a2' overlap with vertices b1' and b2', and vertices b1' and b2' are shown in parentheses.

[0027] The boundary extraction unit 16 reads information about the brushes A and A' to be compared and information about the brushes B and B' as adjacent brushes from the storage unit 30, and extracts the boundary between brushes A and B (first boundary) shown in FIG. 2(c) and the boundary between brushes A' and B' (second boundary) shown in FIG. 2(d) by defining the coordinate values ​​of vertices a1 and a2 of the first boundary and vertices a1' and a2' of the second boundary. Note that in the examples of FIGS. 2(c) and 2(d), each vertex is indicated by a black circle. The boundary extraction unit 16 stores the coordinate values ​​of the extracted vertices a1 and a2 of the first boundary and vertices a1' and a2' of the second boundary in the storage unit 30.

[0028] If the coordinate systems of the first and second maps are different, the conversion unit 14 reads from the storage unit 30 the coordinate values ​​of the vertices of the first outline a4, a3, b3, b4 and the second outline a4', a3', b3', b4' of the connected strokes extracted by the outline coordinate value extraction unit 13, and converts the coordinate values ​​of one or both of the vertices a1, a2, a3, a4, b1, b2, b3, b4 that define the first outline and the vertices a1', a2', a3', a4', b1', b2', b3', b4' that define the second outline to make them into the same coordinate system. As a result, the first boundary line a1a2 and the second boundary line a1'a2' extracted by the boundary line extraction unit 16 become boundary lines defined based on the converted coordinate values.

[0029] 3(a) and 3(b) are explanatory diagrams illustrating an example of the operation of the matching processor 18 and the evaluation data generator 20. In FIG. 3(a), the evaluation data is generated for the first boundary line a1a2 and the second boundary line a1'a2' shown in FIGS. 2(c) and 2(d). The matching processor 18 reads the coordinate values ​​of the vertices a1, a2 and a1', a2' of the first boundary line a1a2 and the second boundary line a1'a2' from the storage unit 30, and determines pairs of corresponding vertices between the first boundary line and the second boundary line. Also, FIG. 3(b) shows an example in which the first boundary line a1a2, which is the boundary line between the brush A to be compared and the adjacent brush B, intersects with the second boundary line a1'a2', which is the boundary line between the brush A' to be compared and the adjacent brush B'. In this case, as in the case of Figure 3(a), the matching processing unit 18 reads the coordinate values ​​of the vertices a1, a2 and a1', a2' of the first boundary line a1a2 and the second boundary line a1'a2' from the memory unit 30, and determines the pair of corresponding vertices between the first boundary line and the second boundary line.

[0030] In the example of Figures 3(a) and 3(b), vertices a1 and a1', and vertices a2 and a2', are both endpoints of the respective boundary lines, and are therefore determined as a pair of vertices by the matching processor 18. Also, in the example of Figures 3(a) and 3(b), there are no vertices other than endpoints, and no isolated vertices exist. The matching processor 18 stores one of these pairs of vertices, for example, vertices a1 and a1', as a pair of starting points of the boundary line, and vertices a2 and a2' as a pair of ending points of the boundary line, together with their coordinate values, in the memory unit 30.

[0031] The evaluation data generation unit 20 reads the coordinate values ​​of the vertices a1 and a2 of the first boundary line and the coordinate values ​​of the vertices a1' and a2' of the second boundary line from the storage unit 30, calculates the distances between the start points a1 and a1' and between the end points a2 and a2' of the first boundary line and the second boundary line from the coordinates of the vertices, and sets these as evaluation data of the difference between the first boundary line and the second boundary line. Also, even when the first boundary line a1a2 and the second boundary line a1'a2' intersect, as in the example of Figure 3(b), the distances between the start points a1 and a1' and between the end points a2 and a2' can be set as evaluation data of the difference between the first boundary line and the second boundary line, as in the case of Figure 3(a).

[0032] The relationship between the first boundary line a1a2 and the second boundary line a1'a2' is not limited to that shown in FIGS.

[0033] 4(a) and 4(b) are explanatory diagrams illustrating other examples of the operation of the matching processor 18 and the evaluation data generator 20. In the example of FIG. 4(a), the first boundary line is defined by a starting point a1, an ending point a2, and two intermediate points a3 and a4 as vertices other than these end points. The second boundary line is defined by a starting point a1', an ending point a2', and two intermediate points a3' and a4' as vertices other than these end points. In the example of FIG. 4(b), the first boundary line is defined by a starting point a1, an ending point a2, and two intermediate points a3 and a4 as vertices other than these end points. The second boundary line is defined by a starting point a1', an ending point a2', and one intermediate point a3' as a vertex other than these end points. In both examples of FIGS. 4(a) and 4(b), the first boundary line is the boundary line between the brush A to be compared and the adjacent brush B, and the second boundary line is the boundary line between the brush A' to be compared and the adjacent brush B'. The vertex pairs are determined by the following three-stage determination. Step (I): First, if the vertices defining the first boundary line and the second boundary line are endpoints (starting or ending points), then regardless of the distance between the vertices of the first boundary line and the second boundary line, the vertices that are starting points and the vertices that are ending points are extracted as pairs of vertices, respectively. Step (II): Next, if the first boundary line or the second boundary line has a vertex that defines a midpoint, the coordinate values ​​of the vertex of the midpoint of one boundary line are used to search for the vertex of the midpoint of the other boundary line that exists within a first threshold value, starting from the starting point, and vertices of midpoints whose distance from each other is equal to or less than the first threshold value are extracted as pairs of vertices. In this case, if there are multiple vertices of the midpoint of the other boundary line within the first threshold value, only the vertex of the midpoint with the shortest distance between the vertices is selected. Furthermore, if a vertex of the other boundary line that is within the first threshold value has already been extracted as a pair of vertices with a vertex of another midpoint of the same boundary line, the vertex with the shortest distance between the vertices is given priority and extracted as a pair of vertices. Step (III): For the vertices at the midpoints of all boundary lines, a search is made to see whether there are any vertices at the midpoints of other boundary lines that exist within the first threshold, and the vertices at the midpoints of both boundary lines that are not extracted as a pair of vertices are extracted as isolated vertices.

[0034] Specifically, in FIG. 4(a), the matching processor 18 determines pairs of corresponding vertices between the first and second boundary lines based on the coordinate values ​​of vertices a1, a2, a3, and a4 defining the first boundary line and vertices a1', a2', a3', and a4' defining the second boundary line. First, in accordance with step (I) above, vertex a1 defining the first boundary line, which is the starting point of the boundary line, and vertex a1' defining the second boundary line, and vertex a2 and vertex a2' defining the end point, are extracted as pairs of vertices. Next, the distances between vertices a3 and a3' and vertices a4 and a4' are calculated based on the coordinate values ​​of vertices a3 and a4 defining the first boundary line, which are the midpoints of the boundary lines, and vertices a3' and a4' defining the second boundary line, and it is determined whether the distances between the vertices are equal to or less than a predetermined first threshold. Two points whose mutual distance is equal to or less than the first threshold are the pairs of vertices extracted in step (II) above. In this way, the extracted pair of vertices is extracted as a pair of corresponding vertices.

[0035] 4(b), similarly to the case of FIG. 4(a), a pair of corresponding vertices between the first and second boundary lines is determined based on the coordinate values ​​of vertices a1, a2, a3, and a4 defining the first boundary line and vertices a1', a2', and a3' defining the second boundary line. First, according to step (I), vertex a1 defining the first boundary line, which is the boundary line's starting point, and vertex a1' defining the second boundary line, which is the boundary line's end point, are extracted as a pair of vertices. Next, based on the coordinate values ​​of vertex a3 defining the first boundary line as the vertex at the midpoint next to the boundary line's starting point, and vertex a3' defining the second boundary line, it is determined whether the mutual distance is equal to or less than the first threshold. If it is equal to or less than the threshold, they are extracted as a pair of vertices in step (II). Furthermore, for vertex a4, which is the vertex at the midpoint defining the next first boundary line, there is no corresponding vertex at the midpoint defining the second boundary line, so it is extracted as an isolated vertex for which a corresponding vertex cannot be determined. As described above, pairs of vertices and isolated vertices are extracted, and the pairs of vertices are treated as corresponding pairs of vertices.

[0036] In the examples of Figures 4(a) and (b), the evaluation data generation unit 20 also reads the coordinate values ​​of the vertices of each boundary line from the memory unit 30, calculates the distance between each pair of vertices corresponding to the coordinates of the vertices, and, together with information on whether or not there is an isolated vertex, uses this as evaluation data on the difference between the first boundary line and the second boundary line.

[0037] The relationship between the first boundary line and the second boundary line from which the matching processing unit 18 extracts corresponding vertex pairs and isolated vertices as part of the matching process is not limited to the example shown in FIGS. 4(a) and 4(b).

[0038] In FIGS. 4(a) and 4(b), the evaluation data generation unit 20 reads the coordinate values of the vertices of each boundary line from the storage unit 30, calculates the distances between each pair of vertices extracted as corresponding vertex pairs from the vertex coordinates, and uses them as evaluation data for the difference between the first boundary line and the second boundary line. Further, when the matching processing unit 18 is executing the determination process for isolated vertices, the evaluation data generation unit 20 generates evaluation data based on the presence or absence of isolated vertices. Specifically, information regarding the presence or absence of isolated vertices is added to the evaluation data regarding the distances between vertices. Alternatively, when isolated vertices exist, instead of the information regarding the presence or absence of isolated vertices, the shortest distances between each of the isolated vertices and the counterpart boundary line (the second boundary line in the example of FIG. 4(b)) may be used as evaluation data.

[0039] FIG. 5 shows an example of a table of evaluation scores used by the evaluation unit 22. In the example of FIG. 5, evaluation scores are set for the distance g between corresponding vertices, the presence or absence of isolated vertices on the first boundary line, and the presence or absence of isolated vertices on the second boundary line as evaluation items. Regarding the distance g between corresponding vertices, a score of 0.05 is set when 0 < g ≤ 1 m, a score of 0.25 is set when 1 < g ≤ 2.5 m, and a score of 0.25 is set when there are isolated vertices on the first boundary line and the second boundary line. When the distance g between corresponding vertices exceeds 2.5 m, it may be considered that they are not extracted as a pair of vertices exceeding the above threshold value (2.5 m) and are extracted as isolated vertices.

[0040] The evaluation unit 22 uses the table in FIG. 5 to calculate scores for each distance between corresponding vertices, calculates scores according to the number of isolated vertices when there are isolated vertices, obtains the total score, and evaluates the difference between the first boundary line and the second boundary line. That is, the larger the total score, the greater the difference between the first boundary line and the second boundary line, so it is possible to easily extract the portions that need to be corrected preferentially from the total score.

[0041] The significance of evaluating the isolated vertices extracted by the matching processing unit 18 can be considered as follows. (1) In most cases, land boundaries are determined by driving stakes into the ground at the boundary location. The straight lines connecting the stakes define the land boundary. Here, the stake refers to the apex of the boundary line on the Legal Affairs Bureau official map or the current land lot map. When verifying the consistency of the boundary line between plots of land, it is important to consider the stake as the apex and verify the apex position of the boundary line between plots of land. (2) Furthermore, if there are missing vertices, it means that the shape of the boundary line is not correctly represented, so isolated vertices become a problem, and a boundary line that is missing the position of the stakes, i.e., the position of the vertices, will have a significantly reduced credibility as a boundary line. (3) For the above reasons, isolated vertices are an important evaluation item.

[0042] Here, an example will be described in which the evaluation unit 22 evaluates the examples shown in Figures 3(a), (b) and 4(a), (b) using the table of evaluation points shown in Figure 5. In the examples of Figures 3(a) and (b), since there are no isolated vertices, the distances between the starting points a1 and a1' and between the end points a2 and a2' are used as evaluation data.

[0043] In Figures 3(a) and (b), the evaluation data generation unit 20 calculates the distance between the starting points a1 and a1' on the first boundary line and the second boundary line to be 1.5 m in the example of Figure 3(a) and 2.0 m in the example of Figure 3(b), and calculates the distance between the end points a2 and a2' to be 0.5 m in the example of Figure 3(a) and 2.0 m in the example of Figure 3(b).

[0044] In this case, when the evaluation unit 22 evaluates the difference between the first boundary line and the second boundary line in Figure 3(a) using the evaluation score table shown in Figure 5, it selects 0.25 as a score based on the distance (1.5 m) between the start points a1 and a1', and 0.05 as a score based on the distance (0.5 m) between the end points a2 and a2'. As a result, in the example of Figure 3(a), the score for evaluating the difference between the first boundary line and the second boundary line is 0.25 + 0.05 = 0.3.

[0045] Similarly, when the evaluation unit 22 evaluates the difference between the first boundary line and the second boundary line in Figure 3(b), it selects 0.25 as a score based on the distance (2.0 m) between the start points a1 and a1', and selects 0.25 as a score based on the distance (2.0 m) between the end points a2 and a2'. As a result, in the example of Figure 3(b), the score for evaluating the difference between the first boundary line and the second boundary line is 0.25 + 0.25 = 0.5.

[0046] From the above results, it can be seen that the difference between the first boundary line and the second boundary line is greater in the order of the example in FIG. 3(b) > the example in FIG. 3(a), and therefore the necessity for correction is greater in the above order.

[0047] 4(a), the evaluation data generation unit 20 calculates the distance between the starting points a1 and a1' on the first and second boundary lines as 0.5 m, the distance between the end points a2 and a2' as 2.0 m, the distance between the midpoint vertices a3 and a3' as 0.5 m, and the distance between the midpoint vertices a4 and a4' as 1.0 m. Similarly, in FIG. 4(b), the evaluation data generation unit 20 calculates the distance between the starting points a1 and a1' on the first and second boundary lines as 0.5 m, the distance between the end points a2 and a2' as 2.0 m, and the distance between the midpoint vertices a3 and a3' as 0.5 m, and the midpoint vertex a4 is determined to be an isolated vertex by the matching unit 18. Note that the existence of the isolated vertex extracted by the matching unit 18 (vertex a4 in the example of FIG. 4(b)) itself becomes evaluation data.

[0048] In this case, when the evaluation unit 22 evaluates the difference between the first boundary line and the second boundary line in FIG. 4(a) using the evaluation score table shown in FIG. 5, it selects 0.05 as a score based on the distance (0.5 m) between the start points a1 and a1', and 0.25 as a score based on the distance (2.0 m) between the end points a2 and a2'. It also selects 0.05 as a score based on the distance (0.5 m) between the midpoint vertices a3 and a3', and 0.05 as a score based on the distance (1.0 m) between the midpoint vertices a4 and a4'. As a result, in the example of FIG. 4(a), the score for evaluating the difference between the first boundary line and the second boundary line is 0.05 + 0.25 + 0.05 + 0.05 = 0.4.

[0049] Similarly, when the evaluation unit 22 evaluates the difference between the first boundary line and the second boundary line in Figure 4(b), it selects 0.05 as a score based on the distance (0.5 m) between the starting points a1 and a1', and 0.25 as a score based on the distance (2.0 m) between the end points a2 and a2'. It also selects 0.05 as a score based on the distance (0.5 m) between the vertices a3 and a3' at the midpoint of the first boundary line, and further selects 0.25 as a score for the vertex a4 at the midpoint, since it is an isolated vertex. As a result, in the example of Figure 4(b), the score for evaluating the difference between the first boundary line and the second boundary line is 0.05 + 0.05 + 0.25 + 0.25 = 0.6.

[0050] From the above results, it can be seen that the difference between the first boundary line and the second boundary line is greater in the order of the example in FIG. 4(b) > the example in FIG. 4(a), and therefore the necessity for correction is greater in the above order.

[0051] The evaluation score table used by the evaluation unit 22 is not limited to the example in Fig. 5, and the types of evaluation items and their respective scores (weighting) can be changed as appropriate depending on the conditions of the first and second maps to be evaluated, the purpose of the evaluation, etc. Furthermore, for isolated vertices, scores may be set not based on the presence or absence of an isolated vertex, but on the shortest distance between the isolated vertex and the boundary line on the other side. This makes it possible to appropriately evaluate the boundary line to be evaluated depending on the conditions of the first and second maps to be evaluated, the purpose of the evaluation, etc.

[0052] <Modifications of the evaluation data generating unit 20 and the evaluation unit 22> As a modified example of the configuration of the evaluation data generation unit 20, the coordinate values ​​of the vertices of the first boundary line and the second boundary line may be read from the storage unit 30, and the area of ​​the region formed by the first boundary line and the second boundary line based on the vertex coordinate values ​​may be used as the evaluation data. Specifically, for the vertices defining the first boundary line and the second boundary line, connecting lines are generated with the vertices that define the first boundary line and the vertices that define the second boundary line as their end points, and the area within the range surrounded by the connecting lines between the vertices that define the starting point and the vertices that define the end point, and the first boundary line and the second boundary line is used as the evaluation data. The evaluation data generated by the evaluation data generation unit 20 is stored in the storage unit 30. In this case, the matching process by the matching processing unit 18 is not performed.

[0053] The above-described modified example will be described with reference to Figures 3(a), 3(b) and 4(a), 4(b). In Figure 3(a), the evaluation data generation unit 20 generates connecting lines with vertices a1 and a1' as the starting points of the first boundary line and vertices a2 and a2' as the ending points, and calculates the area within the range surrounded by the connecting lines between the starting vertices a1 and a1' and between the ending vertices a2 and a2', the first boundary line a1a2 and the second boundary line a1'a2', and sets the area as evaluation data.

[0054] 3(b), when the first boundary line a1a2 and the second boundary line a1'a2' intersect, the area within the range enclosed by the joining lines a1a1' and a2a2' and the first boundary line a1a2 and the second boundary line a1'a2' is used as the evaluation data. In this case, the area within the range enclosed by the joining lines and the first and second boundary lines is the sum of the areas of the two triangles formed above and below the intersection c of the first boundary line a1a2 and the second boundary line a1'a2' in FIG. 3(b).

[0055] Furthermore, in the same manner as in the cases of Figures 3(a) and (b), in the case of Figure 4(a), the area within the range enclosed by the joining lines connecting the starting vertices a1 and a1' and the ending vertices a2 and a2', and the first boundary line a1a3a4a2 and the second boundary line a1'a3'a4'a2' is calculated, and in the case of Figure 4(b), the area within the range enclosed by the joining lines connecting the starting vertices a1 and a1' and the ending vertices a2 and a2', and the first boundary line a1a3a4a2 and the second boundary line a1'a3'a2' is calculated, and these are used as evaluation data.

[0056] As explained in Figures 3(a) and 3(b) and Figures 4(a) and 4(b), when the evaluation data generation unit 20 calculates the area within the range surrounded by the first boundary line, the second boundary line, and the connecting line as evaluation data, the evaluation unit 22 can evaluate the difference between the first boundary line and the second boundary line directly from the area. That is, the evaluation unit 22 evaluates that the difference between the first boundary line and the second boundary line is greater as the area increases. In this case, the table in Figure 5 is not used.

[0057] FIG. 6 is an explanatory diagram of an example of the operation of the evaluation range designation unit 24. FIG. 6 shows an example in which, based on instruction information input from the input unit 32, the evaluation range designation unit 24 designates an evaluation range including multiple plots, such as a range including plots A, B, C, D, E, and F on the first map, and a range including plots A', B', C', D', E', and F' on the second map. On the first map and the second map, the designated evaluation ranges are indicated by areas I and I' surrounded by dashed lines. As described above, the evaluation range designation unit 24 designates the plots of the evaluation range based on the lot number, reference number, etc. included in the instruction information.

[0058] When the evaluation range designation unit 24 designates an evaluation range, the brush designation unit 10 sequentially designates brushes within the evaluation range for each evaluation range as brushes to be compared, and the adjacent brush designation unit 12 searches for and extracts one or more brushes that share part or all of the boundary line that constitutes the brush shape using a geographic information system or the like, and designates the brushes from the extracted brushes, excluding brushes that are adjacent by an evaluated boundary line, in order as adjacent brushes.

[0059] Fig. 7 is a flow diagram showing an example of the operation of the map evaluation device 100 according to the embodiment. In Fig. 7, map information stored in advance in a server provided in a legal affairs bureau, a city, town, or village, or in a USB or other appropriate storage medium is acquired via the communication unit 26, and stored in the storage unit 30 (S101).

[0060] The stroke designation unit 10 designates a stroke to be compared based on instruction information input by the user via the input unit 32 in a first map, such as a public map of the Legal Affairs Bureau, and a second map, such as a current land lot map, included in the map information, and stores the designation information in the memory unit 30 (S102).

[0061] The adjacent stroke designation unit 12 reads information on the strokes to be compared designated by the stroke designation unit 10 and information on the first map and the second map from the storage unit 30, and designates at least one stroke adjacent to each of the strokes to be compared designated by the stroke designation unit 10 as an adjacent stroke in each of the first map and the second map (S103). The adjacent stroke designation unit 12 stores the information on the designated adjacent strokes in the storage unit 30.

[0062] The boundary extraction unit 16 reads information about the stroke to be compared specified by the stroke specification unit 10 and information about the adjacent stroke specified by the adjacent stroke specification unit 12 from the storage unit 30, and defines and extracts the first boundary line in the first map and the second boundary line in the second map, which are the boundaries between the stroke to be compared and the adjacent stroke, as coordinate values ​​of the vertices of the first boundary line and the second boundary line. The coordinate values ​​of the vertices of the extracted first boundary line and second boundary line are each stored in the storage unit 30 (S104).

[0063] Next, if the user inputs instruction information from the input unit 32 indicating that the coordinate systems of the first map and the second map are different (N in S105), the outline coordinate value extraction unit 13 reads information on the stroke to be compared designated by the stroke designation unit 10 and the adjacent stroke designated by the adjacent stroke designation unit 12 from the storage unit 30, and extracts a first outline from the first map and a second outline from the second map as the outline of a combined stroke combining the stroke to be compared and the adjacent stroke, as the coordinate values ​​of the vertices that define each outline (S106). The outline coordinate value extraction unit 13 stores the information on the first outline and the second outline in the storage unit 30.

[0064] The conversion unit 14 reads from the storage unit 30 the coordinate values ​​of the vertices defining the first boundary line and the second boundary line extracted by the boundary line extraction unit 16, and the coordinate values ​​of the vertices defining the first outer shape and the second outer shape of the connected stroke extracted by the outer shape coordinate value extraction unit 13, and converts the coordinate values ​​of one or both of the vertices defining the first boundary line and the first outer shape and the vertices defining the second boundary line and the second outer shape to a single coordinate system. Specifically, the conversion unit 14 executes the following coordinate value conversion process. This conversion process first unifies the vertices defining the first outer shape and the vertices defining the second outer shape into one or another coordinate system. Next, the conversion unit 14 converts the coordinate values ​​of the vertices defining one or both of the first outer shape and the second outer shape of the connected stroke by moving, rotating, enlarging, or reducing them so that the distance between the vertices defining the first outer shape and the vertices defining the second outer shape is minimized, and the conversion process maintains similarity between the first outer shape and the second outer shape or both before and after the conversion. In this case, the coordinate values ​​of the vertices defining the first boundary line and the vertices defining the second boundary line are also converted using the same movement amount and ratio as the coordinate values ​​of the vertices defining one or both of the first and second outer shapes. The coordinate values ​​of each vertex after the conversion process are stored in the storage unit 30 (S107).

[0065] In addition, in S105, if the user has input instruction information from the input unit 32 that the coordinate systems of the first map and the second map are the same (Y), the process proceeds to S108 without performing the extraction process of the vertices that define the first outline and the second outline by the outline coordinate value extraction unit 13 and the conversion process by the conversion unit 14.

[0066] The matching processing unit 18 reads out the coordinate values ​​of the vertices that define the first boundary line and the second boundary line from the storage unit 30, and determines a pair of corresponding vertices between the first boundary line and the second boundary line based on the read coordinate values. If corresponding vertices cannot be determined between the first boundary line and the second boundary line, the matching processing unit 18 determines those vertices as isolated vertices. Information about the determined pair of vertices is stored in the storage unit 30 together with the coordinate values ​​of each vertex, as information that identifies the corresponding vertex on the other boundary line for each vertex of each boundary line, or as information on the presence or absence of an isolated vertex (S108).

[0067] The evaluation data generation unit 20 reads the coordinate values ​​of the vertices of the first boundary line and the second boundary line from the memory unit 30, generates evaluation data based on the pairs of corresponding vertices and the presence or absence of isolated vertices, and stores the evaluation data in the memory unit 30 (S109).

[0068] The evaluation unit 22 reads out the evaluation data generated by the evaluation data generation unit 20 in S109 from the storage unit 30, and evaluates the difference in the boundary line between the parcel to be compared and the adjacent parcel on the first map and the second map from the evaluation data (S110). The evaluation unit 22 stores the evaluation result in the storage unit 30.

[0069] After evaluation of the boundary lines between all target brushes and their adjacent brushes is completed, the display control unit 28 reads out the evaluation results of each boundary line evaluated in S110 from the memory unit 30 and controls an LCD display device or other appropriate display device to display the evaluation results (S111).

[0070] Fig. 8 shows a flow diagram of another operation example of the map evaluation device 100 according to the embodiment. In Fig. 8, steps S201 to S207 are the same as steps S101 to S107 in Fig. 7, and therefore a description thereof will be omitted.

[0071] The evaluation data generation unit 20 reads out the coordinate values ​​of the vertices that define the first boundary line and the vertices that define the second boundary line from the memory unit 30, and generates connecting lines with the vertices that are the starting points and the vertices that are the ending points for each of the read coordinate values ​​as endpoints (S208).

[0072] Next, the evaluation data generation unit 20 calculates the area within the range surrounded by the connecting line generated in S208, the first boundary line, and the second boundary line, and sets the calculated area as evaluation data (S209). The evaluation data generation unit 20 stores the calculated area in the storage unit 30.

[0073] The evaluation unit 22 reads out the area calculated in S209 from the storage unit 30, and evaluates that the larger the area, the greater the difference between the first boundary line and the second boundary line (S210). The evaluation unit 22 stores the evaluation result in the storage unit 30.

[0074] After evaluation of the boundary lines between all target brushes and their adjacent brushes is completed, the display control unit 28 reads out the evaluation results of each boundary line evaluated in S210 from the memory unit 30 and controls an LCD display device or other appropriate display device to display the evaluation results (S211).

[0075] In the above-described S111 of FIG. 7 and S211 of FIG. 8, when the evaluation results are displayed, for example, if there is a large difference between the first boundary line and the second boundary line on the first map and the second map, the second boundary line on the second map, such as a current parcel number map, is displayed in a different color according to the evaluation results. By displaying the problem areas in a different color, workers can visually identify the problem areas on the second map, allowing for efficient correction work on the second map. Furthermore, evaluation results aggregated by block, official map, town, and district, etc., may be displayed in a different color for the corresponding area on the map for each aggregation unit. As a result, it becomes possible to identify regional problem areas, which can be used as an indicator for determining the priority of correction work.

[0076] 7 and 8 may be stored in a recording medium, or may be provided via a communication means. In such a case, the program described above may be considered as an invention of a "computer-readable recording medium on which a program is recorded" or an invention of a "data signal."

[0077] As described above, the present invention makes it possible to verify the consistency between official maps of the Legal Affairs Bureau and current parcel number maps based on objective indicators. In particular, because the division and merging of parcels frequently results in the addition, deletion, or modification of boundary lines between adjacent parcels, the present invention enables verification and visual confirmation of consistency by focusing on the position and shape of parcel boundaries, which are prone to errors. Furthermore, since matching processing can be performed only on boundary lines rather than on all vertices that define the outline of the parcel, it is possible to reduce processing load and perform verification processing that focuses on the boundary lines of parcels that are prone to errors. This makes it possible to process the discrepancies (differences) between official maps of the Legal Affairs Bureau and current parcel number maps in accordance with the actual situation.

[0078] Furthermore, when checking land boundaries, the integrity of the boundary line is evaluated from the perspective that stakes are the vertices that define the boundary line. In this case, evaluating whether there are any excess or deficiencies in the stakes (presence or absence of isolated vertices) contributes to improving the reliability of the verification results.

[0079] In this way, by referring to the evaluation results of the present invention, it becomes possible to efficiently verify and correct the current land lot map, thereby realizing appropriate fixed asset tax. [Explanation of symbols]

[0080] 10 stroke designation unit, 12 adjacent stroke designation unit, 13 outer coordinate value extraction unit, 14 conversion unit, 16 boundary line extraction unit, 18 matching processing unit, 20 evaluation data generation unit, 22 evaluation unit, 24 evaluation range designation unit, 26 communication unit, 28 display control unit, 30 memory unit, 32 input unit, 34 CPU, map evaluation device 100.

Claims

1. A map evaluation device that evaluates differences in boundary lines between a plurality of adjacent plots in a first map and a second map representing plot shapes, a stroke designation unit for designating a stroke to be compared on the first map and the second map; an adjacent stroke designation unit that designates, in the first map and the second map, at least one stroke adjacent to a stroke to be compared that has been designated by the stroke designation unit, as an adjacent stroke; a boundary line extraction unit that defines and extracts a first boundary line in the first map and a second boundary line in the second map, which are boundary lines between the stroke to be compared designated by the stroke designation unit and the adjacent stroke designated by the adjacent stroke designation unit, as coordinate values ​​of vertices of the first boundary line and the second boundary line; an evaluation data generation unit that generates evaluation data based on coordinate values ​​of vertices of the first boundary line and the second boundary line; an evaluation unit that evaluates the difference in boundary lines between the comparison target plots and the adjacent plots on the first map and the second map based on the evaluation data; A map evaluation device comprising:

2. further comprising a matching processing unit that determines a pair of corresponding vertices between the first boundary line and the second boundary line, and determines whether or not there is an isolated vertex for which a corresponding vertex cannot be determined, 2. The map evaluation device according to claim 1, wherein the evaluation data generation unit calculates the evaluation data based on a distance between vertices calculated from coordinates of the vertices in the pair of corresponding vertices determined by the matching processing unit and on the presence or absence of the isolated vertex.

3. 2. The map evaluation device according to claim 1, wherein the evaluation data generation unit generates connecting lines whose endpoints are the vertices that are the starting points of the first boundary line and the second boundary line, and further generates connecting lines whose endpoints are the vertices that are the ending points of the first boundary line and the second boundary line, and calculates, as evaluation data, an area within a range enclosed by the connecting lines between the vertices that are the starting points and the vertices that are the ending points, and the first boundary line and the second boundary line.

4. further comprising an evaluation range designation unit that designates an evaluation range including a plurality of brushes; the brush designation unit sequentially designates brushes within the evaluation range designated by the evaluation range designation unit; 4. The map evaluation device according to claim 1, wherein the adjacent stroke designation unit designates strokes excluding strokes that are adjacent to each other by an evaluated boundary line as adjacent strokes.

5. When the coordinate systems of the first map and the second map are different, an outline coordinate value extraction unit that extracts a first outline from the first map and a second outline from the second map as the outline of a combined stroke formed by combining the stroke to be compared designated by the stroke designation unit and the adjacent stroke designated by the adjacent stroke designation unit, as coordinate values ​​of vertices that define each outline; a conversion unit that converts coordinate values ​​of vertices of one or both of the first and second outer shapes so that a distance between a vertex that defines the first outer shape and a vertex that defines the second outer shape is minimized, converts the coordinate values ​​of the first and / or second outer shapes whose coordinate values ​​have been converted before and after the conversion so that they maintain similar shapes, and converts the coordinate values ​​of the vertices that define the first boundary line and the vertices that define the second boundary line by the same amount and rate as the coordinate values ​​of the vertices of one or both of the first and second outer shapes, The map evaluation device according to claim 1 , wherein the boundary line extraction unit extracts the first boundary line and the second boundary line based on the converted coordinate values.

6. A map evaluation method for evaluating differences in boundary lines between a plurality of adjacent plots in a first map and a second map representing plot shapes, comprising: a step of designating a parcel to be compared in the first map and the second map; designating at least one pen adjacent to the pen to be compared in the first map and the second map as an adjacent pen; a step of defining and extracting a first boundary line in the first map and a second boundary line in the second map, which are boundary lines between the stroke to be compared and the adjacent stroke, as coordinate values ​​of vertices of the first boundary line and the second boundary line; generating evaluation data based on coordinate values ​​of vertices of the first boundary line and the second boundary line; a step of evaluating the difference in the boundary lines between the comparison target plot and the adjacent plot in the first map and the second map from the evaluation data; A map evaluation method comprising:

7. Computer, a stroke designation unit for designating a stroke to be compared in the first map and the second map representing the stroke shape; an adjacent stroke designation unit that designates, in the first map and the second map, at least one stroke adjacent to the stroke to be compared designated by the stroke designation unit as an adjacent stroke; a boundary line extraction unit that defines and extracts a first boundary line in the first map and a second boundary line in the second map, which are boundary lines between the stroke to be compared designated by the stroke designation unit and the adjacent stroke designated by the adjacent stroke designation unit, as coordinate values ​​of vertices of the first boundary line and the second boundary line; an evaluation data generation unit that generates evaluation data based on coordinate values ​​of vertices of the first boundary line and the second boundary line; an evaluation unit that evaluates the difference in the boundary lines between the comparison target plots and the adjacent plots on the first map and the second map from the evaluation data; A map evaluation program that evaluates differences in the boundaries of multiple adjacent plots on a first map and a second map, characterized by functioning as follows.

Images