• Journal of Industrial Convergence
• /
• v.16 no.1
• /
• pp.35-40
• /
• 2018

The procedural generation algorithm is an algorithm that automatically generates a content to be used in a game by repeatedly executing a series of rules. As the size of the game increases, the amount of content used in the game increases. Accordingly, artificial intelligence research is actively conducted to automatically generate game contents using game artificial intelligence such as procedural generation. In this paper, we propose an algorithm to create 3D game world using procedural generation. The proposed algorithm generates a two-dimensional contour in which the path is naturally connected using Perlin-Noise whose noise is gradually changed. A three-dimensional Height-Map is created based on the generated two-dimensional contour lines. The generated Height-Map show that the shape of the map is normal and that the player is able to move around all the sections as in the game world created by hand. In the future, we will improve the performance of algorithms and apply them to game.

• Journal of Korea Multimedia Society
• /
• v.7 no.10
• /
• pp.1464-1477
• /
• 2004

Recently, there is a growing consideration that game authoring tools can play an important role in producing 3D games. In this paper, we introduce our 3D game authoring tool. The tool consists of a map editor, a sound editor, a game data exporter/previewer, and a special effect editor. This tool can help a game designer Produce game data such as game maps, sound effects, and special effects, and so on. In this paper, we implemented a prototype game content to verify the effectiveness of the developed authoring tool.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.301-304
• /
• 2014

비정형 게임 Big Data에서 고효율 정보를 추출하고, 신뢰 할 수 있는 클러스터 게임서버 환경을 위한 병렬 처리를 위해 MapReduce를 사용한다. 본 논문에서는 빈번하게 입력되는 신규 게임데이터 처리를 위해 함수 Demap을 사용하는 Incremental MapReduce를 적용하여 불필요한 중간 값 저장과 재계산 없이 점차적으로 MapReduce 함수를 실행한다.

• Journal of Korea Game Society
• /
• v.10 no.4
• /
• pp.73-80
• /
• 2010

This paper proposes an effective method to select MIP-Map level of texture images for ray-traced texture mapping. This MIP-Map level selection method requires only the total length of intersected ray. By supporting MIP-Map for texture mapping, we can reduce the texture aliasing effects, while our approach decreases rendering performance very slightly.

• Journal of Korea Game Society
• /
• v.7 no.1
• /
• pp.3-10
• /
• 2007

The maps in the world of the role playing games provide not only areas for motions and actions of player characters, but also worlds of totally included monsters and NPC(Non Player Character). However, the design of maps and monsters in them could not be tested for their balances until the games had been developed quite a bit. So they need additional expense of extension period of developments. In this paper, we have designed and developed a map simulator to expect the popularities of the maps in the early stage of the game planning in order to prevent inefficient concentration of users on some maps by expecting the popularities of the maps in the early stage of game planning and by setting the parameters of monster arrangements in the map.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.4
• /
• pp.51-56
• /
• 2019

In this paper, we propose an algorithm that can quickly generate and synthesize city maps in racing games. Racing games are characterized by moving a wide map rather than a fixed map, but designing and developing a wide map requires a lot of production time. This problem can be mitigated by creating a large map in the preprocessing step, but a fixed map makes the game tedious. It is also inefficient to process all the various maps in the preprocessing step. In order to solve this problem, we propose a technique to create a terrain pattern in the preprocessing process, to generate a map in real time, and to synthesize various maps randomly. In addition, we reduced unnecessary rendering computations by integrating view-dependent techniques into the proposed framework. This study was developed in Unity3D and can be used for various contents as well as racing game.

• Journal of Korea Game Society
• /
• v.12 no.3
• /
• pp.69-76
• /
• 2012

At MMORPGs that has the numerous game users with many interactions at the same virtual world, massive loading that results in delays, resource shortages, and other such problems occur. To solve this, many developers devote research to load-balancing servers, yet due to steady and dynamic map divisions, such research is unreliable. This paper proposes a game user-oriented load balancing scheme for the load balancing of MMORPG servers. This scheme shows effectiveness at dealing with hot-spots and other gatherings of game users at specific servers compared to previous methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7B
• /
• pp.991-1000
• /
• 2010

The Hierarchical Mobile IPv6 (HMIPv6) has been proposed to accommodate frequent mobility of the Mobile Node. HMIPv6 can effectively reduce the signaling overhead and latency. However, it has a problem that the registration of a mobile node concentrates on the furthest MAP(Mobility Anchor Point) when the mobile node enters into a new domain. This paper proposes a new load distribution mechanism by using the concept of Nash Bargaining Solution. The main advantage of the proposed scheme can prevent load concentration from being registered to the specified MAP based on the weight value according to the available resource-ratio of a MAP. With a simulation study, the proposed scheme can improve network performance under widely diverse traffic load intensities.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2020.01a
• /
• pp.203-205
• /
• 2020

본 논문에서는 게임 엔진에서 사용되는 노말맵(Normal Map)의 원리와 그 응용 방식에 대해 연구하였다. 노말맵은 게임에서 하이 폴리곤 모델링에 적용되는 조명 적용 데이터를 로우 폴리곤에 적용할 수 있는 기술로, 하이 폴리곤 모델링의 벡터 방향 데이터를 텍스쳐로 저장하여 로우 폴리곤에 적용해서 벡터 방향을 텍셀단위로 조정할 수 있게 한다. 여기에서는 게임에서의 노말맵 저장 방식과 연산 방식에 대해 소개하고 이를 응용하여 최적화 시킬 수 있는 방법에 대해 연구한다.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.863-868
• /
• 2002

In this paper we suggested a map management method for on line RPG supporting full 3D. In general, it is possible to support full 3D with client engine. Rut the online game server cannot show the expected performance under normal price constrains with current hardware technology, since the amount of data for management of 3D on-line game server increase exponentially with respect to the size of game world. To solve this problem. we introduced the "special object" which makes it possible for on-line game server with low performance hardware. This suggested method gave concrete from to manage full 3D for server as well as clients.s clients.