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

We introduce a new method for constructing a dynamic Delaunay triangulation for a set S of n sites in the plane under the $L_{\infty}(L_1)$ metric. We find that the quadrant neighbor graph is contained in the Delaunay triangluation and that at least one edge of each triangle in the Delaunay triangulation is contained in the quadrant neighbor graph. By using these observations and employing a range tree scheme, we present a method that dynamically maintains the $L_{\infty}(L_1)$ Delaunay triangulation under insertions and deletions in $O(log^2n)$ amortized time and O(log n) expected time.

• Journal of Internet Computing and Services
• /
• v.19 no.6
• /
• pp.53-62
• /
• 2018

As the performance of computer hardware has been increased in recent years, more realistic computer generated objects can be created and presented in personal computers and portable digital devices as well. For this reason, digital contents, including computer graphics, require virtual objects that are more realistic and representable in real-time on various devices, thus it requires more computational costs. In order to support the production of contents including computer graphics, games, and animations on multi-platform, Unity or unreal engines are mainly used. To represent more realistic behavior of virtual objects in a simulation, a virtual object must collide with other virtual objects and present the plausible interaction, as in the real world. However, such dynamic simulation requires a large amount of computational cost, and most portable devices cannot provide these dynamic simulations in real-time. In this paper, we proposed a GPGPU computation based dynamic cloth simulation to represent collision and response with spherical object in real-time. We believe that the proposed method can be useful for readily producing realistic digital contents.

• Journal of Advanced Marine Engineering and Technology
• /
• v.34 no.6
• /
• pp.858-863
• /
• 2010

In order to enhance encoding speed in dynamic image encoding using H.264/AVC, reducing the time for motion estimation which takes a large portion of the processing time is very important. An approach using graphics processing unit(GPU) as a coprocessor to assist the central processing unit(CPU) in computing massive data, will be a way to reduce the processing time. In this paper, we present an efficient block-level parallel algorithm for the motion estimation(ME) on a computer unified device architecture(CUDA) platform developed in general-purpose computation on GPU. Experiments are carried out to verify the effectiveness of the proposed algorithm.

• Computers and Concrete
• /
• v.18 no.5
• /
• pp.1019-1039
• /
• 2016

In this paper, a parallel algorithm of nonlinear dynamic analysis of three-dimensional (3D) reinforced concrete (RC) frame structures based on the platform of graphics processing unit (GPU) is proposed. Time integration is performed using Newmark method for nonlinear implicit dynamic analysis and parallelization strategies are presented. Correspondingly, a parallel Preconditioned Conjugate Gradients (PCG) solver on GPU is introduced for repeating solution of the equilibrium equations for each time step. The RC frames were simulated using fiber beam model to capture nonlinear behaviors of concrete and reinforcing bars. The parallel finite element program is developed utilizing Compute Unified Device Architecture (CUDA). The accuracy of the GPU-based parallel program including single precision and double precision was verified in comparison with ABAQUS. The numerical results demonstrated that the proposed algorithm can take full advantage of the parallel architecture of the GPU, and achieve the goal of speeding up the computation compared with CPU.

• Journal of the Korea Computer Graphics Society
• /
• v.1 no.2
• /
• pp.213-225
• /
• 1995

3 차원 볼륨 데이터를 시각화(visualization)하기 위해서는 많은 계산 량과 메모리 량을 필요로 한다. 단일컴퓨터에서 순차 알고리즘을 이용하여 데이터를 시각화하고 분석하는 것은 실시간 응용 프로그램에는 부적합하다. 기존의 병렬 볼륨 렌더링에서의 데이터 분할 방법은 대부분 정적 로드 밸런싱(static load balancing)에 기반하고 있다. 동적 로드 밸런싱에 기반한 기존의 방법들은 불륨 데이터의 정규성(regularity)을 이용할 수 없다는 단점이 있다. 본 연구에서는 3 차원 볼륨 데이터에 대하여 로컬 태스크 큐(local task queue) 기법에 기반한 새로운 로드밸런싱 알고리즘을 제안한다. 제안한 방법은 계산에 참여할 노드(node)들을 PVM(parallel virtual machine)의 동적 프로세스 그룹(dynamic process group: DPG)을 이용하여 정적으로 그룹화(grouping)한다. 각각의 DPG들은 로컬 태스크 큐를 기반으로 단위 서브-블록에 대하여 동적 로드 밸런싱을 수행한다. 최적화된 레이 캐스팅 알고리즘들을 분산 환경에 새롭게 적용함으로써 로드 밸런싱으로 생길 수 있는 오버 헤드를 최소화하였다.

• Journal of the Semiconductor & Display Technology
• /
• v.18 no.1
• /
• pp.123-128
• /
• 2019

Currently mobile services are on the verge of full commercialization ahead of 5G mobile communication (5G). The first goal could be to preempt the 5G market through realistic media services utilizing VR (Virtual Reality) and AR (Augmented Reality) technologies that users can most easily experience. Basically this movement is based on the advanced development of smart devices and high quality graphics processing computing power of mobile application processors. Accordingly, the importance of mobile GPUs is emerging and the most concern issue becomes a model for predicting the power and performance for smooth operation of high quality mobile contents. In many cases, the performance of mobile GPUs has been introduced in terms of power consumption of mobile GPUs using dynamic voltage and frequency scaling and throttling functions for power consumption and heat management. This paper introduces several studies of mobile GPU performance prediction model with user-friendly methods not like conventional power centric performance prediction models.

• Journal of Information Processing Systems
• /
• v.12 no.1
• /
• pp.46-56
• /
• 2016

Dynamic textures are videos that exhibit a stationary property with respect to time (i.e., they have patterns that repeat themselves over a large number of frames). These patterns can easily be tracked by a linear dynamic system. In this paper, a model that identifies the underlying linear dynamic system using wavelet coefficients, rather than a raw sequence, is proposed. Content based threshold filtering based on Set Partitioning in a Hierarchical Tree (SPIHT) helps to get another representation of the same frames that only have low frequency components. The main idea of this paper is to apply SPIHT based threshold filtering on different bands of wavelet transform so as to have more significant information in fewer parameters for singular value decomposition (SVD). In this case, more flexibility is given for the component selection, as SVD is independently applied to the different bands of frames of a dynamic texture. To minimize the time complexity, the proposed model is implemented on a graphics processing unit (GPU). Test results show that the proposed dynamic system, along with a discrete wavelet and SPIHT, achieve a highly compact model with better visual quality, than the available LDS, Fourier descriptor model, and higher-order SVD (HOSVD).

• Journal of the Korea Computer Graphics Society
• /
• v.8 no.3
• /
• pp.9-16
• /
• 2002

Recently, high dynamic range (HDR) compression has attracted much attention due to the wide availability of HDR images. In this paper, we present an HDR compression method using a progressive image, which is a multi-level image representation based on a progressive mesh. An HDR image can be decomposed into a base image and a sequence of details by conversion into a progressive image. This decomposition provides a good structure to highly compress the dynamic range while preserving image details. The base image and larger details are considerably scaled down but smaller details are slightly scaled down. Experimental results show that our method successfully generates HDR compressed images without halo artifacts by controlling two intuitive parameters.

• Journal of the Korea Computer Graphics Society
• /
• v.5 no.2
• /
• pp.33-41
• /
• 1999

This paper presents a new algorithm about motion adjustment for dynamic balance. It adjusts an unbalanced motion to an balanced motion while preserving the nuance of original motion. We solve dynamic balancing problem using the zero moment point (ZMP) which is often used for controlling the balance of biped robot. Our algorithm is consists of four steps. First, it fits joint angle data to spline curves for reducing noise. Second, the algorithm analyzes the ZMP trajectory so that it can detects the dynamically-unbalanced duration. Third, the algorithm project the ZMP trajectory into the supporting area if the trajectory deviates from the area. Finally, the algorithm produces the balanced motion that satisfies the new ZMP trajectory. In this step, the constrained optimization method is used so that the new motion keeps the original motion characteristics as much as possible. We make several experiments in order to prove that our algorithm is useful to add physical realism to a kinematically edited motion.

• Journal of the Korea Computer Graphics Society
• /
• v.23 no.3
• /
• pp.115-122
• /
• 2017

As the era of the fourth industrial revolution began, augmented reality showed infinite possibilities throughout society. However, current augmented reality systems such as head-mount display and hand-held display systems suffer from various problems such as weariness and nausea, and thus space-augmented reality, which is a projector-based augmented reality technology, is attracting attention. Spacial augmented reality requires precise tracking of dynamic objects to project virtual images in order to increase realism of augmented reality and induce user 's immersion. The infrared sensor-based precision tracking algorithm developed in this paper demonstrates very robust tracking performance with an average error rate of less than 1.5% and technically opens the way towards advanced augmented reality technologies such as tracking for arbitrary objects, and Socially, by easy-to-use tracking algorithms for non-specialists, it allows designers, students, and children to easily create and enjoy their own augmented reality content.