• Journal of the Korea Computer Graphics Society
• /
• v.9 no.4
• /
• pp.1-7
• /
• 2003

본 논문에서는 GPU와 스텐실 버퍼(stencil buffer) 및 깊이 버퍼(depth buffer)를 이용하여 가려진 픽셀들을 렌더링 단계 이전에 건너뛰는(skipping) 방법을 제시하고자 한다. 그래픽 카드에 기본적으로 제공되는 기능인 깊이 및 스텐실 버퍼 검사(depth & stencil buffer test)를 이용하여 이진 차폐 맵(binary occlusion map)을 만들고 이를 재사용하여 가려지는 부분의 픽셀들을 효과적으로 건너뛰게 하는 방법이다. 전체 볼륨 데이터는 팔진트리(octree) 구조를 가진 서브볼륨들로 나뉘어 저장되며 시점에 가까운 서브볼륨부터 렌더링에 사용된다. 서브볼륨들을 차례로 렌더링하면서 차폐 맵을 갱신하게 하면, 멀리 있는 서브볼륨들을 렌더링할 때 이미 가려진 픽셀들을 렌더링에서 제외할 수 있다.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.11
• /
• pp.67-76
• /
• 2011

This paper describes the development of interactive visualization techniques and a program that allow us to visualize the structure of the volume data and interactively select and visualize the isosurface components using contour tree. The main characteristic of this technique is to provide an algorithm that draws the contour tree in 2D plane in a way that users easily understand the tree, and to provide an algorithm that can efficiently extract an isosurface component utilizing GPU's parallel architecture. The main characteristic of the program we developed through implementing the algorithms is to provide us with an interactive user interface based on the contour tree for extracting an isosurface component and visualization that integrates with previous isosurface and volume rendering techniques. To show the excelland vof our methods, we applied 3D biomedical volume data to our algorithms. The results show that we could interactively select the isosurface components that represent a polypeptide chain, a ventricle and a femur respectively using the user interface based on our contour tree layout method, and extract the isosurface components with 3x-4x higher speed compared to previous methods.

• The KIPS Transactions:PartA
• /
• v.15A no.1
• /
• pp.1-8
• /
• 2008

An occlusion culling method, one of visibility culling methods, excludes invisible objects or triangles which are covered by other objects. As it reduces computation quantity, occlusion culling is an effective method to handle complex scenes in real-time. But an existing common occlusion culling method, such as hardware occlusion query method, sends objects' data twice to GPU and this causes processing overheads once for occlusion culling test and the other is for rendering. And another existing hardware occlusion culling method, VCBP, can test objects' visibility quickly, but it neither test bounding volume nor return test result to application stage. In this paper, we propose a single pass occlusion culling method which uses temporal and spatial coherency, with effective occlusion culling hardware architecture. In our approach, the hardware performs occlusion culling test rapidly with cache on the rasterization stage where triangles are transformed into fragments. At the same time, hardware sends each primitive's visibility information to application stage. As a result, the application stage reduces data transmission quantity by excluding covered objects using the visibility information on previous frame and hierarchical spatial tree. Our proposed method improved maximum 44%, minimum 14% compared with S&W method based on hardware occlusion query. And the performance is increased 25% and 17% respectively, compared to maximum and minimum performance of CHC method which is based on occlusion culling method.