Efficient generation of adaptive Cartesian mesh for computational fluid dynamics using GPU

Seyoun Park, Hayong Shin

Research output: Contribution to journalArticle

Abstract

Mesh generation has been frequently the most time consuming step in typical CFD analysis studies. In the past two decades, adaptive Cartesian mesh methods have gained increasing popularity among CFD researches, mainly because of its simplicity and the possibility of automating mesh generation step. In contrast to body-fitted mesh, cells in Cartesian mesh are aligned with coordinate axes. In adaptive Cartesian mesh, cells near the objects' boundary are recursively refined using quad-tree (two-dimensional) or octree (three-dimensional). Then, cells intersecting the objects' boundary are clipped by the surfaces, leaving numerous small irregular shaped cells, called cut-cells. Most of the computational efforts required to generate adaptive Cartesian mesh is concentrated on the cut-cell clipping operation. To achieve the computational accuracy in the subsequent numerical solver, the number of cut-cells can be easily over millions, demanding substantial amount of computation time. Reducing mesh generation time matters more especially for unsteady flow simulation involving moving objects, which requires frequent regeneration of meshes for varied postures of the object. In this paper, we report an efficient novel approach to generating adaptive Cartesian mesh by parallelization using the graphics processing unit. The proposed method consists of the following three steps: (1) computing cross-sectional curves of object boundary, (2) octree refinement based on the section curves, and (3) cut-cell clipping. Because each step is designed to be highly parallelizable, we also implemented it on a graphics processing unit, showing orders of magnitude faster performance than the CPU version.

Original languageEnglish (US)
Pages (from-to)1393-1404
Number of pages12
JournalInternational Journal for Numerical Methods in Fluids
Volume70
Issue number11
DOIs
StatePublished - Dec 20 2012
Externally publishedYes

Fingerprint

Mesh generation
Cartesian
Computational Fluid Dynamics
Computational fluid dynamics
Mesh
Cell
Mesh Generation
Flow simulation
Unsteady flow
Octree
Clipping
Program processors
Graphics Processing Unit
Co-ordinate axis
Curve
Quadtree
Graphics processing unit
Flow Simulation
Regeneration
Unsteady Flow

Keywords

  • Adaptive Cartesian mesh
  • CFD
  • GPU computing
  • Octree

ASJC Scopus subject areas

  • Computational Mechanics
  • Mechanics of Materials
  • Mechanical Engineering
  • Computer Science Applications
  • Applied Mathematics

Cite this

Efficient generation of adaptive Cartesian mesh for computational fluid dynamics using GPU. / Park, Seyoun; Shin, Hayong.

In: International Journal for Numerical Methods in Fluids, Vol. 70, No. 11, 20.12.2012, p. 1393-1404.

Research output: Contribution to journalArticle

@article{99b98d46da40430c8c993d634dd39005,
title = "Efficient generation of adaptive Cartesian mesh for computational fluid dynamics using GPU",
abstract = "Mesh generation has been frequently the most time consuming step in typical CFD analysis studies. In the past two decades, adaptive Cartesian mesh methods have gained increasing popularity among CFD researches, mainly because of its simplicity and the possibility of automating mesh generation step. In contrast to body-fitted mesh, cells in Cartesian mesh are aligned with coordinate axes. In adaptive Cartesian mesh, cells near the objects' boundary are recursively refined using quad-tree (two-dimensional) or octree (three-dimensional). Then, cells intersecting the objects' boundary are clipped by the surfaces, leaving numerous small irregular shaped cells, called cut-cells. Most of the computational efforts required to generate adaptive Cartesian mesh is concentrated on the cut-cell clipping operation. To achieve the computational accuracy in the subsequent numerical solver, the number of cut-cells can be easily over millions, demanding substantial amount of computation time. Reducing mesh generation time matters more especially for unsteady flow simulation involving moving objects, which requires frequent regeneration of meshes for varied postures of the object. In this paper, we report an efficient novel approach to generating adaptive Cartesian mesh by parallelization using the graphics processing unit. The proposed method consists of the following three steps: (1) computing cross-sectional curves of object boundary, (2) octree refinement based on the section curves, and (3) cut-cell clipping. Because each step is designed to be highly parallelizable, we also implemented it on a graphics processing unit, showing orders of magnitude faster performance than the CPU version.",
keywords = "Adaptive Cartesian mesh, CFD, GPU computing, Octree",
author = "Seyoun Park and Hayong Shin",
year = "2012",
month = "12",
day = "20",
doi = "10.1002/fld.2750",
language = "English (US)",
volume = "70",
pages = "1393--1404",
journal = "International Journal for Numerical Methods in Fluids",
issn = "0271-2091",
publisher = "John Wiley and Sons Ltd",
number = "11",

}

TY - JOUR

T1 - Efficient generation of adaptive Cartesian mesh for computational fluid dynamics using GPU

AU - Park, Seyoun

AU - Shin, Hayong

PY - 2012/12/20

Y1 - 2012/12/20

N2 - Mesh generation has been frequently the most time consuming step in typical CFD analysis studies. In the past two decades, adaptive Cartesian mesh methods have gained increasing popularity among CFD researches, mainly because of its simplicity and the possibility of automating mesh generation step. In contrast to body-fitted mesh, cells in Cartesian mesh are aligned with coordinate axes. In adaptive Cartesian mesh, cells near the objects' boundary are recursively refined using quad-tree (two-dimensional) or octree (three-dimensional). Then, cells intersecting the objects' boundary are clipped by the surfaces, leaving numerous small irregular shaped cells, called cut-cells. Most of the computational efforts required to generate adaptive Cartesian mesh is concentrated on the cut-cell clipping operation. To achieve the computational accuracy in the subsequent numerical solver, the number of cut-cells can be easily over millions, demanding substantial amount of computation time. Reducing mesh generation time matters more especially for unsteady flow simulation involving moving objects, which requires frequent regeneration of meshes for varied postures of the object. In this paper, we report an efficient novel approach to generating adaptive Cartesian mesh by parallelization using the graphics processing unit. The proposed method consists of the following three steps: (1) computing cross-sectional curves of object boundary, (2) octree refinement based on the section curves, and (3) cut-cell clipping. Because each step is designed to be highly parallelizable, we also implemented it on a graphics processing unit, showing orders of magnitude faster performance than the CPU version.

AB - Mesh generation has been frequently the most time consuming step in typical CFD analysis studies. In the past two decades, adaptive Cartesian mesh methods have gained increasing popularity among CFD researches, mainly because of its simplicity and the possibility of automating mesh generation step. In contrast to body-fitted mesh, cells in Cartesian mesh are aligned with coordinate axes. In adaptive Cartesian mesh, cells near the objects' boundary are recursively refined using quad-tree (two-dimensional) or octree (three-dimensional). Then, cells intersecting the objects' boundary are clipped by the surfaces, leaving numerous small irregular shaped cells, called cut-cells. Most of the computational efforts required to generate adaptive Cartesian mesh is concentrated on the cut-cell clipping operation. To achieve the computational accuracy in the subsequent numerical solver, the number of cut-cells can be easily over millions, demanding substantial amount of computation time. Reducing mesh generation time matters more especially for unsteady flow simulation involving moving objects, which requires frequent regeneration of meshes for varied postures of the object. In this paper, we report an efficient novel approach to generating adaptive Cartesian mesh by parallelization using the graphics processing unit. The proposed method consists of the following three steps: (1) computing cross-sectional curves of object boundary, (2) octree refinement based on the section curves, and (3) cut-cell clipping. Because each step is designed to be highly parallelizable, we also implemented it on a graphics processing unit, showing orders of magnitude faster performance than the CPU version.

KW - Adaptive Cartesian mesh

KW - CFD

KW - GPU computing

KW - Octree

UR - http://www.scopus.com/inward/record.url?scp=84868115459&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84868115459&partnerID=8YFLogxK

U2 - 10.1002/fld.2750

DO - 10.1002/fld.2750

M3 - Article

AN - SCOPUS:84868115459

VL - 70

SP - 1393

EP - 1404

JO - International Journal for Numerical Methods in Fluids

JF - International Journal for Numerical Methods in Fluids

SN - 0271-2091

IS - 11

ER -