scholarly journals An hp-adaptive discretization algorithm for signed distance field generation

2017 ◽  
Vol 23 (10) ◽  
pp. 2208-2221 ◽  
Author(s):  
Dan Koschier ◽  
Crispin Deul ◽  
Magnus Brand ◽  
Jan Bender
Author(s):  
Wasim Abbas ◽  
Chris Doran ◽  
Rich Evans ◽  
Roberto Lopez Mendez

2021 ◽  
pp. 103166
Author(s):  
Wenjuan Hou ◽  
Chen Zong ◽  
Pengfei Wang ◽  
Shiqing Xin ◽  
Shuangmin Chen ◽  
...  

2018 ◽  
Vol 141 (6) ◽  
Author(s):  
Chenguang Zhang ◽  
Chunliang Wu ◽  
Krishnaswamy Nandakumar

We present three algorithms for robust and efficient geometric calculations in the context of immersed boundary method (IBM), including classification of mesh cells as inside/outside of a closed surface, projection of points onto a surface, and accurate calculation of the solid volume fraction field created by a closed surface overlapping with a background Cartesian mesh. The algorithms use the signed distance field (SDF) to represent the surface and remove the intersection tests, which are usually required by other algorithms developed before, no matter the surface is described in analytic or discrete form. The errors of the algorithms are analyzed. We also develop an approximate method on efficient SDF field calculation for complex geometries. We demonstrate how the algorithms can be implemented within the framework of IBM with a volume-average discrete-forcing scheme and applied to simulate fluid–structure interaction problems.


Sign in / Sign up

Export Citation Format

Share Document