JP5775042B2 - Information processing apparatus, method, and computer program - Google Patents

Description

  The present invention relates to information distribution to mobile terminals.

  Conventionally, polygons are widely used for information processing related to maps. In particular, Voronoi polygons based on points (nodes) are used in determining trade areas and setting school districts.

JP2007-121668A

  However, when polygons are generated with respect to a large number of points such as points constituting a boundary, there is a problem that the number of figures is large and processing load and time are increased. For example, in order to associate an area with a sea area facing the area, a process for generating a Voronoi polygon for each polygon point constituting the coastline is considered. In this case, if the range of the target coastline is wide, the number of polygons is too large, and the load required for generating and processing graphics exceeds the practical range.

  In the technique of deforming a polygon with a detailed shape into a schematic shape for a wide area diagram (see, for example, Patent Document 1), it has been introduced that a Voronoi figure is generated from a point on the side of a polygon with a detailed shape. This technique has not been useful in solving the problem that the generation of graphics itself becomes difficult if there are many points. Furthermore, if the points are thinned out at a fixed rate, the overall processing accuracy decreases.

  An object of the present invention is to suppress the processing load while maintaining the processing accuracy even if there are many points constituting the boundary that generates the polygon.

  Based on the above object, an information processing apparatus according to one aspect (1) of the present invention includes a dividing unit that divides an area including a boundary defined by a plurality of points into mesh-like sections, and the divided sections. Among them, a subdivision unit that divides a portion that satisfies a predetermined condition as a subdivided section, and a generation unit that generates a polygon that includes a representative point representing the divided section. It is characterized by.

  An information processing method according to another aspect (11) of the present invention is obtained by capturing the above aspect in a method category, and a division process for dividing an area including a boundary defined by a plurality of points into mesh-like sections. , Re-division processing to divide a portion satisfying a predetermined condition among the divided sections as a further subdivided section, and generation to generate a polygon including a representative point representing the divided section The processing is performed by a computer.

  Another aspect (12) of the present invention is a computer program that captures the above aspect in the category of a computer program. By controlling the computer, an area including a boundary defined by a plurality of points is meshed. Dividing into sections, dividing a portion satisfying a predetermined condition among the divided sections as a further subdivided section, and generating a polygon including a representative point representing the divided section It is characterized by.

  According to another aspect (2) of the present invention, in any one of the above aspects, the predetermined condition is that the density of the points included in the portion is equal to or greater than a predetermined value.

  According to another aspect (3) of the present invention, in any one of the aspects described above, the divided section is selected based on a predetermined criterion among the attribute values assigned to the areas included in the section. Of the polygons generated by the generating means, the assigning means for assigning attribute values, and the polygons having the same attribute value assigned to the section that is the basis of generation are merged to create And a merging means having a square shape.

  Another aspect (4) of the present invention is characterized in that, in any of the above aspects, the predetermined condition includes a point where a plurality of the regions touch each other at the boundary.

  According to another aspect (5) of the present invention, in any one of the above aspects, as the predetermined reference, the provision unit includes the boundary included in the section in the region included in the section. The attribute value given to the longest region is given to the section.

  According to another aspect (6) of the present invention, in any one of the aspects described above, as the predetermined reference, the providing unit may be configured such that the area included in the section is the largest in the area included in the section. The attribute value given to the area is given to the section.

  According to another aspect (7) of the present invention, in any one of the above aspects, the assigning unit includes, as the predetermined reference, the density of nodes included in the section in the area included in the section. The attribute value assigned to the region that is the highest is assigned to the section.

  Another aspect (8) of the present invention is characterized in that, in any of the above aspects, the region is an area and the boundary is a coastline.

  According to another aspect (9) of the present invention, in any one of the above aspects, the attribute value includes an area name (an address such as an administrative division name such as a prefecture, a municipality, and a town character area. Any local name may be used).

  According to another aspect (10) of the present invention, in any one of the above aspects, a point at which the merged polygon sides touch the boundary coincides with a point at which the adjacent regions touch each other at the boundary. Is provided with means for deforming the polygon.

  According to the present invention, the processing load can be suppressed while maintaining the processing accuracy even if there are many points constituting the boundary that generates the polygon.

The functional block diagram which shows a structure about embodiment of this invention. The figure which illustrates the information (data) in the embodiment of the present invention. The flowchart which shows the process sequence (information delivery) in embodiment of this invention. The flowchart which shows the process sequence (outline | summary of maritime polygon production | generation) in embodiment of this invention. The flowchart which shows the process sequence (specific procedure) in embodiment of this invention. The conceptual diagram which shows the processing content in embodiment of this invention. The conceptual diagram which shows the processing content in embodiment of this invention. The conceptual diagram which shows the processing content in embodiment of this invention. The conceptual diagram which shows the processing content in embodiment of this invention. The conceptual diagram which shows the processing content in embodiment of this invention. The conceptual diagram which shows the processing content in embodiment of this invention. The conceptual diagram which shows the processing content in embodiment of this invention.

  Next, a mode for carrying out the present invention (referred to as “embodiment”) will be illustrated along the drawings. In addition, the assumptions common to the contents already described in the background art and problems are omitted as appropriate.

[1. overall structure〕
FIG. 1 shows the overall configuration of this embodiment. In the present embodiment, when the information processing apparatus of the present invention is configured by the distribution server 1 and the generation apparatus 2 and information distribution is performed from the distribution server 1 to the terminal T such as a smartphone, the position of the measured terminal T is at sea level. Even so, this is an example in which information distribution is performed based on the attribute value of the region corresponding to the position on land. Moreover, the example which the production | generation apparatus 2 produces | generates the information used in order to perform such information distribution is shown.

  First, the distribution server 1 and the generation device 2 have at least an arithmetic control unit 6 such as a CPU, a storage device 7 such as a main memory and an auxiliary storage device, and a communication network N (for example, a mobile phone, PHS, As a communication means 8 with various wireless communication networks such as a public wireless LAN and the Internet, for example, a communication circuit with a mobile communication network, a wireless LAN adapter, and the like are included.

  In addition to the configuration of the computer as described above, the terminal T is not shown, but a rechargeable battery control unit that controls charging / discharging of a built-in rechargeable battery (battery) and an incoming call (not shown) other than making and receiving calls A call control unit that also controls a speaker for use and a microphone for transmission, and a positioning unit.

  The positioning unit measures the current position using GPS, position information of a nearby mobile phone base station or a wireless LAN base unit, and the like. Further, although not shown, the terminal T includes a display screen which is an input / output unit using a liquid crystal or an organic EL and having a touch panel function.

  In the distribution server 1 and the generation device 2, the arithmetic control unit 6 implements elements such as each unit illustrated in FIG. 1 by executing a program (not shown). There is no limitation on the format of the program that realizes the functions in the distribution server 1, the generation device 2, and the terminal T. For example, basic software, application programs, various middleware, scripts, and the like are conceivable.

  Of the elements to be realized, the mode of the information storage means is arbitrary, and can be realized in any data format such as a file on the storage device 7, or may be remote storage by network computing (cloud).

  The storage means may include not only a data storage area but also functions such as data input / output and management. In addition, the unit of the storage means shown in this application is for convenience of explanation, and the configuration can be divided or integrated as appropriate, and the processing data and processing results of each means are stored in addition to the explicit storage means. A storage means is used as appropriate.

[2. Corresponding storage means]
For example, the correspondence storage unit 15 is a unit that stores a region to which an attribute value is assigned and a sea region corresponding to the region in association with each other. In this application, an area is a part other than the sea, and includes an island and an inland water surface. The attribute value is assumed to be a region name. The area name may be an official address such as an administrative division name such as a prefecture, a municipality, or a town character area, but may be an arbitrary area name such as a customary area name.

  The attribute value is not limited to a region name that is a character string. For example, the region code is used for internal processing and communication of the terminal T, the distribution server 1 and the generation device 2, and the region code is displayed when displayed on the terminal T. An area name that is a character string previously associated with the name may be used.

  In addition, as a correspondence between the area to which the attribute value is assigned and the sea area, the area to which the attribute value is assigned may be associated with the area to which the attribute value is not assigned. Each may be associated by giving the same attribute value.

  For example, an example of information stored in the correspondence storage unit 15 is shown in FIG. In this example, for A city, B city, and C city respectively represented by area codes A, B, and C (actually numbers and the like), an area polygon that represents a land area and a position determination polygon at sea ( It will be called “marine polygon”). In this case, an example of information stored in the correspondence storage unit 15 is shown in FIG.

  The arrows in the figure (for example, FIG. 1) supplementarily indicate the main direction of the flow of data, control, etc., and do not deny other flows or imply direction limitations. For example, before or after data acquisition in a certain direction, a data request or an acknowledgment (ACK) can occur in the reverse direction.

  In addition, each means other than the storage means is a processing means for realizing and executing the information processing functions and operations (for example, FIG. 1) described below, but these are functional units arranged for explanation. It doesn't matter if it matches the actual hardware elements or software modules.

[3. (Distribution of information)
In the present embodiment configured as described above, a processing procedure for transmitting information from the distribution server 1 to the terminal T (also referred to as “distribution” because the number of terminals T is usually larger than that of the distribution server 1) is illustrated. 3 is a flowchart. That is, a program operating on the terminal T acquires position information such as longitude and latitude indicating the current position of the terminal, and transmits it to the distribution server 1 (step S11).

  The timing at which the terminal T acquires the position information may be when the terminal T requests information from the distribution server 1 or may move when the terminal T moves at a constant cycle or a fixed distance. In the distribution server 1, the position acquisition unit 10 receives the position information transmitted as described above, thereby acquiring position information representing the position of the terminal T (step S21).

  Then, the information transmission unit 20 of the distribution server 1 determines which polygon the position indicated by the acquired position belongs (step S22), and when the position indicated by the acquired position information belongs to the sea area (step S23). : "YES"), the information corresponding to the attribute value assigned to the area corresponding to the sea area in the correspondence storage means 15 is transmitted to the terminal T (step S24), and the terminal receives and displays this information (step S24). S12).

  For example, in this embodiment, for the sea location corresponding to A city, B city, and C city, the area codes (A1, B2, C3) of A city, B city, and C city are assigned. A polygon (referred to as “marine polygon”) is set.

  For this reason, even if the acquired location information is shifted to a position at sea due to an error or the like, the facility search narrowed down to the city B based on the corresponding area code of the city B, or the terminal in the city B Ad delivery to can be realized. The information to be distributed is stored in advance in the information storage means 25 and used by retrieving it by searching or the like.

  When the area code is also given to the maritime polygon, the process of determining whether the area is an area (step S23) is unnecessary, and the area code based on the area polygon and the area code based on the sea polygon are handled without distinction.

[4. (Generation of maritime polygons)
Next, a flowchart of FIG. 4 shows an outline of a processing procedure for generating a marine polygon used for information distribution as described above. Moreover, even if there are many points constituting the boundary that generates the polygon, a more specific processing procedure for suppressing the processing load while maintaining the processing accuracy is shown in the flowchart of FIG.

  First, as an outline (FIG. 4), the generating means 30 generates a polygon based on the points constituting the coastline (step S1), and the merging means 40 is an attribute assigned to the area to which the points belong. Polygons having common values are merged to form a polygon (step S2). Further, the shaping unit 50 cuts the merged polygon by a coastline line where the area and the sea area are adjacent to each other to form a polygon only for the sea area (step S3). Hereinafter, a more specific processing procedure will be described with reference to the flowchart of FIG.

[4-1. (Target of generation procedure)
The maritime polygon generated in the present embodiment is information that associates a region with a sea region corresponding to the region, but this is only an example. That is, the following algorithm used for the generation is not limited to the association between a region and a sea region corresponding to the region, but can be applied to other cases.

  In other words, to generalize, the following algorithm is the result of a first region on one side of the boundary (also referred to simply as “region”) and a second region on the other side of the boundary. Applicable to all processes that generate polygons based on association. The processing in the present embodiment shows an example in which the first area is a land area, the boundary is a coastline, and the second area is a sea area in contact with the area by the coastline. is there.

[4-2. (Thinning processing by division)
Prior to generating a polygon based on the points constituting the coastline, in order to reduce the processing load, the process of thinning out the points that form the basis for generating the polygon is performed as follows. First, FIG. 6 is a conceptual diagram showing a geographical range that is a target of generation of a maritime polygon.

  In this figure, a winding solid line indicates a coastline K, and the coastline K is defined by a plurality of points (not shown), and is realized as a polyline or a polygon. The upper left side of the coastline K is land, and A city, B city, and C city are arranged along the sea in order from the left, and the alternate long and short dash line indicates the city boundary.

  Here, it is assumed that in the generation device 2, land polygons used for determination of the ranges of A city, B city, and C city and for coastlines are stored in advance in the land polygon storage means 55. Then, based on the land polygon, a marine polygon is generated using the section storage means 75 as a work area and stored in the correspondence storage means 15 of the distribution server 1 together with the land polygon.

  First, as illustrated in FIG. 6, the dividing unit 60 divides an area including the coastline K into mesh-like sections M1 (hereinafter also referred to as “adjacent mesh” or “adjacent mesh M1”) (step S31). ). In the figure, reference numeral M1 indicates a part of the rectangles, but other rectangles having the same size are also the sections M1, and the same applies to the sections M2 and M3 described later.

  As a result of this division, the coastline in the range for generating a polygon passes through the adjacent mesh. 6 and subsequent drawings are conceptual diagrams, and the sections related to the vicinity of the end of the figure are omitted.

  Further, the re-dividing means 70 divides a portion satisfying a predetermined condition (hereinafter referred to as “division condition”) among the divided sections as a further subdivided section. Specifically, in the procedure of FIG. 5, the re-division unit 70 selects one of the divided sections that are not selected one by one (step S34), and if that part satisfies the division condition (step S34). Step S35: “YES”), the process of dividing the portion (step S36) is repeated until the end condition is satisfied (step S37).

  The end condition (step S37) is, for example, that the determination (step S33) has been completed for all parts of all the sections that may be divided into lower sections, or the total number of sections in the breadth-first search described later. For example, a predetermined upper limit has been exceeded. Note that attribute values are assigned (step S32) and representative points are set (step S33) to newly divided sections including adjacent meshes, which will be described later.

  The number of stages to be divided by proceeding with subdivision of the sections can be set according to the range to be processed. Here, as illustrated in FIG. 7, the adjacent mesh M1 is further divided into subdivided sections M2 (hereinafter also referred to as “subdivision mesh” or “subdivision mesh M2”), and a part of the subdivision mesh M2 is divided. Further, it is further divided into subdivided sections M3 (referred to as “detailed meshes”).

  Further, the order in which the processing is advanced from the uppermost section (adjacent mesh M1 in the above example) to the lowermost section may be a breadth-first search or a depth-first search. In the former, after determining all the parts of all the adjacent meshes M1, the process proceeds to a process at a level for the part of the subdivided mesh M2. In the latter case, after determining all the parts of one adjacent mesh M1, if there is a subdivided mesh M2 divided from the adjacent mesh M1, each part of the subdivided mesh M2 is targeted for determination, and another adjacent mesh M1. Return to.

[4-3. (Division condition)
The division condition for dividing a certain part from the upper section (for example, M1) as the lower section (for example, M2) is, for example, a point where a plurality of areas touch the coastline K (for example, points P and Q in FIG. 7, “adjacent points”). It shall also be called).

  Another example of the division condition is that the density of the points included in the portion is greater than or equal to a predetermined value. The density may be the number of points in the portion, or the proximity of adjacent distances between points or the average value of the closeness. Further, the criterion for determining whether the density of points is equal to or higher than a predetermined value may be an absolute criterion or a relative criterion.

  For example, when each portion that further divides the adjacent mesh M1 into 4 parts vertically and horizontally is divided into subdivided meshes M2 that are one step smaller, the number of points included in a part of the adjacent mesh M1 if it is an absolute reference Is equal to or greater than a predetermined threshold value, the portion is divided as a subdivided mesh M2. If it is a relative standard, for example, the number of points included in each part of all adjacent meshes M1 existing in the target geographical range is arranged in descending order, and the upper predetermined ratio part is divided to subdivide the mesh Let M2.

[4-4. Polygon generation)
And the production | generation means 30 produces | generates a polygon based on the point which comprises a coastline. Here, the “point constituting the coastline” is not limited to a point located on the coastline such as a vertex of a polygon representing the coastline, but may be a point within a predetermined range from the coastline such as a center point of a section including the coastline.

  In this embodiment, the production | generation means 30 produces | generates the polygon which includes a representative point based on the representative point (for example, center point) which represents the divided division (step S38). The divided sections include not only the section M1 but also sections M2 and M3 obtained by further subdividing it. Further, a Voronoi polygon is generated as the polygon.

  The representative point can be set when the polygon is generated, but in the present embodiment, the generating unit 30 or other appropriate unit sets the representative point in a new section for each division (step S33).

  In FIG. 8, a black rectangle near the center of each section is a representative point. The alphabets A to C added to each representative point are attribute values to be described later and indicate which of A city to C city corresponds to. FIG. 9 shows an image diagram in a state where a polygon is generated based on these representative points. Many of the polygons in the figure are out of the scope of the figure, and the illustration results in part of the contour.

[4-5. Merge polygons based on attribute values)
Further, the merging means 40 merges Voronoi polygons having common attribute values assigned to the region to which the point belongs to form a polygon (step S40, for example, FIG. 10). The attribute value assigned to the area to which the point belongs may be the attribute value of the area including the position of the point. However, as in the present embodiment, for the section corresponding to the point, the attribute value is determined based on the area. It may be a given attribute value. This attribute value can be given in advance to a section or a representative point of the section at the stage of partitioning.

  For example, in the present embodiment, the representative points of the divided sections are used as the base points for generating the polygon. However, in the processing procedure of FIG. The attribute value selected (that is, calculated) based on a predetermined criterion among the attribute values assigned to the area included in the section is assigned to the representative point (step S32).

  An example of the predetermined criterion is to assign an attribute value assigned to an area where the area included in the section is the largest among the areas included in the section to the representative point of the section or the section. For example, in FIG. 8, the attribute of the sections M1 and M2 is C (C city) in the section including the adjacent point Q because of the positional relationship with the adjacent point Q existing between the B city and the C city. However, the attribute of the section M3 is B (B city).

  Another example of the predetermined criterion is that the coastline included in the section assigns an attribute value assigned to the longest area among the areas included in the section to the section or the representative point of the section. Even when this criterion is applied, in the example of FIG. 8, the attributes of the sections M1 and M2 are C (C city), and the attribute of the section M3 is B (B city).

  Although illustration is omitted, the attribute value assigned to the region where the density of nodes included in the partition is the highest among the regions included in the partition is assigned to the representative point of the partition or the partition. Also good. When there is one area included in the section, the attribute value assigned to the area is assigned to the section or the representative point of the section.

  The merging means 40 merges the polygons generated by the generating means 30 by merging polygons having the same attribute value assigned to the section that is the basis of generation or the representative points of the sections. It is a square (step S40). The polygon shown in FIG. 9 is merged based on the commonality of the attribute values (A, B, or C) given to the representative points that are the basis of the polygon. A part is shown by a thick solid line. Moreover, in this figure, the outline which the merged polygon had was shown with a thin broken line.

  Note that the attribute value of the region to which the point belongs can also be determined and assigned again when the polygons are merged. In this case, the merging means 40 assigns the attribute value (for example, region name) of the region to which the point belongs as the attribute value of the Voronoi polygon, and merges the Voronoi polygons to which the same attribute value is assigned.

[4-6. Shaping)
Then, the shaping means 50 deforms the polygon so that the points where the merged polygon sides are in contact with the coastline K coincide with the adjacent points where the adjacent areas are in contact with the coastline K (step S41). For example, in FIG. 11, a polygon (corresponding to B city) in which the outlines R <b> 1 and R <b> 2 have passed through the broken line portion is deformed so as to pass through the solid line portion according to the adjacent points P and Q.

  Further, the shaping unit 50 cuts the merged polygon by a line of the coastline K where the area and the sea area are adjacent to each other, thereby making the polygon only for the sea area (step S42). For example, as a result of cutting the polygon corresponding to the city B shown in FIG. 11 along the coastline K, the maritime polygon X (shown by horizontal line hatching) shown in FIG. 12 is obtained.

[5. effect〕
As described above, in the present embodiment, even when the measured position information belongs to the sea area due to an error or the like (for example, step S23 in FIG. 3: “YES”), the attribute value assigned to the area corresponding to the sea area By using (step S24), it becomes possible to distribute information to the terminal.

  In particular, in the present embodiment, information distribution is performed based on the region name of the region corresponding to the sea area to which the measured position belongs. As a result, even if the positioning position is offshore due to an error, or even if you are actually at sea for offshore leisure, information distribution such as distribution of advertisements that specify the name of the area to be distributed and facility information search based on the area name Is possible.

  Further, in this embodiment, a Voronoi polygon is generated based on points constituting the coastline (for example, FIG. 9), and a Voronoi polygon having a common area name to which the base point belongs is merged (for example, FIG. 10). With this simple process, it is possible to easily obtain a polygon, that is, a polygon for determining the area name of the area corresponding to the sea area.

  Furthermore, in this embodiment, after assigning the attribute value of the region to which the point that becomes the mother point belongs as the attribute value of the Voronoi polygon (for example, FIG. 10), the Voronoi polygons having the same attribute value are merged. (For example, FIG. 11). Thereby, it is not necessary to read out the attribute value assigned to the region to which the point belongs every time the commonality of attribute values between Voronoi polygons is confirmed, and the processing is made efficient.

  In addition, in this embodiment, the merged polygon is cut at the coastline to form a polygon only for the sea area (for example, FIG. 12). Thereby, the polygon of the sea area does not overlap with the polygon of the corresponding area, and priority processing is not required when determining the corresponding area or sea area from the position information.

  Further, in the present embodiment, among the sections obtained by dividing the area including the boundary, a portion satisfying the predetermined condition is further subdivided (for example, FIG. 7), and a polygon is formed based on the representative points (for example, FIG. 8) of each section. Generate (for example, FIG. 9). As a result, the reference point for generating the polygon can be thinned out with a density corresponding to the feature of each boundary portion. For this reason, even if there are many points constituting the boundary that generates the polygon, the processing load can be suppressed while maintaining the processing accuracy.

  In particular, in the present embodiment, the feature of the portion where the shape is complicated can be faithfully reflected in the polygon by further subdividing a particularly dense portion of the divided sections (for example, FIG. 8).

  In the present embodiment, the attribute value selected on the basis of a predetermined criterion suitable for the purpose of information processing is selected from the attribute values of the area on one side of the boundary (for example, the first area or the like, the same applies hereinafter). And assigned to the divided sections (for example, FIG. 8), and polygons generated based on the sections (for example, FIG. 9) are merged with those having the same attribute value of the section that is the basis of generation (for example, FIG. 9). For example, FIG. Thereby, the attribute value of the area can be given to the second area that is in contact with the area at the boundary (for example, FIG. 12).

  Further, in the present embodiment, by further subdividing a portion including a point where adjacent regions contact each other at the boundary (for example, FIG. 8), the power relationship between the regions is reflected in the corresponding second regions. In this case, the polygon generated at that portion becomes fine. For this reason, the shift | offset | difference of a position with respect to a 1st area | region can be suppressed about the polygon after merging.

  In addition, in the present embodiment, the attribute value of the region whose boundary included in the partition is the longest among the regions included in the partition is assigned to the divided partition (for example, FIG. 8). As a result, when generating a polygon in the second region that touches the region at the boundary, the attribute value of the region with the longest border that touches the partition can be faithfully reflected in the second region.

  In particular, in the present embodiment, an attribute value of a region whose area included in the partition is the largest among the regions included in the partition is assigned to the divided partition (for example, FIG. 8). As a result, the processing area can be increased when any processing is performed on the region.

  In particular, in this embodiment, the attribute value of the area having the most complicated boundary in the section is assigned to the divided section. This is suitable for information processing that emphasizes the existence of complicated boundaries.

  Moreover, in this embodiment, the information processing which uses the attribute value of a land for the corresponding sea area is realizable by providing the attribute value of the land area to the sea area which touches the area with a coastline (for example, FIG. 12).

  Furthermore, in this embodiment, the area name to which the land area is given as the attribute value is given to the sea area that is in contact with the area by the coastline (for example, FIG. 12). As a result, even if the positioning position is offshore due to an error, or when you are actually on the sea at a marine leisure etc., distribution of advertisements that specify the area name to be distributed, facility information based on the area name, etc. (POI) It is possible to distribute information such as search.

  In addition, in the present embodiment, the polygonal shape is deformed so that the points where the sides of the merged polygons touch the coastline that is the boundary coincide with the points where the regions that are adjacent to each other are touched by the coastline (for example, FIG. 11).

  As a result, by thinning the points and using the representative points, the points where the adjacent areas (first areas) touch each other at the coastline (boundary) and the points where the polygonal side touches the coastline (boundary) Even if there is a deviation, the deviation is eliminated and the coupling accuracy between the land (region) polygon and the sea (second region) polygon is improved.

[6. Other embodiments]
In addition, the said embodiment is only an illustration and this invention includes what is illustrated below and other embodiment other than that. For example, the attribute value is not limited to the area name, but may be an economic index or other value.

  In addition, the configuration diagram, data diagram, flowchart, and the like in the present application are merely examples, and the presence / absence of each element, the order of arrangement and processing execution, specific contents, and the like can be appropriately changed. For example, the distribution server 1 and the generation device 2 may be configured integrally, or only the distribution server 1 or only the generation device 2 may be realized as the information processing apparatus of the present embodiment.

  Moreover, each aspect shown in this application can be grasped | ascertained also as other categories (a method, a program, a system containing a terminal, etc.) which are not specified. Regarding the category of method and program, “means” shown in the category of apparatus is appropriately read as “process” or “step”. Further, the order of processes and steps is not limited to the one directly specified in the present application, and can be changed such as changing the order or executing some processes collectively or partly at any time.

  In addition, computers such as terminals that implement and execute individual means, processes, and steps may be common, or may differ for each means, process, step, or timing. Further, all or any part of the “means” can be read as “part” (unit, section, module, etc.).

  In addition, the mode for realizing the individual means constituting the distribution server 1 and the generation device 2 is free, and functions provided by an external server can be set using API (Application Program Interface) or network computing (so-called cloud or the like). The configuration of the present invention can be flexibly changed. Furthermore, each element such as means relating to the present invention may be realized by other information processing mechanisms such as a physical electronic circuit as well as a computer control unit.

DESCRIPTION OF SYMBOLS 1 Distribution server 2 Generation | occurrence | production apparatus 6 Operation control part 7 Storage device 8 Communication means 10 Position acquisition means 15 Corresponding storage means 20 Information transmission means 25 Information storage means 30 Generation means 40 Merge means 50 Shaping means 55 Land polygon storage means 60 Dividing means 70 Subdivision means 75 Section storage means 80 Giving means M1 Section (adjacent mesh)
M2 section (subdivided mesh)
M3 section (detailed mesh)
N Communication network P, Q Adjacent point T Terminal X Maritime polygon

Claims (11)

A dividing means for dividing an area including a boundary defined by a plurality of points into mesh-like sections including the boundary;
Of the divided sections, subdivision means for dividing a portion where the density of the points is equal to or higher than a predetermined value into subdivided sections;
Generating means for generating a Voronoi polygon having a representative point representing the divided section as a generating point;
When,
An information processing apparatus comprising: An assigning unit that assigns an attribute value selected according to a predetermined criterion among attribute values given to an area included in the partition to the divided partition;
Among the Voronoi polygons generated by the generating means, merging means for merging Voronoi polygons having the same attribute value assigned to the section that is the basis of generation into polygons;
Claim 1 Symbol placement of the information processing apparatus characterized by comprising a. A dividing means for dividing an area including a boundary defined by a plurality of points into mesh-like sections including the boundary;
An assigning unit that assigns an attribute value selected according to a predetermined criterion among attribute values given to an area included in the partition to the divided partition;
At least one section divided by the boundary is composed of a plurality of regions , and among the divided sections , a portion including a point where a line dividing the plurality of regions intersects the boundary is included . Subdivision means for further dividing into subdivided sections;
Generating means for generating a Voronoi polygon having a representative point representing the divided section as a generating point;
Among the Voronoi polygons generated by the generating means, merging means for merging Voronoi polygons having the same attribute value assigned to the section that is the basis of generation into polygons;
Information processing apparatus comprising the. The assigning unit assigns, to the partition, the attribute value assigned to the region in which the boundary included in the partition is the longest among the regions included in the partition as the predetermined reference. the information processing apparatus according to claim 2 or 3, wherein the to. The assigning unit assigns, to the partition, the attribute value assigned to the region having an area included in the partition that is the largest among the regions included in the partition as the predetermined reference. the information processing apparatus according to claim 2 or 3, wherein the. The assigning means assigns the attribute value assigned to the region having the highest density of nodes included in the partition as the predetermined reference to the region. imparting information processing apparatus according to claim 2 or 3, wherein the to. The region is a region, the boundary information processing apparatus according to any one of claims 2 to 6, characterized in that the coastline. The attribute value is information processing apparatus according to any one of claims 2 to 7, characterized in that a region name. 2. The apparatus according to claim 1, further comprising means for deforming the polygonal side so that the side of the merged polygonal side touches the boundary so as to coincide with the point where the adjacent regions touch each other at the boundary. The information processing apparatus according to any one of 2 to 8 . A division process for dividing an area including a boundary defined by a plurality of points into mesh-like sections including the boundary;
Of the divided sections, a re-division process that divides a portion where the density of the points is equal to or higher than a predetermined value into subdivided sections;
A generation process for generating a Voronoi polygon having a representative point representing the divided section as a generating point;
An information processing method characterized in that a computer executes. By controlling the computer
An area including a boundary defined by a plurality of points is divided into mesh-like sections including the boundary,
Of the divided sections , the portion where the density of the points is equal to or higher than a predetermined value is further divided into subdivided sections,
A computer program for generating a Voronoi polygon having a representative point representing the divided section as a generating point.

Images