• Journal of the Korea Society of Computer and Information
• /
• v.10 no.3 s.35
• /
• pp.345-352
• /
• 2005

This paper aims to design Game Rendering Engine for real-time 3D online games. Previous, in order to raise rendering speed, BSP tree was used to partitioned space in Quake Game Engine. A game engine is required to develop for rapidly escalating of 3D online games in Korea. too. Currently rendering time is saved with the hardware accelerator which is working on the high-level computer system. On the other hand, a game engine is needed to save rendering time for users with low-level computer system. Therefore, a game rendering engine is which reduces rendering time by PVS look-up table using Empty space BSP tree designed and implemented in this paper

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.451-454
• /
• 2002

충돌검사는 사실감 있는 3 차원 공간을 시뮬레이션 하기 위해서 필수적인 요소이다. 본 논문에서는 BSP 로 표현될 수 있는 정적 게임환경과 Bounding Sphere 로 표현될 수 있는 움직이는 물체와의 효과적인 충돌검사 방법에 대해서 기술하고 있다. 본 논문에서 제안하는 충돌검사 알고리즘은 단 하나의 BSP 트리를 사용하여 임의의 크기의 bounding sphere 와 충돌검사를 할 수 있다는 장점을 가진다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.1_2
• /
• pp.1-14
• /
• 2006

Sort-last parallel rendering using a cluster of GPUs has been widely used as an efficient method for visualizing large- scale volume datasets. The performance of this method is constrained by load balancing when data parallelism is included. In previous works static partitioning could lead to self-balance when only task level parallelism is included. In this paper, we present a load balancing scheme that adapts to the characteristic of volume dataset when data parallelism is also employed. We effectively combine the hierarchical data structures (octree and BSP tree) in order to skip empty regions and distribute workload to corresponding rendering nodes. Moreover, we also exploit a 3D clustering method to determine visibility order and save the AGP bandwidths on each rendering node. Experimental results show that our scheme can achieve significant performance gains compared with traditional static load distribution schemes.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.11-14
• /
• 2002

게임에서 충돌탐지는 게임의 성능향상을 위해 중요하다. 본 논문에서는 효율적인 충돌탐지를 위해 BSP 트리를 사용한다. 공격에 사용되는 스프라이트와 공격의 대상이 되는 스프라이트를 트리로 구성하여 빠른 시간내에 충돌탐지를 행한다. 또한 스프라이트의 모양에 따라 경계 볼륨(bounding volume)을 구와 박스(box)를 선택적으로 사용하여 충돌탐지에서 발생하는 문제점을 해결한다.

• Journal of the Korea Computer Graphics Society
• /
• v.2 no.2
• /
• pp.1-9
• /
• 1996

It is important issue to increase the efficiency of visibility operations in rendering since the most of rendering time is spent for performing visibility operations. In this paper, we present light buffers of area light sources, which provide efficient visibility operations from the sources. The light buffers are extended to support visibility operations not originated from the sources. We also explore their applications such as shadow generation, ray tracing and radiosity. Our experimental results show that the light buffers support more efficient visibility operations than the previously developed data structures including BSP trees, linear grids, and octrees.

• KIEAE Journal
• /
• v.11 no.6
• /
• pp.95-100
• /
• 2011

Although Space Syntax is a well-known technique for spatial analysis, debates have taken place among some researchers because the Space Syntax discards geometric information as both shapes and sizes of spaces, and hence may cause some inconsistencies. Therefore, this study aims at developing methods to recognize and manage spatial shapes for more precise space syntax analysis. To reach this goal, this study employed both a graph theory and binary spatial partitioning (BSP) tree to recognize and manage spatial information. As a result, spatial shapes and sizes could be recognized by checking loops in graph converted from spatial shapes of built environment. Each spatial shape could be managed sequentially by BSP tree with hierarchical structure. Through such recognition and management processes, convex maps composed of the fattest and fewest convex spaces could be drawn. In conclusion, we hope that the methods developed here will be useful for urban planning to find appropriate purposes of spaces to satisfy the sustainability of built environment on the basis of the spatial and social relationships in urban spaces.

• Journal of the Korea Computer Graphics Society
• /
• v.5 no.2
• /
• pp.9-23
• /
• 1999

Visibility preprocessing is a useful method to reduce the complexity of scenes to be processed in real-time, and so enhances the overall rendering performance for interactive visualization of virtual environments. In this paper, we propose an efficient visibility preprocessing method. In the proposed method, we assume that navigatable areas in virtual environments are partitioned into rectangular parallelpiped cells or sub-worlds. To preprocess the visibility of each polygon for a given partitioned cell, we should determine at least the area-to-area visibility. This is inherently a four-dimensional problem. We efficiently express four-dimensional visibility information on two-dimensional spaces and keep it within a ternary tree, which is conceptually similar to a BSP(Binary Space Partitioning) tree, by exploiting the characteristics of conservative visibility. The proposed method is able to efficiently handle more general environments like urban scenes, and remove invisible polygons jointly blocked by multiple occluders. The proposed method requires O(nm) time and O(n+m) space. By selecting a suitable value for m, users can select a suitable level of trade-off between the preprocessing time and the quality of the computational result.