Awad Muhammad A, Rushdi Ahmad A, Abbas Misarah A, Mitchell Scott A, Mahmoud Ahmed H, Bajaj Chandrajit L, Ebeida Mohamed S
Alexandria University, Alexandria, Egypt.
Institute for Computational Engineering and Sciences, University of Texas, Austin TX 78712, U.S.A.
Procedia Eng. 2016;163:251-261. doi: 10.1016/j.proeng.2016.11.055.
In this paper, we present a new algorithm for all-hex meshing of domains with multiple regions without post-processing cleanup. Our method starts with a strongly balanced octree. In contrast to snapping the grid points onto the geometric boundaries, we move points a slight distance away from the common boundaries. Then we intersect the moved grid with the geometry. This allows us to avoid creating any flat angles, and we are able to handle two-sided regions and more complex topologies than prior methods. The algorithm is robust and cleanup-free; without the use of any pillowing, swapping, or smoothing. Thus, our simple algorithm is also more predictable than prior art.
在本文中，我们提出了一种用于对具有多个区域的域进行全六边形网格划分的新算法，无需进行后处理清理。我们的方法从一个强平衡八叉树开始。与将网格点捕捉到几何边界上不同，我们将点从公共边界移开一小段距离。然后我们将移动后的网格与几何图形相交。这使我们能够避免创建任何平角，并且与先前的方法相比，我们能够处理双侧区域和更复杂的拓扑结构。该算法健壮且无需清理；无需使用任何填充、交换或平滑操作。因此，我们的简单算法也比现有技术更具可预测性。
