• Title/Summary/Keyword: Vertex Shader

Search Result 21, Processing Time 0.021 seconds

Photomosaic using a programmable GPU (프로그래밍 가능한 GPU를 이용한 포토 모자이크)

  • Kang, Dong-Wann;Yoon, Kyung-Hyun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.14 no.1
    • /
    • pp.17-25
    • /
    • 2008
  • We proposed the method for photomosaic generation using a programmable GPU. We design vertices to generate a photomosaic through a graphics pipeline and suggest a texture representation of an image database whice is used for tile. Both the source image and the tiles are stored to texture, which are matched by a vertex shader and drawn by a fragment shader. This is much faster than several techniques which achieve the best match for each tile.

  • PDF

Efficient Representation of Soap Bubble Shapes using Snell's Law and Background Synthesis (Snell의 법칙을 이용한 효율적인 비눗방울 형상 표현 및 배경 합성)

  • Yoojin Jeong;Jong-Hyun Kim
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2024.01a
    • /
    • pp.403-406
    • /
    • 2024
  • 본 논문에서는 비눗방울에 나타나는 반사와 굴절 효과를 상용 게임엔진인 유니티 쉐이더(Unity shader)를 사용하여 구현하고 다양한 배경에서 합성할 수 있는 효율적인 프레임워크를 제안한다. 본 논문에서 제안하는 방법은 계산량이 큰 유체 시뮬레이션을 이용하지 않고, 스넬(Snell)의 법칙을 이용하여 박막 내부의 굴절 벡터를 계산하고, 막 표면의 표현을 위해 다양한 텍스처(Texture)를 적용하였으며, vertex의 조정을 통해 비눗방울 자체의 움직임을 나타낼 수 있다. 결과적으로 실시간으로 높은 품질의 비눗방울을 표현할 수 있기 때문에 게임뿐만 아니라 가상현실 및 다양한 실시간 애플리케이션에 활용될 수 있다.

  • PDF

CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES

  • Kim, In-Jae;Shader, Bryan L.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.45 no.1
    • /
    • pp.95-99
    • /
    • 2008
  • It is known that each eigenvalue of a real symmetric, irreducible, tridiagonal matrix has multiplicity 1. The graph of such a matrix is a path. In this paper, we extend the result by classifying those trees for which each of the associated acyclic matrices has distinct eigenvalues whenever the diagonal entries are distinct.

Real-Time Animation of large Crowds

  • Kang, In-Gu;Han, Jung-Hyun
    • 한국HCI학회:학술대회논문집
    • /
    • 2007.02c
    • /
    • pp.318-321
    • /
    • 2007
  • This paper proposes a GPU-based approach to real-time skinning animation of large crowds, where each character is animated independently of the others. In the first pass of the proposed approach, skinning is done by a pixel shader and the transformed vertex data are written into the render target texture. With the transformed vertices, the second pass renders the large crowds. The proposed approach is attractive for real-time applications such as video games.

  • PDF

Improving the Rendering Speed of 3D Model Animation on Smart Phones

  • Ng, Cong Jie;Hwang, Gi-Hyun;Kang, Dae-Ki
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.3
    • /
    • pp.266-270
    • /
    • 2011
  • The advancement of technology enables smart phones or handheld devices to render complex 3D graphics. However, the processing power and memory of smart phones remain very limited to render high polygon and details 3D models especially on games which requires animation, physic engine, or augmented reality. In this paper, several techniques will be introduced to speed up the computation and reducing the number of vertices of the 3D meshes without losing much detail.

Computing Fast Secondary Skin Deformation of a 3D Character using GPU (GPU를 이용한 3차원 캐릭터의 빠른 2차 피부 변형 계산)

  • Kim, Jong-Hyuk;Choi, Jung-Ju
    • Journal of the Korea Computer Graphics Society
    • /
    • v.18 no.2
    • /
    • pp.55-62
    • /
    • 2012
  • This paper presents a new method to represent the secondary deformation effect using simple mass-spring simulation on the vertex shader of the GPU. For each skin vertex of a 3D character, a zero-length spring is connected to a virtual vertex that is to be rendered. When a skin vertex changes its position and velocity according to the character motion, the position of the corresponding virtual vertex is computed by mass-spring simulation in parallel on the GPU. The proposed method represents the secondary deformation effect very fast that shows the material property of a character skin during the animation. Applying the proposed technique dynamically can represent squash-and-stretch and follow-through effects which have been frequently shown in the traditional 2D animation, within a very small amount of additional computation. The proposed method is applicable to represent elastic skin deformation of a virtual character in an interactive animation environment such as games.

Design and Implementation of GPU Based Time-Variant Volume Rendering Program and User-Friendly Transfer Function Editor (GPU 기반의 Time-Variant 볼륨 렌더링 프로그램과 사용자 친화적인 전이함수 에디터의 설계 및 구현)

  • Lee, Joong-Youn;Hur, Young-Ju;Koo, Gee-Bum
    • 한국HCI학회:학술대회논문집
    • /
    • 2007.02a
    • /
    • pp.1025-1030
    • /
    • 2007
  • 여러 학계와 산업계로부터 인체영상과 같은 정적인 볼륨 데이터뿐만 아니라, 유체 흐름과 같은 동적으로 움직이는 Time-Variant 볼륨 데이터에 대한 실시간 렌더링의 요구가 계속되고 있다. 일반적으로 Time-Variant 데이터는 그 크기가 정적 볼륨 데이터의 수배에서 수백 배에 이르러, 이를 실시간으로 가시화하는 데에 많은 어려움이 있어왔다. 한편, PC 그래픽스 하드웨어의 급격한 발전에 따라 슈퍼컴퓨터나 다수의 컴퓨터들을 이용한 병렬/분산 렌더링으로나 가능했던 Time-Variant 볼륨 데이터의 실시간 볼륨 렌더링을 한대의 일반 PC에서 수행하려는 시도가 계속되고 있다. GPU의 꼭지점 및 프래그먼트 쉐이더(vertex & fragment shader)는 수치 계산에 최적화된 벡터 연산과 사용자 프로그래밍 기능으로 빠른 볼륨 렌더링을 일반 PC에서도 가능하게 했다. 본 논문에서는 GPU를 이용해서 Time-Variant 볼륨 데이터를 빠르게 가시화하고, 이렇게 개발한 GPU 볼륨 렌더링 프로그램을 사용자가 사용하기 편리하도록 사용자 친화적인 유저 인터페이스를 설계하고 구현하였다. 특히, 시간에 따라 동적으로 변화해야 하는 전이함수를 최대한 편리하게 생성할 수 있도록 전이함수 에디터에 중점을 두었다.

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

FPGA Implementation of Scan Conversion Unit using SIMD Architecture and Hierarchical Tile-based Traversing Method (계층적 타일기반 탐색기법과 SIMD 구조가 적용된 스캔변환회로의 FPGA 구현)

  • Ha, Chang-Soo;Choi, Byeong-Yoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.9
    • /
    • pp.2023-2030
    • /
    • 2010
  • In this paper, we present research results of developing high performance scan conversion unit and implementing it on FPGA chip. To increase performance of scan conversion unit, we propose an architecture of scan converter that is a SIMD architecture and uses tile-based traversing method. The proposed scan conversion unit can operate about 124Mhz clock frequency on Xilinx Vertex4 LX100 device. To verify the scan conversion unit, we also develop shader unit, texture mapping unit and $240{\times}320$ color TFT-LCD controller to display outputs of the scan conversion unit on TFT-LCD. Because the scan conversion unit implemented on FPGA has 311Mpixels/sec pixel rate, it is applicable to desktop pc's 3d graphics system as well as mobile 3d graphics system needing high pixel rates.

An Efficient Real-time Rendering Method for Compressed Terrain Dataset with Wavelet Transform (웨이블릿 변환으로 압축된 지형 데이터의 효율적인 실시간 렌더링 기법)

  • Kim, Tae-Gwon;Lee, Eun-Seok;Shin, Byeong-Seok
    • Journal of Korea Game Society
    • /
    • v.14 no.4
    • /
    • pp.45-52
    • /
    • 2014
  • We cannot load the entire data for high-resolution terrain model to the GPU memory since its size is too big. Out-of-core approaches are commonly used to solve the problem. However, due to limited bandwidth of the secondary storage, it is difficult to render the terrain in real-time. A method that compresses the DEM data with wavelet transform on GPU, and renders the decoded data is suggested. However, it is inefficient since it has to sample the values from textures, convert them to vertices, and generate a mesh periodically. We propose a method to store the approximation coefficients of wavelet compression as vertex attributes and render the terrain by decoding the data on geometric shader. It can reduce the amount of transferring terrain texture since approximation coefficients are given as an attribute of the vertex. Also, it generate meshes without additional upload of terrain texture.