KR20030061210A - Method for automatically generating map data used in a computer game - Google Patents

Abstract

PURPOSE: A method for automatically creating map data being used in a computer game is provided to increase a working speed, reduce a game manufacturing term, and reduce a game manufacturing cost in manufacturing a game graphic. CONSTITUTION: The original picture is manufactured. The original picture is divided into tiles having a predetermined size, and a position number is designated to each tile. The original picture is divided into pictures corresponded to the tile size. The divided pictures are compared with the tiles in order of the position number sequentially. If tiles having the same picture are displayed, a position number of the tile is designated as an index number. A tile corresponded to the index number is loaded in each corresponding position, the tile is inserted, and a screen is constituted. The position number is created by combining a tile block number designated in a tile block which is a tile group and a tile number designated in each tile. After comparing tiles of corresponding tile numbers in a tile block of the lowest tile block number in order of tile number, tiles of corresponding tile numbers are compared in a tile block of the next higher tile block number, sequentially.

Description

How to automatically generate map data for computer games {METHOD FOR AUTOMATICALLY GENERATING MAP DATA USED IN A COMPUTER GAME}

The present invention relates to a method for automatically generating map data used in a computer game, and more particularly, in the generation of map data used in the production of a computer game, it is possible to drastically shorten the production period, and also in terms of production convenience. A method for automatically generating map data used in excellent computer games.

1 is a diagram schematically illustrating a conventional computer game production sequence. As shown, game publishers first go through the planning stages of deciding which games to make, followed by scenario production, graphics production, program production, and music production stages, then the alpha and beta versions are completed and finalized. Leads to

In this case, the scenario production field specifically determines which game the producer will produce, and sets the progress of the game accordingly. Also, graphics

This is a step to set the background image required for the small game and the graphic image of all the characters in the game. In addition, the program production is to produce a program necessary to perform the progress of the game. In addition, the music production is to produce a sound that is output as the effect sound during the progress of the game.

However, the above graphic production is a long-term work that takes up most of the game production period, the programmers can not proceed programming until the completion of the graphic image. Therefore, the prolongation of the graphic production period takes a lot of time to produce the game, thereby causing an increase in the game production cost.

In addition, with the recent activation of the game market, the life cycle of computer games is also getting shorter. Thus, computer games produced over long periods of time cannot be competitive on their own. This is because consumer preferences that the manufacturer intended to reflect at the planning stage may have already changed during the commercialization stage. Therefore, the shortening of the game production period in the field of game production technology is the greatest proposition.

The map (map) constituting the background of the conventional computer game is composed of one map by combining small tiles. In other words, in order to obtain the entire map, a myriad of small tiles were first made, and then, they were stitched together to complete the map. When creating an entire map using these small tiles, the player will use as many tiles of the same type as possible to reduce the game's capacity. The map data about whether it should be put in is extracted and used separately.

In order to obtain such map data, a method of extracting map data by manual operation has been used in the early days. In other words, first, make the necessary tiles by comparing them with the naked eye, and then extract and record the necessary map data by hand-weaving the tiles according to the concept of the entire map, and then create map files by hand based on them. Map data extraction was done in a manner. This was a laborious task that required very long time and concentration.

Thus, as a more advanced form, a map data extraction method has been developed using a map editor. In other words, by making comparisons with the naked eye and making the necessary tiles, and then manually assemble the tiles according to the concept of the entire map, the map editor extracts the necessary map data and creates a map file based on the extracted map data. Map data extraction was done in such a way.

However, although the convenience of work and the speed of work were increased a little, the map data extraction method by the map editor also could not avoid the hassle of attaching pictures to maps one by one. For example, if a tile is 50 * 50 pixels in size and the map shown in the game is 10000 * 10000 pixels in size, 40000 pastes were required to obtain map data. Therefore, the map data creation method by the map editor also had a problem in terms of work convenience and work speed.

SUMMARY OF THE INVENTION The present invention has been made to solve the above problems, and an object of the present invention is to provide a method for automatically generating map data excellent in terms of work convenience in producing game graphics.

In addition, the present invention provides a method for automatically generating map data that enables a significant increase in the work speed in game graphic production, thereby reducing the overall production time and reducing the production cost. .

1 is a diagram schematically illustrating a conventional computer game production sequence.

2A to 2D are conceptual views for schematically illustrating the concept of the present invention.

2A is a view schematically showing a screen of an original picture;

FIG. 2B is a diagram in which the original picture of FIG. 2A is divided into tiles, and the location number is displayed on each tile;

FIG. 2C is a diagram showing index numbers of which tiles should be pasted at each position of the original picture of FIG. 2A;

FIG. 2D is a flowchart schematically illustrating a process of obtaining map data of FIG. 2C from the original picture of FIG. 2A.

3A to 3D are views for schematically explaining a preferred embodiment of the present invention.

3A is a view schematically showing a screen of an original picture;

FIG. 3B divides the original picture of FIG. 3A into respective tile plates and tiles, and tiles to each tile

Shows the location number of,

FIG. 3C is a view showing index numbers of which tiles should be pasted at each position of the original picture of FIG. 3A;

FIG. 3D is a flowchart schematically illustrating a process of obtaining map data of FIG. 3C from the original picture of FIG. 3A.

In order to achieve the above object, the present invention automatically retrieves and compares similar parts of a whole map through a program, and automatically extracts similar tiles as one tile, and when the entire map is composed of tiles again, the extracted tiles are extracted. It provides a method of automatically generating map data by automatically recognizing and importing and pasting tiles at appropriate positions.

Looking specifically, the present invention is the original production step of producing original paintings; A tile manufacturing step of dividing the original picture into tiles of a predetermined size and assigning a position number to each tile; The index numbering step of dividing the original picture into a picture corresponding to the tile size, sequentially comparing each of the tiles with the tiles in the order of the location number, and assigning the corresponding location number of the tile as the index number when the tiles of the same picture appear. ; For each position, retrieve and paste the tile corresponding to the given index number to construct the screen.

The present invention provides a method for automatically generating map data used in a computer game, comprising: a screen configuration step.

According to a preferred embodiment of the present invention, the position number is a tile plate number assigned to each tile plate which is a predetermined size set of the tiles, and a tile number assigned to each tile constituting the tile plate in each tile plate. In the index numbering step, the tile number of the lowest tile plate number is compared with each tile of the corresponding tile number in order of the tile number, and it is sequentially repeated in the tile plate of the high tile plate number.

Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings.

2A to 2D are views for schematically illustrating the concept of the present invention, and FIG. 2A is a view schematically showing a screen of an original picture. For convenience of explanation, the original picture of the screen as shown in FIG. 2A will be described as an example. Also, assume that the picture of a tile (pictures 4 to 13 columns, tiles 4 to 13 rows) without a picture is different from the picture of the tile in which the picture is shown, and the size of the original picture is 800 * 800 pixels. Assume that we have The original picture is drawn using a graphic tool, which must be stored in a computer readable file such as a BMP file. The resolution of the original picture is not limited.

FIG. 2B is a diagram in which the original picture of FIG. 2A is divided into tiles, and the position number is displayed on each tile. As shown, dividing the 800 * 800 pixel sized original of FIG. 2A into 50 * 50 pixel sized tiles each yields a total of 256 tiles of 16 * 16. Since the same or similar tiles are often used in the original picture, the number of tiles actually used will be 256 or less. Since a maximum of 256 tiles exist, the location number of the tiles can be represented by 1 byte data. This is illustrated in FIG. 2B, in which the tiles in row 1 and column 1 are given hexadecimal numbers with 00, the tiles in row 1 and 2 with hexadecimal numbers, 01 with position numbers, followed by tiles in 16 rows with 16 hexadecimal numbers. The position number of FF is assigned.

FIG. 2C is a diagram showing index numbers of which tiles should be pasted at each position of the original picture of FIG. 2A. As shown in Fig. 2A, the picture of the 00 position of the original picture is the same as the tile of the position number 00, so that 00 is given as the index number. Next, since the picture of position 01 of the original picture is not the same as the position number 00 tile which is the preceding tile, and is the same as the position number 01 tile, 01 is assigned as the index number. Next, since the picture at position 02 of the original picture is the same as the position number 00 tile which is the preceding tile, 00 is assigned as the index number. In this way, index numbering is repeated. For example, the picture of the FF position of the original picture is not the same as the preceding tiles of position number 00 to CF tile, and the tile of the same picture appears only after reaching the position number D0 tile. Therefore, the index number is assigned D0.

FIG. 2D is a flowchart schematically illustrating a process of obtaining map data of FIG. 2C from the original picture of FIG. 2A. This starts with the original production as shown. Next, we make tiles and give each tile a location number. Next, read the produced tile and the original picture into memory.

Next, the index numbering step follows. In the index numbering step, first, a picture of a tile size (50 * 50 pixel size) is cut from the original picture and compared with the read tiles. In the case of the same picture, the position number assigned to the tiles of the same picture is assigned as the index number of the picture, and the memory number is written and the counter of the memory is increased by one. However, if it is not the same figure, it is compared with the tile of the next position number. This operation is repeated by the size of the original picture. Once this is done, map data of 1 * (horizontal size of the premise map / horizontal size of the tile) * (vertical size of the entire map / vertical size of the tile) bytes is generated.

When the index numbering step is completed, a map file is generated next, and the screen is constructed using the map file in the game.

In the method of generating map data of FIGS. 2A to 2D, an original image having a size of 800 * 800 pixels has been described as an example. However, the method of generating map data of FIGS. 2A to 2D may be extended to an original having a larger capacity. In this case, however, it is not preferable to simply divide the original picture into tiles and generate map data. This is because when composing a screen in a game, only a part of the original is displayed on the screen, not the entire original. In other words, it is preferable to generate map data on the basis of tile plates because only a few tile plates described later are sufficient to display a screen on the user computer.

3A to 3D are views for schematically explaining an embodiment of the present invention, and FIG. 3A is a view schematically showing a screen of an original picture. The original picture of FIG. 3A is described by taking a picture of 10000 * 10000 pixel size as an example. As in FIG. 2A, it is assumed that a picture of a tile in which a picture is not shown is different from a picture of a tile in which a picture is shown.

FIG. 3B is a diagram showing the original picture of FIG. 3A divided into tile plates and tiles, and a tile position number displayed on each tile. The original picture is divided into tiles, for example, 50 * 50 pixels, to form a tile. Thus, up to 200 * 200 tiles are required for an original of 10000 * 10000 pixel size.

When tile production is completed, a tile plate which is a bundle of tiles is made. The tile board should be saved as a file such as BMP like the original picture. If you create an 800 * 800 pixel tile, 16 * 16 tiles of 50 * 50 pixel size will be aligned. In order to display the tile plate number of the tile plate, the tile plate number is indicated by allocating 1 byte. For example, tile plate numbers are assigned in hexadecimal order from the top left tile plate to 00, 01, 02 ... in order.

In the map, the avatar has three layers: the layer that the avatar cannot step on, the layer that the avatar cannot step on, and the layer that is drawn on the head of the avatar. If the file name is 000.bmp, 001.bmp, 002.bmp ..., the second layer is named 100.bmp, 101.bmp, 102.bmp ... and the third layer. Name the file in the order of 200.bmp, 201.bmp, 202.bmp ... Always use 24-bit BMP, and the transparent color is pink with RGB (255,0,255).

In addition, a tile number is assigned to each tile of each tile plate, and also a tile number is indicated by allocating 1 byte. For example, tile numbers are assigned in hexadecimal notation from the top left tile to 00, 01, 02 ... in each tile plate.

Finally, the position number of each tile is shown by combining the tile plate number and the tile number. For example, in the case of tile plate number 00 and tile number 01, the position number is written as 2-byte data of upper byte 01 and lower byte 00.

FIG. 3C is a diagram showing index numbers of which tiles should be pasted at each position of the original picture of FIG. 3A.

FIG. 3D is a flowchart schematically illustrating a process of obtaining map data of FIG. 3C from the original picture of FIG. 3A. As shown, the alternative flow is similar to the flowchart of FIG. 2D. However, the flowchart of FIG. 3D includes the step of manufacturing a tile plate which is a bundle of tiles. In addition, in the index numbering step, the tiles of the lowest tile plate number are compared with each tile of the tile number in the order of the tile number and the original picture, and are sequentially repeated in the tile plate of the high tile plate number. In other words, the comparison with the original is repeated from the tile of position number 00 00 to the tile of FF 00, and then the comparison with the original is repeated from the tile of position number 00 01 to the tile of FF 01. The comparison of original and tile for numbering is repeated. After this operation is completed, map data of 2 * (width of the entire map / width of the tile) * (length of the entire map / length of the tile) bytes is completed.

In the loading step of the tile plate and the original picture, it is preferable to sequentially load the tile plate to be compared with the original picture. This is because the capacity increases when the entire tile plate is loaded at once. Specifically, map data is generated by comparing the original image by loading the position number 00 tile plate, and generating map data by comparing the original image by loading the position number 01 tile plate, and repeating this until the last tile plate. It is.

Of course, in the original picture, as described above, three layers are required to express the three layers drawn on the avatar's head, the avatar's step on the avatar, and the avatar's head, and the above operations are repeated for each original picture.

The map file completes the map file by storing data in the order of 2 bytes of header for identifying the file, the width of the map, the vertical size of the map, and the above map data.

In the game, an index number is obtained by using the map data values stored in the map file, and then a tile corresponding to the index number is retrieved and pasted on the screen to configure a screen.

As a result of the test of the present inventors, it took one week when the map data was extracted using the conventional map editor, but according to the present invention, the map data creation time was shortened to 10 minutes. This would be a workload that would take more than a month if the conventional full manual map data production process. This shortening of production period becomes more pronounced as the entire map becomes larger.

According to the above-described configuration, the present invention has the effect of providing a method for automatically generating map data excellent in terms of work convenience in producing game graphics.

In addition, the present invention has an effect that can provide a map data automatic generation method that can reduce the production cost and the overall game production period through a significant increase in the work speed in the game graphics production.

Claims (2)

Original production step of producing the original painting; A tile manufacturing step of dividing the original picture into tiles of a predetermined size and assigning a position number to each tile; Dividing the original picture into a picture corresponding to the tile size, and sequentially comparing each of them with the tile in order of the position number, and when the tiles of the same picture appear, assigning an index number of the tile to the index number; A screen configuration step of constructing a screen by importing and pasting a tile corresponding to the given index number for each location; Map data automatic generation method used in a computer game comprising a. The method of claim 1, The position number is made up of a combination of tile plate numbers assigned to tile plates, which are sets of predetermined sizes of the tiles, and tile numbers assigned to tiles constituting the tile plate, respectively, in each tile plate. In the index numbering step, the tile number of the lowest tile plate number is compared with each tile of the corresponding tile number in the order of the tile number, and sequentially An automatic method of generating map data used in a computer game, characterized by repeating on a tile board.