After map units are formed, in each map unit, a certain map pixel is randomly selected as the center of a regional circleAnd is generated by the circle center and the radius R

The areas are circular. Since the partial area circles in the subsequent part are moved to be independently laid out on the game map, if the game map is not divided, a large number of invalid traversals are generated in the process of checking each area circle, which results in long process time and high load requirement. Thus, by dividing the game map into a plurality of map cells (e.g., 4r × 4r per game cell), the traversal process is completed within each map cell, and as the traversal area becomes smaller, the load requirements may be reduced.

In this embodiment, the step S300 of moving one or more overlapping area circles of the area circles generated in each map unit to independently allocate all the area circles in the map unit includes:

s310: calculating the force between each circle overlapping the remaining circle or circles and the overlapping circle

To achieve independent layout of the region circles, the interaction force received by each region circle by other region circles is first calculated iteratively in step S310. The calculation mode can be obtained by the extrusion force between the area circles, the overlapping area and the simulated movement trend after the area circles are overlapped.

S320: moving the region circle to an adjustment position according to the magnitude and direction of the acting force, wherein the region circle is separated from any other region circles at the adjustment position

Based on the acting force (the resultant force and the direction applied to the area circle by the rest of the area circles partially overlapped with the area circles) received by each area circle calculated in the above steps, the area circle is moved along the direction until the circle center moves to an adjustment position, the resultant force disappears, so that the area circles are not extruded by other area circles at the adjustment position, and all the area circles are independently arranged and separated from each other.

In another preferred embodiment, the step S400 of generating blocking area information in the game map, where the blocking area information includes at least one blocking area further includes:

s410: comparing the area ratio of the blocking area to the area circle in each area circle with a ratio threshold, and removing the area circle when the ratio is larger than or equal to the ratio threshold;

the foregoing steps generate a pre-region of the map area on the map, but because of the large amount of blockage present on the game map: where game objects such as mountains, rivers, seas, etc. cannot pass, further processing of the pre-area is required to move or remove the pre-area on the barrier. Taking the removal as an example, in step S410, a proportional threshold is preset, the ratio of the area of the blocking area to the area of the area circle in each area circle is compared with the proportional threshold, and when the ratio is greater than or equal to the proportional threshold, the area circle is removed. For example, when the proportion threshold is 50%, and the proportion of the area of the blocking area to the area of the area circle is greater than 50%, the area circle is directly removed from the game map.

S420: when the proportion is smaller than the proportion threshold value, reserving the area circle and keeping the center of the area circle

And when the proportion is smaller than the proportion threshold value, the blocking area in the area circle is less, and the area circle can be regarded as an effective area circle, so that the area circle is reserved and the position of the center of the area circle is kept.

Although in the above embodiments, the blocking area within the partial area circle is smaller, so that the area circle is preserved. However, if the center of the area circle is located in the blocking area, the core area of the area circle will be an inaccessible part, and these situations cannot be allowed in the game. Therefore, referring to fig. 5, 6a, and 6b, when the circle center is located in any of the blocking areas, the step S600 of moving the circle center to an outside of the blocking area specifically includes:

s610: when the circle center is positioned in any blocking area, traversing pixel points in the blocking area, and collecting the distance between any pixel point and the circle center;

in order to move the circle center and effectively and pertinently move the circle center, when the circle center is positioned in any blocking area, pixel points in the blocking area are traversed, the distance between each pixel point and the circle center is collected, the distance is used for judging the moving direction of the circle center, and the minimum distance can be moved.

S620: extracting a pixel point with the minimum distance r from the circle center, and acquiring a standard boundary where the pixel point and the circle center are connected;

in step S620, the pixel point with the minimum distance r from the center of the circle in the blocking region is extracted, and it is known that the pixel point can be removed from the blocking region at the minimum moving distance when the center of the circle in the region is moved out of the pixel point. Therefore, with the pixel point, the standard boundary where the pixel point and the circle center are connected is obtained. Taking the pixel point as a hexagon as an example, under the condition that the pixel point is known, the shortest moving distance from He Tiaoleng side of the pixel point still needs to be calculated, so that after the center of the pixel point is connected with the center of a circle, the boundary intersected with the pixel point is extended to be the standard boundary.

S630: taking the normal direction of the standard boundary as the moving direction, moving the circle center r 'units to make the circle center located outside the blocking area, wherein r' = r + delta r

Then taking the standard boundary as a standard, taking the normal direction as a moving direction, moving the circle center r' units, and positioning the circle center outside the blocking area after moving. It can be known that, in this embodiment, r '= r + Δ r, the Δ r may be 0 or any unit larger than 0, when Δ r is 0, the center of the circle moves to the boundary of the blocking area, and to be more suitable for the user's game experience, Δ r is generally a value larger than 0, and Δ r in different area circles may be different, so that the blocking areas are different in position within the area circle. After the movement is finished, all circles are not blocked within the range of delta r, so that the blocked area in the game map really belongs to a part of the map area, but the movement of the game object is not influenced.

Referring to fig. 7 and 8, the step S700 of expanding outward layer by layer based on an expansion speed with each circle center as an origin to form expansion regions until the boundary of the expansion region contacts with an adjacent expansion region or a blocking region includes:

s710: adding each circle center to an expansion list;

the center of the area circle, i.e., the center of the circle, is added to an expanded list, such as OpenList.

S720: traversing the expansion list, and traversing adjacent pixels of each endpoint in the expansion list;

and traversing the expansion list OpenList, and traversing adjacent pixels of each endpoint (such as a circle center of a Node) in the expansion list OpenList. Taking a hexagonal map pixel as an example, the adjacent pixels are six map pixels on the periphery adjacent to six edges.

S730: judging whether the adjacent pixels are marked as pixels belonging to the expansion area or not, when the adjacent pixels are not marked as pixels belonging to the expansion area, marking the pixels belonging to the expansion area same as the end point, and adding the values into an expansion list to which the pixels belong;

after traversing the neighboring pixels, it is determined whether the neighboring pixels have been marked as belonging to pixels within the expanded region, i.e., whether the neighboring pixels have been marked as belonging to a certain map region. It will be appreciated that in this embodiment, each map pixel will be assigned a label based on the expansion process of the circle center, the label representing the map area to which the map pixel belongs. Therefore, in step S730,

s740: repeatedly executing the steps to mark all the pixels except the blocking area in the game map with the attribution of the expansion area

After the above steps S720 and S730 are continuously executed based on the center of the circle in the region circle, all the pixels of the region except the blocking region are marked with the attribution of the expansion region. And the overall expansion trend is judged by gradually going outward, and the marking of which area the map pixel belongs to is completed.

Further, step S700 may further include:

s750: identifying whether pixels adjacent to all boundary pixels of the blocking area belong to the same expansion area;

in the above steps, map pixels on the game map except for the blocked area are marked, but if the blocked area is not marked, more holes between the map areas formed by blocking on the game map are easy to appear, and the boundary line effect of the finally formed game map is influenced. Therefore, in a subsequent step, the blocking area will be area marked. Specifically, it is first identified whether pixels adjacent to all boundary pixels in any blocked area belong to the same expansion area, that is, whether the blocked area is completely included in a map area formed by expansion.

S760: when the pixels adjacent to the boundary pixel of the blocking area belong to the same expansion area, all the pixels in the blocking area are marked as the same expansion area to which the pixels adjacent to the boundary pixel belong.

If the pixels adjacent to the boundary pixel of the blocking area belong to the same expansion area under the judgment, all the pixels in the blocking area are marked as the same expansion area to which the adjacent pixels belong, namely the blocking area is phagocytosed by the expansion area, the blocking area is classified into the blocking area, but the blocking property of the blocking area still exists, and the significance of the phagocytosis or classification is to cancel the boundary between the map area and the blocking area.

Still further, step S700 may further include:

s770: when the pixels adjacent to the boundary pixels of the blocking areas do not belong to the same expansion area, acquiring the identification number of the expansion area to which the adjacent pixels of the pixels in each blocking area belong, and calculating the maximum identification number of the expansion area to which the adjacent pixels of the pixels in each blocking area belong;

if the pixels adjacent to the boundary pixels of the blocking area do not belong to the same expansion area under the judgment, that is, one blocking area is adjacent to two or more expansion areas, it is necessary to arrange that each expansion area gradually erodes the blocking area so as to classify different positions of the blocking area into different expansion areas. For this, the identification number of the expansion region to which the adjacent pixels of the pixels in each blocking region belong is obtained, that is, the pixels of the blocking region obtain the pixels (6 pixels in the case of a hexagon) adjacent to the pixels, and whether the pixels already belong to a certain expansion region, if so, what the identification number (or mark number) of the expansion region belongs to. It is to be understood that, when these pixels are the outermost pixels of the barrier region, some of the pixels adjacent thereto have identification numbers of the dilated regions, and when the pixels are pixels within the outermost pixels of the barrier region, the pixels adjacent thereto have no identification numbers of the dilated regions.

Then, counting the identification number with the largest occurrence number in the identification numbers of the expansion areas to which the adjacent pixels of the pixels of each blocking area belong. For example, in the outermost peripheral pixel of the barrier region, among 6 adjacent pixels having one pixel, there are 3 identification numbers having the expansion regions, of which 2 are the expansion regions a and 1 is the expansion region B, and then the maximum identification number of the pixel is the expansion region B. If the inner pixel of the blocking area, and the adjacent 6 pixels do not have the identification number of the expansion area, the pixel has the largest identification number (area).

S780: marking pixels in the blocking area to belong to the expansion area corresponding to the largest identification number, and marking the pixels in the blocking area as state pixels;

the pixels in the mark blocking area having the most identification number series are: belonging to the dilated area corresponding to the largest identification number, in the above example, the peripheral pixels belong to dilated area B, and the pixels in the blocked area are marked as status pixels (extra flag). The state pixels represent pixels within the blocking region, having properties attributable to a certain expansion region, as distinguished from other pixels within the blocking region that have not yet been determined to be within which expansion region. To this end, the expansion region is further expanded toward the barrier region.

S790: traversing all pixels in the blocking area, removing the state labels of the state pixels when the identification pixels are marked as the state pixels, and classifying the pixels into the expansion area corresponding to the maximum identification number according to the maximum identification number;

then, based on the state pixel, the step of expanding the region to etch the blocking region is performed. I.e. traverse all pixels within the blocking area, if a pixel has been marked as a status pixel, remove its status label and attribute it to the inflation area corresponding to the maximum identification number according to its maximum identification number, which is also marked at the same time. In other words, still taking the above example as an example, the peripheral pixels are classified into the expanded region B, and the erosion of the barrier region is completed.

S791: the steps are repeatedly executed until all the pixels in the blocking area belong to an expansion area.

By continuing the above steps until all pixels in the blocking area are classified as an expansion area, the erosion is terminated, and each blocking area is included in one or more expansion areas. No more holes are formed between the expanded areas, so that a map area is formed between the boundaries. That is, the expansion area initially includes only all pixels except the blocking area, and the map area may include both general map pixels and map pixels in the blocking area.

After the above steps are completed, the region generating method further includes:

s900: recording the identification number of the map area, the identification number of the adjacent map area and the identification number of the map area to which each pixel belongs, and recording the center of a circle as the center position of the map area

For example, all data related to a map of an area, including but not limited to: the game map is represented in an information form by an identification number (area) of a map area, an identification number (areas) of adjacent map areas, an identification number (map area X) of a map area to which each pixel belongs, a center position (center) represented by a center of a circle, an area collection (area collection) including all the map areas, and the like.

In a preferred embodiment, there is also disclosed a system for generating an area within a game map, comprising: the selection module selects a game map with the length of W and the width of H and an area circle with the radius of R; the layout module is used for dividing the game map into at least two map units, randomly selecting map pixels in each map unit as the center of a regional circle, and generating the regional circle by using the center of the regional circle and the radius R; the distribution module moves one or more overlapped area circles among the area circles generated in each map unit so as to independently distribute all the area circles in the map units; the generating module is used for generating blocking area information in the game map, wherein the blocking area information comprises at least one blocking area; the processing module is used for acquiring the circle center of the area circle and judging whether the circle center is positioned in any blocking area; the moving module moves the circle center to the outside of the blocking area when the circle center is positioned in any blocking area; the expansion module is used for outwards expanding layer by layer based on an expansion speed by taking each circle center as an origin to form an expansion area until the boundary of the expansion area is contacted with an adjacent expansion area or a blocking area; and a mapping module for forming a map area based on the expanded area.

In a further preferred embodiment, a computer-readable storage medium is also disclosed, on which a computer program is stored which, when being executed by a processor, carries out the steps as described above.

The smart terminal may be implemented in various forms. For example, the terminal described in the present invention may include an intelligent terminal such as a mobile phone, a smart phone, a notebook computer, a PDA (personal digital assistant), a PAD (tablet computer), a PMP (portable multimedia player), a navigation device, etc., and a fixed terminal such as a digital TV, a desktop computer, etc. In the following, it is assumed that the terminal is a smart terminal. However, it will be understood by those skilled in the art that the configuration according to the embodiment of the present invention can be applied to a fixed type terminal in addition to elements particularly used for moving purposes.

It should be noted that the embodiments of the present invention have been described in terms of preferred embodiments, and not by way of limitation, and that those skilled in the art can make modifications and variations of the embodiments described above without departing from the spirit of the invention.

Claims

1. A method for generating an area in a game map is characterized by comprising the following steps:

selecting a game map with the length of W and the width of H and an area circle with the radius of R;

dividing the game map into at least two map units, randomly selecting map pixels in each map unit as the center of the area circle, and generating one area circle by each center and radius R;

moving one or more of the area circles generated within each map cell that overlap with the remaining one or more to independently allocate all area circles within the map cell;

generating blocking area information in the game map, wherein the blocking area information comprises at least one blocking area and a position covered by the blocking area, and the blocking area is an area which cannot be penetrated or touched by a game object in the game map;

forming a map area based on the expanded area.

2. The region generation method of claim 1,

dividing the game map into at least two map units, randomly selecting map pixels in each map unit as the center of the area circle, and generating the area circle by using the center and the radius R, wherein the step comprises the following steps:

dividing the game map into n map units;

randomly selecting map pixels in each map unit as the center of a regional circle, and generating the map pixels by using the center and the radius R

A region circle;

the step of moving the overlapping one or more of the area circles generated within each map cell to independently allocate all the area circles within the map cell includes:

calculating the acting force between each region circle overlapped with the rest one or more region circles and the overlapped region circle, wherein the acting force is the extrusion force generated by the interaction between the region circles;

and moving the area circle to an adjusting position according to the magnitude and the direction of the acting force, wherein the area circle is separated from any other area circles at the adjusting position.

3. The area generation method of claim 1, wherein the step of generating blocking area information within the game map, the blocking area information including at least one blocking area, further comprises:

comparing the area ratio of the blocking area to the area circle in each area circle with a ratio threshold, and removing the area circle when the ratio is larger than or equal to the ratio threshold;

4. The region generation method of claim 1, wherein when the center of circle is located within any of the blocked regions, the step of moving the center of circle outside the blocked regions comprises:

when the circle center is located in any blocking area, traversing pixel points in the blocking area, and collecting the distance between any pixel point and the circle center;

extracting a pixel point with the minimum distance r from the circle center, and acquiring a standard boundary where the pixel point and the circle center connecting line are located;

and moving the circle center r 'units by taking the normal direction of the standard boundary as a moving direction, so that the circle center is positioned outside the blocking area, wherein r' = r + Δ r, and Δ r is 0 or any unit larger than 0.

5. The region generation method of claim 1, wherein the step of forming the expansion regions by outwardly expanding layer by layer based on an expansion speed with each circle center as an origin until the boundary of the expansion region contacts with the adjacent expansion region or the blocking region comprises:

adding each circle center to an expansion list;

traversing the expansion list, and traversing adjacent pixels which are used as the circle center of each endpoint in the expansion list;

judging whether the adjacent pixel is marked as a pixel belonging to an expansion area or not, and when the adjacent pixel is not marked as a pixel belonging to the expansion area, marking that the pixel belongs to the expansion area same as the endpoint and adding the pixel to the expansion list as a new endpoint;

6. The region generation method of claim 5, wherein the step of forming the expansion regions by expanding outward layer by layer based on an expansion speed with each circle center as an origin until the boundary of the expansion region contacts with the adjacent expansion region or the blocking region further comprises:

identifying whether pixels adjacent to all boundary pixels of the blocking region belong to the same expansion region;

7. The region generation method of claim 6, wherein the step of expanding outward layer by layer based on an expansion speed with each circle center as an origin to form an expanded region until a boundary of the expanded region contacts an adjacent expanded region or a blocking region further comprises:

marking pixels in the blocking area to belong to the expansion area corresponding to the maximum identification number, and marking the pixels in the blocking area as state pixels;

8. The region generation method of claim 1, wherein the region generation method further comprises the steps of:

9. An in-game map region generation system, the region generation system comprising:

the layout module is used for dividing the game map into at least two map units, randomly selecting map pixels in each map unit as the center of the area circle, and generating one area circle by each center and radius R;

an allocation module that moves one or more of the area circles generated in each map unit, which overlap with the remaining one or more, to independently allocate all the area circles in the map unit;

the game map generation module is used for generating blocking area information in the game map, wherein the blocking area information comprises at least one blocking area and a position covered by the blocking area, and the blocking area is an area which cannot be penetrated or touched by a game object in the game map;

the expansion module is used for outwards expanding layer by layer to form an expansion area based on an expansion speed by taking each circle center as an origin until the boundary of the expansion area is contacted with an adjacent expansion area or a blocking area;

and the mapping module is used for forming a map area on the basis of the expansion area.

10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of any of claims 1-8.