• Title/Summary/Keyword: Adaptive Cartesian mesh

Search Result 6, Processing Time 0.027 seconds

Development of a 2-dimensional Flow Solver using Hybrid Unstructured and Adaptive Cartesian Meshes (비정렬 및 적응 직교격자를 이용한 2차원 혼합격자계 유동해석 코드 개발)

  • Jung, M.K.;Kwon, O.J.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2011.05a
    • /
    • pp.294-301
    • /
    • 2011
  • A two-dimensional hybrid flaw solver has been developed for the accurate and efficient simulation of steady and unsteady flaw fields. The flow solver was cast to accommodate two different topologies of computational meshes. Triangular meshes are adopted in the near-body region such that complex geometric configurations can be easily modeled, while adaptive Cartesian meshes are, utilized in the off-body region to resolve the flaw more accurately with less numerical dissipation by adopting a spatially high-order accurate scheme and solution-adaptive mesh refinement technique. A chimera mesh technique has been employed to link the two flow regimes adopting each mesh topology. Validations were made for the unsteady inviscid vol1ex convection am the unsteady turbulent flaws over an NACA0012 airfoil, and the results were compared with experimental and other computational results.

  • PDF

DEVELOPMENT OF A 2-D UNSTEADY FLOW SIMULATION CODE USING CARTESIAN MESHES (직교격자를 이용한 2차원 비정상 유동해석 코드 개발)

  • Jung, Min-Kyu;Lee, Jae-Eun;Park, Se-Youn;Kwon, Oh-Joon;Kwon, Jang-Hyuk;Shin, Ha-Yong
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2009.04a
    • /
    • pp.116-120
    • /
    • 2009
  • A two-dimensional unsteady inviscid flow solver has been developed for the simulation of complex geometric configurations on adaptive Cartesian meshes. Embedded condition was used for boundary condition and a predictor-corrector explicit time marching scheme was used for time-accurate numerical simulation. The Cartesian mesh generator, which was previously developed for steady problem, was used grid generation for unsteady flow. The solver was based on ALE formulation for body motion. For diminishing the effects of cut-cells, the cell merging method was used. Using cell merging method, it was eliminated the CFL constraints. The conservation problem, which is caused cell-type variation around region swept by solid boundary, was also solved using cell merging method. The results are presented for 2D circular cylinder and missile launching problem.

  • PDF

Development of a Cartesian-based Code for Effective Simulation of Flow Around a Marine Structure - Integration of AMR, VOF, IBM, VIV, LES (효율적인 해양구조물 유동 해석을 위한 직교좌표계 기반의 코드 개발 - AMR, VOF, IBM, VIV, LES의 통합)

  • Lee, Kyongjun;Yang, Kyung-Soo
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.51 no.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.

S-Octree: An Extension to Spherical Coordinates

  • Park, Tae-Jung;Lee, Sung-Ho;Kim, Chang-Hun
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.12
    • /
    • pp.1748-1759
    • /
    • 2010
  • We extend the octree subdivision process from Cartesian coordinates to spherical coordinates to develop more efficient space-partitioning structure for surface models. As an application of the proposed structure, we apply the octree subdivision in spherical coordinates ("S-Octree") to geometry compression in progressive mesh coding. Most previous researches on geometry-driven progressive mesh compression are devoted to improve predictability of geometry information. Unlike this, we focus on the efficient information storage for the space-partitioning structure. By eliminating void space at initial stage and aligning the R axis for the important components in geometry information, the S-Octree improves the efficiency in geometry information coding. Several meshes are tested in the progressive mesh coding based on the S-Octree and the results for performance parameters are presented.

An Adaptive Watermarking Scheme for Three-Dimensional Mesh Models (3차원 메쉬 모델의 적응형 워터마킹 방법)

  • 전정희;호요성
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.6
    • /
    • pp.41-50
    • /
    • 2003
  • For copyright protection of digital contents, we employ watermarking techniques to embed watermark signals into digital host data. In this paper we propose an adaptive watermarking algorithm for three-dimensional (3-D) mesh models. Watermark signals are inserted into vertex coordinates adaptively according to changes of their position values. While we embed strong watermarks in the areas of large variations, watermarks are weakly inserted in other areas. After we generate triangle strips by traversing the 3-D model and convert the Cartesian coordinates to the spherical coordinate system, we calculate variations of vertex positions along the traversed strips. Then, we insert watermark signals into the vertex coordinates adaptively according to the calculated variations. We demonstrate that imperceptibility of the inserted watermark is significantly improved and show the bit error rate (BER) for robustness.