JP7502511B1 - Extraction device, extraction method, and program - Google Patents

Abstract

[Problem] To provide an extraction device etc. that makes it possible to extract image plots adjacent to a route in a predetermined connection state from among a plurality of routes. [Solution] The extraction device has a storage unit that stores a plurality of routes as graphic data representing straight lines or broken lines, and stores the plurality of image plots in association with the routes adjacent to each of the image plots, a specification unit that specifies points as intersections from among the connection points of the plurality of routes, excluding connection points where only two routes connect at their end points, a graphic extraction unit that divides each of the straight lines or broken lines represented by the plurality of routes at intersections and joins them at connection points other than the intersections to extract them as network lines, a correspondence relationship setting unit that sets a correspondence relationship between the plurality of routes and the extracted network lines, and a picture plot extraction unit that extracts image plots adjacent to the plurality of routes that correspond to the same network line from among the plurality of image plots. [Selected Figure] Figure 7

Description

The present invention relates to an extraction device, an extraction method, and a program.

The land valuation, which is the basis for calculating the fixed property tax on land, is determined based on the road value of the road that the land faces. To facilitate the cumbersome task of calculating land valuation, computer-based management of road values has become common. For example, Patent Document 1 describes a device that allows the flow of road values to be visually and easily confirmed.

JP 2013-89143 A

According to the fixed asset assessment standards, the method of calculating land valuation also varies depending on the number of roads adjacent to the land plot, which is the land assessment unit. This means that the taxation department in charge of imposing fixed asset tax in municipalities and other local governments needs to properly grasp the number of roads that the land plot faces. However, according to the fixed asset assessment standards, depending on the system of multiple consecutive roads, multiple roads may be recognized as separate roads, or some of the multiple roads that are actually adjacent to the land plot may not be evaluated as being adjacent to the land plot. In such cases, tax officials, etc. must carry out the cumbersome task of checking the connection status of the multiple roads adjacent to the land plot to determine the number of roads adjacent to the land plot. Therefore, in order to facilitate the above task, it is necessary to extract land plots that require the judgment of tax officials, etc.

The present invention has been made to solve the above-mentioned problems, and aims to provide an extraction device, extraction method, and program that make it possible to extract plots adjacent to a route with a specified connection status from among multiple plots.

The extraction device according to the embodiment of the present invention is characterized by having a storage unit that stores a plurality of routes, each of which is graphic data indicating a straight line or a broken line, and stores the plurality of plots in association with the routes adjacent to each plot; an identification unit that identifies, as intersections, points among the connection points of the plurality of routes, excluding connection points where only two routes connect at their end points; a graphic extraction unit that divides each of the straight lines or broken lines indicated by the plurality of routes at intersections and joins them at connection points other than the intersections to extract them as network lines; a correspondence relationship setting unit that sets a correspondence relationship between the plurality of routes and the extracted network lines; and a plot extraction unit that extracts, from the plurality of plots, plots adjacent to the plurality of routes that correspond to the same network line.

The extraction device preferably further includes a connection point setting unit for setting a connection point between each of the multiple routes and another route when a portion of the other route is included in a predetermined range including the end point of the route, and the identification unit preferably identifies an intersection from among the set connection points.

It is also preferable that the graphic extraction unit expands the extracted network lines and combines spatially overlapping network lines in the expanded state into a single network line.

The extraction device preferably further includes a generation unit that generates an intersection polygon that includes the intersection and at least a portion of each of the routes that connect at the intersection, and the graphic extraction unit preferably divides the straight lines or broken lines indicated by the multiple routes by extracting only those portions of the straight lines or broken lines that are not included in the intersection polygon.

The extraction method according to an embodiment of the present invention is an extraction method executed by an extraction device, and includes storing a plurality of routes, each of which is graphic data indicating a straight line or a broken line, storing the plurality of plots in association with the routes adjacent to each plot, identifying points among the connection points of the plurality of routes as intersections, excluding connection points where only two routes connect at their endpoints, dividing each of the straight lines or broken lines indicated by the plurality of routes at the intersections and joining them at connection points other than the intersections to extract them as a plurality of network lines, setting a correspondence relationship between the plurality of routes and the extracted network lines, and extracting, from the plurality of plots, plots adjacent to the plurality of routes that correspond to the same network line.

A program according to an embodiment of the present invention is a computer program having a memory unit that stores multiple routes, each of which is graphic data indicating a straight line or a broken line, and stores multiple plots in association with routes adjacent to each plot, and is characterized in that the program causes the computer to execute the following: identify, as intersections, points among the connection points of the multiple routes, excluding connection points where only two routes connect at their endpoints, divide each of the straight lines or broken lines indicated by the multiple routes at the intersections and join them at connection points other than the intersections to extract them as multiple network lines, set a correspondence relationship between the multiple routes and the extracted network lines, and extract, from the multiple plots, plots adjacent to multiple routes that correspond to the same network line.

The extraction device, extraction method, and program of the present invention make it possible to extract plots adjacent to a route with a specified connection status from among multiple plots.

FIG. 2 is a functional block diagram of the extraction device 1. 13A and 13B are schematic diagrams for explaining examples of routes and plots. 13A and 13B are schematic diagrams for explaining examples of routes and plots. 13A and 13B are schematic diagrams for explaining examples of routes and plots. 2 is a diagram showing an example of a data structure of a route table T1; 13 is a diagram showing an example of the data structure of an image location table T2. FIG. 11 is a flow diagram showing an example of the flow of an extraction process. FIG. 13 is a schematic diagram for explaining setting of connection points and identification of intersections. FIG. 11 is a schematic diagram for explaining generation of an intersection polygon. FIG. 13 is a schematic diagram for explaining division of a straight line or a broken line. FIG. 1 is a schematic diagram for explaining expansion and coupling of network lines. FIG. 13 is a schematic diagram for explaining setting of a correspondence relationship.

Various embodiments of the present invention will be described below with reference to the drawings. Please note that the technical scope of the present invention is not limited to these embodiments, but extends to the inventions described in the claims and their equivalents.

Figure 1 is a functional block diagram of an extraction device 1 according to an embodiment. The extraction device 1 extracts a route in a predetermined connection state from among a plurality of routes stored in advance. The extraction device 1 is an information processing device such as a PC (Personal Computer), a server, a mobile phone, a smartphone, a tablet terminal, or a portable game console. The extraction device 1 has a memory unit 11, a communication unit 12, a display unit 13, an operation unit 14, and a processing unit 15.

The storage unit 11 is configured to store programs and data, and includes, for example, a semiconductor memory. The storage unit 11 stores, as programs, operating system programs, driver programs, application programs, etc., used in processing by the processing unit 15. Programs are installed into the storage unit 11 from computer-readable, non-transient portable storage media such as CD-ROMs (Compact Disc Read Only Memory) and DVD-ROMs (Digital Versatile Disc Read Only Memory).

The communication unit 12 is configured to enable the extraction device 1 to communicate with other devices, and includes a communication interface circuit. The communication interface circuit included in the communication unit 12 is a communication interface circuit such as a wired LAN (Local Area Network) or a wireless LAN. The communication unit 12 receives data from other devices and supplies the data to the processing unit 15, and transmits data supplied from the processing unit 15 to other devices.

The display unit 13 is configured to display an image, and includes, for example, a liquid crystal display or an organic EL (Electro-Luminescence) display. The display unit 13 displays an image based on the display data supplied from the processing unit 15.

The operation unit 14 is configured to receive operations for the extraction device 1, and includes, for example, a keyboard, a keypad, a mouse, etc. The operation unit 14 may be a touch panel integrated with the display unit 13. The operation unit 14 generates an operation signal corresponding to the received operation and supplies it to the processing unit 15.

The processing unit 15 is configured to comprehensively control the operation of the extraction device 1, and includes one or more processors and their peripheral circuits. The processing unit 15 includes, for example, a CPU (Central Processing Unit). The processing unit 15 may also include a GPU (Graphics Processing Unit), a DSP (Digital Signal Processor), an LSI (Large Scale Integration), an ASIC (Application Specific Integrated Circuit), an FPGA (Field Programmable Gate Array), etc. The processing unit 15 controls the operation of each component and executes various processes so that the various processes of the extraction device 1 are executed in an appropriate order based on the programs stored in the memory unit 11.

The processing unit 15 has an acquisition unit 151, a connection point setting unit 152, an identification unit 153, a generation unit 154, a figure extraction unit 155, a correspondence setting unit 156, an image extraction unit 157, and an output unit 158. Each of these units is a functional module that is realized by the processing unit 15 executing a program. Each of these units may be implemented in the extraction device 1 as a dedicated processing circuit.

Figure 2 (A) is a schematic diagram for explaining an example of plots and routes. A route is a section of a road for which a road value is set, and is stored as graphic data showing a straight line or a broken line. A plot is a piece of land that is a calculation unit when calculating a land valuation based on the road value. As described later, information on plots and routes is stored in advance in the memory unit 11. Figure 2 (A) shows plots L1 and L2, and routes R1-R6, which are graphic data showing straight lines. In the example shown in Figure 2 (A), three of the four sides of the rectangular plot L1 are in contact with the routes R1, R2, and R3, respectively, and the other side is in contact with the plot L2. Therefore, in the calculation of the land valuation, the plot L1 is evaluated as a plot adjacent to the three routes R1, R2, and R3.

The lines adjacent to a plot include the front line, the side line, and the two-way line. In principle, the front line is the line adjacent to the plot with the highest land value. The side line is the line that connects to the front line through an intersection at the corner of the plot, and is adjacent to the side of the plot. When side lines are located on the left and right of the plot, they are called side line 1 and side line 2, respectively. A two-way line is a line adjacent to the plot other than the front line and side line, which does not intersect with the front line at an intersection adjacent to the plot, and is located on the opposite side of the plot to the front line. When multiple lines are two-way lines, one representative line among them is considered to be the two-way line. In FIG. 2(A), when line R1 is the front line, line R2 is a side line, and line R3 is a two-way line.

In the following, a point on a road where two or more routes connect may be referred to as a connection point. For example, routes R1, R2, R4, and R5 connect at their endpoints at connection point C1, which corresponds to a crossroads. Routes R2, R3, and R6 connect at their endpoints at connection point C2, which corresponds to a T-shaped road. Connection points are set based on route information in the extraction process described below.

Figure 2(B) is a schematic diagram for explaining another example of plots and routes. In the example shown in Figure 2(B), plot L3 is evaluated as being adjacent to three routes R7, R8, and R9. In the example shown in Figure 2(B), routes R8 and R9 are connected at their midpoint and end point at connection point C3, which corresponds to a T-shaped road. A T-shaped road is represented by a state in which three routes are connected at their end points, such as connection point C2 in Figure 2(A), or a state in which two routes are connected at their midpoint and end point, such as connection point C3 in Figure 2(B).

Figure 3 (A) is a schematic diagram for explaining another example of plots and routes. In the example shown in Figure 3 (A), plot L4 is adjacent to three routes R10, R11, and R12. Routes R11 and R12 are connected at their end points at connection point C4, and correspond to an L-shaped road. According to the fixed asset assessment standards, when there are two routes corresponding to an L-shaped road such as that formed by routes R11 and R12, only the route that is a side route of the two routes is associated with the plot and evaluated. Therefore, route R10 is associated with plot L4 as the front route, and only route R11 is associated with plot L4 as the side route, and plot L4 is evaluated as a plot adjacent to the two routes.

Figure 3 (B) is a schematic diagram for explaining another example of plots and routes. Route R14 in Figure 3 (B) is graphic data showing a broken line. In the example shown in Figure 3 (B), route R13 is associated with plot L5 as the front route, route R14 is associated with plot L5 as the side route, and no two-way route is associated with plot L5. Therefore, plot L5 is evaluated as a plot adjacent to two routes.

Figure 4 (A) is a schematic diagram for explaining another example of plots and routes. In the example shown in Figure 4 (A), rectangular plot L6 is bordered on its four sides by routes R15, R16, R17, and R18. Therefore, plot L6 is associated with route R13 as the front route, route R16 as side route 1, route R17 as side route 2, and route R18 as a second route, and plot L6 is evaluated as a plot adjacent to four routes.

Figure 4 (B) is a schematic diagram for explaining another example of plots and routes. In the example shown in Figure 4 (B), the rectangular plot L7 is in contact with routes R19, R20, R21, and R22 at its four sides. Routes R20 and R21 are connected at their end points at connection point C5. Routes R21 and R22 are connected at their end points at connection point C6. According to the fixed asset assessment standard, when there are routes corresponding to a U-shaped road such as that formed by routes R20, R21, and R22, only one of the routes is to be associated as a side route or two-way route. Therefore, route R19 is associated with plot L7 as the front route, and route R20 is associated as one side route, for example, and plot L7 is evaluated as a plot adjacent to two routes.

As mentioned above, if a route other than the frontal route adjacent to a plot corresponds to an L-shaped or U-shaped road, the route located on the opposite side of the plot from the frontal route is not treated as a two-way route, in principle. In such cases, tax officials must evaluate the plot individually.

Hereinafter, among the connection points of multiple routes, points excluding those where only two routes connect at their endpoints may be referred to as intersections. In the examples shown in Figures 2 to 4, connection points C1 and C2 in Figure 2(A) are intersections because three or more routes connect. Connection point C3 in Figure 2(B) is an intersection because two routes connect at an endpoint and a midpoint. Connection point C4 in Figure 3(A) is not an intersection because two routes connect at their endpoints. Connection points C5 and C6 in Figure 4(B) are also not intersections because two routes connect at their endpoints. Since the connection points of multiple routes that make up an L-shaped or U-shaped route are not intersections, it is possible to determine whether those routes make up an L-shaped or U-shaped road by determining whether the connection points of multiple routes are intersections.

Figure 5 shows an example of the data structure of route table T1 pre-stored in memory unit 11. Route table T1 is set up in advance by a taxing department or the like, and stores route numbers, route values, vertex positions, etc. in association with one another.

The route number is information that identifies each of multiple routes. The route value is the base price used to calculate the assessed value of land adjacent to a route, and is the price per square meter of land adjacent to a route. The vertex positions are the position coordinates of the endpoints and midpoints of a route, which is graphic data showing a straight line or a broken line. The straight line or broken line connecting the vertex positions indicates the shape of the route. The position coordinates are, for example, latitude and longitude values or plane rectangular coordinate values.

Figure 6 is a diagram showing an example of the data structure of the map table T2 pre-stored in the storage unit 11. The map table T2 is set up in advance by the taxation department of each local government, and stores map numbers and adjacent route numbers in association with each other.

The plot number is information that identifies each of multiple plots. The plot number may be the lot number of the parcel of land that makes up the plot. The adjacent route number is the route number of the route adjacent to the plot, and includes the route numbers of the front route, side route 1, side route 2, and two-way route.

Figure 7 is a flowchart showing an example of the flow of the extraction process executed by the extraction device 1. The extraction process is executed in response to a user's operation on the operation unit 14. The extraction process is realized by the processing unit 15 working in cooperation with other components of the extraction device 1 based on a program stored in the storage unit 11.

First, the acquisition unit 151 acquires multiple routes (step S101). For example, the acquisition unit 151 accepts an operation on the operation unit 14 to input a geographical range from which routes are to be extracted. The acquisition unit 151 acquires information on routes included in the input geographical range from the route table T1. A route included in the input geographical range is, for example, a route in which at least one of the vertices constituting the route is included in the input geographical range.

Next, the connection point setting unit 152 sets a connection point where two or more of the multiple routes connect (step S102). For example, for each of the multiple routes acquired, the connection point setting unit 152 determines whether or not a part of another route is included in a predetermined range including the endpoint of the route. The predetermined range including the endpoint of the route is, for example, a circle centered on the endpoint of the route. The part of the other route includes the endpoint, midpoint, and line segment connecting these points of the other route. If a part of the other route exists within a predetermined range from the endpoint of the route, the connection point setting unit 152 sets a connection point that connects the route and the other route. At this time, the connection point setting unit 152 sets the position coordinates of the connection point based on the positional relationship between the endpoint of the route and the part of the other route within the predetermined range. For example, if the endpoint of the other route is included in the predetermined range, the position coordinates of the connection point are set to a midpoint between the endpoint of the route and the endpoint of the other route.

Next, the identification unit 153 identifies an intersection from among the connection points of the multiple routes (step S103). The identification unit 153 identifies, as an intersection, a connection point other than a connection point where only two routes connect at their endpoints. That is, the identification unit 153 identifies, as an intersection, a connection point where three or more routes connect, and a connection point where two routes connect at their endpoints and midpoints. For example, among the connection points set in step S102, connection points other than a connection point set because it is determined that only one endpoint of another route exists within a predetermined range from the endpoint of a route are identified as intersections. The identification unit 153 stores intersection flag information indicating that the identified connection point is an intersection in association with the identified connection point.

Figure 8 is a schematic diagram for explaining the setting of connection points and the identification of intersections. In the example shown in Figure 8, lines R1-R7 are acquired as multiple lines. The connection point setting unit 152 refers to the position coordinates of the endpoints of lines R1-R7, determines that the endpoints E2-E4 of lines R2-R4 are included in a predetermined range including the endpoint E1 of line R1, and sets a connection point C1 that connects lines R1-R4. In the same manner, the connection point setting unit 152 sets a connection point C2 that connects the endpoints of lines R2 and R5, a connection point C3 that connects the endpoints and midpoints of lines R1 and R6, and a connection point C4 that connects the endpoints of lines R5-R7.

Since connection point C1 is a connection point where four routes R1-R4 connect, the identification unit 153 identifies connection point C1 as an intersection. Since connection point C2 is a connection point where only two routes connect at their endpoints, the identification unit 153 does not identify connection point C2 as an intersection. Since connection point C3 is a connection point where two routes connect at their endpoints and midpoints, the identification unit 153 identifies connection point C3 as an intersection. Since connection point C4 is a connection point where three routes connect, the identification unit 153 identifies connection point C4 as an intersection.

Returning to FIG. 7, next, the generation unit 154 generates an intersection polygon that includes the identified intersection and at least a portion of the lines that connect at the intersection (step S104). In the following description, the intersection polygon has a circular shape centered at the intersection, but is not limited to this example, and the intersection polygon may have any convex shape that includes the intersection and at least a portion of the lines that connect at the intersection.

9 is a schematic diagram for explaining the generation of an intersection polygon. As described with reference to FIG. 8, the connection points C1, C3, and C4 are specified as intersections, and the connection point C2 is not specified as an intersection. Therefore, the generation unit 154 generates an intersection polygon for the connection points C1, C3, and C4. The intersection polygon is generated so as to include at least a part of the intersection and each line connected at the intersection, for example, to include an end point or a midpoint connected at the intersection. In the example shown in FIG. 9, the generation unit 154 generates an intersection polygon D1 so as to include the end points of the lines R1-R4 connected at the connection point C1. The generation unit 154 also generates an intersection polygon D3 including the end point of the line R1 connected at the connection point C3 and the midpoint of the line R6. The generation unit 154 also generates an intersection polygon D4 including the end points of the lines R5-R7 connected at the connection point C4.

Returning to FIG. 7, next, the graphic extraction unit 155 divides each of the straight lines or broken lines indicated by the multiple routes at intersections, and connects the resulting divided parts at connection points other than intersections to extract them as network lines (step S105). For example, the graphic extraction unit 155 divides the straight lines or broken lines at intersections by extracting only the parts of the straight lines or broken lines indicated by the multiple routes that are not included in the intersection polygons.

Figure 10 is a schematic diagram for explaining the division of straight lines or broken lines. In the example shown in Figure 10, only the parts of the straight lines indicated by the lines R1-R7 in Figures 8-9 that are not included in the intersection polygons D1, D3, and D4 are extracted, thereby dividing the straight lines indicated by each line. In addition, network lines P1-P8 are extracted as parts resulting from the division. Since the endpoints of line R1 are included in the intersection polygons D1 and D3, a network line P1 that is shorter than line R1 is extracted from line R1. Furthermore, since the midpoint of line R6 is included in the intersection polygon D3, two network lines P6 and P8 are extracted from line R6.

The graphic extraction unit 155 also expands the extracted network lines, and combines the network lines that overlap spatially in the expanded state into a single network line. That is, the graphic extraction unit 155 expands the network lines that were graphic data indicating straight lines or broken lines, thereby converting them into polygons having planar areas. The graphic extraction unit 155 also combines the network lines that spatially overlap polygons in the expanded state, and converts them into a single network line. Expanding a network line means, for example, generating a polygon that includes points that are less than a predetermined distance from the network line by setting a buffer area on the network line that is composed of straight lines or broken lines before expansion. Hereinafter, the predetermined value may be referred to as the width of the polygon.

The width of the polygon is set based on the size of the intersection polygon. For example, if the intersection polygon has a circular shape, the width of the polygon is set to a value smaller than the radius of the circle. This makes the width of the polygon of the expanded network line smaller than the width of the intersection polygon, so that the network lines are joined only at connection points where no intersection polygons are generated.

Figure 11 is a schematic diagram for explaining the expansion and joining of network lines. In Figure 11, the network lines before expansion are shown by solid lines, and the polygons of the network lines after expansion are shown by dashed lines. In the example shown in Figure 11, polygon Q2 obtained by expanding network line P2 and polygon Q5 obtained by expanding network line P5 overlap spatially, so the figure extraction unit 155 joins polygons Q2 and Q5 to generate one polygon QA. In addition, the figure extraction unit 155 joins network lines P2 and P5 corresponding to the joined polygons Q2 and Q5 to one network line PA. Polygons Q1, Q3-4, and Q6-Q8 obtained by expanding network lines P1, P3-P4, and P6-P8 do not spatially overlap with other polygons, so polygons Q1, Q3-4, and Q6-Q8 are not joined to other polygons. In addition, network lines P1, P3-P4, and P6-P8 are not joined to other network lines.

When multiple routes are connected at their endpoints, the position coordinates of those endpoints are generally the same, but when the route data contains errors, the position coordinates of those endpoints may differ from each other, as shown in Figures 10 and 11. By expanding the network lines, even if the position coordinates of the vertices of the routes contain errors, the polygons overlap spatially at the connection points, so that the network lines of the routes that are connected to each other can be combined into one polygon. On the other hand, since the width of the expanded polygon is smaller than the width of the intersection polygon, the network lines corresponding to the routes that are divided at the intersection where the intersection polygon is generated are not combined. That is, in step S105, if two routes are connected at their endpoints, the network lines corresponding to those two routes are combined into one network line, and if multiple routes are connected in other ways, the network lines corresponding to those routes are not combined. Therefore, even if there is an error in the position coordinates of the endpoints of the routes, multiple routes that are connected at a connection point that is not an intersection are combined and extracted into the same network line, and multiple routes that are connected at an intersection are divided at the intersection as they are and extracted as different network lines. In addition, a route that has an intersection on the way is divided into multiple network lines at the intersection. In this way, multiple routes that connect at non-intersection connection points corresponding to L-shaped or U-shaped roads are combined into a single network line and extracted.

Returning to FIG. 7, next, the correspondence setting unit 156 sets a correspondence between the multiple routes and the connected network lines (step S106). The correspondence setting unit 156 sets identification information for each of the multiple network lines, and sets a correspondence between the multiple routes and the network lines by associating the identification information with the multiple routes.

12 is a schematic diagram for explaining the setting of the correspondence relationship. In FIG. 12, for convenience of explanation, only polygons Q1 and QA are illustrated among the multiple polygons. Also, for ease of viewing, the route and the network line are illustrated shifted. The correspondence relationship setting unit 156 sets identification information for the polygons Q1 and QA. The correspondence relationship setting unit 156 associates the identification information of each polygon with the route from which the network line from which each polygon is generated is extracted. In the example shown in FIG. 12, the correspondence relationship setting unit 156 associates the identification information of the polygon Q1 with the route R1 from which the network line P1 from which the polygon Q1 is generated is extracted. Also, the correspondence relationship setting unit 156 associates the identification information of the polygon QA with the routes R2 and R5 from which the network lines P2 and P5 from which the polygons Q2 and Q5 connected to the polygon QA are generated are extracted. Since polygons and network lines have a one-to-one correspondence, the polygon identification information is associated with the route, and a correspondence relationship between multiple routes and network lines is set.

The identification information of a polygon is, for example, the route number of the route corresponding to the polygon. In this case, the identification information of a polygon formed by combining multiple polygons may be the identification information of any one of the multiple routes from which the multiple network lines from which the combined multiple polygons are generated are extracted, or may be any numeric value or character string. The present invention is not limited to such an example, and the identification information of all polygons may be set to any numeric value or character string.

The correspondence setting unit 156 may set correspondence between multiple routes and network lines based on the spatial positional relationship between the polygon and the route. For example, the correspondence setting unit 156 calculates the inclusion relationship between the straight line or broken line indicated by the route and the polygon based on the position coordinates of the endpoints and midpoints of the route and the position coordinates of each vertex constituting the polygon. When the straight line or broken line indicated by the route is included in the polygon, the correspondence setting unit 156 associates the identification information of the route and the polygon. In this case, too, since the polygon and the network line have a one-to-one correspondence, the correspondence between multiple routes and the network lines is set by associating the identification information of the polygon with the route.

Returning to FIG. 7, the image extraction unit 157 extracts image areas adjacent to multiple routes corresponding to the same network line from among the multiple image areas (step S107). The image extraction unit 157 refers to the image table T2 to extract the side 1 route, side 2 route, and two-way route adjacent to a single image area. Based on the correspondence relationship set in step S106, the image extraction unit 157 determines whether the side 1 route, side 2 route, and two-way route adjacent to the image area include routes that correspond to the same network line. For example, the image extraction unit 157 acquires identification information of polygons associated with each of the extracted side 1 route, side 2 route, and two-way route. If any of the acquired identification information is duplicated, the image extraction unit 157 determines that the routes adjacent to the image area include routes that correspond to the same network line. If the routes include routes that correspond to the same network line, the image extraction unit 157 extracts the image area as an image area adjacent to multiple routes that correspond to the same network line.

In the example shown in FIG. 12, the image extraction unit 157 extracts route R2 as one lateral route adjacent to image L1, and route R5 as a second lateral route. Since routes R2 and R5 are both set to correspond to polygon Q2, the image extraction unit 157 extracts image L1 as an image adjacent to multiple routes corresponding to the same network line.

Next, the output unit 158 outputs the extracted image area (step S108). The output unit 158 outputs the extracted image area information by transmitting it to another device via the communication unit 12. The output unit 158 may output the extracted image area information by displaying it on the display unit 13. The output unit 158 may output the extracted image area information by controlling a printing unit (not shown) to print the extracted image area on a printing medium. The image area information may be output, for example, as a table that allows information about the image area to be listed at a glance, or may be output as map information that displays information about adjacent routes identifiable on a map. The extraction process ends when verification of all image areas is completed.

As described above, the extraction device 1 identifies as intersections points among the connection points of multiple routes, excluding connection points where only two routes connect at their endpoints, divides each of the straight lines or broken lines indicated by the multiple routes at the intersections, and joins the parts resulting from the division at connection points other than the intersections to extract them as network lines, and extracts image areas adjacent to multiple routes that correspond to the same network line. In this way, the extraction device 1 makes it possible to extract image areas to which routes with a specified connection state are connected from among image areas to which multiple routes are connected.

In other words, even if side routes and two-way routes are stored as adjacent routes to a plot, depending on the route connection status, not all of those routes may be evaluated as adjacent to the plot in the taxation process. Therefore, for plots adjacent to L-shaped or U-shaped routes, tax officials must individually determine which routes are adjacent to the plot. However, it is not easy to extract only plots adjacent to L-shaped or U-shaped routes from a large number of plots. The extraction device 1 makes it possible to appropriately extract plots that require individual judgment by tax officials by extracting plots adjacent to two routes that connect at their endpoints, corresponding to L-shaped or U-shaped roads.

The following modifications may be applied to the extraction device 1.

In the above description, the graphic extraction unit 155 expands the network line in step S105 of the extraction process. This is not a limited example, and if there is no error in the vertex positions of the route in the route table T1 and the connecting end points and intermediate points have the same position coordinates, the graphic extraction unit 155 does not need to expand the network line. In this case, the graphic extraction unit 155 combines multiple network lines that spatially overlap in an unexpanded state into a single network line. Even in this way, the extraction device 1 can extract image areas adjacent to routes that have a specified connection state.

In the above description, the connection points are set in step S102 of the extraction process, but the information on the connection points may be stored in advance in the storage unit 11. In this case, steps S102 and S104 are omitted.

In the above description, the generation unit 154 generates an intersection polygon in step S104 of the extraction process, and in step S105 the graphic extraction unit 155 extracts only the portion not included in the intersection polygon of the straight lines or broken lines indicated by the multiple routes, but this is not limited to an example. In step S105, the graphic extraction unit 155 may divide the straight lines or broken lines at the intersection by moving the end points connected at the intersection of the straight lines or broken lines along the straight lines or broken lines so as to shorten the length of the straight lines or broken lines. In this case, step S104 is omitted.

The functions of the extraction device 1 described above may be realized by multiple devices that communicate with each other.

It should be understood by those skilled in the art that various changes, substitutions, and modifications can be made to the present invention without departing from the scope of the present invention. For example, the above-described embodiments and modifications may be implemented in appropriate combinations within the scope of the present invention.

REFERENCE SIGNS LIST 1 Extraction device 151 Acquisition unit 152 Connection point setting unit 153 Identification unit 154 Generation unit 155 Figure extraction unit 156 Correspondence relationship setting unit 157 Image extraction unit 158 Output unit

Claims (6)

A storage unit that stores a plurality of routes, each of which is graphic data showing a straight line or a broken line, and stores a plurality of plots and routes adjacent to each plot in association with each other;
an identification unit that identifies, as an intersection, a point from among the plurality of route connection points, excluding a connection point where only two routes are connected at their end points;
a geometrical feature extraction unit that divides each of the straight lines or broken lines indicated by the plurality of routes at the intersections and connects them at connection points other than the intersections to extract them as a network line;
a correspondence setting unit that sets a correspondence between the plurality of routes and the extracted network lines;
a plot extraction unit that extracts plots adjacent to a plurality of routes corresponding to the same network line from among the plurality of plots;
An extraction apparatus comprising: a connection point setting unit that sets the connection point at which each of the plurality of routes is connected to another route when a part of the other route is included in a predetermined range including an end point of the route,
The identification unit identifies the intersection from among the set connection points.
The extraction device of claim 1. the graphic extraction unit expands the extracted plurality of network lines and combines the network lines that spatially overlap in the expanded state into a single network line.
3. The extraction device of claim 2. A generation unit that generates an intersection polygon including the intersection and at least a part of each line connected at the intersection,
the graphic extraction unit divides the straight lines or the broken lines indicated by the multiple routes by extracting only the portions of the straight lines or the broken lines that are not included in the intersection polygons;
The extraction device of claim 1. A method of extraction performed by an extraction device, comprising:
storing a plurality of routes, each of which is graphic data showing a straight line or a broken line, and storing a plurality of plots and routes adjacent to each plot in association with each other;
Identifying, as an intersection, a point among the plurality of route connection points excluding a connection point where only two routes are connected at their end points;
Dividing each of the straight lines or broken lines indicated by the plurality of routes at the intersections and connecting them at connection points other than the intersections to extract a network line;
setting a correspondence relationship between the plurality of routes and the extracted network lines;
extracting, from the plurality of plots, plots adjacent to a plurality of routes corresponding to the same network line;
The extraction method comprising the steps of: A computer program having a storage unit that stores a plurality of routes, each of which is graphic data showing a straight line or a broken line, and stores a plurality of plots and routes adjacent to each plot in association with each other, comprising:
Identifying, as an intersection, a point among the plurality of route connection points excluding a connection point where only two routes are connected at their end points;
Dividing each of the straight lines or broken lines indicated by the plurality of routes at the intersections and connecting them at connection points other than the intersections to extract a network line;
setting a correspondence relationship between the plurality of routes and the extracted network lines;
extracting, from the plurality of plots, plots adjacent to a plurality of routes corresponding to the same network line;
A program for causing the computer to execute the above steps.

Images