• Title/Summary/Keyword: GPU기반 랜더링

Search Result 2, Processing Time 0.019 seconds

Quadtree-based Terrain Visualization Using Vertex Multiplication (정점증식을 이용한 사진트리 기반 지형 시각화 기법)

  • Lee, Eun-Seok;Shin, Byeong-Seok
    • Journal of the Korea Computer Graphics Society
    • /
    • v.15 no.3
    • /
    • pp.27-33
    • /
    • 2009
  • In terrain visualization, the quadtree is the most frequently used data structure for progressive mesh generation. The quadtree provides an efficient level-of-detail selection and view frustum culling. However, most applications using quadtrees are performed by the CPU, since the hierarchical data structure cannot be manipulated in a programmable rendering pipeline. For this reason, quadtree-based methods show lower performance and higher dependancy of CPU in comparison to GPU-based methods. We present a quadtree-based terrain-rendering method for GPU execution that uses vertex multiplication. It offers higher performance than previous CPU-based quadtree methods, without loss of image quality.

  • PDF

Accelerating GPU-based Volume Ray-casting Using Brick Vertex (브릭 정점을 이용한 GPU 기반 볼륨 광선투사법 가속화)

  • Chae, Su-Pyeong;Shin, Byeong-Seok
    • Journal of the Korea Computer Graphics Society
    • /
    • v.17 no.3
    • /
    • pp.1-7
    • /
    • 2011
  • Recently, various researches have been proposed to accelerate GPU-based volume ray-casting. However, those researches may cause several problems such as bottleneck of data transmission between CPU and GPU, requirement of additional video memory for hierarchical structure and increase of processing time whenever opacity transfer function changes. In this paper, we propose an efficient GPU-based empty space skipping technique to solve these problems. We store maximum density in a brick of volume dataset on a vertex element. Then we delete vertices regarded as transparent one by opacity transfer function in geometry shader. Remaining vertices are used to generate bounding boxes of non-transparent area that helps the ray to traverse efficiently. Although these vertices are independent on viewing condition they need to be reproduced when opacity transfer function changes. Our technique provides fast generation of opaque vertices for interactive processing since the generation stage of the opaque vertices is running in GPU pipeline. The rendering results of our algorithm are identical to the that of general GPU ray-casting, but the performance can be up to more than 10 times faster.