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

• The Journal of the Korea Contents Association
• /
• v.20 no.1
• /
• pp.392-402
• /
• 2020

Many modern movies and animations rely heavily on CG (computer graphics). The use of CG has made it possible to produce beyond the limits of visual expression. There has also been an increase in technical and artistic efforts to create new and high quality CGs. Look development is the process of modifying and creating shaders and renderings in 3D to produce CGI (computer-generated imagery) that meets the director's intentions. However, small production or projects may have relatively little or no awareness of look development in the production pipeline. The problems that can occur when look development is not preceded are classified into three categories. first, the shader may react differently under the same lighting conditions. Second, there can be a problem in communication between workers. Third, there is a waste of not promising a look for a given situation. As a way to avoid these problems I studied by creating consistency by the look development system. In the limitation that make it difficult for small studios to do look development because of small workers, time and cost, it is meaningful to study and present a simple look development process that can be carried out by individual or small production.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.663-666
• /
• 2005

The geometry stage, which performs the transformation and lighting operations of vertices, became the critical part in 3D graphics pipeline. In this paper, we have planned and designed the Geometry Processor for the better and more efficient way to process the real-time 3D using the floating point unit. We also designed a verification system for Geometry engine. It is implemented with Xilinx-Virtex2 and Visual C++.NET. In the Synopsis, we confirmed 100 MHz performance and 137107 cell area of Geometry Engine.

• Journal of information and communication convergence engineering
• /
• v.1 no.2
• /
• pp.82-87
• /
• 2003

We are able to work on the shared virtual space in Web-based Collaborative Design System using only Internet and Web browser. Then the users will share 3D objects and must be able to pick the objects effectively which they want to manipulate. In this paper, picking is implemented not only by computing intersection of mouse pointer with the objects of the virtual world, but also by using capabilities and attributes of scene graph node, by setting bounds intersection testing instead of geometric intersection testing, by limiting the scope of the pick testing, using Java 3D. These methods can reduce the computation of picking and can pick 3D objects effectively and easily using the system of hierarchy.

• Journal of the Korea Computer Graphics Society
• /
• v.12 no.4
• /
• pp.1-5
• /
• 2006

This paper introduces the surface detailed painterly rendering using heightfield map. To do this, we implement painterly rendering using normal mapping and displacement mapping method by heightfield map. The suggested method can apply to the 3D visualization program and game engine for representing the surface detailed realtime rendering using GPU Programming.

• ETRI Journal
• /
• v.45 no.6
• /
• pp.1035-1045
• /
• 2023

We propose a novel graphics processing unit (GPU) algorithm that can handle a large-scale 3D fast Fourier transform (i.e., 3D-FFT) problem whose data size is larger than the GPU's memory. A 1D FFT-based 3D-FFT computational approach is used to solve the limited device memory issue. Moreover, to reduce the communication overhead between the CPU and GPU, we propose a 3D data-transposition method that converts the target 1D vector into a contiguous memory layout and improves data transfer efficiency. The transposed data are communicated between the host and device memories efficiently through the pinned buffer and multiple streams. We apply our method to various large-scale benchmarks and compare its performance with the state-of-the-art multicore CPU FFT library (i.e., fastest Fourier transform in the West [FFTW]) and a prior GPU-based 3D-FFT algorithm. Our method achieves a higher performance (up to 2.89 times) than FFTW; it yields more performance gaps as the data size increases. The performance of the prior GPU algorithm decreases considerably in massive-scale problems, whereas our method's performance is stable.

• International Journal of CAD/CAM
• /
• v.4 no.1
• /
• pp.19-32
• /
• 2004

This paper presents a new approach to create 3D visualization from discrete simulation results. This approach connects discrete event simulation directly to 3D animation with its novel methods that analyze and convert discrete simulation results into animation events to trigger 3D animation. In addition, it constructs a 3D animation framework for the visualization of discrete simulation results. This framework supports the reuse of both the existing 3D animation objects and behavior components, and allows the rapid development of new 3D animation objects by users with no special knowledge in computer graphics. This approach has been implemented with the software component technology. As an application in virtual manufacturing, visualizations of an electronics assembly factory are also provided in the paper to demonstrate the performance of this new approach.

• Journal of the Korea Computer Graphics Society
• /
• v.6 no.4
• /
• pp.35-42
• /
• 2000

3D texture mapping generates highly natural visual effects in which objects appear carved from lumps of materials rather than laminated with thin sheets as in 2D texture mapping. Storing 3D texture images in a table for fast mapping computations, instead of evaluating procedures on the fly, however, has been considered impractical due to the extremely high memory requirement. Recently, a practical real-time 3D texture mapping technique was proposed in [11], where they attempt to resolve the potential texture memory problem by compressing 3D textures using a wavelet-based encoding method. In this paper, we consider two other encoding schemes that could also be applied to the compression-based 3D texture mapping. In particular, we extend the vector quantization and FXT1 for 3D texture compression, and compare their performance with the wavelet-based encoding scheme.

• Journal of the Korea Computer Graphics Society
• /
• v.10 no.3
• /
• pp.1-8
• /
• 2004

본 논문은 한 장 혹은 여러 장의 실세계의 사진 영상을 입력으로 받아 영상 기반 모델링 방법 중 하나인 영상 분할 모델링 방법을 통해 환경을 3차원으로 모델링을 하고 주어진 실세계 사진 영상을 비사실적 렌더링하여 환경 탐색시 환경맵으로 사용하도록 하여 비사실적 탐색 영상을 생성하는 방법을 제안하였다. 제안된 방법은 세밀한 3차원 환경 메쉬 모델을 생성하여 2차원 환경맵의 비사실적 랜더링 과정을 통해 비사실적 애니메이션 효과를 손쉽게 만들어 낼 수 있다는 장점을 가지고 있다. 또한, 환경맵의 비사실적 렌더링을 통한 환경 매핑방법으로 각 프레임 간의 유사성을 유지하며 렌더링하는 특징을 가지고 있어 자연스러운 비사실적 탐색 영상을 생성 할 수 있다.

• Journal of the Korea Computer Graphics Society
• /
• v.7 no.2
• /
• pp.1-9
• /
• 2001

본 논문은 여러 장의 이미지로부터 삼차원 모델을 빠르게 복원하기 위한 다각형 기반 Space Carving 알고리즘을 제안한다. 본 논문에서 제안하는 알고리즘은 기존의 복셀 carving 연산에 다각형 carving 연산을 추가하여 기존 복셀 carving 기법의 단점인 렌더링 품질의 저하와 느린 렌더링 속도 문제를 보완하였다. 따라서 복원된 모델은 다각형 구조를 가지며, 이로부터 텍스쳐 매핑을 이용한 빠른 속도의 고품질 렌더링 기법이 가능해진다. 또한 다각형 carving 후잉여 데이터를 삭제함으로써 복원된 모델의 품질 저하없이 메모리를 줄이고, 더욱 빠른 렌더링을 가능하게 한다.