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

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

For virtual reality, virtual manufacturing system, or simulation based design, we need to visualize very large and complex 3D models which are comprising of very large number of polygons. To overcome the limited hardware performance and to attain smooth realtime visualization, there have been many researches about algorithms which reduce the number of polygons to be processed by graphics hardware. One of these algorithms, occlusion culling is a method of rejecting the objects which are not visible because they are occluded by other objects, and then passing only the visible objects to graphics hardware. Existing occlusion culling algorithms have some shortcomings such as the required long preprocessing time, the limitation of occluder shape, or the need for special hardware implementation. In this study, an efficient occlusion culling algorithm is proposed. The proposed algorithm reads and analyzes Z-buffer of graphics hardware using Microsoft DirectX, and then determines each object's visibility. This proposed algorithm can speed up visualization by reading Z-buffer using DirectX which can access hardware directly compared to OpenGL, by reading only the region to which each object is projected instead of reading the whole Z-Buffer, and the proposed algorithm can perform more exact visibility test by using simplified model instead of using bounding box. For evaluation, the proposed algorithm was applied to very large polygonal models. And smooth realtime visualization was attained.

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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04a
• /
• pp.703-706
• /
• 2002

최근 컴퓨터 그래픽스 분야에서 보다 현실감 나는 영상을 제공하기 위해, 많은 기하로 구성될 뿐만 아니라 깊이 복잡도가 매우 높은 데이터가 요구되어지고 있다. 또한 기하학적으로 늘어나는 데이터를 실시간에 처리해 줄 수 있는 고성능의 렌더링 시스템에 대한 요구도 높아지고 있다. 이에 본 논문에서는 OpenGL 기반에서 occlusion culling을 1-패스에 처리하여 고성능을 보여주는 렌더링 구조를 제안한다. 이는 2-패스의 기존 구조에서 반복적으로 발생되는 불필요한 연산을 효과적으로 제거하여 성능을 높여주고 파워 소모도 최소로 하고 있다. 실험을 통해 제안 구조가 기존 구조에 비해 $1.2\sim1.5$배 성능 향상을 보임을 알 수 있었다.

• Journal of Korea Game Society
• /
• v.14 no.6
• /
• pp.29-38
• /
• 2014

In the large scale indoor 3D game scenes, the data amount of potentially visible set (PVS) which pre-computes the information of occlusion culling can be huge. However, the large part of them can be represented as zero. In this paper, the effective hardware structure is designed, which compresses PVS data as the way of zero run length encoding (ZRLE) during building the scene trees of 3D games in mobile environments. The compression ratio of the proposed structure and the rendering speed (frame per second: FPS) according to both PVS culling and frustum culling are analyzed under 3D game simulations.

• Journal of the Korea Computer Graphics Society
• /
• v.15 no.4
• /
• pp.1-11
• /
• 2009

In this paper, we present a prism-based mesh culling method to improve effectiveness of continuous collision detection which is a major bottleneck in a simulation using polygonal mesh models. A prism is defined based on two matching triangles between a sequence of times m a polygonal model. In order to detect potential colliding set(PCS) of prism between two polygonal models in a unit time, we apply the visibility test based on the occlusion query to two sets of prisms which are defined from two polygonal models in a unit time. Moreover, we execute the narrow band culling based on SAT(Separating Axis Test) to define potential colliding prism pairs from PCS of prisms extracted as a result of the visibility test. In the SAT, we examine one axis to be perpendicular to a plane which divides a 3D space into two half spaces to include each prism. In the experiments, we applied the proposed culling method to pairs of polygonal models with the different size and compared the number of potential colliding prism pairs with the number of all possible prism pairs of two polygonal models. We also compared effectiveness and performance of the visibility test-based method with those of the SAT-based method as the second narrow band culling. In an experiment using two models to consist of 2916 and 2731 polygons, respectively, we got potential colliding prism pairs with 99 % of culling rate.

• Journal of Korea Game Society
• /
• v.9 no.6
• /
• pp.179-189
• /
• 2009

We present a novel shadow culling algorithm for interactive ray tracing. Our approach exploits frame-to-frame coherence instead of preprocessing of building shadow data, so this algorithm is suitable for dynamic ray raying. In this algorithm, shadow processing results are stored to each primitive and used in the next frames. We also present a novel occlusion testing method. This method corrects potential shadow errors in our culling algorithm and requires low overhead. Experiment results show that our algorithm reduced both the traversal cost by 7-19 percent and the intersection cost by 9-24 percent.

• ETRI Journal
• /
• v.44 no.1
• /
• pp.85-93
• /
• 2022

We propose an efficient method for synthesizing mesh-based realistic computer-generated hologram (CGH). In a previous nonanalytic mesh-based CGH synthesis, the angular spectrum of the two-dimensional (2D) plane is calculated using the fast Fourier transform (FFT) with the same size as the resolution of the final hologram. Because FFT increases the computation time as the size of the input matrix increases, the previous method has a problem: The higher the resolution of the hologram, the greater the computational load, thereby delaying synthesis time. In this study, when calculating the angular spectrum of the 2D plane in mesh-based CGH synthesis, we propose a method to calculate the angular spectrum by defining the 2D plane with an arbitrary size smaller than the resolution of the final hologram. The resolution adjustment method reduces the computation time and can be applied to occlusion culling and texturing for the realistic effect of mesh-based CGH. We describe the principle, error analysis, application of realistic effect, and experimental results of the proposed method.