• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.7
• /
• pp.1840-1850
• /
• 1994

Enhancement of numerical algorithms for low speed compressible flow will be considered. Contemporary time-marching algorithm has been widely accepted and applied as the method of choice for transonic, supersonic and hypersonic flows. In the low Mach number regime, time-marching algorithms do not fare as well. When the velocity is small, eigenvalues of the system of compressible equations differ widely so that the system becomes very stiff and the convergence becomes very slow. This characteristic can lead to difficulties in computations of many practical engineering problems. In the present approach, the time-derivative preconditioning method will be used to control the eigenvalue stiffness and to extend computational capabilities over a wide range of flow conditions (from very low Mach number to supersonic flow). Computational capabilities of the above algorithm will be demonstrated through computation of a variety of practical engineering problems.

• Journal of computational fluids engineering
• /
• v.1 no.1
• /
• pp.26-34
• /
• 1996

The performance of the SIMPLE, SIMPLE-C and PISO algorithms for the treatment of the pressure-velocity coupling in fluid flow problems were examined by comparing the computational effort required to obtain the same level of the convergence. Example problems are circular duct and 90-degree bent square-duct. For circular duct case, laminar and turbulent flow were computed. For 90-degree bent square-duct case, laminar flow was simulated by the time-marching method as well as the iterative method. The convergence speed of the other two algorithms are not always superior to SIMPLE algorithm. SIMPLE algorithm is faster than SIMPLE-C algorithm in the simple laminar flow calculations. The application of the PISO algorithm in three dimensional general coordinates is not so effective as in two-dimensional ones. Since computational time of PISO algorithm is increased at each time step(or iterative step) in three dimension, the total convergence speed is not decreased. But PISO algorithm is stable for large time step by using time marching method,.

• Structural Engineering and Mechanics
• /
• v.73 no.1
• /
• pp.65-73
• /
• 2020

The present work describes a new time marching procedure for structural dynamics analyses. In this novel technique, time integration parameters are automatically evaluated according to the properties of the model. Such parameters are locally defined, allowing the user to input a numerical dissipation property for each element, which defines the amount of numerical dissipation to be introduced. Since the integration parameters are locally defined as a function of the structural element itself, the time marching technique adapts according to the model, providing enhanced accuracy. The new methodology is based on displacement-velocity relations and no computation of accelerations is required. Furthermore, the method is second order accurate, it has guaranteed stability, it is truly self-starting and it allows highly controllable algorithm dissipation in the higher modes. Numerical results are presented and compared to those provided by the Newmark and the Bathe methods, illustrating the good performance of the new time marching procedure.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2004.03a
• /
• pp.15-25
• /
• 2004

This paper outlines a new convergence acceleration de-signed to solve scramjet flowfields with zones of re-circulation. Named the “marching-window”, the algorithm consists of performing pseudo-time iterations on a minimal width subdomain composed of a sequence of cross-stream planes of nodes. The upstream boundary of the subdomain is positioned such that all nodes upstream exhibit a residual smaller than the user-specified convergence threshold. The advancement of the downstream boundary follows the advancement of the upstream boundary, except in zones of significant streamwise ellipticity where a streamwise ellipticity sensor ensures its continuous progress. Compared to the standard pseudo-time marching approach, the march-ing-window is here seen to decrease the work required for convergence by up to 24 times for supersonic flows with little streamwise ellipticity and by up to 8 times for supersonic flows with large streamwise separated regions. The memory requirements are observed to be reduced sixfold by not allocating memory to the nodes not included in the computational subdomain. The marching-window satisfies the same convergence criterion as the standard pseudo-time stepping methods, hence resulting in the same converged solution within the tolerance of the user-specified convergence threshold. The extension of the marching-window to the weakly-ionized Navier-Stokes equations is also discussed.

• 한국전산유체공학회:학술대회논문집
• /
• 1998.05a
• /
• pp.35-42
• /
• 1998

Time marching algorithms applied to compressible Navier-Stokes equation have a convergence problem at low Mach number. It is mainly due to the eigenvalue stiffness and pressure singularity as Mach number approaches to zero. Among the several methods to overcome the shortcomings of time marching scheme, time derivative preconditioning method have been used successfully. In this numerical analysis, we adopted a preconditioner of K.H. Chen and developed a two-dimensional, axisymmetric Navier-Stokes program. The steady state driven cavity flow and backward facing step flow problems were computed to confirm the accuracy and the robustness of preconditioned algorithm for low Mach number flows. And the transonic and supersonic flows insice the JPL axisymmetric nozzle internal flow is exampled to investigate the effects of preconditioning at high Mach number flow regime. Test results showed excellent agreement with the experimental data.

• Journal of Korea Game Society
• /
• v.20 no.3
• /
• pp.75-84
• /
• 2020

This paper introduces an interactive indirect illumination algorithm which considers indirect visibility. First, a small number of rays are emitted on hemisphere of the current pixel to obtain the first intersection. If this point is directly illuminated by the light source, its illuminated color is collected. Second, in order to approximate the indirect visibility, a 3D ray marching algorithm, which is based on a hierarchy structure, is used to accelerate the ray-voxel intersection. Third, the indirect images are denoised by an edge-avoiding filtering with a local means replacement method.

• Journal of the Korea Computer Graphics Society
• /
• v.26 no.4
• /
• pp.17-26
• /
• 2020

We present a real-time GPU(Graphic Processing Unit) marching tetrahedra technique that extracts isosurfaces in the indexed mesh format from BCC(Body Centered Cubic) volume datasets. Compared to classical marching tetrahedra, our method shows better performance with little memory overhead. Our technique is composed of five stages. In the first stage, which needs to be done only once, we build min/max blocks that is to be used for empty space skipping to boost the performance. Next, we extract active blocks that contain the current isovalue. In the next two stages, we extract the edges and cells that contain the isosurface and then the final triangular mesh is generated in the last stage. When applied 512³ or higher resolution volume dataset, our technique shows up to 5 times speed improvement compared to the classical marching tetrahedra algorithm.

• The KIPS Transactions:PartB
• /
• v.17B no.1
• /
• pp.15-22
• /
• 2010

Background generation is very important for accurate object tracking in video surveillance systems. Traditional background generation techniques have some problems with non-moving objects for longer periods. To overcome this problem, we propose a newbackground generation method using mean-shift and Fast Marching Method (FMM) to use pixel information along temporal and spatial dimensions. The mode of pixel value density along time axis is estimated by mean-shift algorithm and spatial information is evaluated by FMM, and then they are used together to generate a desirable background in the existence of non-moving objects during longer period. Experimental results show that our proposed method is more efficient than the traditional method.

• Journal of Information Processing Systems
• /
• v.16 no.5
• /
• pp.1129-1144
• /
• 2020

The thangka image inpainting method based on wavelet transform is not ideal for contour curves when the high frequency information is repaired. In order to solve the problem, a new image inpainting algorithm is proposed based on edge structural constraints and wavelet transform coefficients. Firstly, a damaged thangka image is decomposed into low frequency subgraphs and high frequency subgraphs with different resolutions using wavelet transform. Then, the improved fast marching method is used to repair the low frequency subgraphs which represent structural information of the image. At the same time, for the high frequency subgraphs which represent textural information of the image, the extracted and repaired edge contour information is used to constrain structure inpainting in the proposed algorithm. Finally, the texture part is repaired using texture synthesis based on the wavelet coefficient characteristic of each subgraph. In this paper, the improved method is compared with the existing three methods. It is found that the improved method is superior to them in inpainting accuracy, especially in the case of contour curve. The experimental results show that the hierarchical method combined with structural constraints has a good effect on the edge damage of thangka images.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.4
• /
• pp.416-422
• /
• 2019

This paper proposes a GPU-based modeling and rendering of 3D clouds using procedural functions. The formation of clouds is based on modified noise function made with fbm(Fractional Brownian Motion). Those noise values turn into densities of droplets of liquid water, which is a critical parameter for forming the three different types of clouds. At the rendering stage, the algorithm applies the ray marching technique to decide the colors of cloud using density values obtained from the noise function. In this process, all lighting attenuation and scattering are calculated by physically based manner. Once we have the clouds, they are blended on the sky, which is also rendered physically. We also make the clouds moving in the sky by the wind force. All algorithms are implemented and tested on GPU using GLSL.