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

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

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

• IEMEK Journal of Embedded Systems and Applications
• /
• v.9 no.2
• /
• pp.61-66
• /
• 2014

Temporal disappearance of weather phenomena effect is frequently observed in flight simulator when large volume of terrain data are processed. This problem was solved by employing culling scheme at static ratio in the existing scheme. However, since this approach causes the irregular rendering speed according to volume of data, it is necessary to develop a new culling scheme to maintain steady rendering speed by adjusting the culling ratio dynamically. In this paper, we propose a new culling scheme to make use of distance of the visibility to determine culling ratio depending on volume of terrain data. The experimental results show that rendering speed is preserved by the proposed scheme without affecting the visuality at rendering the scene and weather phenomena effect together.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.10
• /
• pp.6917-6924
• /
• 2015

The universal nature of humans is formed by the view angle and the visibility range. However, the majority of theories on spatial structure analysis based on the visual perception do neither reflect the view angle nor consider only the flat view angle. Some theories that reflect them is a theory where the part included in the view angle and the part excluded in the view angle have been separated in a dichotomous way, excluding the universal characteristics of humans. This study applied an observing probability to a 3-D visibility analysis theory by conducting a eye-tracking experiment, empirically determining the limits of the field of view, and deriving the observing probability by view angle. In addition, it attempted to identify the probability by manufacturing an application of spacial, visual perception analysis and applying the concept of multiple frustum culling. For the characteristics of observation, the data were measured and collected regarding the walking course for 3 minutes for an optional space, aimed for 33 people as subjects. Subsequently, the data were prepared by analyzing the observation fixation frequency probability.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1999.06a
• /
• pp.15.1-21
• /
• 1999

Radiosity method is a global illumination model for image synthesis. It computes all energy interactions among diffuse elements in a virtual environment. One of the major drawbacks if its time consuming computation. Existing radiosity algorithms for static scene is difficult to be applicable to dynamic environments. In this paper we proposed an hierarchical scene partition scheme to speedup the link update computations in the dynamic environments. Since the proposed spatial data structure is global, it not only can be used to speedup the culling of non-affected links after geometry change, but also can be used to accelerate the subsequent visibility computation. Several empirical tests are given to show the efficiency of our improved algorithm.

• Journal of Advanced Navigation Technology
• /
• v.15 no.4
• /
• pp.616-625
• /
• 2011

There are two representative geometry rendering methods. One is Geometry Clipmaps, another is ROAM 2.0. We propose an extended Geometry Clipmaps algorithm which does not focus on CPU operation but the GPU for faster and wider visibility area. The extended algorithm presents mesh configuration method of each level by LOD, how to configurate Mesh network between levels, mesh block method for rendering optimization using VFC, and image mapping method to get high resolution up to 1 m.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1713-1716
• /
• 2005

최근 3 차원 그래픽 영상의 복잡도가 점점 증가함에 따라, 가시성 선별에 관련된 연구는 3 차원 렌더링 프로세서 설계에 있어서 중요한 핵심 연구 중 하나가 되었다. 본 논문에서는 기존의 픽셀 캐쉬의 정보를 이용하여 가시성 선별을 수행하는 새로운 래스터라이제이션 파이프라인을 제안하고 있다. 제안 구조에서는 가시성 정보를 관리하기 위해서 계층적 z-버퍼 (HZB)와 같이 규모가 큰 별도의 하드웨어를 추가하지 않고, 픽셀 캐쉬에 저장되어 있는 데이터를 참조하여 주사 변환 과정에서 가시성 선별을 수행하고 있다. 캐쉬에서 접근 참조 실패된 프리미티브에 대해서는 픽셀 래스터라이제이션 파이프라인의 z-테스트 과정에서 은면 제거를 수행하도록 하였고, 선 인출 기법을 적용하여 픽셀 캐쉬의 접근 실패에 따른 손실을 줄여주었다. 실험 결과, 제안 구조는 일반 픽셀 파이프라인 구조에 비해 약 32%, HZB 구조에 비해 약 7%의 성능 향상을 보이고 있다.