• Journal of the Korea Computer Graphics Society
• /
• v.16 no.4
• /
• pp.11-16
• /
• 2010

We present an efficient algorithm for rendering sweep surfaces using programmable graphics hardware. A sweep surface can be represented by a cross-section curve undergoing a spline motion. This representation has a simple matrix-vector multiplication structure that can easily be adapted to programmable graphics hardware. The data for the motion and cross-section curves are stored in texture memory. The vertex processor considers a pair of surface parameters as a vertex and evaluates its coordinates and normal vector with a single matrix multiplication. Using the GPU in this way is between 10 and 40 times as fast as CPU-based rendering.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.12
• /
• pp.2675-2680
• /
• 2010

Computation steps for 3D graphic processing consist of two stages - fixed operation stage and programming required stage. Using this characteristic of 3D pipeline, a hybrid structure between graphics hardware designed by fixed structure and programmable hardware based on instructions, can handle graphic processing more efficiently. In this paper, fragment Shader is designed under this hybrid structure. It also supports OpenGL ES 2.0. Interior interface is optimized to reduce the delay of entire pipeline, which may be occurred by data I/O between the fixed hardware and the Shader. Interior register group of the Shader is designed by an interleaved structure to improve the register space and processing speed.

• Journal of IKEEE
• /
• v.13 no.2
• /
• pp.253-259
• /
• 2009

In this paper, we propose a novel architecture of a general graphics shader processor without a dedicated hardware. Recently, mobile devices require the high performance graphics processor as well as the small size, low power. The proposed shader processor is a GP-GPU(General-Purpose computing on Graphics Processing Units) to execute the whole OpenGL ES 2.0 graphics pipeline by using shader instructions. It does not require the separate dedicate H/W such as rasterization on this fully programmable capability. The fully programmable 3D graphics shader processor can reduce much of the graphics hardware. The chip size of the designed shader processor is reduced 60% less than the sizes of previous processors.

• Journal of Korea Multimedia Society
• /
• v.11 no.10
• /
• pp.1460-1470
• /
• 2008

As the performance of recent mobile systems increases, a vector graphic has been implemented to represent various types of dynamic menus, mails, and two-dimensional maps. This paper proposes a hardware accelerator for open vector graphics (OpenVG), which is widely used for two-dimensional vector graphics. We analyze the specifications of an OpenVG and divide the OpenVG into several functions suitable for hardware implementation. The proposed hardware accelerator is implemented on a field programmable gate array (FPGA) board using hardware description language (HDL) and is about four times faster than an Alex processor.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.414-419
• /
• 2008

3D rendering is a critical process for a movie production, advertisement, interior simulation, medical and many other fields. Recently, several effective rendering methods have been developed for the photo-realistic image generation. With a rapid performance enhancement of graphics hardware, physically based 3D rendering algorithm can now often be approximated in real-time games. However, the high quality of global illumination, required for the image generation in the 3D animation production community is a still very expensive process. In this paper, we propose a new rendering method to create photo-realistic global illumination effect efficiently by harnessing the high power of the recent GPUs. Final gathering routines in our global illumination module are accelerated by programmable graphics hardware. We also simulate physically based light transport on a ray tracing based rendering algorithm with photon mapping effectively.

• Journal of the Korea Computer Graphics Society
• /
• v.8 no.2
• /
• pp.23-29
• /
• 2002

In this paper, we describe an implementation technique that extends the classification and shading capabilities offered by previously reported hardware-assisted volume rendering algorithms. In designing our rendering scheme, we exploited the programmable shader technology supported by the latest consumer PC graphics hardware. Our direct volume rendering technique enables to simultaneously display up to four materials, and to dynamically control gradient magnitude to emphasize or de-emphasize surface boundaries. It can easily create lighting effects such as light source attenuation, depth cueing, and multiple light sources that were often difficult to realize in previous hardware-assisted volume rendering.

• Journal of the Korea Computer Graphics Society
• /
• v.13 no.1
• /
• pp.1-6
• /
• 2007

Although free-form surfaces can represent smooth shapes with only a few control points contrary to polygonal meshes, graphics hardware does not support surface rendering currently. Since modern programmable graphics pipeline can be used to accelerate various kinds of existing graphics algorithms, this paper presents a method that utilizes the graphics processing unit (GPU) to render blending surfaces with arbitrary topology fast. Surface parameters sampled on the control mesh and geometric data for local surfaces are sent to the graphics pipeline, and then the vertex processor evaluates the surface positions and normals with these data. This method can achieve very high performance rather than CPU-based rendering.

• Journal of Information Processing Systems
• /
• v.5 no.2
• /
• pp.105-116
• /
• 2009

To solve the general problems surrounding the application of genetic algorithms in stereo matching, two measures are proposed. Firstly, the strategy of simplified population-based incremental learning (PBIL) is adopted to reduce the problems with memory consumption and search inefficiency, and a scheme for controlling the distance of neighbors for disparity smoothness is inserted to obtain a wide-area consistency of disparities. In addition, an alternative version of the proposed algorithm, without the use of a probability vector, is also presented for simpler set-ups. Secondly, programmable graphics-hardware (GPU) consists of multiple multi-processors and has a powerful parallelism which can perform operations in parallel at low cost. Therefore, in order to decrease the running time further, a model of the proposed algorithm, which can be run on programmable graphics-hardware (GPU), is presented for the first time. The algorithms are implemented on the CPU as well as on the GPU and are evaluated by experiments. The experimental results show that the proposed algorithm offers better performance than traditional BMA methods with a deliberate relaxation and its modified version in terms of both running speed and stability. The comparison of computation times for the algorithm both on the GPU and the CPU shows that the former has more speed-up than the latter, the bigger the image size is.

• 한국가시화정보학회:학술대회논문집
• /
• 2003.11a
• /
• pp.51-54
• /
• 2003

Fluid is an effective element in computer animation. Recently, the techniques from CFD have been actively applied to CG production. In this paper, we describe our fluid animation system which implements a variety of established simulation and rendering methods. We also explain our new techniques such as chemical reaction and hardware-assisted fluid animation that are being developed to enhance the features of our software system.

• 한국가시화정보학회:학술대회논문집
• /
• 2004.04a
• /
• pp.57-63
• /
• 2004

최근 일반 범용 PC 에 장착되고 있는 ATI 나 NVIDIA 등의 그래픽스 가속기의 성능은 수년전과 비교할 때 비교가 안 될 정도의 빠른 속도를 자랑하고 있다. 이러한 속도 향상과 함께 급격하게 일어나고 있는 변화 중의 하나는 바로 기존의 고정된 기능의 그래픽스 파이프라인(fixed-function graphics pipeline)과는 달리 프로그래머가 가속기의 기능을 자유자재로 프로그래밍할 수 있도록 해주는 프로그래밍이 가능한 파이프라인(programmable graphics pipeline)의 출현이라 할 수 있다. 이러한 가속기에 장착되고 있는 GPU (Graphics Processing Unit)는 간단한 형태의 SIMD 프로세서라 할 수 있는데, 특히 GPU 의 한 부분인 픽셀 쉐이더는 그 처리 속도가 매우 높기 때문에 이를 통하여 기존의 수치 알고리즘을 병렬화 하려는 시도가 활발히 일어나고 있다. 본 강연에서는 다양한 수치 계산을 그래픽스 가속기를 사용하여 해결하려는 시도에 대하여 간단히 살펴본다.