J. KIMS Technol Search

CLOSE


J. KIMS Technol > Volume 14(2); 2011 > Article
Journal of the Korea Institute of Military Science and Technology 2011;14(2):313-320.
DOI: https://doi.org/10.9766/KIMST.2011.14.2.313   
A Syudy on Applications of Convex Hull Algorithm in the SPH
Jin-Sung Lee, Young-Shin Lee
1
2Chungnam National University
SPH에서의 Convex Hull 알고리즘 적용연구
이진성, 이영신
1국방과학연구소
2충남대학교
Abstract
SPH(Smoothed Particle Hydrodynamics) is a gridless Lagrangian technique that is useful as an alternative numerical analysis method used to analyze high deformation problems as well as astrophysical and cosmological problems. In SPH, all points within the support of the kernel are taken as neighbours. The accuracy of the SHP is highly influenced by the method for choosing neighbours from all particle points considered. Typically a linked-list method or tree search method has been used as an effective tool because of its conceptual simplicity, but these methods have some liability in anisotropy situations. In this study, convex hull algorithm is presented as an improved method to eliminate this artifact. A convex hull is the smallest convex set that contains a certain set of points or a polygon. The selected candidate neighbours set are mapped into the new space by an inverse square mapping, and extract a convex hull. The neighbours are selected from the shell of the convex hull. These algorithms are proved by Fortran programs. The programs are expected to use as a searching algorithm in the future SPH program.
Key Words: SPH(Smoothed Particle Hydrodynamics), Stress Particle, Velocity Particle, Neighbour Particle, Convex Hull


ABOUT
ARTICLE CATEGORY

Browse all articles >

BROWSE ARTICLES
FOR CONTRIBUTORS
Editorial Office
160 Bugyuseong-daero 488beon-gil, Yuseong-gu, Daejeon 34060, Korea
Tel: +82-42-823-4603    Fax: +82-42-823-4605    E-mail: kimst@kimst.or.kr                

Copyright © 2023 by The Korea Institute of Military Science and Technology.

Developed in M2PI

Close layer
prev next