• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.12
• /
• pp.1633-1638
• /
• 1988

This paper proposes the lattice-structured space subdivision method using bounding volume to reduce a great number of ray-surface intersection calculations in ray tracing algorithm for the computer graphics. We show that this method reduced 50%-70% calculations compard to pre-exist method by experiments.

• Journal of Korea Multimedia Society
• /
• v.8 no.9
• /
• pp.1239-1247
• /
• 2005

Basically, objects are discriminated by transfer functions in volume rendering . However, in some cases objects cannot be discriminated only with transfer functions. In these cases, objects are pre-segmented with other methods, and visualized based on the segmentation information. In this paper we present a way of assigning per-object transparency in visualization of segmented volumes. Semi-transparent rendering is used to effectively give context information about the observed object. Per-object transparency can be used as a very effective visualization tool especially when it is difficult to adjust transfer functions to make the object semi-transparent. We present several interpretations of the meaning of per-object transparency, and corresponding variations of the algorithm. We show that efficient implementations for interactive use are possible, by presenting an implementation using general graphics hardware.

• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.311-315
• /
• 1987

In this paper an efficient algorithm to estimate the volume and surface area and the reconstruction algorithm for 3-dimensional graphics are presented. The graph theory is used to estimate the optimal quantitative factors. To improve the computing efficiency, the algorithm to get proper contour points is performed by applying several tolerances. The search and the given arc cost is limited according to the change of curvature of the cross-sectional contour. For mathematical model, these algorithms for volume estimation based on polyhedral approximation are applied to the selected optimal surface. The results show that the values of the volume and surface area for tolerances 1.0005, 1.001 and 1.002 approximate to values for tolerances 1.000 resulting in small errors. The reconstructed three-dimensional images are sparse and consist of larger triangular tiles between two cross sections as tolerance is increasing.

• Journal of Korea Multimedia Society
• /
• v.10 no.3
• /
• pp.316-324
• /
• 2007

Maximum Intensity Projection (MIP) identifies patients' anatomical structures from MR or CT data sets. Recently, it becomes possible to generate MIP images with interactive speed by exploiting Graphics Processing Unit (GPU) even in large volume data sets. Generally, volume boundary plane is obliquely crossed with view-aligned texture plane in hardware-texture based volume rendering. Since the ray sampling distance is not increased at volume boundary in volume rendering, the aliasing problem occurs due to data loss. In this paper, we propose an efficient method to overcome this problem by Re-rendering volume boundary planes. Our method improves image quality to make dense distances between samples near volume boundary which is a high frequency area. Since it is only 6 clipping planes are additionally needed for Re-rendering, high quality rendering can be performed without sacrificing computational efficiency. Furthermore, our method couldbe applied to Minimum Intensity Projection (MinIP) volume rendering.

• Journal of Korea Game Society
• /
• v.13 no.2
• /
• pp.99-110
• /
• 2013

As volume rendering has been applied for computer game, the visualization of volume data with surface data in one scene has been required. Though a hybrid rendering of volume and surface data have been developed using the GPGPU functionality, computer games which run on low-level hardware are difficult to perform the hybrid rendering. In this paper, we propose a new hybrid rendering based on DirectX 9.0 and general hardware. We generate the layered depth images from surface data using a new method to reduce the depth complexity and generation time. Then, we perform the hybrid rendering using the layered depth images. In the rendering process, we suggest a new method to transform the coordinate system from a surface coordinate to a volume coorinate and propose an accelerated rendering technique. As the result, we can perform volume-surface hybrid rendering in an efficient way.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.4
• /
• pp.181-187
• /
• 2001

본 논문에서는 3D 텍스쳐 매핑 하드웨어(texture mapping hardware)하에서 OpenGL를 이용하여 빠른 추출(classification) 및 음영처리(shading)를 가능하게 하는 직접 볼륨 렌더링(direct volume rendering) 방법을 제안한다. 추출과정을 위해 lookup table을 통해서 볼륨 데이터의 밀도값(density)으로부터 불투명도(opacity)값을 얻어내고, 법선 벡터 블렌딩(normal blending)방법을 제안하여 볼륨 크기에 상관없이 최종 이미지에서만 음영 처리 연산을 수행한다. 본 논문에서 제시된 볼륨 렌더링의 전과정이 그래픽스 하드웨어(graphics hardware)에서 이뤄지면, 음영처리 연산의 복잡도 감소로 인하여 상호 대화적인 볼륨 렌더링이 가능하다.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.05a
• /
• pp.551-554
• /
• 2002

The paper discusses new approach for machining operation simulation using enhanced Z map algorithm. To extract the required geometric information from NC code, suggested algorithm uses supersampling method to enhance the efficiency of a simulation process. By executing redundant Boolean operations in a grid cell and averaging down calculated data, presented algorithm can accurately represent material removal volume though tool swept volume is negligibly small. Supersampling method is the most common form of antialiasing and usually used with polygon mesh rendering in computer graphics. The key advantage of enhanced Z map model is that the data structure is same with conventional Z map model, though it can acquire higher accuracy and reliability with same or lower computation time. By simulating machining operation efficiently, this system can be used to improve the reliability and efficiency of NC machining process as well as the quality of the final product.

• Journal of the Korea Computer Graphics Society
• /
• v.19 no.3
• /
• pp.1-11
• /
• 2013

Fluid Implicit Particle (FLIP) method is used in Visual Effect(VFX) industries frequently because FLIP based simulation show high performance with good visual quality. However in large-scale fluid simulations, the efficiency of FLIP method is low because it requires many particles to represent large volume of water. In this papers, we propose a novel hybrid method of simulating fluids to supplement this drawback. To improve the performance of the FLIP method by reducing the number of particles, particles are deployed inside thin layers of the inner surface of water volume only. The coupling between less-disspative solutions of FLIP method and viscosity solution of level set method is achieved by introducing a new surface reconstruction method motivated by surface reconstruction method[1] and moving least squares(MLS) method[2]. Our hybrid method can generate high quality of water simulations efficiently with various multiscale features.

• Journal of the Korea Computer Graphics Society
• /
• v.6 no.1
• /
• pp.19-27
• /
• 2000

This paper proposes a non-self-intersecting multiresolution deformable model to extract and reconstruct three-dimensional boundaries of objects from volumetric data. Deformable models offer an attractive method for extracting and reconstructing the boundary surfaces. However, convensional deformable models have three limitations- sensitivity to model initialization, difficulties in dealing with severe object concavities, and model self-intersections. We address the initialization problem by multiresolution model representation, which progressively refines the deformable model based on multiresolution volumetric data in order to extract the boundaries of the objects in a coarse-to-fine fashion. The concavity problem is addressed by mesh size regularization, which matches its size to the unit voxel of the volumetric data. We solve the model self-intersection problem by including a non-self-intersecting force among the customary internal and external forces in the physics-based formulation. This paper presents results of applying our new deformable model to extracting a sphere surface with concavities from a computer-generated volume data and a brain cortical surface from a MR volume data.

• Journal of the Korea Computer Graphics Society
• /
• v.18 no.1
• /
• pp.29-34
• /
• 2012

High-quality tetrahedral meshes are crucial for FEM-based simulation of large elasto-plastic deformation and tetrahedral-mesh-based simulation of fluid flow. This paper proposes a volume meshing method that exploits an octree-based adaptive signed distance field to fill the inside of a polygonal object with tetrahedra, of which dihedral angles are good. The suggested method utilizes an octree structure to reduce the total number of tetrahedra by space-efficiently filling an object with graded tetrahedra. To obtain a high-quality mesh with good dihedral angles, we restrict the octree in such a way that any pair of neighboring cells only differs by one level. In octree-based tetrahedral meshing, the signed distance computation of a point to the surface of a given object is a very important and frequently-called operation. To accelerate this operation, we develop a method that computes a signed distance field directly on the vertices of the octree cells while constructing the octree using a top-down approach. This is the main focus of the paper. The suggested tetrahedral meshing method is fast, stable and easy to implement.