• Title/Summary/Keyword: frustum culling

Search Result 16, Processing Time 0.023 seconds

A View-Frustum Culling Technique Using OpenGL for Large Polygon Models (OpenGL을 이용한 대용량 Polygon Model의 View-Frustum Culling 기법)

  • Cho, Doo-Yeoun;Jung, Sung-Jun;Lee, Kyu-Yeul;Kim, Tae-Wan;Choi, Hang-Soon;Seong, Woo-Jae
    • Journal of Korea Game Society
    • /
    • v.1 no.1
    • /
    • pp.55-60
    • /
    • 2001
  • With rapid development of graphic hardware, researches on Virtual Reality and 3D Games have received more attention than before. For more realistic 3D graphic scene, objects were to be presented with lots of polygons and the number of objects shown in a scene was remarkably increased. Therefore, for effective visualization of large polygon models like this, view-frustum culling method, that visualizes only objects shown in the screen, has been widely used. In general, the bounding boxes that include objects are generated firstly, and the boxes are intersected with view-frustum to check whether object is in the visible area or not. Recently, an algorithm that can check in-out test of objects using OpenGL's selection mode, which is originally used to select the objects in the screen, is suggested. This algorithm is fast because it can use hardware acceleration. In this study, by implementing and applying this algorithm to large polygon models, we showed the efficiency of OpenGL assisted View-Frustum Culling algorithm. If this algorithm is applied to 3D games that have to process more complicated characters and landscapes, performance improvement can be expected.

  • PDF

A Study on the Object Search in 3D FPS Games Using Modified Frustum Culling (변형된 절두체 컬링을 이용한 3차원 FPS 게임에서의 오브젝트 탐색 연구)

  • Choi, Won-Tae;Park, Chang-Min
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.105-108
    • /
    • 2007
  • A 3D game plays in fast screen conversion and the objects a partner with camera visual field. Shall recognize a threat of the opponent objects that there is not to a visual field of a player in on-line games. In this paper, we proposed a method to efficiently search for the object in 3D game as used modified frustum culling. For the objects which a player cannot perceive, we accord the player and camera position and used a distance of the player and objects for count of the threatening objects. The method that proposed will play an important role in development of a 3D FPS games.

  • PDF

Efficient Data Structures and Algorithms for Terrain Data Visualization (지형 렌더링을 위한 효율적인 자료 구조와 알고리즘)

  • Jung, Moon-Ju;Han, Jung-Hyun
    • The KIPS Transactions:PartA
    • /
    • v.9A no.4
    • /
    • pp.581-588
    • /
    • 2002
  • In implementing interactive multimedia systems, real-time visualization plays an important role. This paper presents efficient data structures and algorithms for real-time terrain navigation. Terrain data set is usually too huge to display as is. Therefore LOD (levels of detail) methods and view frustum culling are essential tools. This paper describes in detail compact hierarchical data structures, fast view frustum culling, and efficient LOD construction/rendering algorithms. Unlike previous works, we use a precise screen-space error metric for vertex removal and a strict error threshold allowing sub-pixel -sized errors only. Nevertheless, we can achieve 22 fps on average in a PC platform. The methods presented in this paper also satisfy almost all of the requirements for interactive real-time terrain Visualization.

Real-time 3D terrain visualization based on Regular Grid Method (Regular Grid Method에 기반한 실시간 지형 가시화 알고리즘 개발)

  • Jeong, Ji-Chan;Park, Jun-Yeong
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.05a
    • /
    • pp.835-841
    • /
    • 2005
  • 실시간 가시화/시각화(Visualization)을 위한 지형 가시화 분야에서의 렌더링 속도 향상은 사용자의 현실감에 있어 중요한 역할을 한다. 본 연구는 Height Field 데이터를 사용한 블록 단위 지형 렌더링 방법에서 이전 프레임 정보를 사용하여 지형 가시화 속도를 향상시키는 방법을 제안한다. Height Field로 표현된 지형을 실시간에 효과적으로 렌더링 할 수 있는 방법으로CLOD(Continuous leveI Of Detail)가 있으며 대표적인 방법으로 Multiresolution TIN(Triangle Irregular Network)과 Regular Grid Method에 기반한 방법들이 있다. 대개의 경우, 지형 데이터는 매우 방대한 크기를 가지고 있어서 실시간으로 렌더링 하는 것이 불가능할 경우가 많다. 따라서 실시간 지형렌더링 에서는 LOD(Level of Detail)관리와 뷰 프러스텀 컬링이 실시간 렌더링 속도 향상을 위한 핵심 사항이 된다. 본 연구에서는 PC 기반에서 효과적으로 지형을 표현하기 위해 기존 Regular Grid Method에 기반한 방법의 가시영역 추출(View Frustum Culling)을 수정하여 실시간 지형 렌더링의 가시 영역 추출(View Frustum Culling)시 기존의 쿼드트리 방식과 함께 이전 프레임에서 블록 단위로 저장된 컬링 정보를 혼용하여 속도를 향상시키는 방법을 상세히 기술 한다.

  • PDF

A Design of a 3D Graphics Rasterizer with culling and clipping (컬링과 클리핑을 포함한 3D그래픽스 래스터라이져 설계)

  • Lee, Kwang-Yeob;Koo, Yong-Seo
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.8
    • /
    • pp.89-96
    • /
    • 2007
  • In this paper, we designed 3D graphics rasterizer with a culling and clipping for the efficient 3D graphics accelerator. The proposed rasterizer is implemented for the mobile system and process frustum culling, back face culling, Y-axis clipping and X-axis clipping. The rasterzier consists of triangle setup, edge walk and span process unit. Each unit of rasterzier is designed with a culling and clipping. It supports goraud shading with 16 bits depth values and 16 bits color values. The estimated performance of proposed rasterizer is 52M pixels per second.

A Contribution Culling Method for Fast Rendering of Complex Urban Scenes (복잡한 도시장면의 고속 렌더링을 위한 기여도 컬링 기법)

  • Lee, Bum-Jong;Park, Jong-Seung
    • Journal of Korea Game Society
    • /
    • v.7 no.1
    • /
    • pp.43-52
    • /
    • 2007
  • This article describes a new contribution culling method for fast rendering of complex huge urban scenes. A view frustum culling technique is used for fast rendering of complex scenes. To support the levels-of-detail, we subdivide the image regions and construct a weighted quadtree. Only visible objects at the current camera position contributes the current quadtree and the weight is assigned to each object in the quadtree. The weight is proportional to the image area of the projected object, so large buildings in the far distance are less likely to be culled out than small buildings in the near distance. The rendering time is nearly constant not depending on the number of visible objects. The proposed method has applied to a new metropolitan region which is currently under development. Experimental results showed that the rendering quality of the proposed method is barely distinguishable from the rendering quality of the original method, while the proposed method reduces the number of polygons by about 9%. Experimental results showed that the proposed rendering method is appropriate for real-time rendering applications of complex huge scenes.

  • PDF

Development of Efficient Parallel Tiled Display Algorithms by Combining the Sort-first and the Sort-last Sorting Methods (전 분류 기법과 후 분류 기법의 조합을 통한 효율적 병렬 타일 가시화 알고리듬 개발)

  • Choi, Yun-Hyuk;Kim, Il-Ho;Kim, Hong-Seong;Cho, Jin-Yeon
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.36 no.2
    • /
    • pp.146-155
    • /
    • 2008
  • To improve the performance of tiled display system, two parallel tiled display algorithms are proposed by combining the sort-first and the sort-last sorting methods. In the proposed algorithms, the view frustum culling is employed along with the OpenGL display list for the sort-first sorting, and the pre-detection sort-last sparse sorting method is used for sort-last sorting. Through the benchmarking tests, the performances of two proposed algorithms are investigated. Based on the observations, it is suggested how to select an optimal algorithm among the two proposed parallel tiled display algorithms for the given visualization model.

An Effective Structure of Hardware Compression for Potentially Visible Set of Indoor 3D Game Scenes (실내 3D 게임 장면의 잠재적 가시 집합을 위한 효과적인 하드웨어 압축 구조)

  • Kim, Youngsik
    • 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.

GPU-based Adaptive LOD control for Quadtree-Based Terrain Rendering (사진트리 기반 지형렌더링을 위한 GPU기반의 적응형 상세단계 조정 방법)

  • Choi, In-Ji;Shin, Byeong-Seok
    • Journal of Korea Game Society
    • /
    • v.8 no.3
    • /
    • pp.61-68
    • /
    • 2008
  • Quadtree-based terrain visualization methods have been used in a lot of applications. However, because most procedures are performed on the CPU, the rendering speed is slow in comparison to methods using GPU. In this paper, we present a quadtree-based terrain visualization method working on the GPU with specially designed data structure, error-texture and LOD-texture, and block-based acceleration method. In preprocessing step, we calculate errors in world space and store them to error-texture. In rendering step, we examine projected errors of error-texture and choose the detail level, then store the projected errors to LOD-texture. View frustum culling is performed as block unit using the values of error-texture and LOD-texture. This method reduces CPU load and performs time consuming jobs such as LOD selection and view frustum culling.

  • PDF

Spatial Structure Analysis of View Angle Correction reflecting Characteristics of Universal Observation (보편적 주시특성을 반영한 시야각 보정 공간구조 분석)

  • Kim, Suk-Tae
    • 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.