JP5094904B2 - Regional information retrieval server and regional information retrieval method - Google Patents

Description

  The present invention relates to an area information search server, an area information search system, and an area information search method, and more particularly, to a search for area information around a central point based on position information from a user, in a mesh structure hierarchized in multiple layers. The present invention relates to an area information search server, an area information search system, and an area information search method for searching for area information by changing the search mesh order.

  In the regional information search service provided on the Internet, map data representing the whole of Japan or the whole world is divided into meshes of a predetermined range and managed, and included in meshes corresponding to location information entered by the user and surrounding meshes. Output POI as a search result. The mesh has a plurality of hierarchical structures, and the higher the order, the more detailed the region is targeted, and the higher order mesh is included in the lower order mesh.

  As a prior art about the method of acquiring the regional information located in the surrounding mesh, there was Patent Literature 1. In Patent Document 1, when data included in a region divided by a mesh of a specific order is extracted for information search using a mesh of a specific order, the mesh search order is determined clockwise or counterclockwise. is doing.

JP 2004-178191 A

  However, Patent Document 1 is intended for information retrieval using a mesh of a specific order, and when there is little area information included in the mesh, such as in a rural area or a mountainous area, a considerable amount of mesh is required for a high-order mesh. There is a problem in that it is necessary to calculate the mesh, and the processing load is increased.

  Further, the m-order center mesh, the m-1 order mesh including the m order center mesh, the m-2 mesh including the m-1 order mesh,. When trying to acquire regional information, the high-order center mesh corresponding to the position information specified by the user is not always located at the center of the low-order mesh, and the position from the m-order center mesh is biased. The plurality of pieces of regional information included in the low-order mesh have a problem that the distance from the center mesh varies greatly depending on the location of the regional information.

  The present invention has been made in view of the above problems, and in a mesh structure hierarchized into a plurality of orders, the order of meshes to be searched is changed according to distance, and regional information such as regions and mountainous areas is obtained. Provided is a region information search server, a region information search system, and a region information search method capable of searching even if sparse, without applying a processing load, and making it possible to search the region information with as little deviation from the central mesh as possible. For the purpose.

  According to the first aspect of the present invention, the regional information search server divides the entire map into a plurality of meshes, and the first to m-th order (m Is a mesh structure hierarchized in meshes of order of 2 or more), a POI information database that stores POI information including a POI identifier that uniquely identifies each POI, and a mesh in which the POI identifier and each POI are located A POI search database for storing information for specifying the information and a section (i-1) (i = 1) consisting of a center mesh of the initial search mesh order indicated by the requested position information, or a center mesh of each corresponding search mesh order Is a set of one or more adjacent meshes separated from each other in the latitude or longitude direction with respect to the search mesh order, and the corresponding search mesh order A section i consisting of a mesh of the current search mesh degree k of a single rectangle just outside the outermost mesh of the section j (j = 1 to i-1, i is an integer of 2 or more) Based on the number of meshes of the mesh of the current search mesh order k included in the section i extracted by the section generation unit, the section generation unit that generates based on the mesh structure, and the corresponding search mesh order in the subsequent section A search mesh order change determination unit that determines whether or not to change, and each mesh and map range of the order k included in the category i when the search mesh order change determination unit determines to change the search mesh order Whether or not the k-th order mesh overlaps with the map range and includes the mesh of degree k other than the mesh of section i generated by the section generation unit. And a complementary determining unit that determines whether or not to complement, and when the complementary determining unit determines to complement, the complementary mesh of the order k including the mesh of the order k other than the mesh of the section i A complementary mesh identification unit to be identified; a segment regeneration unit that merges the complementary mesh with the segment i generated by the segment generation unit to form the segment i; and searches the POI search database to obtain the segment i The POI set retrieval unit for obtaining the POI set Ri located in the mesh to which the mesh belongs and the POI set Ri stored in the POI information database from the POI set Ri acquired by the POI set search unit. A POI acquisition unit, and the segment generation unit determines that the search mesh order change determination unit changes the search mesh order, Local search server and generates a divided i + 1 to k-1 as the current search mesh orders is provided.

  According to a second aspect of the present invention, in the first aspect of the present invention, the classification j (j = 1 to i−1, i is an integer of 2 or more), which is a set of meshes of the corresponding search mesh orders. The outermost k-order mesh is a set of n × n meshes in the latitudinal direction and n in the longitude direction, and the search mesh order change determination unit determines that n is equal to or greater than a predetermined value no. A regional information search server that determines to change the search mesh order mesh in the subsequent sections is provided.

  According to a third aspect of the present invention, in the second aspect of the present invention, each l (l = 2 to m−1) degree mesh is divided into 2 × 2 (l + 1) degree meshes, and the complementary The mesh specifying unit for the meshes of the order k and the n of the outermost circumference of the section j (j = 1 to i, i is an integer of 2 or more) that is a set of meshes of the corresponding search mesh orders. When n is an even number, (n + 2) × (n + 2), and when n is an odd number, classify the complement types indicated by the set of meshes of order k including the mesh of order k of (n + 1) × (n + 1) A regional information search server that determines a complementary pattern and identifies the complementary mesh is provided.

  According to the invention of claim 4, in the invention of claim 1, the partition regeneration unit generates the partition i + 1 as belonging to the partition i + 1 without merging the complementary mesh with the partition i, The section generation unit is provided with an area information search server that generates the next section i + 2 of the section i + 1 to which the complementary mesh belongs, with the order k-1 as the current search mesh order.

  According to the first or eighth aspect of the invention, the closer to the center indicated by the requested position information, the higher-order mesh is searched for regional information, and the farther away from the center, the lower-order mesh is searched for regional information. Therefore, even if the distribution of regional information is sparse, such as in rural areas and mountainous areas, it is possible to calculate the appropriate range of mesh without applying computational load and obtain the required number of data Become. Since the complementary mesh is merged with the section i, it is possible to prevent the position of the searched area information from being biased.

  According to the second aspect of the invention, since the section j (j = 0 to i) is composed of a single n × n mesh, the section in which the search mesh order is changed from the center mesh indicated by the requested position information. It becomes possible to make the distance to the (k + 1) -order mesh of (i + 1) approximately equal, and it is possible to effectively prevent a deviation from occurring in the distance from the center of the searched area information.

  According to the third aspect of the present invention, when the outermost k-th order mesh of the section j (j = 0 to i) and the outermost n is an even number, (n + 2) × (n + 2), when n is an odd number, According to the n + 1) × (n + 1) mesh, the complementary pattern is determined and the complementary mesh is determined. Therefore, the distance from the center mesh to the segment i after the search mesh order change can be made approximately equal. It is possible to more effectively prevent a deviation in the distance from the center of the searched area information.

  According to the fourth aspect of the present invention, since the complementary mesh is not merged with the section i and is set to the section (i + 1), it is possible to prevent a variation in distance from the center mesh of the regional information from occurring.

  According to the invention described in claim 5, since the section i is sequentially expanded until a predetermined number of cases are searched, and the search is performed in a wide area with a lower order of the search mesh as the distance from the center increases, the distribution of regional information is sparse. Even in this case, it is possible to obtain a necessary number of data by calculating a mesh in an appropriate range without effectively applying a calculation load.

  According to the invention described in claim 6, since the mesh coordinates of the adjacent mesh of the section i are calculated from the mesh coordinates of the center mesh of the initial search mesh order, the addition / subtraction and the power of 2 are calculated from the mesh coordinates of the center mesh, Since the mesh coordinates of the adjacent mesh are calculated, the section i can be searched at high speed even when the search mesh order of the section is changed.

1 is a schematic configuration diagram of a regional information search system according to an embodiment of the present invention. It is a functional block diagram of the portable terminal device in FIG. It is a functional block diagram of the area information search server in FIG. FIG. 4 is a functional block diagram of a POI list acquisition unit in FIG. 3. It is a functional block diagram of the mesh coordinate calculation part in the division i in FIG. It is a block diagram of the POI information table in FIG. It is a block diagram of the POI search table in FIG. It is a figure for demonstrating the multilevel mesh structure by embodiment of this invention. It is a figure which shows a secondary mesh and a secondary mesh number. It is a figure which shows a n-th order (n is an integer greater than or equal to 3) mesh and a n-th order mesh number. It is a figure which shows the calculation method of the mesh coordinate of an adjacent mesh. It is a figure which shows the calculation method of the mesh coordinate of an adjacent mesh. It is a figure which shows the complementary pattern in the case of an even number. It is a figure which shows the complementary pattern in the case of an odd number. It is a figure which shows the area information search method (in the case of merge). It is a figure which shows the local information search method (when using as a division i). It is a flowchart which shows the area information search method. It is a flowchart which shows the production | generation method of the division i in FIG. It is a sequence chart which concerns on POI list acquisition between a portable terminal device and a regional information search server. It is a figure which shows distribution of POI.

  FIG. 1 is a configuration diagram of a regional information search system 1 according to an embodiment of the present invention. As shown in FIG. 1, a regional information search system 1 includes a mobile terminal device 2, a radio base station 4, a base station control device 6, a communication network 8 such as the Internet, a regional information search server 10, and a POI information search table. 12 and a POI search table 14.

  The mobile terminal device 2 is a mobile terminal such as a mobile phone, a smart phone, or a PDA (Personal Digital Assistants), and the local information is transmitted through a mobile network such as the radio base station 4 and the base station controller 6 and a communication network 8 such as the Internet. Connected to the search server 10. The mobile terminal device 2 communicates with the area information search server 10 according to a predetermined communication protocol, for example, an HTTP protocol. Further, the mobile terminal device 2 acquires position information of latitude and longitude from a GPS (Global Positioning System) (not shown) and the radio base station 4. The communication network 8 is a communication network such as the Internet.

  FIG. 2 is a functional block diagram relating to acquisition of area information (hereinafter referred to as POI (Point Of Interest)) of the mobile terminal device 2 in FIG. As shown in FIG. 2, the functional block related to POI acquisition of the mobile terminal device 2 includes an event catch unit 52, a position information acquisition unit 54, a request unit 56, a response reception unit 58, and a data display unit 60. The corresponding program stored in the storage device is loaded into the main memory and realized by the execution of the program by the CPU.

  The event catch unit 52 catches various events such as the click operation of the corresponding character part in which the link information related to the acquisition of the position information or the POI request is set, and the acquisition of the position information or the POI request Necessary link information is output as a parameter to the position information acquisition unit 54 and the request unit 56.

  When the location information acquisition unit 54 is instructed to search for area information from the event catch unit 52, the location information acquisition unit 54 performs radio communication with the radio base station 4 or a GPS (not shown) according to a predetermined protocol, and acquires location information of latitude and longitude. The genre in which the position information and link information are set is output to the request unit 56, and a POI request is instructed.

  The request unit 56 includes a POI request unit 70, and requests the area information search server 10 for information corresponding to the link information when clicking to request a POI.

  The POI request unit 70 designates the position information acquired from the position information acquisition unit 54, and requests the local information search server 10 to transmit the POI list located in the adjacent mesh of the center mesh indicated by the position information (for example, , HTTP request).

  The response receiving unit 58 receives a response to the request from the regional information search server 10 and includes a POI list receiving unit 76 and the like. The POI list receiving unit 76 receives a POI list that is a response to the POI list request and outputs the POI list to the data display unit 60.

  The data display unit 60 displays the response output from the response receiving unit 58 on the screen, and has a POI list display unit 82. The POI list display unit 82 displays the POI list received by the POI list receiving unit 76 on the screen.

  The regional information search server 10 has a POI information table 12 and a POI search table 14 and has the following functions.

  (1) FIG. 8 is a diagram showing a mesh structure. FIG. 9 is a diagram showing secondary mesh numbers. FIG. 10 is a diagram showing the mesh numbers of the third-order to m (m is an integer of 3 or more) order mesh. As shown in FIG. 8, the entire map is divided into a plurality of meshes, and is hierarchized into a plurality of stages in which the sizes of the meshes differ according to the scale. For example, the primary mesh is divided into 8 × 8 secondary meshes, the secondary mesh is divided into 2 × 2 tertiary meshes, the tertiary mesh is 2 × 2 quaternary mesh, and the quaternary mesh is 2 ×. 2 quintic meshes,...

  In the primary mesh, if the latitude of an arbitrary point included in the primary mesh is lat and the longitude is lon, the decimal value (integer) of the 2-digit latitude part of the primary mesh number is lat × 1.5, The decimal value (integer) of the 2-digit longitude part of the primary mesh number is (lon-100).

  As shown in FIG. 9, the mesh number of the secondary mesh is given 2 digits, and the upper 1 digit latitude part is assigned a number from 0 to 7 so that the value increases as the latitude increases. It has been. For example, 0 is given to the south of the secondary mesh, and 7 is given to the north. A number from 0 to 7 is assigned to the longitude part of the lower one digit so that the value increases as the longitude increases. For example, 0 is assigned to the west of the secondary mesh, and 7 is assigned to the east.

  As shown in FIG. 10, the i-th order (i is 3 or more) mesh is divided into 2 × 2, and 0 is assigned to the lower left corner, 1 is assigned to the lower right corner, 2 is assigned to the upper left corner, and 3 is assigned to the upper right corner. As a result, when a decimal value from 0 to 3 is converted to a 2-bit binary value, the upper 1 bit is the latitude part, the lower two meshes are 0, the upper two mesh numbers are 1, and the latitude is large. The value of the mesh number is increased by 1. The lower 1 bit is the longitude part, the left two meshes are 0, the right two meshes are 1, and the value of a mesh with a large longitude is 1 larger. The primary mesh and the secondary mesh are meshes determined by the Ministry of Internal Affairs and Communications, and the tertiary and subsequent meshes are extended meshes.

  (2) A section j (j = 0, 1,...) Is generated recursively. That is, equations (1) and (2) to be described later of the center mesh of the highest order (initial search mesh order) to which the point indicated by the position information belongs from the position information (latitude and longitude) transmitted from the portable terminal device 2 together with the POI list request. ) To calculate the mesh coordinates composed of the latitude code and longitude code of the highest order center mesh where the point indicated by the position information is located, and create the mesh coordinates of the center mesh as the section i (i = 0). It is determined whether or not to change the search mesh order of the section i from the number of meshes of the search mesh order of the section i-1 (i = 0,...). The section i means a set of meshes and a set of mesh coordinates that specify the meshes.

  When there is no need to change the search mesh order of the section i, the mesh i of the meshes on the outer periphery of the mesh belonging to the section i-1 is obtained with the same search mesh order k as the section i-1, and the section i is generated. If it is necessary to change the mesh order of the section i to (k−1), it is necessary to complement the k-th mesh number of the k-order mesh at the northwest end, northeast end, southwest end, and southeast end of the section i-1. Determine whether or not. The case where complementation is necessary means that when the k-order mesh region of the section i-1 is divided by the k-1 order mesh, the k-1 order mesh is a k-order mesh other than the k-order mesh of the section i-1. Including.

  When section i is generated by changing the order of k-1 search mesh, another area is included between the area of section i-1 of search mesh order k-1 and the area of section i. The section i (i = 0, 1,...) Is generated without a gap, and n k−1 order meshes in the latitude direction and n k−1 order meshes in the longitude direction ( Hereinafter, a complementary mesh is generated so as to be n × n mesh). The reason why the n × n mesh is used is that the distance from the center mesh to the k−1th order mesh of section i is approximately equal.

  If there is a need for completion, when the k-order search mesh of section i-1 is composed of n × n meshes, any one of the northwest end, the northeast end, the southwest end, and the southeast end depending on whether n is an even number or an odd number A complementary pattern is determined from the k-th mesh number of one k-th mesh and a complementary mesh is obtained. Complementary meshes include the k-th order mesh of section i-1, when n is an even number, (n + 2) × (n + 2) mesh, and when n is an odd number, (n + 1) × (n + 1) mesh and To be determined. This is because the center mesh of the initial search mesh order is set to the center of the set of k−1 order meshes composed of the division i−1 and the complementary mesh as much as possible to reduce the deviation of the distance between the meshes.

  The complementary mesh is merged into section i-1 or used as section i. Merging the complementary mesh into the section i-1 means that the complementary mesh is included in the section i-1. Using as the section i means generating the section i including only the complementary mesh. A section consisting of (k-1) -order meshes on the outer periphery of section i-1 (when the complementary mesh is merged with section i-1) or section i-1, i (when the complementary mesh is used as section i) i (when merging complementary meshes) or section i + 1 (when using complementary mesh as section i) is generated. The section i (i = 0, 1,...) Is sequentially generated recursively. Each section i (i = 0, 1,...) Only needs to be able to specify a mesh belonging to section i, but here, mesh coordinates are used.

  (3) The mesh coordinates of the center mesh of the initial search order included in section 0 and the mesh coordinates of adjacent meshes included in section i (in the case of i = 1, 2,...) Are converted into pack codes described later. Then, a list of pack codes is created, narrowing down by the POI search table 14 and table combination with the POI information table 12 are performed using the pack code list as a key, and a POI set Ri (i = 0, 1, ...) is acquired. The POI set Ri (i = 0, 1,...) Is sorted in ascending order based on a predetermined key, and a predetermined number of items are sequentially ordered from the sorted POI set Ri (i = 0, 1,...). (Hereinafter, N cases) is acquired, and N POI lists are returned to the mobile terminal device 2.

  If there are no N items in the section i, the mesh coordinates of the adjacent meshes included in the next section i + 1 are converted into pack codes, and the narrowing by the POI search table 14 and the POI information table are performed using the pack code list as a key. The table join with 12 is performed to obtain the POI set Ri + 1 in the section i + 1. The POI set Ri + 1 is sorted in ascending order based on a predetermined key, and a predetermined number (hereinafter referred to as N) is acquired from the sorted POI set Rj (j = 0, 1,..., I + 1). To do.

  If N cannot be acquired, the same processing is performed for the section i + 2,..., And the POI set Rj (j = 0, 1,..., I), Ri + 1, Ri + 2,. Get the records. That is, in the POI set Rj (j = 0 to i), the POI set Rj is searched until Σ | Rj | (j = 0 to i), | Rj | is the number of POI sets Rj)) ≧ N. . In the N searches, section 0 has the highest priority and section i has priority over section i + 1. As a result, as the distance from the center mesh of the initial search mesh order increases, the search mesh order decreases and the area information is searched over a wide area.

  The hardware configuration of the regional information search server 10 includes a CPU, a display device, an input unit, a ROM, a main memory, a storage medium, an I / O controller, a communication interface unit, and the like.

  As illustrated in FIG. 3, the regional information search server 10 includes a request reception unit 150, a POI list acquisition unit 152, and a response transmission unit 156.

  FIG. 6 is a configuration diagram of the POI information table 12. As shown in FIG. 6, each POI has a POI ID that uniquely identifies the POI, a latitude / longitude where the POI is located, a POI name, a POI genre, a POI telephone number, and a URL that provides detailed information about the POI (not shown) Includes thumbnail images.

  FIG. 7 is a block diagram of the POI search table 14 in FIG. As shown in FIG. 7, the POI search table 14 is a table for associating POIIDs and pack codes, and stores the POIID of each POI and the pack code of the n (highest order) order mesh in which the POI is located. The Hereinafter, mesh coordinates and pack codes for specifying each mesh will be described.

  The latitude code Ca of the mesh coordinates of the m-th mesh is obtained from the latitude of the point located on the mesh by the following formula (1) (m is an arbitrary order of 3 or more). Let latitude be lat. If latitude is specified in degrees / minutes / seconds, minutes / seconds are converted to degrees.

Ca = FLOOR (((lat−10) × 3) ÷ 2) × (i (i = 2 to m) value obtained by multiplying the number of longitudes of the next mesh from i = 2 to m)) (1 )
FLOOR () is a function that truncates the decimal part.

If the secondary mesh divides the primary mesh into 8 × 8 and the i (i = 3 to m) order mesh divides the (i−1) (i = 3 to m) order mesh into 2 × 2, the latitude The number of secondary meshes in the direction = 2 ^{3, and the} number of i (i = 2 to m) order meshes in the latitudinal direction is 2, so the number of i (i = 2 to m) order meshes in the latitudinal direction I = 2 to ^m is 2 ³ × 2 ^(m−2) = 2 to the power of (m + 1),
Ca = FLOOR ((((lat-10) × 3) ÷ 2) × (2 to the (m + 1) th power))
It becomes.

  The longitude code Cb of the mesh coordinates of the m-th mesh is obtained from the longitude located on the mesh by the following formula (2). Let longitude be lon. Here, if the longitude is specified in degrees / minutes / seconds, the minutes / seconds are converted into degrees.

Cb = FLOOR ((lon-100) × i (i = 2 to m) value obtained by multiplying the number of longitudes of the next mesh from i = 2 to m) (2)
FLOOR () is a function that truncates the decimal part.

For example, when the secondary mesh divides the primary mesh into 8 × 8 and the i (i = 1 to m) th mesh divides the (i−1) (i = 1 to m) th mesh into 2 × 2. To do. In this case, since the number of secondary meshes in the longitude direction = 2 ³ and the number of longitude directions in the i direction (i = 3 to m) in the longitude direction are 2, i (i = 2 to m in the longitude direction). ) The value obtained by multiplying the number of the next mesh from i = 2 to ⁿ is 2 ³ × 2 ^(m−2) = 2 to the (m + 1) th power)
Cb = FLOOR ((lon−100) × (2 to the power of (m + 1)))
It becomes.

  Latitude code Ca = C1aC2aC3a ... C7aC8a ... Cma, longitude code Cb = C1bC2bC3b ... C7bC8b ... Cmb, each degree i (i = 1 to m) from mesh coordinates of latitude code Ca and longitude code Cb ) Of the latitude portion Cia and the longitude portion Cib, the latitude portion Cia is set to the upper bit side of the longitude portion Cib, the primary is set to the most significant side, and the order is combined in ascending order, and converted into a pack code.

  That is, assuming that the latitude code Ca = C1aC2aC3a ... Cma and the longitude code Cb = C1bC2bC3b ... Cmb, the pack code P1aP1bP2aP2bP3 ... Pm is as follows.

  P1a = C1a, P1b = C1b, P2a = C2a, P2b = C2b, P3 = C3aC3b, P4 = C4aC4b, P5 = C5aC5b, P6 = C6aC6b, P7 = C7aC7b,..., Pm = CmaCmb.

  A request receiving unit 150 in FIG. 3 receives a request from the mobile terminal device 2 and includes a POI list request receiving unit 160. The POI list request receiving unit 160 receives the POI list request and outputs the latitude / longitude position information to the POI list acquisition unit 152.

  FIG. 4 is a block diagram of the POI list acquisition unit 152 in FIG. 3. The center mesh coordinate calculation unit 190, the mesh coordinate calculation unit 192 within the section i, the POI set Ri search unit 194, the POI set Ri sort unit 196, N cases An acquisition unit 198 and a result generation unit 202 are included.

  The center mesh coordinate calculation unit 190 uses the latitude and longitude received by the POI list request reception unit 160 according to the above formulas (1) and (2), and the initial search mesh order (for example, the highest order) including the point of the latitude and longitude. The mesh coordinates consisting of the latitude code and longitude code of the mesh are calculated.

  The intra-section i mesh coordinate calculation unit 192 generates the section i (i = 1, 2,...) Recursively. As illustrated in FIG. 5, the section i generation unit 203 and the search mesh order change are performed. It has a determination unit 204, a complementary mesh determination unit 205, a complementary mesh identification unit 206, and a segment i regeneration unit 207.

  The section i generator 203 generates the section i (i = 0, 1,...) Recursively. That is, the above formulas (1) and (2) of the center mesh of the highest order (initial search mesh order) to which the point indicated by the position information belongs from the position information (latitude and longitude) transmitted from the portable terminal device 2 together with the POI list request. ) To create a mesh coordinate section i (i = 0) of the center mesh calculated by the center mesh coordinate calculation unit 190. For the category i (i = 1,...), The category i is determined as follows depending on whether or not the search mesh order change determination unit 204 described later determines that the search mesh order k is not changed. Is generated.

  (A) When it is determined by the search mesh order change determination unit 205 that the search mesh order k is not to be changed, a single (n + 2) × is placed on the outermost periphery of the n × n k-order mesh of the section i−1. A section i consisting of (n + 2) adjacent meshes is generated as follows.

(A) When the search mesh order is the same as the initial search mesh order FIGS. 11 and 12 are diagrams illustrating a method of calculating mesh coordinates of an adjacent mesh. In this example, the case of a 10th-order mesh is shown. Assuming that the latitude and longitude received from the mobile terminal device 2 are “13.754394 degrees east longitude and 35.669921 degrees north latitude”, the above-described equations (1) and (2) were calculated.
Latitude code is 100110100000000010 (referred to as Ca001010)
The longitude code is 10011111000001001 (described as Cb001001)
It becomes.

  The pack codes P1aP1bP2aP2bP3P4P5P6P7P8P9P10 are P1a = 100110, P1b = 100111, P2a = 100, P2b = 110, P3 = 00, P4 = 00, P5 = 00, P6 = 00, P7 = 11, P8- = 00, P9 = 10, P10 = 01.

  As described above, the mesh code of the center mesh M33 where the latitude and longitude points are located is 53394600003021 (hereinafter referred to as M003021, M = 53394600).

  From Equation (1), the latitude code is an m-order (for example, 10th-order) mesh in which the primary meshes are arranged to the north from a point including a point of 10 degrees north latitude, and the scale is equal to the primary mesh. When the primary mesh is divided, the number of m-order meshes in the latitudinal direction up to the 10th-order mesh including the point where the north latitude is lat is −1, so i-th tenth meshes are separated from the central mesh M33 in the latitudinal direction. The latitude code of the mesh to be obtained is a value obtained by adding or subtracting the binary value of i to the latitude code Ca001010 of the center mesh M33 in accordance with the latitude direction.

  From Equation (2), the longitude code is an m-order (for example, 10th-order) mesh in which primary meshes are arranged eastward from a point including a point of 100 degrees east longitude and the scale is equal to the primary mesh. When the primary mesh is divided, the number of m-th meshes in the longitude direction to the m-th mesh including the point where the longitude is lon is −1, so i-th tenth meshes are separated from the center mesh M33 in the longitude direction. The longitude code of the mesh to be obtained is a value obtained by adding or subtracting the binary value of i to the latitude code Ca001010 of the center mesh M33 according to the longitude direction.

  Therefore, as shown in FIG. 11, the latitude code of the mesh M11 is Ca001000, the longitude code is Cb000111, the mesh code is M002111, the latitude code of the mesh M12 is Ca001000, the longitude code is Cb001000, the mesh code is M003000, and the latitude code of the mesh M13. Is Ca001000, longitude code is Cb001001, mesh code is M003001, mesh M14 latitude code is Ca001000, longitude code is Cb001010, mesh code is M003010, mesh M15 latitude code is Ca001000, longitude code is Cb001011, mesh code is M003011 . For the mesh Mij (i = 2 to 5, j = 1 to 5), the latitude code and the longitude code are obtained in the same manner.

  As shown in FIG. 12, when the m-th order center mesh M33 is an m-th order mesh, meshes M22, M23, M24, M34, M44, M43, M42, M32, M22 belonging to the section 1 in which the m-th order mesh is separated by one. 1 is added to or subtracted from the mesh coordinates of the center mesh. Further, the outer meshes M22, M23, M24, M34, M44, M43, M42, M32, and M22 of the outer circumference of the section 1 are meshes M11, M12, M13, M14, M15, M25, M35, M45, M55, The mesh coordinates of M54, M53, M52, M51, M41, M31, and M21 are calculated by adding / subtracting 1 to / from the mesh coordinates of the meshes M22, M23, M24, M34, M44, M43, M42, M32, and M22 of section 1. .

As described above, if the section i is an m-th order mesh, the mesh coordinates of the adjacent meshes of the section i are calculated by adding or subtracting the number of m-th order meshes separated from the m-order center mesh to the m-order center mesh coordinates. Can do. Note that the (m−1) th order mesh indicated by a solid line including each mth order mesh Mij (i = 1 to 5, j = 1 to 5) can be calculated from the mesh coordinates / 2 of the mesh Mij. In general, the mesh coordinates of the k-th order center mesh are mesh coordinates / 2 ^(mk) of the m-order center mesh.

(B) When the search mesh order k is different from the initial search mesh order m When the search mesh order is different from the initial search mesh order m due to the change of the search mesh order in the previous classification, the mesh coordinates of the k-th order center mesh are used as the initial search mesh It is calculated by dividing the mesh coordinates of the center mesh of the order by the power of 2 (initial search mesh order-k). The mesh of section i is n × n.

  When n is an odd number, the same as (a) above, the number of meshes of the k-th order mesh from the k-th order center mesh to the section i (n−1) / 2 is the latitude code and longitude code of the mesh coordinates of the k-th order center mesh. Is added to or subtracted from to calculate the mesh coordinates of section i.

  When n is an even number, the section i is generated so as to go around the south-west end and the north-east end of the k-th order mesh of the k-th section i-1. The rounding algorithm obtains the mesh coordinates of the k-th order mesh of section i by tracing the adjacent mesh by adding / subtracting the k-th order mesh coordinates from the southwest end.

(B) When the search mesh order change determination unit 205 determines that the search mesh order k is to be changed. Section i-1 (when merging with section i-1) or section i-1, i-2 (section i) (N / 2 + 2) × (n / 2 + 2), (n / 2 + 3) × (n / 2 + 3) or ((n + 1)) on the outer periphery of the n × n k-th order mesh of the outermost periphery A segment i of the k−1 order mesh of / 2 + 2) × ((n + 1) / 2 + 2) is generated as follows.

(A) When the section i is an odd-numbered odd-numbered k-1th order mesh The mesh coordinates of the k-1st order center mesh are the initial search mesh order and the mesh coordinates of the center mesh are the 2nd power of the initial search mesh order-k + 1 Calculate by dividing. Alternatively, the k-th order center mesh is divided by 2 to calculate the mesh coordinates of the k-1 order center mesh. By adding or subtracting the number of k-1 order meshes separated from the k-1 order center mesh to the k-1 order mesh of the section i to the mesh coordinates of the k-1 order center mesh, the mesh coordinates of the adjacent mesh of the section i are obtained. calculate.

(B) When section i is an even-numbered x even-numbered k-1 order mesh k-1 order section i-1 (when merging with section i-1) or sections i-1, i-2 (as section i) The mesh coordinates of the k-th order mesh are obtained by dividing the k-order mesh coordinates of the south-west end and the north-east end by 2 by dividing the mesh coordinates of the k-order mesh in the case of use, and a section i is generated so as to go around the outside. The rounding algorithm obtains the mesh coordinates of the k−1th order mesh of section i by tracing the adjacent mesh by adding and subtracting the mesh coordinates from the southwest end.

  The search mesh order change determination unit 204 determines whether there is a change in the search mesh order based on the number of outermost meshes in the section i-1 as follows.

  If the current search mesh order k is less than or equal to the minimum order k_min (for example, k_min = 2), the search mesh order k is not changed. In the present embodiment, when the low-order mesh is divided into 2 × 2 high-order meshes, the search mesh order can be easily changed, and the primary mesh is divided into 8 × 8 meshes. It is.

  Assume that the mesh of the section i-1 is n × n. It is determined whether n is equal to or greater than a predetermined value n0 indicating that the mesh of the section i-1 is separated from the center mesh of the initial search mesh order by a certain distance. If n is greater than or equal to n0, it is determined that the search mesh order has changed, and the current search mesh order is reduced by one. If n is less than n0, the mesh of section i-1 is not separated from the center mesh of the initial search mesh order by a certain distance, so it is determined that the search mesh order has not changed, and the current search mesh order k is updated. do not do.

  Although the predetermined value n0 is not particularly limited, if the segment i is an n1 × n1 mesh and n1 is an odd number, the k−1 order center mesh after the change of the search mesh order is the center of the mesh of the segment i Therefore, the distance from the center mesh to the k-th mesh of the section i can be made substantially equal. For example, assuming that n0 = 4 multiple + 1, when the k-order mesh of the section i-1 is n0 × n0, k−1 includes the outermost map range including the section i-1 and a complementary mesh described later. The next mesh number is (multiple of 4 + 1 + 1) / 2 (= (multiple of 2 + 1)) × (multiple of 2 + 1), which is an odd number. Therefore, the k−1th order mesh of section i is odd × odd.

  FIG. 13 and FIG. 14 are diagrams showing a complement pattern for determining whether or not complement is necessary and a complement mesh. FIG. 13 is a diagram illustrating a complementary pattern when n is an even number, and FIG. 14 is a diagram when n is an odd number. In FIG. 13, the case of n = 2 is illustrated, but the same applies to the case of a general even number. In FIG. 14, the case of n = 5 is shown, but the same applies to the case of a general odd number.

  Complementary meshes include a section k-1 of order k and a section i of order k-1 (when a complementary mesh is merged with section i-1), or a section i-1 and a section i (complementing mesh is divided into sections i). Segment i-1 and segment i (when the complementary mesh is merged with segment i-1), or segment i-1 and segment i + 1 (complement) Purpose of connecting the mesh for use as section i) to eliminate gaps, and to make the number of k-order meshes on the outermost circumference of section i-1 and the complementary mesh equal in the latitude and longitude directions Generated as.

  In a mesh structure in which an entire map is divided into a plurality of meshes and hierarchized into meshes of a first order to mth order (m is an integer of 2 or more) in a plurality of stages in which the size of the mesh differs according to the scale. The complementary mesh may be generated as follows.

  (1) Each k-1 order mesh and map so as to correspond to each k-1 order mesh whose map range overlaps with the k order mesh (reference mesh) of the section i-1 whose search mesh order is k order. The range overlaps and the k-th order mesh different from the k-th order mesh of the section i-1 is complemented as a complementary mesh. As a result, the k-1th order mesh adjacent to each k-1th order mesh and the kth order mesh of the section i-1 are connected by the complementary mesh, so that the section i-1 and the section i (the complementary mesh The gap of the k-th order mesh between the section i-1 and the section i + 1 (when the complementary mesh is used as the section i) is filled with the complementary mesh.

  (2) The number of outermost meshes of the section i-1 and the complementary mesh is made equal in the latitude direction and the longitude direction, and the section i (when the complementary mesh is merged with the section i-1) or the section i + 1 In order to make the number of k-1 order meshes in the case of using the complementary mesh as the section i equal in the latitude direction and the longitude direction, the k order mesh of the section i-1 is used as a reference mesh. The outermost mesh of the kth order mesh and the kth order complementary mesh obtained by the processing of (1), the outermost mesh in the latitudinal direction and the longitudinal direction in the direction with a small number of meshes in the vertical and horizontal directions If there is a region that does not overlap by overlapping the region of the set of kth order meshes and the region of the k−1th order meshes, the distance is taken into account from the center latitude and longitude (for example, the center of the kth order of the center latitude and longitude) Messi From the set of k-th order meshes to increase or decrease the k-th order meshes by one row or one column at a time. A process of adding the k-th order mesh of the region that does not become to the set is performed, and the k-th order mesh remaining in the set is added to the complementing mesh of (1) to be a complementary mesh. As a result, the k-1 order mesh adjacent to the adjacent k-1 order mesh and the section i-1 are connected by this complementary mesh, and the section i (the complementary mesh is merged with the section i-1). ) Or the k−1 order mesh of the section i + 1 (when the complementary mesh is used as the section i) is n1 × n1.

  The process (2) is a process assuming the case of even-numbered patterns 3 to 6 shown in FIGS. 13 (c) to 13 (f) described later. In this case, when the k−1th order mesh is divided into 2 × 2 kth order meshes, instead of the processes of (1) and (2), the section i−1 is set outside the section i−1. A normal section i surrounded by a single kth order mesh is temporarily generated, and if there is an area that does not overlap by overlapping the k-1th order mesh in the area of the section i, the distance from the central latitude and longitude is taken into account. (For example, when the outermost mesh of the section i-1 is n × n, the k-th order mesh of the distance n / 2 and the k-th order mesh of the distance n / 2 + 1 from the k-th center mesh including the point of the central latitude and longitude are (K-1) determines whether the meshes belong to the same mesh or not, and temporarily increases or decreases the complementary meshes in the latitude direction or longitude direction by one row or one column from the section i that is temporarily generated. The remaining k-th order mesh and the increased k-th order mesh are used as complementary meshes. What is necessary is just to perform the process.

  (3) The search mesh order of the section j (j> i) is the section j-1 (when the complementary mesh is merged with the section j-1) or the section j-2 (the complementary mesh is used as the section j-1). Each time the search mesh order k-1 is changed from k-1 to k-2, each k-1 order mesh of the section j-1 or the section j-2 is used as a reference mesh. Until (1) is repeated, (2) is repeatedly executed until the k-1th order mesh of the section j-1 or the section j-2 is used as a reference mesh until a predetermined search mesh order is obtained.

  Even when the search mesh order of the section j is changed from k-1 to k-2, the algorithm for generating the complementary mesh is the same. In the processes (1) and (2), the section j-1 The search mesh order k-1 mesh corresponds to the kth order mesh that becomes the reference of the section i-1 when the search mesh order is changed from k to k-1, and the processing of (1) and (2) Thus, the processing is changed according to the correspondence relationship of the reference mesh.

  As a result, even if the search mesh order is changed, regional information is searched in a wide area with a low-order mesh as it moves away from the reference point, and regional information in sparse areas such as local cities and mountainous areas is searched at high speed. can do.

  In the mesh structure in which the j (j = 2 or higher) -order mesh of this embodiment is divided into 2 × 2 j + 1-order meshes, the presence / absence of complementation and the generation of the complementary mesh are performed as follows.

  In FIG. 13, meshes 210a to 210f hatched with left diagonal lines (in the case of general even numbers, the outermost n × n meshes) are sections i-1 of order k, and meshes 212a to 212f without hatching are sections i. −1 is an adjacent mesh of degree k−1 adjacent to −1. In FIG. 14, the outermost 5 × 5 meshes of meshes 230a to 230d hatched with left diagonal lines are the sections i-1 of the order k, and the meshes 232a to 232d without hatching are the orders k−1 of the sections i-1. Adjacent mesh.

  When the search mesh order change determination unit 204 determines that the search mesh order change determination unit 204 changes the complementation determination unit 205, the k−1 order mesh including the mesh of the search mesh order k of the section i−1 is the mesh of the section i−1. It is determined whether or not a k-order mesh other than that is included, and if no k-order mesh other than the k-order mesh of the section i-1 is included, it is determined that complementation is not necessary, and the k-order mesh of the section i-1 is determined. If any other k-order mesh is included, it is determined that complementation is necessary.

  As shown in FIG. 13A, the even-numbered pattern 1 includes the k-th order mesh of the section i-1 and the longitude direction (horizontal direction) and the latitude direction (longitudinal direction) of the k-1 order mesh including the k-th order mesh. Since the boundary coincides and the k-1 order mesh including the k order meshes at the northwest end, the northeast end, the southwest end, and the southeast end does not include k order meshes other than the section i-1, there is no need for complementation. Judged to be. This is determined to be an even pattern 1 because the mesh numbers of the k-th order meshes at the southwest end, southeast end, northwest end, and northeast end are 0, 1, 2, and 3.

  As shown in FIG. 13 (b), the even-numbered pattern 2 has a boundary i-1 in which the k-th order mesh of the section i-1 and the boundary of the k-1th order mesh including the k-th order mesh do not match in the longitude direction and the latitude direction. -1 north west end, north east end, south west end and south east end k-1 order meshes including k order meshes include 3 k order meshes other than section i-1 and need to be complemented It is judged. This is determined to be an even pattern 2 because the k-th order mesh numbers of the meshes at the southwest end, southeast end, northwest end, and northeast end are 3, 2, 1, 0.

  In the even patterns 3 and 4, as shown in FIGS. 13C and 13D, the k-th order mesh of the section i-1 and the boundary of the k-1th order mesh including the k-th order mesh coincide with each other in the longitude direction. However, they do not match in the latitude direction, and there are two k-1 order meshes in the west, each including the k order meshes at the northwest end and the southwest end of the section i-1, and the k order meshes at the northeast end and the southeast end. Since the (k−1) -order mesh including “2” includes two k-order meshes in the east, it is determined that complementation is necessary. The even-numbered patterns 3 and 4 are judged by the k-th order mesh numbers of the meshes at the southwest end, southeast end, northwest end, and northeast end being 1, 0, 3, and 2.

  In the even patterns 5 and 6, as shown in FIGS. 13E and 13F, the boundary of the kth order mesh of the section i-1 and the k-1th order mesh including the kth order mesh match in the latitude direction. However, they do not match in the latitude direction, and there are two k-1 order meshes in the north, and each k order mesh in the southwest end and southeast end including the k order meshes in the northwest and northeast ends of the section i-1. Since the (k−1) -order mesh including “x” includes two k-order meshes in the south, it is determined that complementation is necessary. This is determined to be the even patterns 5 and 6 because the k-th order mesh numbers of the meshes at the southwest end, southeast end, northwest end and northeast end are 2, 3, 0 and 1.

  As described above, when n is an even number, whether or not complementation is necessary is determined by the mesh number of any one of the k-th order meshes of the southwest end, southeast end, northwest end, and northeast end of section i-1. it can.

  As shown in FIG. 14, in the case of an odd number, it is determined that complementation is necessary in any of the odd patterns 1, 2, 3, and 4.

  As shown in FIG. 14 (a), the odd-numbered pattern 1 is obtained by matching the boundary of the k-th order mesh including the k-th order mesh and the k-th order mesh of the section i-1 in the longitude direction. The boundary of the 1st west end k-th order mesh and the k-1th order mesh including the kth order mesh coincide with the latitude direction, and the k-1 mesh including the east end and the south end kth order mesh of the section i-1 is the section i. In this case, k-order meshes other than the k-order mesh of −1 are included. This is determined to be an odd pattern 1 because the k-th order mesh numbers of the meshes at the southwest end, southeast end, northwest end, and northeast end are 2, 2, 2, and 2.

  As shown in FIG. 14B, the odd-numbered pattern 2 is obtained by matching the boundary of the k-th order mesh including the k-th order mesh and the k-th order mesh of the section i-1 in the longitude direction. The boundary of the kth order mesh of the east end of 1 and the k-1 order mesh including the kth order mesh coincides with the latitude direction, and the k-1 mesh including the kth order mesh of the west end and the south end of the section i-1 is the section i. In this case, k-order meshes other than the k-order mesh of −1 are included. This is determined to be an odd pattern 2 because the k-th order mesh numbers of the meshes at the southwest end, the southeast end, the northwest end, and the northeast end are 3, 3, 3, and 3.

  As shown in FIG. 14 (c), the odd-numbered pattern 3 is obtained by dividing the boundary of the k-th order mesh of the east end of the section i-1 and the k-1 order mesh of the k-order mesh in the latitude direction. The boundary of the kth order mesh including the kth order mesh at the south end and the kth order mesh including the kth order mesh coincides with the longitude direction, and the k−1 mesh including the kth order mesh at the west end and the north end of the section i−1 is the section i−. This is a case including k-order mesh other than 1 k-order mesh. This is determined to be the odd pattern 3 because the k-th order mesh numbers of the meshes at the southwest end, the southeast end, the northwest end, and the northeast end are 1, 1, 1, 1.

  As shown in FIG. 14 (d), the odd-numbered pattern 4 has a boundary i-1 in which the boundary of the kth order mesh of the west end of the section i-1 and the k-1th order mesh of the kth order mesh coincide with each other in the latitude direction. The boundary of the kth order mesh including the kth mesh at the south end and the kth order mesh including the kth order mesh coincides with the longitude direction, and the kth mesh including the kth order mesh at the north end and the east end is the kth order mesh of the section i-1. It is a case where k order meshes other than are included. This is determined to be an odd pattern 4 because the k-th order mesh numbers of the meshes at the southwest end, southeast end, northwest end, and northeast end are 0, 0, 0, 0.

  If it is determined that complementation is necessary, the complementation mesh identification unit 205 identifies the complementation mesh according to which of the even patterns 2 to 6 and the odd patterns 1 to 4 in FIG. 13 and FIG. To do.

(1) Even pattern 2 As shown in the hatched right hatching in FIG. 13B, the k-th meshes at the north end and the south end of the section i-1 are separated by one in the north direction and the south direction ( The n + 2) k-th order adjacent meshes and (n + 2) k-th order adjacent meshes spaced one by one in the west and east directions from the west end and east end k-th meshes are used as the complementary mesh 214b. These k-th order adjacent meshes are complementary meshes for eliminating gaps. The k-th order mesh on the outermost periphery of the k-th order mesh including the section (i-1) and the complementary mesh is (n + 2) × (n + 2).

(2) For even pattern 3 As shown in the hatched hatching in FIG. 13 (c), n is separated by one in the west and east directions of the respective kth order meshes at the west end and east end of section i-1. The k-th order adjacent meshes and the (n + 2) k-th order adjacent meshes separated in the south direction from the k-th order mesh of the k-th order mesh and the k-th order mesh at the south end of the section i-1 are defined as the complementary mesh 214c. The former k-th order neighboring mesh is a complementary mesh for eliminating gaps, and the latter k-th order neighboring mesh has the number of k-th meshes at the outermost circumference of the section i-1 and the complementary mesh in the latitude direction and the longitude direction. It is a mesh for the complement to make it the same number. The outermost k-th order mesh of the k-th order mesh including the section i-1 and the complementary mesh is (n + 2) × (n + 2).

(3) Even pattern 4 As shown by hatching in the right oblique line in FIG. 13 (d), n is separated by one in the west and east directions of the respective k-order meshes at the west end and the east end of section i-1. The n-th adjacent k-th order meshes and (n + 2) adjacent k-th order meshes in the north direction of the north-order k-th order mesh of the section i-1 are defined as the complementary mesh 214d. The former k-th order neighboring mesh is a complementary mesh for eliminating gaps, and the latter k-th order neighboring mesh has the number of k-th meshes at the outermost circumference of the section i-1 and the complementary mesh in the latitude direction and the longitude direction. It is a mesh for the complement to make it the same number. The outermost k-th order mesh of the k-th order mesh including the section i-1 and the complementary mesh is (n + 2) × (n + 2).

  The even patterns 3 and 4 are selected so that the outermost mesh of the section i-1 and the complementary mesh is equidistant from the center mesh of the initial search mesh order. For example, if the center mesh is closer to the south in the section i-1, the even pattern 3 is selected. If the center mesh is closer to the north, the even pattern 4 is selected.

(4) For even pattern 5 As shown in the hatched right hatching in FIG. 13 (e), n is separated by one in the north direction and the south direction of the k-th meshes at the north end and the south end of section i-1. The k-th order neighboring meshes and the (n + 2) k-th order neighboring meshes separated in the east direction from the k-th order mesh of the k-th order mesh at the east end of the section i-1 are defined as a complementary mesh 214e. The former k-th order neighboring mesh is a complementary mesh for eliminating gaps, and the latter k-th order neighboring mesh has the number of k-th meshes at the outermost circumference of the section i-1 and the complementary mesh in the latitude direction and the longitude direction. It is a mesh for the complement to make it the same number. The outermost k-th order mesh of the k-th order mesh including the section i-1 and the complementary mesh is (n + 2) × (n + 2).

(5) Even pattern 6 As shown by hatching in the right oblique line in FIG. 13 (f), n is separated by one in the north direction and the south direction of the k-th meshes at the north end and the south end of the section i-1. The k-th order neighboring meshes and the (n + 2) k-th order neighboring meshes separated in the west direction by the west direction of the k-th order mesh at the west end of the section i-1 are defined as the complementary mesh 214f. The former k-th order neighboring mesh is a complementary mesh for eliminating gaps, and the latter k-th order neighboring mesh has the number of k-th meshes at the outermost circumference of the section i-1 and the complementary mesh in the latitude direction and the longitude direction. It is a mesh for the complement to make it the same number. The outermost k-th order mesh of the k-th order mesh including the section i-1 and the complementary mesh is (n + 2) × (n + 2).

  The even patterns 5 and 6 are selected so that the outermost mesh of the section i-1 and the complementary mesh is equidistant from the center mesh of the initial search mesh order. For example, if the center mesh is eastward in the section i-1, the even pattern 5 is selected, and if it is west, the even pattern 6 is selected.

(6) Odd pattern 1 As shown in the hatched hatching in FIG. 14A, the odd-numbered pattern 1 is separated by one in the east and south directions of the k-order mesh at the east end and the south end of section i-1. Let n + 1) k-th order adjacent meshes be complementary meshes 234a. The k-th order adjacent mesh is a complementary mesh for eliminating gaps. The outermost k-th order mesh of the k-th order mesh including the section i-1 and the complementary mesh is (n + 1) × (n + 1).

(7) Odd pattern 2 As shown in the hatched hatching in FIG. 14 (b), the odd-numbered pattern 2 is separated by one in the west and south directions of the respective k-order meshes at the west end and the south end of section i-1. Let n + 1) k-th order adjacent meshes be complementary meshes 234b. The k-th order adjacent mesh is a complementary mesh for eliminating gaps. The outermost k-th order mesh of the k-th order mesh including the section i-1 and the complementary mesh is (n + 1) × (n + 1).

(8) Odd pattern 3 As shown in the hatched hatching in FIG. 14C, the odd-numbered pattern 3 is separated by one in the north direction and the west direction of the k-order mesh at the north end and the west end of the section i-1. Let n + 1) k-th order adjacent meshes be complementary meshes 234c. The k-th order adjacent mesh is a complementary mesh for eliminating gaps. The outermost k-th order mesh of the k-th order mesh including the section i-1 and the complementary mesh is (n + 1) × (n + 1).

(9) Odd pattern 4 As shown by hatching in the right oblique line in FIG. 14D, the k-order meshes at the north end and the east end of the section i-1 are separated by one in the north direction and the east direction ( Let n + 1) k-th order adjacent meshes be complementary meshes 234d. The k-th order adjacent mesh is a complementary mesh for eliminating gaps. The outermost k-th order mesh of the k-th order mesh including the section i-1 and the complementary mesh is (n + 1) × (n + 1).

  By adding or subtracting 1 or 2 mesh coordinates of the k-order mesh of the section i-1 in the latitude direction and the longitude direction according to the complementary pattern corresponding to any of the even patterns 2 to 6 and the odd patterns 1 to 4. Find the mesh coordinates of the complementary mesh.

  The section i regeneration unit 206 merges the mesh coordinates of the complementary mesh into the section i-1 when merging the complementary mesh with the section i-1, and uses the section mesh when using the complementary mesh as the section i. The mesh coordinates of the complementary mesh are included in i, and the section i is set to only the complementary mesh.

  In the case of merging, since the POIs belonging to the mesh of the section i-1 and the complementary mesh are searched, the outer circumference of the k-th order mesh included in the section i-1 is closed, so the POI included in the section i-1 This list does not appear in a biased direction.

  When used as section i, the mesh included in section i appears only in a biased direction when viewed from the center, but in terms of distance order sorting, when merging, compared to using as section i, Dispersion of perspective is increased.

  FIG. 15 is a diagram illustrating a case where complementary meshes are merged. FIG. 16 is a diagram showing a case where the complementary mesh is used as the section i. Here, n0 = 7. Section 0 is the center mesh of the initial search mesh order, Section 1 is a 3 × 3 mesh adjacent to Section 0, Section 2 is a 5 × 5 mesh adjacent to Section 1, and Section 3 is 7 × 7 adjacent to Section 2. The mesh. Since section 2 has n = 5, the search mesh order of section 3 is not changed and is the initial search mesh order. Since the mesh of section 3 is 7 × 7, it is determined that the search mesh order is changed. Since the mesh of section 3 is 7 × 7 and n is an odd number, it is determined that there is complement.

  As shown in FIGS. 15 and 16, it is determined that the pattern is an odd pattern 1 from the m-th mesh number of the mesh of the initial search mesh order of the mesh of section 3, and the initial search mesh order of the section 3 is determined as described above. The mesh coordinates are obtained, and the mesh coordinates of the complementary mesh are calculated.

  When the complementary mesh is merged into the section i-1, the complementary mesh is merged into the section 3 as shown in FIG. Generate section 4 consisting of 6 × 6 initial search mesh degree-1 mesh. Generate section 5 consisting of 8 × 8 initial search mesh degree-1 mesh.

  When the complementary mesh is used as the category i, as shown in FIG. 16, the category 4 is configured only by the complementary mesh. Generate section 5 consisting of a 6 × 6 initial search mesh degree-1 mesh. Generate section 6 consisting of 8 × 8 initial search mesh degree-1 mesh.

  The POI set Ri search unit 194 searches for a POI set Ri belonging to the section i, converts the mesh coordinates of the section i into a pack code of the search mesh order k (i) of the section i, and searches for the section i. A list of pack codes of mesh order k (i) is generated.

  The POI set Ri search unit 194 performs narrowing down by the POI search table 14 and table combination with the POI information table 12 by using the pack code list of the search mesh degree k (i) as a key, and POIs in the same category i. A POI set Ri that is a list is acquired. At this time, if a genre is specified in the POI request, a POI that matches the specified genre is searched.

  The search mesh order k may be changed and may be different from the initial search mesh order m. However, the pack code P1aP1bP2aP2b... Pk (i) of the k (i) -th order mesh of the section i is denoted by P (k (i ) +1) L = ... = PmL = 00 (binary number) and P (k (i) +1) H =... = PmH = 11 (binary number), the pack code P1aP1bP2aP2b. i) P (k (i) +1) L ... PmL to pack code P1aP1bP2aP2b ... Pk (i) P (k (i) +1) H ... PmH from the POI search table 14 in the range of PmH Just search.

  The POI set Ri sorting unit 196 sorts the POI set Ri according to specific POI information (for example, POIID) in ascending order. In addition, you may sort based on the distance between the latitude longitude received from the portable terminal device 2 and the latitude longitude of POI.

  The N number acquisition unit 198 acquires N POIs in total in the sorted POI set Rj (j = 0 to i). When N cases cannot be acquired, the mesh coordinates of the adjacent mesh belonging to the section i + 1 are calculated by the adjacent mesh coordinate calculation section 192 in the section i, and the mesh coordinates are converted into pack codes by the POI set Ri search section 194. The POI set Ri + 1 located at i + 1 is searched, the POI set Ri sorting unit 196 sorts the POI set Ri + 1 in ascending order according to the POIID, and adds them in the category j (j = 0 to i, i + 1) to obtain N POIs. get. If N cases cannot be acquired, the range of the category of i + 2,..., And POI search is further expanded and added up in category j (j = 0 to i, i + 1, i + 2,...). Get N POIs. At this time, the section i has priority over the section i + 1.

  The result generation unit 202 includes N POI lists (store names of each POI, URLs that provide detailed information of the stores as link information of POI store names, thumbnail images, etc.) and center as information for specifying the center mesh. Create the result of setting the latitude and longitude or the mesh coordinates of the center mesh and the link to the mesh code.

  A response transmission unit 156 in FIG. 3 responds to a request from the mobile terminal device 2 (for example, an HTTP response), and includes a POI list response unit 170. The POI list response unit 170 responds to the N POI lists acquired by the POI list acquisition unit 152 to the mobile terminal device 2 (for example, an HTTP response).

  17 and 18 are flowcharts showing the area information search method. FIG. 19 is a sequence chart between the mobile terminal device 2 and the area information search server 10. FIG. 20 is a diagram illustrating a region information search method. Hereinafter, the regional information search method will be described with reference to these drawings.

  When the mobile terminal device 2 accesses the regional information search server 10 according to the user's operation and receives the response of the regional information search page, the mobile terminal device 2 displays the regional information search page on the screen. When the user clicks on a character (Japanese food, etc.) of a specific genre in which link information for requesting the POI list on the area information search page is set, the mobile terminal device 2 receives a GPS or wireless base station 4 (not shown). The current position p (latitude and longitude) is acquired, and as shown in (2) in FIG. 19, the POI list is requested by specifying the position information, the genre, and the like in the area information search server 10.

  In step S50 in FIG. 17, the area information search server 10 receives the current position p from the user. In step S52, the center mesh of the initial search mesh order k0 (for example, the highest order) including the current position p is extracted. For example, the mesh coordinates of the center mesh of the initial search mesh order are calculated from the latitude and longitude according to the above-described equations (1) and (2). In step 54, steps S100 to S130 shown in FIG. 18 are executed.

  In step S100 in FIG. 18, the extracted center mesh of the initial search mesh degree k0 is set as the first section 0. Section 0 is specified by the mesh coordinates of the center mesh. In step S101, 1 is assigned to i, the initial search mesh order k0 is assigned to the search mesh order k (0) of category 0, and k0 is assigned to the current search mesh order k. In step S102, it is determined whether or not the current mesh order k is minimum. In step S104, it is determined whether k is larger than k_min.

  If a positive determination is made, the process proceeds to step S106. If a negative determination is made, the process proceeds to step S110. In this embodiment, when the low-order mesh is divided into 2 × 2 meshes, the search mesh order can be changed, and the primary mesh is divided into 8 × 8, and the search mesh order is not changed. For example, k_min = 2. The section i−1 is a mesh of the current search mesh degree k and is set to n × n. When the search mesh order is not changed, the current search mesh order is the search mesh order k (i-1) of the category (i-1), and when the search mesh order is changed, the processing in step S126 is performed. The search mesh order k (i-1) -1 of the section (i-1) is obtained.

  In step S106, the change of the mesh order is determined. In step S108, it is determined whether n is n0 or more. If a positive determination is made, it is determined that the search mesh order is to be changed, and the process proceeds to step S114. If a negative determination is made, the process proceeds to step S110. If the search mesh order is not changed, the process proceeds to step S110. Even when the search mesh is changed, the area of the section i-1 is counted by the current mesh order k (= (k (i-1) -1)) changed in step S126, and n is an even number and complemented. (N / 2 × n / 2) when the pattern is an even pattern 1, (n + 1) / 2) × ((n + 1) / 2)) when n is an odd number and the complementary pattern is an odd pattern 1 to 4. When n is an even number and the complement pattern is an even number pattern 2 to 6, (((n / 2 + 1) × (n / 2 + 1)) is obtained, and the determination in step S108 is denied and the process proceeds to step S110.

  In step S110, the current mesh order k is substituted into the search mesh order k (i) of the section i, and as described above, the search mesh order k (i) of the search mesh order k (i) is set to the outer periphery of the section i-1. In the case of an even number from the mesh coordinates of the center mesh, the mesh coordinates of the k (i) -th mesh belonging to the section i are created by the circulation algorithm as described above.

  Even when the search mesh order is changed, the section i is created in step S110. In this case, when the complementary mesh is used as the section i, the section i-1 is composed of only the complementary mesh. K (i) -th mesh section i is created on the outermost periphery of section i-2 and section i-1. The section i is the section i-1 or the n (n) -th k (i) -order mesh at the outermost periphery of the sections i-1 and i-2. When n is an odd number, the search mesh order k (i) In the case of an even number from the mesh coordinates of the center mesh, the mesh coordinates of the mesh of the search mesh order k (i) belonging to the section i are calculated by the circulation algorithm as described above. In step S112, i + 1 is substituted into i (1 is added to i), and the process proceeds to step S128.

  If there is a change in the search mesh order, in step S114, whether n is an even number or an odd number and any one of k ( i-1) From the mesh number of the next mesh, it is determined which of the even patterns 1 to 6 and the odd patterns 1 to 4 shown in FIGS.

  In step S116, it is determined whether or not the pattern needs to be supplemented (even pattern 2-6 or odd pattern 1-4). If a positive determination is made, the process proceeds to step S118. If a negative determination is made, the process proceeds to step S126. In step S118, a complementary mesh is specified according to which of the even patterns 2 to 6 and the odd patterns 1 to 4 in FIGS.

  In step S120, it is determined whether or not the complementary mesh is used as the category i. If it is affirmation determination, it will progress to step S121. If a negative determination is made, the process proceeds to step S124. In step S121, a complementary mesh is generated as section i. In step S122, k is substituted into the search mesh order k (i), i is incremented by 1, and the process proceeds to step 126.

  In step S124, a complementary mesh is added (merged) to section i-1, and the process proceeds to step S126. In step S126, k-1 is substituted into the current search mesh order k (k is decreased by 1), and the search mesh order is changed. In step S128, the end of segment generation is determined. For example, the length of one side in the latitude direction of the outermost peripheral section i-1 is used as the end determination criterion. In step S130, it is determined whether or not segment generation is complete. If a positive determination is made, the process proceeds to step S56 in FIG. If it is negative determination, it will return to step S102 and will repeat step S102-S130 until division | segmentation production | generation is complete | finished.

  When it is determined that the search mesh order is changed, the process proceeds to steps S102, S104, S108, S110, and S112. At this time, since the search mesh order has been changed to k = (k−1) in step S126, the k-order mesh classification i after the search mesh order change is generated.

  In step S56 in FIG. 17, the mesh coordinates of section i are converted into k (i) -order pack codes, and the narrowing by the POI search table 14 and table combination with the POI information table 12 using the pack code list as a key. To search for the POI set Ri included in the section i.

  In step S58, the POI sets Ri are sorted in ascending order according to specific criteria. For example, the POI set Ri is sorted based on the POIID. In step S60, it is determined whether the number of POI sets Rj (j = 0 to i) satisfies a predetermined value N. In step 62, it is determined whether or not Σ | Rj | (j = 0 to i, | Rj | is the number of POI sets Rj) ≧ N. If a positive determination is made, the process proceeds to step S66. If a negative determination is made, the process proceeds to step S64. In the first time, N items are searched from the center mesh.

  As shown in FIG. 20, it is assumed that the user designates a city part from latitude and longitude. In this example, for convenience of explanation, n0 = 7, and the initial search mesh order k0 is obtained up to 1 × 1 section 0, 3 × 3 section 1, 5 × 5 section 2, and 7 × 7 section 3. The area information is searched with the mesh. Since the urban area is designated, regional information is concentrated in Category 0, Category 1, etc. In section 4, since n = 7 and equal to n0, a change in the search mesh order is determined, and section 3 is complemented according to the complement pattern. This example is a case of the odd pattern 2.

  The complementary mesh is used as a merge in section 3 or as a section 4. For example, merging into section 3. The search mesh order of section 4 is the initial search mesh order −1, and the mesh of section 4 is 6 × 6. At this point, the mesh area of Category 4 is far from the urban area containing the specified latitude and longitude points, the area information is sparse, and the mesh search order is low, It is possible to obtain a necessary number of pieces of area information by calculating a mesh in an appropriate range without applying a calculation load.

  In step S64, the range of the section i is set to the section i + 1, the process returns to step S56, and steps S56 to S64 are repeated until the determination in step S62 is affirmative. In step S66, N POIs are acquired. In step S68, a search result is generated. In step S70, the section i and the position S in the section are set as the succeeding candidate takeover value, and as shown in (4) in FIG. A POI list response including information such as the center latitude / longitude or the mesh coordinates of the center mesh of the initial search order, the mesh code, and the like as information for specifying is transmitted to the portable terminal device 2. As shown in (5) of FIG. 19, the mobile terminal device 2 displays a POI list in which URLs providing details are linked to each POI name.

  According to the present embodiment, the closer to the center indicated by the requested location information, the higher the mesh is searched for the regional information, and the farther away from the center, the lower the number of meshes is searched for the regional information. Even when the distribution of regional information is sparse, such as in a mountainous area, it is possible to obtain a necessary number of data by calculating a mesh in an appropriate range without applying a calculation load.

  When the search mesh order is changed, it is complemented by a complementary mesh, so there is a mesh of the search mesh order before the change that is not searched between the section i-1 before the change of the search mesh order and the section i after the change. Thus, it is possible to search the region information without any problem, and to make the mesh of the section i approximately at the same distance from the center mesh of the initial search mesh order. By setting the predetermined value n0 as a criterion for changing the search mesh order to a multiple of 4 + 1, the center of the section i whose search mesh order has been changed can be positioned at the center mesh of the changed search mesh order. .

  Since the complementary mesh is merged with the section i, it is possible to prevent the distribution of the searched area information from being biased. When the complementary mesh is used as the section i, the perspective variation can be reduced from the viewpoint of distance order sorting as compared with the case of merging.

  In the mesh structure divided into multiple layers, the mesh coordinates of section i are extracted from the mesh coordinates of the center mesh of the initial search mesh order by adding and subtracting to extract the adjacent mesh, so that the adjacent mesh can be extracted at high speed. The POI located in the adjacent mesh can be searched at high speed. Since the POI set Ri is searched from the category i and sorted in the ordered category set of the ordered category i, the search / sort processing range is limited, and the search / sort speed can be increased.

In the present embodiment, the example in which the mesh coordinates are calculated from the latitude and longitude using the above-described formulas (1) and (2) has been described, but the mesh coordinates can also be calculated from the mesh code.
In the POI search table, instead of the pack code, the pack code is converted into a mesh code, the mesh code is stored, and the mesh coordinates of the center mesh of the initial search mesh order and the k (i) -th mesh of the section i are stored. Convert to k (i) next pack code, convert pack code to k (i) next mesh code, and narrow down by POI search table and join table to POI information table using mesh code list as key You may do it. You may make it calculate the mesh code of the mesh of the mesh search order k (i) of the division | segmentation i by addition / subtraction of the mesh code of the center mesh of the initial search mesh order.

  The mesh code acquired from the map DB managing the map is converted into mesh coordinates, and the mesh coordinates are stored in the mesh DB together with the latitudes 1 and 2 at the northwest and southeast ends, and the latitude received from the mobile terminal device 2 The map DB may be searched and acquired based on the longitude.

  The mesh coordinates may be stored in the POI search table, and the POI search table may be combined with the POI information table by using the list of mesh coordinates of the center mesh and the adjacent mesh as a key.

  The mesh code may be stored in the POI information table, the mesh code may be acquired from the POI information table, converted to a pack code from the mesh code, and the pack code may be stored together with the POIID in the POI search table.

In the present embodiment, the case where the search mesh order is changed in the case of a mesh structure in which the i-th mesh (i is 2 or more) is divided into 2 × 2 (i + 1) -th meshes has been described as an example. Applicable to 2 ^l × 2 ^l (l> 2), i + 1 mesh mesh coordinates can be calculated by dividing mesh coordinates of i-th mesh by 2 ^l , southwest, southeast and northwest The complementary pattern is determined based on the i-th mesh numbers of the i-th meshes at the end and the north-east end in the same manner as in FIGS. 13 and 14. In addition, a section i in which the search mesh order is changed to k−1 is generated based on the mesh coordinates of the k−1 order center mesh, an orbital algorithm, or the like.

  In the present embodiment, the case of a portable terminal device has been described as an example, but an information terminal device such as a personal computer connected to a network such as the Internet may be used. In this case, the regional information search server transmits a map image related to the POI based on a request from the information terminal device separately from the POI list, and the information terminal device displays the map image together with the POI list on the screen. May be.

2 Mobile terminal device 8 Communication network 10 Regional information search server 12 POI information table 14 POI search table 203 Section i generation unit 204 Search mesh order change determination section 205 Complementation determination section 206 Complementary mesh specification section 207 Section i regeneration section

Claims (8)

A local information search server,
In a mesh structure in which an entire map is divided into a plurality of meshes and hierarchized into meshes of a first order to mth order (m is an integer of 2 or more) in a plurality of stages in which the size of the mesh differs according to the scale. ,
A POI information database including POI identifiers that uniquely identify each POI and storing POI information;
A POI search database that stores information identifying the POI identifier and the mesh in which each POI is located;
The section (i-1) (i = 1) consisting of the center mesh of the initial search mesh order indicated by the requested position information, or 1 in the latitude or longitude direction for the search mesh order from the center mesh of each corresponding search mesh order. A set of adjacent meshes separated by at least one, and a single layer immediately outside the outermost mesh of a section j (j = 1 to i−1, i is an integer of 2 or more) composed of meshes of the corresponding search mesh order A section generation unit that generates a section i composed of a mesh of the current search mesh degree k of the rectangular shape based on the mesh structure;
Search mesh order change for determining whether or not to change the corresponding search mesh order in the subsequent section based on the mesh number of the mesh of the current search mesh order k included in the section i generated by the section generation unit A determination unit;
When the search mesh order change determination unit determines that the search mesh order is to be changed, the mesh of the order k−1 that overlaps each mesh of the order k included in the section i overlaps the map range, and the section A complementation determination unit that determines whether or not to complement based on whether or not the mesh of the order k other than the mesh of the section i generated by the generation unit is included;
A complementary mesh specifying unit for specifying a complementary mesh of the order k including the mesh of the order k other than the mesh of the section i, when the complementary determining unit determines to complement;
A segment regeneration unit that merges the complementary mesh with the segment i generated by the segment generation unit to form a segment i;
A POI set search unit that searches the POI search database to obtain a POI set Ri located in a mesh belonging to the section i;
A POI acquisition unit that acquires a predetermined number of the POI information stored in the POI information database from the POI set Ri acquired by the POI set search unit;
When the search mesh order change determining unit determines that the search mesh order change is to be changed, the section generation unit generates a section i + 1 using the order k-1 as a current search mesh order. .   The mesh of degree k on the outermost periphery of the section j (j = 1 to i−1, i is an integer of 2 or more) is a set of n × n meshes in the latitude direction and n in the longitude direction. The area information search server according to claim 1, wherein the search mesh order change determination unit determines that the search mesh order mesh in a subsequent section is changed when the n is equal to or greater than a predetermined value no.   Each l (l = 2 to m−1) degree mesh is divided into 2 × 2 (l + 1) order meshes, and the complementary mesh specifying unit is a set of meshes of the corresponding search mesh order. When the mesh of the order k in the outermost circumference of a certain section j (j = 1 to i, i is an integer of 2 or more) and the n of the outermost circumference is an even number, (n + 2) × (n + 2), where n is an odd number 3. The complementary mesh is identified by determining a complementary pattern for classifying a complementary type indicated by a set of meshes of the order k including the mesh of the order k of (n + 1) × (n + 1). Local information search server. The partition regeneration unit generates the partition i + 1 as belonging to the partition i + 1 without merging the complementary mesh with the partition i,
The regional information search server according to claim 1, wherein the section generation unit generates the next section i + 2 of the section i + 1 to which the complementary mesh belongs, with the order k-1 as a current search mesh order.   When the predetermined number of POIs do not exist in the POI set Ri, the POI acquisition unit searches for a predetermined number of POIs based on the POI sets Ri and Ri + 1 for the category i and the next category i + 1. 5. The regional information search server according to claim 1, wherein when a predetermined number of POIs cannot be acquired even in the category i + 1, the range of the category is expanded until a predetermined number of POIs are acquired. . The section generation unit adds (i-1) (i = 2 to m, m is an integer of 3 or more) to a first value obtained by multiplying a value based on the latitude indicated by the requested position information by a first predetermined value. Decimal integer value obtained by multiplying the second mesh obtained by multiplying the number in the latitudinal direction of the i-th mesh to which the next mesh is divided (i = 2 to m, m is an integer of 3 or more) from the secondary to the initial search mesh order. A latitude code calculation unit that calculates a binary value obtained by converting the binary number into a binary number as the latitude code of the mesh coordinates of the center mesh of the initial search mesh order indicated by the position information, and a second predetermined value from the longitude indicated by the position information. The subtracted third value (i-1) (i = 2 to m, m is an integer of 3 or more) is divided into i (i = 2 to m, m is an integer of 3 or more) order mesh. A fourth value obtained by multiplying the number in the longitude direction from the second order to the initial search mesh order Was and a longitude code calculating unit for calculating binary numerical values converted to binary number decimal integer value obtained by multiplying a longitude code mesh coordinates of the center mesh,
4. The regional information search server according to claim 3, wherein based on the mesh coordinates of the central mesh of the initial search mesh order, the mesh coordinates of the adjacent mesh of the order k belonging to the section i are calculated to extract the adjacent mesh. A POI set sorting unit for sorting the POI set Ri located in the section i acquired by the POI set search unit based on the POI information;
The POI acquisition unit acquires a predetermined number of the POI information stored in the POI information database from the POI set Ri sorted by the POI set sort unit. The regional information search server described in any one of the above. A local information search method,
The entire map is divided into a plurality of meshes, and layered into a plurality of stages of first to m-th order (m is an integer of 2 or more) orders of different sizes depending on the scale, and each j ( j = 1 to m−1) In the mesh structure in which the next mesh is divided into the (j + 1) th mesh,
The section (i-1) (i = 1) consisting of the center mesh of the initial search mesh order indicated by the requested position information, or 1 in the latitude or longitude direction for the search mesh order from the center mesh of each corresponding search mesh order. A set of adjacent meshes separated by at least one, and a single layer immediately outside the outermost mesh of a section j (j = 1 to i−1, i is an integer of 2 or more) composed of meshes of the corresponding search mesh order A section generation step for generating a section i consisting of a mesh of the current search mesh degree k of the rectangle of
Search mesh order change determination step for determining whether or not to change the search mesh order mesh in the subsequent section based on the number of meshes of the mesh of the search mesh order k included in the section i generated in the section generation step. When,
When it is determined in the search mesh order change determination step that the search mesh order is changed, the mesh of the order k−1 obtained by dividing each mesh of the order k included in the section i is the mesh other than the mesh of the section i. A complement determination step for determining whether or not to complement based on whether or not there is a mesh of degree k;
A complementation mesh specifying step for specifying a complementation mesh of the order k including the mesh of the order k other than the mesh of the section i when it is determined to complement in the complementation determination step;
A segment regeneration step that merges the complementary mesh with the segment i generated in the segment generation step to form a segment i;
A POI set search step of searching a POI search database storing information specifying each POI identifier and a mesh in which each POI is located, and obtaining a POI set Ri located in the mesh belonging to the section i;
It is determined whether or not a predetermined number of POIs exist in the POI set Ri acquired in the POI set search step, and when a predetermined number of POIs exist in the POI set Ri, from the POI set Ri, A POI acquisition step of acquiring a predetermined number of the POI information stored in a POI information database that includes a POI identifier that uniquely identifies each POI and stores POI information;
The area generation search method characterized in that the section generation step generates the section i + 1 using the order k-1 as the current search mesh order when it is determined in the search mesh order change determination step that the search mesh order is changed. .

Images