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

Visibility preprocessing is a useful method to reduce the complexity of scenes to be processed in real-time, and so enhances the overall rendering performance for interactive visualization of virtual environments. In this paper, we propose an efficient visibility preprocessing method. In the proposed method, we assume that navigatable areas in virtual environments are partitioned into rectangular parallelpiped cells or sub-worlds. To preprocess the visibility of each polygon for a given partitioned cell, we should determine at least the area-to-area visibility. This is inherently a four-dimensional problem. We efficiently express four-dimensional visibility information on two-dimensional spaces and keep it within a ternary tree, which is conceptually similar to a BSP(Binary Space Partitioning) tree, by exploiting the characteristics of conservative visibility. The proposed method is able to efficiently handle more general environments like urban scenes, and remove invisible polygons jointly blocked by multiple occluders. The proposed method requires O(nm) time and O(n+m) space. By selecting a suitable value for m, users can select a suitable level of trade-off between the preprocessing time and the quality of the computational result.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.281-284
• /
• 2008

Recently, Khronos institude OpenGL ES 2.0 API for support Shader 3.0 model that can possible variable graphic processing. For this reason, the mobile device have need of supporting processor for a shader 3.0 model. We should extend instruction's length to support OpenGL ES 2.0 API, so we need more memory size. In this paper, we propose a new instruction form that adopted variable length and unit instruction architecture. This proposed instruction architecture that support to Shader 3.0 model has consist of 32bit unit instructions up to 4 which can be combined for embellishing each other. Therefore, it can execute flexible instruction combination and reduce waste of instruction fields.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.25 no.6
• /
• pp.12-16
• /
• 2002

Virtual reality (VR) opened the possibility of moving beyond the 2-D world of conventional desktop systems to an immersive, multi-sensory environment generated by computer graphics. Haptic feedback (Haptics) is now starting to get recognition and use in intensive applications for manipulation, while smell and taste feedback are at the stage of early research. This paper reviews some current works on increased haptic feedback augmentation in virtual reality applications.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.160-166
• /
• 1996

In 2D and 3D computer graphics, fractal techniques have been applied ter rain models. In general, a specific 3D terrain model such as Cheju or Uleung Island could not beformulated by statistical fractalsowing to the randomeffects. However, by locating the control points on the edges and the surface of a specific terrain such as Cheju Island, a similar shape of the terrain model can be simulated. This paper presents the way of formulating a specific 3D terrain model by the statistical fractals with fixed midpoints.

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

In ray tracing of 3D volume data, the color of each pixel in the image is typically obtained by accumulating the contributions of sample points on the ray cast from the pixel point. This accumulation is most naturally represented by integration. In most methods, however, it is done by numerical summation because analytical solution to the integration are hard to find. This paper shows that a semi-analytical solution can be obtained for a typical ray tracing of volume data. Tentative conclusions about the significance and usefulness of our approach are presented based on our experiments.

• Journal of the Korea Computer Graphics Society
• /
• v.4 no.1
• /
• pp.31-40
• /
• 1998

Active Contour Model(ACM) is an efficient method for segmenting an object. The main shortcoming of ACM is that its result is very dependent on the shape and location of an initial contour. To overcome this shortcoming, a new segmentation algorithm is proposed in this paper. The proposed algorithm uses B-splines to describe the active contour and applies Simulated Annealing (SA) and Genetic Algorithm(GA) as energy minimization techniques. We tried to overcome the initialization problem of traditional ACM and compared the result of ACM using GA and that using SA with 2D synthetic binary images. CT and MR images.

• Journal of the Korea Computer Graphics Society
• /
• v.26 no.2
• /
• pp.11-19
• /
• 2020

When a character's pose changes, its center of mass(COM) also changes. The change of COM has distinctive patterns corresponding to various motion types like walking, running or sitting. Thus the motion type can be predicted by using COM movement. We propose a motion generator that uses character's center of mass information. This generator can generate various motions without annotated action type labels. Thus dataset for training and running can be generated full-automatically. Our neural network model takes the motion history of the character and its center of mass information as inputs and generates a full-body pose for the current frame, and is trained using simple Convolutional Neural Network(CNN) that performs 1D convolution to deal with time-series motion data.

• Journal of the Korea Computer Graphics Society
• /
• v.27 no.5
• /
• pp.1-11
• /
• 2021

The purpose of our research is to efficiently deform a 3D models which is composed of a triangular mesh and a skeleton. We designed a novel inverse kinematics (IK) solver that calculates the updated positions of mesh vertices with fewer computing operations. Through our user interface, one or more markers are selected on the surface of the model and their target positions are set, then the system updates the positions of surface vertices to construct a deformed model. The IK solving process for updating vertex positions includes many computations for obtaining transformations of the markers, their affecting joints, and their parent joints. Many of these computations are often redundant. We precompute those redundant terms in advance so that the 3-nested loop computation structure was improved to a 2-nested loop structure, and thus the computation time for a deformation is greatly reduced. This novel IK solver can be adopted for efficient performance in various research fields, such as handling 3D models implemented by LBS method, or object tracking without any markers.

• Journal of Biomedical Engineering Research
• /
• v.15 no.2
• /
• pp.201-208
• /
• 1994

Many three-dimensional object modeling and display methods for computer graphics and computer vision have been developed. Recently, with the help of medical imaging devices such as computerized tomography, magnetic resonance image, etc., some of those object modeling and display methods have been widely used for capturing the shape, structure and other properties of real objects in many medical applications. In this paper, we propose the reconstruction and display method of the three-dimensional object from a series of the cross sectonal image. It is implemented by using the automatic threshold selection method and the contour following algorithm. The combination of curvature and distance, we select feature points. Those feature points are the candidates for the tiling method. As a results, it is proven that this proposed method is very effective and useful in the comprehension of the object's structure. Without the technician's responce, it can be automated.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.135-143
• /
• 2004

3D Graphics accelerator is usually composed of two parts, geometry engine and rasterizer. In this paper, VGE(Vector Geometry Engine) which exploits vertex-level parallelism is proposed. In VGE, Common Floating-Point Unit by adding four-FADD, four-FMUL unit and 128-vector register accelerates geometry calculation. In comparison with SH4, Performance result show that the VGE can achieve performance gain over 4.7 times. To evaluate VGE performance, we make simulator to rebuild Simple-Scalar, general purpose processor simulator. In simulator model, we use Viewperf-benchmark.