• 한국전산유체공학회지
• /
• 제14권1호
• /
• pp.18-23
• /
• 2009

A novel adaptive mesh refinement(AMR) strategy based on the Moment-of-Fluid(MOF) method for volume-tracking dynamic interface computation is presented. The Moment-of-Fluid method is a new interface reconstruction and volume advection method using volume fraction as well as material centroid. The adaptive mesh refinement is performed based on the error indicator, the deviation of the actual centroid obtained by interface reconstruction from the reference centroids given by moment advection process. Using the AMR-MOF method, the accuracy of volume-tracking computation with evolving interfaces is improved significantly compared to other published results.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2008년도 학술대회
• /
• pp.334-336
• /
• 2008

A novel adaptive mesh refinement (AMR) strategy based on the Moment-of-Fluid (MOF) method for volume-tracking dynamic interface computation is presented. The Moment-of-Fluid method is a new interface reconstruction and volume advection method using volume fraction as well as material centroid. The mesh refinement is performed based on the error indicator, the deviation of the actual centroid obtained by interface reconstruction from the reference centroid given by moment advection process. Using the AMR-MOF method, the accuracy of volume-tracking computation with evolving interfaces is improved significantly compared to other published results.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2008년 추계학술대회논문집
• /
• pp.334-336
• /
• 2008

A novel adaptive mesh refinement (AMR) strategy based on the Moment-of-Fluid (MOF) method for volume-tracking dynamic interface computation is presented. The Moment-of-Fluid method is a new interface reconstruction and volume advection method using volume fraction as well as material centroid. The mesh refinement is performed based on the error indicator, the deviation of the actual centroid obtained by interface reconstruction from the reference centroid given by moment advection process. Using the AMR-MOF method, the accuracy of volume-tracking computation with evolving interfaces is improved significantly compared to other published results.

• 천문학회지
• /
• 제34권4호
• /
• pp.181-190
• /
• 2001

The advent of robust, reliable and accurate higher order Godunov schemes for many of the systems of equations of interest in computational astrophysics has made it important to understand how to solve them in multi-scale fashion. This is so because the physics associated with astrophysical phenomena evolves in multi-scale fashion and we wish to arrive at a multi-scale simulational capability to represent the physics. Because astrophysical systems have magnetic fields, multi-scale magnetohydrodynamics (MHD) is of especial interest. In this paper we first discuss general issues in adaptive mesh refinement (AMR), We then focus on the important issues in carrying out divergence-free AMR-MHD and catalogue the progress we have made in that area. We show that AMR methods lend themselves to easy parallelization. We then discuss applications of the RIEMANN framework for AMR-MHD to problems in computational astophysics.

• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 2020년도 학술발표회
• /
• pp.122-122
• /
• 2020

Urban flood simulation plays a vital role in national flood early warning, prevention and mitigation. In recent studies on 2-dimensional flood modeling, the integrated run-off inundation model is gaining grounds due to its ability to perform in greater computational efficiency. The adaptive quadtree shallow water numerical technique used in this model implements the adaptive mesh refinement (AMR) in this simulation, a procedure in which the grid resolution is refined automatically following the flood flow. The method discounts the necessity to create a whole domain mesh over a complex catchment area, which is one of the most time-consuming steps in flood simulation. This research applies the dynamic grid refinement method in simulating the recent extreme flood events in Metro Manila, Philippines. The rainfall events utilized were during Typhoon Ketsana 2009, and Southwest monsoon surges in 2012 and 2013. In order to much more visualize the urban flooding that incorporates the flow within buildings and high-elevation areas, Digital Surface Model (DSM) resolution of 5m was used in representing the ground elevation. Results were calibrated through the flood point validation data and compared to the present flood hazard maps used for policy making by the national government agency. The accuracy and efficiency of the method provides a strong front in making it commendable to use for early warning and flood inundation analysis for future similar flood events.

• 한국정보과학회논문지:시스템및이론
• /
• 제31권5_6호
• /
• pp.360-370
• /
• 2004

적응적 메쉬 세분화(AMR)는 여러 과학과 공학 분야에서 이용되는 보편적인 계산 시뮬레이션기법이다. AMR 데이타가 계층적인 다중해상도 데이타 구조로 이뤄져 있음에도 불구하고, 어떤 적절한 자료구조로의 변형 없이, 이 데이타를 광선추적법이나 스플래팅과 같은 전통적인 볼륨 가시화 알고리즘들을 이용하여 가시화 하는 것은 불가능하다. 본 논문에서는 AMR 데이타로부터 생성된 k-d 트리와 팔진트리를 이용하는 계층적 다중해상도 스플래팅에 대해 설명한다. 이 기법은 최신의 범용 PC 그래픽스 하드웨어를 이용하여 AMR 데이타의 가시화를 구현하는데 적합하다. 대화식으로 변환함수와 뷰잉 / 렌더링 파라메터를 설정할 수 있는 기능을 제공하는 사용자 인터페이스에 대해서도 설명한다. nVIDIA GeForce3 그래픽스 카드를 내장한 범용의 PC를 이용해 얻은 실험 결과로부터, 제안된 기법을 이용해 AMR 데이타를 대화식으로(초당 20프레임 이상의 속도로) 렌더링 할 수 있음을 보인다. 본 기법은 시간 가변 AMR 데이터의 병렬 렌더링에도 쉽게 적응될 수 있을 것이다.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2006년도 PARALLEL CFD 2006
• /
• pp.219-222
• /
• 2006

• 한국컴퓨터그래픽스학회논문지
• /
• 제29권3호
• /
• pp.105-115
• /
• 2023

본 논문에서는 수치모델 시뮬레이션 결과로 생성된 수십 TB의 우주 천체 시간가변(time-varying) AMR(adaptive mesh refinement) 볼륨 데이터를 다양한 XR 디바이스에 사용할 수 있는 최적화된 데이터로 변환하는 과정과 방법에 대해 설명한다. AMR 볼륨 데이터는 복잡한 모델링과 시뮬레이션에 유용하게 활용되는 데이터 구조로 본 연구에서 사용되는 매우 넓은 우주를 구성하는 성단과 가스와 같은 물질들을 효율적으로 표현할 수 있다. AMR 데이터의 메타데이터를 분석하여 낮은 해상도로 샘플링하고, 중요한 영역의 정보를 최적화하여 상대적으로 낮은 성능의 XR 디바이스에서도 사용할 수 있는 데이터 셋으로 변환한다. 마지막으로 데이터 셋을 활용한 실감 XR 콘텐츠 개발 사례를 통해 최적화된 데이터를 어떻게 활용하고 가시화하였는지 소개한다.

• 대한조선학회논문집
• /
• 제51권5호
• /
• pp.409-418
• /
• 2014

Simulation of flow past a complex marine structure requires a fine resolution in the vicinity of the structure, whereas a coarse resolution is enough far away from it. Therefore, a lot of grid cells may be wasted, when a simple Cartesian grid system is used for an Immersed Boundary Method (IBM). To alleviate this problems while maintaining the Cartesian frame work, we adopted an Adaptive Mesh Refinement (AMR) scheme where the grid system dynamically and locally refines as needed. In this study, We implemented a moving IBM and an AMR technique in our basic 3D incompressible Navier-Stokes solver. A Volume Of Fluid (VOF) method was used to effectively treat the free surface, and a recently developed Lagrangian Dynamic Subgrid-scale Model (LDSM) was incorporated in the code for accurate turbulence modeling. To capture vortex induced vibration accurately, the equation for the structure movement and the governing equations for fluid flow were solved at the same time implicitly. Also, We have developed an interface by using AutoLISP, which can properly distribute marker particles for IBM, compute the geometrical information of the object, and transfer it to the solver for the main simulation. To verify our numerical methodology, our results were compared with other authors' numerical and experimental results for the benchmark problems, revealing excellent agreement. Using the verified code, we investigated the following cases. (1) simulating flow around a floating sphere. (2) simulating flow past a marine structure.

• 천문학회보
• /
• 제39권2호
• /
• pp.65.2-65.2
• /
• 2014

We present a new hydrodynamic simulation code based on the Voronoi tessellation for estimating the density precisely. The code employs both of Lagrangian and Eulerian description by adopting the movable mesh scheme, which is superior to the conventional SPH (smoothed particle hydrodynamics) and AMR (adaptive mesh refinement) schemes. The code first generates unstructured meshes by the Voronoi tessellation at every time step, and then solves the Riemann problem for all surfaces of each Voronoi cell so as to update the hydrodynamic states as well as to move current meshes. Besides, the IEM (incremental expanding method) is devised to compute the Voronoi tessellation to desired degree of speed, thereby the CPU time is turned out to be just proportional to the number of particles, i.e., O(N). We discuss the applications of our code in the context of cosmological simulations as well as numerical experiments for galaxy formation.