Link to the University of Pittsburgh Homepage
Link to the University Library System Homepage Link to the Contact Us Form

Binarized-octree generation for Cartesian adaptive mesh refinement around immersed geometries

Hasbestan, JJ and Senocak, I (2018) Binarized-octree generation for Cartesian adaptive mesh refinement around immersed geometries. Journal of Computational Physics, 368. 179 - 195. ISSN 0021-9991

[img]
Preview
PDF
Available under License : See the attached license file.

Download (3MB) | Preview
[img] Plain Text (licence)
Available under License : See the attached license file.

Download (1kB)

Abstract

We revisit the generation of balanced octrees for adaptive mesh refinement (AMR) of Cartesian domains with immersed complex geometries. In a recent short note (Hasbestan and Senocak, 2017) [42], we showed that the data locality of the Z-order curve in a hashed linear-octree generation method may not be perfect because of potential collisions in the hash table. Building on that observation, we propose a binarized-octree generation method that complies with the Z-order curve exactly. Similar to a hashed linear-octree generation method, we use Morton encoding to index the nodes of an octree, but use a red-black tree in place of the hash table. Red-black tree is a special kind of a binary tree, which we use for insertion and deletion of elements during mesh adaptation. By strictly working with the bitwise representation of an octree, we remove computer hardware limitations on the depth of adaptation on a single processor. Additionally, we introduce a geometry encoding technique for rapidly tagging a solid geometry for mesh refinement. Our results for several geometries with different levels of adaptations show that the binarized-octree generation method outperforms the linear-octree generation method in terms of runtime performance at the expense of only a slight increase in memory usage. The current AMR capability, rebl-AMR, is available as open-source software.


Share

Citation/Export:
Social Networking:
Share |

Details

Item Type: Article
Status: Published
Creators/Authors:
CreatorsEmailPitt UsernameORCID
Hasbestan, JJ
Senocak, ISENOCAK@pitt.eduSENOCAK0000-0003-1967-7583
Date: 1 September 2018
Date Type: Publication
Journal or Publication Title: Journal of Computational Physics
Volume: 368
Page Range: 179 - 195
DOI or Unique Handle: 10.1016/j.jcp.2018.04.039
Schools and Programs: Swanson School of Engineering > Mechanical Engineering and Materials Science
Refereed: Yes
ISSN: 0021-9991
Date Deposited: 07 May 2018 19:41
Last Modified: 27 Mar 2021 12:55
URI: http://d-scholarship.pitt.edu/id/eprint/34485

Metrics

Monthly Views for the past 3 years

Plum Analytics

Altmetric.com


Actions (login required)

View Item View Item