JPH10123947A - Method for discriminating detached territory in area management system and device therefor - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a detached territory discriminating method and a device therefor which discriminates the presence or absence of, what is called, a detached territory, which is separated by other area, wit respect to an areas for a specific purpose. SOLUTION: A detached territory discriminating device comprises an input device to input a signal from an operator of the device, an area information input device 2 to input information on an areas for sales, visits, etc., defined as an aggregate of blocks provided by rezoning of municipalities, a storage device 3 to store inputted area information, an area network generating means 4 to generate from the inputted area information a road network related to an area for which the sales man and visitor take in charge, a detached area discriminating device 6 provided with a detached territory discriminating means 5 to check the presence or absence of the detached territory by using the area network, and a display device 7 to display the results outputted from the detached territory discriminating device 6.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention manages a block, which is an administrative unit, and an area constituted as an aggregate of small areas (hereinafter simply referred to as blocks) comparable to this block and having the purpose of selling or visiting. Related to the area management system. Especially,
The present invention relates to an enclave determination method and apparatus for determining whether a specific area in an area management system is divided by another area, that is, for determining the presence or absence of an enclave.

[0002]

2. Description of the Related Art In recent years, an area management system (also referred to as a map information system or an area planning system) has been developed for managing and planning an area having a purpose such as sales and visits. For example, Japanese Patent Application Laid-Open No. 63-11987 describes a map data search method that can search for intersections on a road in units of an area to which the current location belongs. Further, Japanese Patent Application Laid-Open No. 63-58485 describes a map search method that can search for additional information not as a unit of town name but as information within a specified range. further,
Japanese Patent Application Laid-Open No. 60-88982 describes a delivery guidance device in which delivery destinations are sequentially instructed on a house map displayed on a map display based on house data. In addition, Japanese Patent Application Laid-Open Nos. 61-199173 and 5-20
No. 4303 and JP-A-5-233424.

In an area management system for the purpose of selling, visiting, etc., in order to avoid an increase in travel distance and to reduce a patrol route, and to set a visit area with high patrol efficiency, a planner of an area in charge, The setter must carefully create a block of blocks and set up an area of responsibility.

[0004]

In such an area management system, the area of the person in charge is assigned to another person in charge of the area in order to improve the work efficiency by reducing the number of visits by the person in charge of the area and reducing the traveling route. Is required to be separated by the area of the driver, that is, a function of avoiding enclaves. That is, when planning or setting a sales or visiting area, it is important to prevent the occurrence of enclaves in order to avoid an increase in the moving distance and to improve work efficiency.

[0005] In order to avoid such enclaves, for example, a small constituency zoning method (Information Processing Society of Japan, 1996.4)
In Vol. 37, No. 4), adjacent data of a small area constituting a ward is created so as not to generate an enclave in the ward.

However, in an area management system for managing an area having a purpose such as sales and visits, it is not enough to simply avoid an enclave, and it is necessary to improve the efficiency of sales and visits and prevent the occurrence of enclaves. Then, it is necessary to set a visiting area with good patrol efficiency.

[0007] Even if the above-described method of creating adjacent data of the small areas constituting the ward and performing the division is adopted in the area management system, the adjacent relation of the blocks constituting the small area is determined. It is necessary to create the adjacency data to be defined, which is considered to take considerable time and effort.

An object of the present invention is to solve the above-mentioned problems, to save the trouble of creating the adjacent data of the blocks constituting the area in charge by the person in charge, etc., and to improve the efficiency of the work for preventing the occurrence of enclaves. An object of the present invention is to provide a management method and device.

It is another object of the present invention to provide an area management method and apparatus capable of easily setting an area with good patrol efficiency while avoiding enclaves.

[0010]

A feature of the present invention is a method for judging the presence or absence of an enclave in an area management system for managing a plurality of areas, each of which is made up of a collection of town blocks, wherein a network of a specific area is created. Then, the connection relation of points constituting the network of the specific area is searched, and it is determined whether the specific area is divided by another area according to whether the point is connected or divided. The present invention is also directed to an enclave determination method in an area management system for determining the presence or absence of an enclave.

Another feature of the present invention is a method for judging the presence or absence of an enclave in an area management system for managing a plurality of areas each consisting of a set of blocks, wherein each block constituting a specific area is defined. Using the boundary vector, the network of the specific area is created, the connection relation of each point constituting the network of the specific area is searched, and the presence or absence of an isolated subnetwork is determined. There is an enclave discrimination method in an area management system that discriminates that there is an enclave when it exists.

Another feature of the present invention is an enclave presence / absence discriminating device in an area management system for managing a plurality of areas each consisting of a set of block, and defines each block forming a specific area. Means for creating a network of the specific area using a boundary vector,
Means for searching for a connection relationship between points constituting the network of the specific area, and determining the presence or absence of an isolated subnetwork, and determining that there is an enclave when the isolated subnetwork is present. Another feature of the present invention is an area management system that manages a plurality of areas, each of which is composed of a block of town blocks.
An input device, an area information input device for inputting information such as area vector information, a storage device for storing the input area information, a unit for creating a network of a specific area, and the specific area by the created network. The area management system includes an enclave determination device that includes an enclave confirmation unit that confirms the presence or absence of an enclave, and an output device that outputs a result of determining the presence or absence of an enclave.

According to the present invention, in an area having a specific purpose, it is possible to easily determine whether or not a so-called enclave where the specific area is divided by another area.

Further, according to the present invention, it is possible to determine the presence or absence of an enclave by using the boundary vector defining the block without defining the adjacency of the block constituting the specific area.
The trouble of creating the adjacency relationship data can be saved.

Further, according to the present invention, a commercially available block vector map can be used because a boundary vector defining a block is used, and it is not necessary to create block definition data independently.
The map data creation efficiency can be improved.

Further, according to the present invention, the present invention can be applied to an area planning system for realizing a specific purpose, and for example, it is possible to improve the efficiency of area setting such as sales and visits. That is, since the connection part of the block configuring the area can be determined, it is possible to avoid this and set an area with high traveling efficiency.

[0017]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS One embodiment of the present invention will be described below with reference to the drawings. FIG. 1 shows a configuration example of an enclave discrimination device. This enclave discrimination device is a part of an area management system that manages an area having a purpose such as a sale or a visit, and uses this enclave discrimination device to create an assigned area with no enclaves and high patrol efficiency. It is.

The enclave discrimination device inputs an input device 1 for inputting a signal from an operator of the device and information on an area such as a sale or a visit defined as an aggregate of blocks provided by zoning by municipalities. An area information input device 2, a storage device 3 for storing the input area information, an area network creating means 4 for creating a road network for the area in charge of the sales and the visitor in charge from the input area information, and It comprises an enclave determination device 6 having an enclave confirmation means 5 for confirming the presence or absence of an enclave, and an output device 7 for displaying the result output by the enclave determination device 6. The enclave confirming means 5 comprises an enclave discriminating means 5A and a point joining discriminating means 5B.

The input device 1 is realized by a pointing device such as a keyboard, a mouse or a light pen, and the area information input device 2 reads area information stored on a floppy disk or a magneto-optical disk.
This is realized by a floppy disk drive, a magneto-optical disk drive, or the like. Further, the storage device 3 for storing a large amount of data is realized by an external storage device such as a hard disk.

The enclave judging device 6 includes a personal computer having a CPU, a ROM storing an enclave judging processing program, a RAM storing and holding road vector information and the like, and an I / O controlling input and output of these. It is constituted by a processing device such as a workstation.

The enclave determination processing program includes a program for performing processing corresponding to the area network creating means 4 and an enclave determination processing program and a point joining determination processing program for performing processing corresponding to the enclave confirmation means 5.

The output device 7 can be realized by a bit map display or the like.

FIG. 2 shows the area information 400 input from the area information input device 2 displayed on the output device 7. In FIG. 2, intersections and links are indicated by solid circles and solid lines, respectively, and rectangles indicate the outline of the house. Also, in FIG. 2, the assigned areas A to D are divided and indicated by thick solid lines, and the assigned area names are displayed in alphabetical letters in each assigned area.

FIG. 3 shows a road vector as an example of the area information 400. The area information includes digital information such as an intersection (hereinafter, referred to as a node), an up and down route (hereinafter, referred to as a link), link information defining a block, and block information defining a service area. It is included. Also, information such as the number of households in the block is included.

Here, the enclave means that a certain assigned area is divided by another assigned area. In FIG. 2, the assigned area A corresponds to the enclave. When planning or setting a sales or visiting area, it is necessary to prevent the occurrence of enclaves in order to avoid an increase in travel distance.
For this reason, the person in charge of the area planner and the setter must carefully create a block of blocks and set up the area in charge.

As described above, an object of the present invention is to provide a method and an apparatus for improving the efficiency of the above-mentioned work for preventing enclaves, such as the person in charge of planning. For that purpose, first, it is necessary to be able to quickly grasp whether or not an enclave exists in a specific charge area.

In the following, an enclave discrimination method for judging whether an enclave exists in a specific assigned area will be described.

First, based on the area information input from the area information input device 2, an area network for the assigned area is created. FIG. 4 shows a flow of creating an area network. Hereinafter, an area network creation method will be described with reference to FIG.

When creating an area network, first,
Attention is paid to the block constituting the assigned area, and a link defining this block is secured (step 10). The secured link is stored in a table as shown in FIG.

Next, as shown in FIG. 5B, a start node and an end node constituting the secured link are secured (step 20).

Next, as shown in FIG. 5C, a block number of the block is secured (step 30).

By repeating the processing from step 10 to step 30 by the number of blocks constituting the assigned area (step 40), necessary area information is stored in a table and an area network can be created. it can.

FIG. 6 is a display example of digital data after an area network has been created for the assigned area A of FIG. Nodes and links of the area information input by the area information input device 2 are assigned unique numbers throughout the input area. This is a node and link management method similar to the road vector map provided by the Japan Digital Map Association and the like. Blocks also have unique numbers throughout. Here, when judging the presence or absence of an enclave in the assigned area A, for convenience of information processing, a unique serial number in the assigned area is re-assigned to nodes, links, and blocks in the assigned area, and the area is reassigned. Create a network. Numbers in the circles in the figure are block numbers, numbers in parentheses are link numbers,
Also, only numerical values indicate link numbers. Since the link has an up line and a down line, it is understood that two links are provided between the nodes.

FIG. 7 shows the connection relationship between the nodes of the area network of the assigned area A in FIG. 6, which is called an adjacency matrix. If the adjacency matrix has nodes connected to each other, that is, links are set, 1 is set as an element of the matrix, and the nodes are not connected to each other, that is, a pair of nodes not linked. Is created by setting 0 as a matrix element. For example, if the node numbers are 0 and 1,
(0,1) and (1,0)
Is set to 1. If the node number is 0
In the case of and 2, since no link is established, (0, 2)
0 is set in the elements of and (2, 0).

FIG. 8 shows an array for storing a flag indicating the state of execution of a specific process for each node in the area network. If the process has already been performed, 1 is stored in the position of the node number. You. Also, if not processed,
0 is stored at the position of the node number, and this array is hereinafter referred to as a visit flag. How to use this visit flag will be described below.

FIG. 9 shows the enclave discrimination processing flow. Hereinafter, the method of the enclave determination process of the assigned area will be described with reference to FIG. When the area network of the assigned area is given, each node in the area network is in an unprocessed state, so that the visit flag is initialized to 0 (step A). Next, in the area network, a variable Count for storing the number of isolated networks is initialized to 0 (step B). Next, processing for investigating the state of the isolated network of the area network having a recursive call structure is performed (step C). Hereinafter, the process of step C is referred to as a visiting process.

FIG. 10 shows a visit processing flow.
This will be described below. In the visit process shown in FIG.
The node number of the area network is received, and 1 is substituted into the element of the position of the visit flag (step C1).
0). For example, when the node number 0 is received in the visit process, the node with the node number 0 is determined to have already performed the visit process, that is, visited.

Next, the element of the adjacency matrix designated by the node number received in the visit process and the other node number and the visit flag corresponding to the other node number are checked (step C1).
5) For the element of the adjacency matrix of 1, that is, the nodes are connected and the visit flag corresponding to the other node number is 0, that is, the visit processing is performed for the other node number. If not, the visit process is performed by a recursive call (step C20). At this time, the node number passed to the visit processing is the other node number. If the condition of step C15 is not satisfied, a repetitive process of selecting another node number (step C25) is performed. Also, at the time when step C20 is completed, step C25 is performed.

FIG. 11 is a transition example of the visit flag. FIG.
In the first case, since the node number 0 is passed to the visit process, the flag corresponding to the position of the node number 0 is set to 1, and then the step C in the visit process of the step C is performed.
In No. 15, since the node number is 0 and the other node numbers are also initially 0, the elements of the adjacency matrix are 0 and the condition of Step C15 is not satisfied, so that the next node number is replaced by another node number. Is set. At this time, for example, if the other node number is 1, the (0, 1) element of the adjacency matrix is
This means that the nodes are connected, and the flag corresponding to the node number 1 in the visit flag is 0, so that the process proceeds from the first visit process in step C to the next visit process. This visit processing in step C is called a network depth-first search in graph theory. Therefore, if one node in the area network is delivered to step C, step C searches all the nodes in the connected network including the delivered node.

When the search for the connected network is completed in Step C, 1 is added to the current Count (Step D). Perform the processing of Step C and Step D to all nodes in the area network (Step E),
Is 1 (step F), it is determined that the area is not an enclave (step G). That is, it is determined that the area network has a connected network. If Count exceeds 1, it means that there is an isolated network, so it is determined that the vehicle is an enclave (step H).

However, if only the enclave discrimination processing shown in FIG. 9 is performed, the blocks shown in FIG. 12 are combined at one point, that is, the assigned area having the point junction is also permitted. Usually when selling or visiting, Figure 1
In the case of planning a traveling route, for example, when joining a block group located on the left side of FIG. 9 to a tour of a block group located on the right side, the point joining as shown in FIG. Since it is necessary to go through a junction, it is said that it should be avoided because of strict planning conditions and an increase in the number of links that pass redundantly.

Therefore, the present invention employs a method of performing a point joining determination process after the enclave determination process shown in FIG. 9 to determine the enclave in the area. Hereinafter, the point joining determination processing will be described.

FIG. 13 shows an example of digital information around the point junction in FIG. Numerical values in parentheses indicate link numbers, and only numerical values indicate node numbers. In FIG. 13 as well, it can be seen that the link has two links, uplink and downlink, except around the area in charge.

FIG. 14 is a processing flow for judging the presence or absence of a point joint in the assigned area. Hereinafter, the point joining presence / absence determination processing will be described with reference to the drawings. First, in a link defining the ward constituting the assigned area, two adjacent
The link of the book is obtained, and the reverse link of the link is obtained (step 10). For example, in FIG. 12, if the adjacent links are (8) and (10), (7) and (13) will be acquired as reverse links. At this time, if there is a reverse link in any one of the adjacent links (step 20), a repetitive process of moving to another adjacent link is performed on the link defining the block (step 60). Here, if there is no reverse link in any of the adjacent links, a node shared by the two adjacent links is obtained (step 30). For example, in FIG. 12, when the adjacent links are (4) and (9), the node number 12 is acquired as the shared node. Next, if there is a link holding the shared node other than the adjacent link (step 40), it is determined as a point junction (step 5).
0). Here, if the link other than the adjacent link does not hold the shared node, a repetitive process of moving to another adjacent link is performed on the link defining the block. For example, the case where the adjacent links are (17) and (18) can be considered. The processing from step 10 to step 60 is performed on all the blocks constituting the assigned area (step 7).
0), the presence or absence of point joining is determined.

The above-described enclave determination method of the present invention can be incorporated into various area planning systems for achieving a specific purpose, and the result of the determination of the presence or absence of an enclave can be reflected in the area planning. For example, by using it for area setting such as sales and visits, it is possible to easily set an area with no enclave and good patrol efficiency.

For example, by moving a part of the other assigned area to the assigned area at the point joint of the assigned area, the division with the other area is reset so as to eliminate the point joined area, and the area information is set. Rewrite. By repeating such processing, all the assigned areas are reset so that the assigned area is not divided by the other assigned areas and no point junctions exist in each assigned area. Can be.

FIG. 15 shows an enclave discrimination process described with reference to FIG. 9 and a point joining discrimination process described with reference to FIG. 14 performed on the assigned area. Alternatively, in the case where it is determined as a point junction in the point junction determination processing in FIG. 14 and is determined as an enclave, the area in charge of each person in charge of sales or visits is reset and all target areas are divided. It is an example.

[0048]

According to the present invention, it is possible to easily determine whether or not a so-called enclave, in which an area having a specific purpose is divided by another area, occurs.

Further, according to the present invention, it is possible to determine the presence or absence of an enclave by using a boundary vector defining a district without defining the adjacency of the districts constituting the area. The trouble of creating the adjacency relationship data can be saved.

Further, according to the present invention, since a boundary vector defining a block is used, a commercially available block vector map can be used, and it is not necessary to create block definition data independently.
The efficiency of map data creation can be improved.

The enclave determination method according to the present invention can be applied to various area planning systems for achieving specific purposes. For example, an area without an enclave can be set efficiently by using it for area setting such as sales and visits. In particular, according to the present invention, it is possible to determine a connection part of a block configuring the area, and to avoid this, it is possible to set an area with high traveling efficiency.

[Brief description of the drawings]

FIG. 1 is a configuration diagram of an enclave discrimination device according to an embodiment of the present invention.

FIG. 2 is a display example of an area having a specific purpose.

FIG. 3 is an example of area information.

FIG. 4 is a diagram showing a flow of creating an area network.

FIG. 5 is an example of data processed in the creation flow of FIG. 4;

FIG. 6 is a data display example when a network is created in an area where an enclave occurs.

FIG. 7 is an example of an adjacency matrix display showing the connection status of each point constituting the created network.

FIG. 8 is a display example of a visiting flag indicating whether or not processing has been performed on each point constituting the created network.

FIG. 9 is an enclave discrimination processing flow.

FIG. 10 is a flow of a visit process included in the enclave determination process.

FIG. 11 is an example of a transition of a visit flag by a visit process.

FIG. 12 is an example in which a point connection part shift occurs in a block configuring an area.

FIG. 13 is a data display example of a point connection part of a block.

FIG. 14 is a flowchart of a point junction discrimination processing of a block.

FIG. 15 is a display example showing that an area can be set using the present invention so that an enclave does not occur.

[Explanation of symbols]

REFERENCE SIGNS LIST 1 input device 2 area information input device 3 storage device 4 area network creation means 5 enclave confirmation means 6 enclave determination device 7 output device

Claims (12)

[Claims] 1. A method for judging the presence or absence of an enclave in an area management system for managing a plurality of areas each consisting of a set of blocks, comprising: creating a network of a specific area; and configuring a network of the specific area. Searching for a connection relationship between the points to be connected, and determining whether or not the specific area is separated by another area according to whether the points are connected or divided, and determining whether or not there is an enclave. A method for determining an enclave in an area management system. 2. The network according to claim 1, wherein a network of the specific area is created based on a boundary vector defining each block constituting the specific area.
An enclave determination method in an area management system. 3. A method for judging the presence or absence of an enclave in an area management system for managing a plurality of areas each consisting of a set of blocks, wherein a boundary vector defining each block constituting a specific area is provided. The network of the specific area is created, the connection relation of each point constituting the network of the specific area is searched, and the presence or absence of an isolated subnetwork is determined. A method of determining an enclave in an area management system, characterized by determining. 4. The network according to claim 1, wherein a boundary vector constituting the network created for the specific area, and a start point and an end point constituting the boundary vector are unique within the network of the specific area. An enclave discrimination method in an area management system, characterized by giving an identifier. 5. The edge according to claim 1, wherein a starting point and an ending point of a boundary vector forming the network created for the specific area are arranged on a two-dimensional array, and a side forming the network between each pair of points. A method for determining an enclave in an area management system, characterized in that it checks whether or not there is any, and creates an adjacency matrix indicating a connection state between points. 6. The method according to claim 5, wherein a connection state between points constituting the network of the specific area indicated by the adjacency matrix is checked, and a processed flag is added to the point at which the connection is confirmed. An enclave discrimination method in an area management system, comprising an array of visit flags. 7. A step according to claim 5, wherein an arbitrary starting point is determined from points constituting the network of the specific area, and the process is advanced to a point proceeding from the starting point while referring to the adjacency matrix. And a step of returning to a point where progress can be made when there are no more points to progress, a step of proceeding from the point where the point has returned to a point where it can proceed again. A method for determining an enclave in an area management system, comprising: 8. The network according to claim 7, wherein the number of sub-networks constituting the network in the specific area is determined, and if the number is 2 or more, the network includes:
Determining that there is an isolated sub-network, and determining that there is an enclave in the specific area;
An enclave determination method in an area management system. 9. The method according to claim 8, wherein after confirming that there is no enclave, it is determined whether or not there is a portion where the block in the specific area is connected by a point. A method for determining an enclave in an area management system, characterized in that: 10. A process according to claim 9, wherein the step of judging whether or not there is a point connection part in the block constituting said specific area is performed by taking out two adjacent vectors by using a boundary vector defining the block. Obtaining an orientation vector in the network of the specific area; determining whether or not the opposite boundary vector has been obtained; and determining whether or not the two boundary vectors have an inverse vector. Obtaining a shared point of the vector;
Judging whether or not a vector holding the acquired common point in addition to the two boundary vectors exists in the network constituting the specific area; and setting the common point to a position other than the two boundary vectors. If there is also a vector in the network of the specific area, the block is a point connection, applying this processing to all adjacent boundary vectors of the block, and performing a series of the processing on the specific area. An enclave discrimination method in an area management system, comprising a step of applying to all constituent blocks. 11. An enclave presence / absence determination device in an area management system for managing a plurality of areas each consisting of a block of blocks, wherein a boundary vector defining each block constituting a specific area is provided. Means for creating a network in the specific area; and means for searching for a connection relationship between points constituting the network in the specific area to determine the presence or absence of an isolated subnetwork. An enclave discriminating device in an area management system, characterized in that when there is, an enclave is determined. 12. An area management system for managing a plurality of areas each consisting of a block of blocks, comprising: an input device; an area information input device for inputting information such as area vector information; A storage device for storing, a means for creating a network of a specific area, an enclave determination device including an enclave confirmation means for confirming the presence or absence of an enclave in the specific area by the created network, and a result of judging the presence or absence of an enclave. An area management system comprising an output device for outputting.