CN108096835B - Region filling method and device of game map - Google Patents
Region filling method and device of game map Download PDFInfo
- Publication number
- CN108096835B CN108096835B CN201810076588.7A CN201810076588A CN108096835B CN 108096835 B CN108096835 B CN 108096835B CN 201810076588 A CN201810076588 A CN 201810076588A CN 108096835 B CN108096835 B CN 108096835B
- Authority
- CN
- China
- Prior art keywords
- grid
- coordinates
- grids
- area
- filled
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- A—HUMAN NECESSITIES
- A63—SPORTS; GAMES; AMUSEMENTS
- A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
- A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
- A63F13/50—Controlling the output signals based on the game progress
- A63F13/53—Controlling the output signals based on the game progress involving additional visual information provided to the game scene, e.g. by overlay to simulate a head-up display [HUD] or displaying a laser sight in a shooting game
- A63F13/537—Controlling the output signals based on the game progress involving additional visual information provided to the game scene, e.g. by overlay to simulate a head-up display [HUD] or displaying a laser sight in a shooting game using indicators, e.g. showing the condition of a game character on screen
- A63F13/5378—Controlling the output signals based on the game progress involving additional visual information provided to the game scene, e.g. by overlay to simulate a head-up display [HUD] or displaying a laser sight in a shooting game using indicators, e.g. showing the condition of a game character on screen for displaying an additional top view, e.g. radar screens or maps
-
- A—HUMAN NECESSITIES
- A63—SPORTS; GAMES; AMUSEMENTS
- A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
- A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
- A63F13/60—Generating or modifying game content before or while executing the game program, e.g. authoring tools specially adapted for game development or game-integrated level editor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/40—Filling a planar surface by adding surface attributes, e.g. colour or texture
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Physics & Mathematics (AREA)
- Radar, Positioning & Navigation (AREA)
- Optics & Photonics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Processing Or Creating Images (AREA)
Abstract
The invention provides a region filling method of a game map, which comprises the following steps: acquiring coordinates of the filled grids and the walking track grids; creating a minimum bounding region; marking an enclosed area within the minimum enclosing area; filling a closed area, wherein a minimum enclosing area covers coordinates of the filled grid and the walking trajectory grid. The area filling device of the game map supports the circle filling requirement of the map with a plurality of closed areas, so that the accuracy and adaptability of the circle filling are improved. The efficiency of filling the circle is effectively improved by filling the minimum enclosing area and the mark.
Description
Technical Field
The invention relates to the field of computer graphics, in particular to a method and a device for filling an area of a game map.
Background
Planar area filling is an important subject in the field of computer graphics, and area filling is a process of filling pixels in specified irregular areas into filling colors or patterns and the like, and is widely applied in the fields of computer aided design and image processing. As a specific application example of the planar area filling in the field of games, the requirements of circle filling application in the game boundary are known as follows: the player can change the district in the track into the territory of the player as long as the player is not touched by other players or touches the track which is already walked by the player and returns to the territory of the player in the course of the territory. A circle filling method for abstracting the rule comprises the following steps: in other words, in a two-dimensional grid coordinate, a territory with any shape and any walking track are given, the starting point and the ending point of the walking track belong to the existing territory, and the filling of all closed areas related to the track is completed. The difference here is that the fill algorithm refers broadly to fill colors, here circled to fill territories, which are identical in nature. The filling algorithm generally common in the field at present is mainly a seed filling algorithm, and the basic idea is as follows: starting from an inner point of the polygon area, points are drawn from the inside to the outside with a given color until the border. If the boundary is specified in one color, the seed fill algorithm can process pixel-by-pixel, typically traversing in 4-way connectivity, 8-way connectivity, or scan-line fashion, until the boundary color is encountered.
For example, the flow of the 4-way connected seed filling algorithm is as follows:
a) the seed pixel is pushed into the stack;
b) e) if the stack is empty; otherwise, turning to c);
c) popping up a pixel and setting the pixel to a fill color; judging whether four connected pixels adjacent to the pixel are boundary colors or filling colors which are already set into polygons, and if not, pressing the pixel into a stack;
d) turning b);
e) and (6) ending.
Through the above process, it can be seen that the existing scheme has at least the following disadvantages:
the 1 seed fill algorithm is only suitable for filling one closed region, while the travel trajectory in the circle may generate a plurality of closed regions.
The 2-seed fill algorithm needs to start at an interior point of the polygon area, which is very difficult to determine in practice. The walking track in the circle filling algorithm is in an arbitrary shape, so that the acquisition of the inner point becomes very complicated.
In addition, a large number of nested calls can cause the occupied memory to be enlarged, so that a large number of resources are consumed, and the memory overflow is easily caused.
Disclosure of Invention
In order to solve one or more of the above-mentioned drawbacks, according to a first aspect of the present invention, there is provided a method for area filling of a game map, including the steps of: A. acquiring coordinates of the filled grids and the walking track grids; B. creating a minimum bounding region; C. marking an enclosed area within the minimum enclosing area; D. filling a closed area, wherein a minimum enclosing area covers coordinates of the filled grid and the walking trajectory grid.
Further, step B further comprises the following substeps: creating temporary coordinates topLeft and bottomRight; traversing the coordinates of the filled grids and the walking track grids, taking the coordinate of the current grid as grid, and assigning topLeft.x to grid.x if grid.x is less than topLeft.x; if grid.y is less than topleft.y, assigning topleft.y to grid.y; if grid.x > bottomright.x, assigning bottomright.x to grid.x; if grid.y > bottomright.y, assigning bottomright.y to grid.y; after traversing all the coordinates of the filled grids and the walking track grids, establishing a minimum enclosing area based on the coordinates topLeft to the coordinates bottomRight.
Further, the grid is a grid with 8 communication directions.
According to a second aspect of the present invention, there is provided an area filling apparatus for a game map, comprising: a first module that acquires coordinates of the filled lattices and the walking trajectory lattices; a second module that creates a minimal bounding region; a third module that marks an enclosed area within the minimum enclosing area; a fourth module that fills an enclosed area, wherein a minimum bounding area covers coordinates of the filled grid and a walking trajectory grid.
Further, the second module includes the following sub-modules: a first sub-module creating temporary coordinates topLeft and bottomRight; the second submodule traverses the coordinates of the filled grids and the walking track grids, takes the coordinate of the current grid as grid, and assigns a value topleft.x to grid.x if grid.x is less than topleft.x; if grid.y is less than topleft.y, assigning topleft.y to grid.y; if grid.x > bottomright.x, assigning bottomright.x to grid.x; if grid.y > bottomright.y, assigning bottomright.y to grid.y; and the third sub-module establishes a minimum enclosing area based on the coordinates topLeft to the coordinates bottomRight after traversing all the filled grids and the coordinates of the walking track grids.
Further, the grid is a grid with 8 communication directions.
According to a third aspect of the present invention, there is provided a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the method of the first aspect of the present invention.
The invention has the following beneficial effects: the method supports the circle filling requirement of the map with a plurality of closed areas, thereby improving the accuracy and adaptability of the circle filling. The efficiency of filling the circle is effectively improved by filling the minimum enclosing area and the mark.
Drawings
FIG. 1 is a flow chart showing a first embodiment according to the present invention;
FIG. 2 is a schematic diagram illustrating a 4-pass grid and an 8-pass grid according to one or more embodiments of the present invention;
FIG. 3 is a schematic diagram showing a 4-way grid and an 8-way grid filling multiple zones in accordance with one or more embodiments of the present invention;
fig. 4 is a graph illustrating a filling effect according to one or more embodiments of the present invention.
Detailed Description
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct combination or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, each functional unit in the embodiments of the present invention may be integrated into two processing units, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in two computer readable storage media. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
It will be understood by those within the specification of the present application that terms such as "first," "second," "A," "B," and the like, if not specifically stated, do not denote a limitation of order. For example, "step three" may precede "step one," and "D" may also be performed simultaneously with "a".
Aiming at the defects of the prior art, the current situation and the caused reasons of the realization of a common circle ground system are deeply analyzed, the specific requirements of circle ground filling are analyzed and developed, a set of circle ground filling method is summarized to meet the circle ground filling requirement for supporting multi-region sealing, and the high efficiency of algorithm filling is achieved through minimum surrounding regions and mark filling.
First, the coordinates of the filled grid and the walking trajectory grid are acquired. The game map is illustratively represented by a two-dimensional planar coordinate system or a three-dimensional coordinate system, and in the case of a two-dimensional planar coordinate system, the grid of each map has an abscissa x and an ordinate y, i.e., each grid is represented by a unique coordinate (x, y). And acquiring coordinates (x, y) of all filled grids and walking track grids on the map in a traversal mode, and storing the coordinates in a stack in a two-dimensional numerical value form to be used as a territory list.
Second, a minimum bounding region is created. Creating two-dimensional temporary coordinates topLeft (topleft.x, topleft.y) and bottomRight (bottomright.x, bottomright.y), assigning the first grid of the existing territory list to the coordinates topLeft and bottomRight, traversing all the existing territory grid lists and the walking track grid list, taking the current grid as grid.x, grid.y, and if grid.x < topleft.x, topleft.x is grid.x; if grid.y < topleft.y, topleft.y is grid.y; if grid.x > bottomright.x, bottomright.x is grid.x; if grid.y > bottomright.y, bottomright.y is grid.y; until all the grids are traversed. The area formed by the coordinates topLeft to bottomRight is the minimum bounding area. All enclosed areas that can be filled are inside the minimum enclosed area. By determining the minimum enclosing area, the number of traversals for the next area can be effectively reduced, so that the efficiency is improved, and meanwhile, the filled boundary range is defined, namely, once an area (not including the walking track) is the boundary containing the minimum enclosing area, the area is not a closed area. So that later on the seed filling it can be used as a basis to determine whether the area is a closed area. In addition, when the leader list still has the lattice coordinates which are not traversed after one minimum enclosing area is created, a new lattice coordinate is selected, a second minimum enclosing area is created, and the process is repeated, the leader list is divided into a plurality of minimum enclosing areas until all lattices in the leader list are contained in the respective minimum enclosing areas.
Again, the seed to be subsequently filled in the traversal is determined. Since the walking track varies widely and a plurality of closed areas can be formed, and meanwhile, the closed areas need to be associated with the walking track, the seeds in the formed closed areas cannot be directly given. That is, given any one cell in a minimum bounding area, there is no way to know whether the cell is in the enclosed area associated with the track. However, it is known that all the closed regions are in the minimum enclosing region, and here, only eight connected grids flag, namely, upper, lower, left, right, upper left, lower left, upper right, and lower right corresponding to each walking track grid, need to be marked as 1, and used as seeds to be filled and traversed subsequently. Thus, a seed list is obtained, and the flag of the corresponding grid of the seed list is 1. Although the seed list contains some seeds of the non-closed area, all seeds of the closed area which may be associated with the track are also in the seed list, so that in the subsequent filling and marking process, only the seeds of the non-closed area need to be identified and not be filled and marked, and all the seeds in the closed area need to be filled and marked. The 4 connected lattices and 8 connected lattices corresponding to each track lattice are shown in fig. 2.
FIG. 2 is a schematic diagram illustrating a 4-way and 8-way grid according to one or more embodiments of the present invention; wherein a of fig. 2 represents a 4-way lattice, B of fig. 2 represents an 8-way lattice, a solid circle represents a lattice as a base point, an open circle represents a lattice adjacent to the base point lattice, and a connection line connects the base point lattice and the adjacent lattice in a communicating relationship. From the basic point, if any adjacent grids in the arrival area are searched only in the four directions of up, down, left and right, the area filled by the method is called a four-connected domain, and the filled grid is called a 4-connected grid. If starting from the base point, all eight directions reach any adjacent grids in the area through up, down, left, right, left upper, left lower, right upper and right lower, the area filled by the method is called eight-connected domain, and the filled grid is called 8-connected grid. The shape of the lattice itself is not particularly limited, and the lattice may be circular, rectangular, regular hexagonal, regular octagonal, or the like. As can be seen from fig. 2, the 8-way grid has a higher degree of freedom of communication than the 4-way grid, when the walking paths of the game characters intersect to form two closed sections, when the 4-way grid is adopted, two closed areas cannot be connected via the communication relationship between unfilled grids, and when the 8-way grid is adopted, this problem does not exist.
In this example, the 8-connected grids are adopted instead of the 4-connected grids for seed marking because there is a case that there is a closed region in the oblique direction of the trace grid, and the adoption of the 4-connected grids may result in missing seeds of the closed region associated with the trace, so that the subsequent filling mark may miss the closed region. For example, referring to fig. 3, fig. 3 is a schematic diagram illustrating a 4-way grid and an 8-way grid filling multiple zones in accordance with one or more embodiments of the present invention. Where C of fig. 3 represents a plurality of areas filled with 4-way lattices, D of fig. 3 represents a plurality of areas filled with 8-way lattices according to the present invention, solid circles represent lattices serving as base points of a starting point, open solid line circles represent a walking path of a game character, and open dotted line circles represent areas filled with a four-way connected seed filling algorithm, it can be seen that when the area filling is performed with the 4-way connected seed filling algorithm, only 6 open dotted line circular lattices of a lower left closed area are filled, and an upper right closed area is omitted, and the filling range is erroneous. When the 8-direction communication method of the embodiment of the invention is adopted for region filling, the 6 hollow dotted line circular lattices filled in the lower left closed region and the 6 hollow dotted line circular lattices filled in the upper right closed region are all correctly filled, and the filling accuracy is improved.
Next, the closed area is filled, and the filling and marking process is described as follows:
a. setting a current mark variable CurrentSeedFlag to be 2 initially (the mark of the grid is 1, which indicates that the seed needs to be traversed), creating a mark closed list SeedColsedFlags for storing the marks which can be filled (namely the mark number of the grid in the mark closed list indicates that the grid can be filled in the closed area), traversing the grid in the minimum range area from the top left to the bottom right, and starting the algorithm;
b. and taking the next grid in the minimum range area as the current grid, if the current grid is marked as 1 (namely, a seed), performing a marking process on the current grid in a recursion mode, and turning to c. If no next lattice exists, turning f;
c. the marking process begins: if the mark of the grid is CurrentSeedFlag (indicating that the mark is traversed), directly returning to true; if the label of the grid is-1 (indicating that the non-closed area marked by the identification label is already), directly returning failure; if the lattice is on the minimum bounding region boundary or outside the boundary (indicating in the non-enclosed region), label the lattice as-1 and return a failure; otherwise, the grid is marked as CurrentSeedFlag; and acquiring the grids in the four-connection direction of the current grid, and if the existing grid is neither the existing territory grid nor the track grid, recursively marking each grid. If a certain grid marking process in the recursion fails to return, marking the grid as-1 and returning to fail, thereby finally exiting the marking process of the outermost layer, and turning to d; if no lattice marking process returns failure, indicating that the initial current lattice is in the closed area, marking all lattices in the closed area as CurrentSeedFlag, finally exiting the outermost marking process, and turning to e;
d. when the current grid marking process fails, adding 1 to the current marking variable CurrentSeedFlag, and then continuing to switch to b;
e. adding a current marking variable CurrentSeedFlag into a marked closed list SeedColsedFlags, adding 1 to the current marking variable CurrentSeedFlag, and continuing to switch to b;
f. at this point, the filling mark process is ended.
After the completion of the padding flag flow, the flag list seedclosdflags that can be padded is output. The last step is to traverse each grid in the minimum enclosing area, take down the grid as the current grid, if the mark list SeedClosedFlags contains the mark of the current grid or the current grid belongs to the grid of the walking track, the current grid belongs to the grid in the closed area, and then fill the grid into the grid of the current grid until all the grids are traversed. After the flow is finished, all the related closed areas in the walking track can be filled into the territory of the user.
FIG. 4 is a graph illustrating an actual machine effect fill effect in accordance with one or more embodiments of the invention. In fig. 4E, the dark band-shaped area indicates the travel track of the game character, and as can be seen from the figure, the map is divided into two closed areas and one semi-closed area by the adjacent travel track section. F of fig. 4 shows the result of filling in the area in the game map using the method of the embodiment of the present invention on the basis of E of fig. 4. The solid portion is the player's own territory that is filled.
The disclosed embodiment has the following beneficial effects:
1. supporting a circle fill requirement for a map having a plurality of enclosed areas;
the general seed filling method and other filling methods only fill one area, and the land circle filling method in the embodiment can meet the requirement of filling under the condition of sealing multiple areas, so that the accuracy of land circle filling is improved.
2. High efficiency of method fill is achieved by minimum bounding area and marker fill;
the circle filling method in the embodiment firstly determines the minimum enclosing area to be filled to reduce the traversal range, and marks the lattices in the filling process to avoid repeated judgment processing, so that the circle filling efficiency is effectively improved.
According to a second embodiment of the present invention, there is provided an area filling apparatus of a game map, including: a first module that acquires coordinates of the filled lattices and the walking trajectory lattices; a second module that creates a minimal bounding region; a third module that marks an enclosed area within the minimum enclosing area; a fourth module that fills an enclosed area, wherein a minimum bounding area covers coordinates of the filled grid and a walking trajectory grid.
Further, the second module includes the following sub-modules: a first sub-module creating temporary coordinates topLeft and bottomRight; the second submodule traverses the coordinates of the filled grids and the walking track grids, takes the coordinate of the current grid as grid, and assigns a value topleft.x to grid.x if grid.x is less than topleft.x; if grid.y is less than topleft.y, assigning topleft.y to grid.y; if grid.x > bottomright.x, assigning bottomright.x to grid.x; if grid.y > bottomright.y, assigning bottomright.y to grid.y; and the third sub-module establishes a minimum enclosing area based on the coordinates topLeft to the coordinates bottomRight after traversing all the filled grids and the coordinates of the walking track grids.
Further, the grid is a grid with 8 communication directions.
According to a third embodiment of the invention, there is provided a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the method of the first aspect of the invention.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (5)
1. A method for filling an area of a game map is characterized by comprising the following steps:
A. acquiring coordinates of the filled grids and the walking track grids;
B. creating a minimum bounding region;
C. marking an enclosed area within the minimum enclosing area;
D. the enclosed area is filled up with the liquid,
wherein the minimum bounding area covers the coordinates of the filled grid and the walking trajectory grid;
step B further comprises the following substeps:
creating temporary coordinates topLeft and bottomRight;
traversing the coordinates of the filled grids and the walking track grids, taking the coordinates of the currently traversed grids as grid, taking the value of the coordinate grid as the coordinates of the filled grids or the coordinates of the walking track grids, and if grid.x is less than topleft.x, assigning topleft.x to grid.x; if grid.y is less than topleft.y, assigning topleft.y to grid.y; if grid.x > bottomright.x, assigning bottomright.x to grid.x; if grid.y > bottomright.y, assigning bottomright.y to grid.y;
after traversing all the coordinates of the filled grids and the walking track grids, establishing a minimum enclosing area based on the coordinates topLeft to the coordinates bottomRight.
2. The region filling method according to claim 1, characterized in that: the grid is a grid with 8 communication directions.
3. An area filling apparatus for a game map, characterized by comprising:
a first module that acquires coordinates of the filled lattices and the walking trajectory lattices;
a second module that creates a minimal bounding region;
a third module that marks an enclosed area within the minimum enclosing area;
a fourth module that fills the enclosed area,
wherein the minimum bounding area covers the coordinates of the filled grid and the walking trajectory grid;
the second module includes the following sub-modules:
a first sub-module creating temporary coordinates topLeft and bottomRight;
the second submodule traverses the coordinates of the filled grids and the walking track grids, takes the coordinates of the currently traversed grids as grid, takes the coordinate grid as the coordinates of the filled grids or the coordinates of the walking track grids, and assigns a value topleft.x to grid.x if grid.x is less than topleft.x; if grid.y is less than topleft.y, assigning topleft.y to grid.y; if grid.x > bottomright.x, assigning bottomright.x to grid.x; if grid.y > bottomright.y, assigning bottomright.y to grid.y;
and the third sub-module establishes a minimum enclosing area based on the coordinates topLeft to the coordinates bottomRight after traversing all the filled grids and the coordinates of the walking track grids.
4. The zone filling apparatus of claim 3, wherein: the grid is a grid with 8 communication directions.
5. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method of any one of claims 1-2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810076588.7A CN108096835B (en) | 2018-01-26 | 2018-01-26 | Region filling method and device of game map |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810076588.7A CN108096835B (en) | 2018-01-26 | 2018-01-26 | Region filling method and device of game map |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108096835A CN108096835A (en) | 2018-06-01 |
| CN108096835B true CN108096835B (en) | 2021-06-08 |
Family
ID=62221414
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810076588.7A Active CN108096835B (en) | 2018-01-26 | 2018-01-26 | Region filling method and device of game map |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108096835B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109045696A (en) * | 2018-07-24 | 2018-12-21 | 合肥爱玩动漫有限公司 | A kind of closed map Research on Automatic Filling |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1313978C (en) * | 2003-05-21 | 2007-05-02 | 明基电通股份有限公司 | Filling method for closed zone |
| CN104765614B (en) * | 2015-04-24 | 2018-04-10 | 广东小天才科技有限公司 | Color in processing method and processing device |
| WO2017024443A1 (en) * | 2015-08-07 | 2017-02-16 | 浙江大学 | High efficiency parallel vector data visualization method |
| CN107016714B (en) * | 2017-03-14 | 2020-04-24 | 佛山科学技术学院 | Method for filling closed curve graph |
| CN107481190B (en) * | 2017-07-04 | 2018-12-07 | 腾讯科技（深圳）有限公司 | A kind of image processing method and device |
-
2018
- 2018-01-26 CN CN201810076588.7A patent/CN108096835B/en active Active
Non-Patent Citations (1)
| Title |
|---|
| 圈地ios游戏;匿名;《http://www.manew.com/thread-105250-1-1.html》;20170705;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108096835A (en) | 2018-06-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2020134082A1 (en) | Path planning method and apparatus, and mobile device | |
| CN106683167A (en) | Automatic modeling approach for high precision model of complex building | |
| CN107977992A (en) | A kind of building change detecting method and device based on unmanned plane laser radar | |
| CN111185009B (en) | Map generation method and device | |
| KR101086402B1 (en) | Method of image segmentation | |
| KR100947595B1 (en) | Method for voxelization using color coded polygons | |
| CN106123898A (en) | The indoor paths planning method resolved based on picture | |
| CN110517334A (en) | A kind of method and device that map vector data obtains | |
| CN108057245B (en) | Map generation method and device, storage medium and terminal | |
| CN108096835B (en) | Region filling method and device of game map | |
| CN111581756A (en) | Method and device for determining flood inundation range | |
| CN111870952A (en) | Height map generation method, device, equipment and storage medium | |
| CN115757604A (en) | GDP (generalized projection) space-time evolution analysis method based on noctilucent image data | |
| CN109745705B (en) | 2d game map editing method and device | |
| CN109499067B (en) | Terrain texture drawing method and device, electronic equipment and storage medium | |
| CN105138711A (en) | Primitive indexing method, primitive detecting method, primitive indexing device and a primitive detecting device | |
| CN111141768B (en) | Method and device for acquiring rock wettability change in crude oil displacement | |
| CN115952252B (en) | Semantic tile data processing method and device based on dynamic rendering and electronic equipment | |
| CN108090155A (en) | A kind of 2D grids method for searching, device and storage medium | |
| CN106373192A (en) | Non-topology-consistency three-dimensional grid block tracking algorithm | |
| CN107506417A (en) | High-fidelity ground mulching data iteration update method and system | |
| CN112396697B (en) | Method, system and computer readable storage medium for generating area in game map | |
| CN113117334A (en) | Method for determining visible area of target point and related device | |
| CN117274364B (en) | OpenCV-based area calculation method, equipment and storage medium | |
| CN108553902A (en) | A kind of transform method of the multi-dimension material based on UE engines |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: 519000 Room 102, 202, 302 and 402, No. 325, Qiandao Ring Road, Tangjiawan Town, high tech Zone, Zhuhai City, Guangdong Province, Room 102 and 202, No. 327 and Room 302, No. 329 Patentee after: Zhuhai Jinshan Digital Network Technology Co.,Ltd. Patentee after: Guangzhou Xishanju Network Technology Co.,Ltd. Address before: 519000 building 3, Jinshan Software Park, 325 Qiandao Ring Road, Xiangzhou District, Zhuhai City, Guangdong Province Patentee before: ZHUHAI KINGSOFT ONLINE GAME TECHNOLOGY Co.,Ltd. Patentee before: GUANGZHOU SEASUN ENTERTAINMENT NETWORK TECHNOLOGY Co.,Ltd. |