• 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

• 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.

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

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

• Korean Journal of Computational Design and Engineering
• /
• v.8 no.2
• /
• pp.75-83
• /
• 2003

In this paper, OSP(Octal Space Partitioning) tree is proposed for the real time culling of infinite sets of geometries in interactive Virtual Environment applications. And MSVBSP(Modified Shadow Volume BSP) tree is suggested for the occlusion culling. Experimental results show that the OSP and MSVBSP tree are efficiently implemented in real time rendering of interactive geometries.

• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.613-618
• /
• 2006

본 논문은 3차원 가상 환경을 탐험하는데 있어서 빠르고 효과적으로 충돌 탐지를 검출하는 방법을 제안하고자 한다. 넓은 가상 공간상에서 개체가 증가하는 것에 비례하여 충돌 탐지의 계산 비용은 기하 급수적으로 증가한다. 이를 효과적으로 처리하기 위하여 BSP-tree 분할 방식과 경계 기둥을 사용한다. BSP-tree 분할 방식은 3차원의 넓은 가상 공간을 여러 하위 공간으로 나누어 충돌 탐지가 이루어지는 공간을 축소한다. 이를 통하여 충돌 탐지 개체의 수가 증가하는 것에 따라 기하 급수적으로 증가하는 경계 기둥의 충돌 탐지 비용을 줄이는 효과를 얻을 수 있다. 경계 기둥은 축소된 하위 공간 상에서 개체간 실제 충돌 탐지가 일어날 가능성 및 충돌 여부를 빠르고 간편하게 판별하도록 한다.

• 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 Multimedia Society Conference
• /
• 2000.11a
• /
• pp.143-146
• /
• 2000

본 논문에서는 다수의 실내 영상으로부터 영상을 촬영한 카메라의 속성정보와 실내 환경에 대한 기하정보를 추출하는 방법을 제안한다. BSP-Tree를 이용하여 주어진 실영상을 각각의 부분 영역이 실제로도 평면 영역에 해당되도록 분할하였으며, 특징점 대응을 통해 각 분할된 영역의 영상간 대응을 찾고 이로부터 각 분할 영역의 homography를 계산하였다 또한 간단한 가정을 통해 계산된 homography로부터 각 분할영역에 대응된 평면의 방정식과 각 영상을 촬영한 카메라의 속성을 찾아낼 수 있믐을 보였다. 본 논문에서 제안한 방법은 현재 본 연구팀이 구현 중인 영상기반 모델링 시스템에서 핵심적인 기능을 수행하리라 기대된다.

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

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

• Journal of Digital Convergence
• /
• v.13 no.4
• /
• pp.303-310
• /
• 2015

Game technologies are now applied in various engineering areas such as the simulation of surgical operation or the implementation of a cyber model house. One of the essential and important technology in these applications is cutting of the 3D polygon model in real time. Real-time cutting technology is an essential technology needed to implement the simulation of a building demolition or a car assembly for training or educational purpose. Previous cutting method using the conventional BSP-Tree structure has some limitations in that they divide the whole world including the 3D model and its environment, only into two parts with respect to an infinite plane. In this paper, we show a technique cutting the 3D model in a finite extent in order to solve this problem. Specifically, we restricted the cut surface in a finite rectangular area and constructed the mesh for the divided surface. To show the usefulness of our partial cutting technique, an example of the dismantling process simulation of a nuclear reactor polygon model was illustrated.

• 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.