arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1304.2896astro-ph.IMastro-ph.CO
收藏

在蒙特卡罗辐射转移模拟中使用分层八叉树

Using hierarchical octrees in Monte Carlo radiative transfer simulations

W. Saftly, P. Camps, M. Baes, K. D. Gordon, S. Vandewoude, A. Rahimi, M. Stalevski

摘要:

三维蒙特卡罗辐射转移的一个重要方面是选择用于划分尘埃介质的空间网格。我们严格调查使用八叉树网格在蒙特卡罗尘埃辐射转移,有两种不同的八叉树构造算法(定期和重心细分)和三种不同的八叉树遍历算法(自上而下,邻居列表,和簿记方法)。一般来说,对于固定的最大细胞质量阈值标准,与重心网格相比,规则八叉树网格需要更高级别的细分。但是,网格单元的总数取决于模型的几何形状。令人惊讶的是,常规八叉树网格模拟的运行时间比重心网格模拟的效率高10%到20%,即使后者包含的网格单元比前者少。此外,我们发现,存储邻居列表中的每个单元在一个八叉树,根据减少重叠面积排序,是值得的额外的内存和实现开销:使用邻居列表可以减少20%的网格遍历相比,传统的自顶向下的方法。总之,一个规则的节点细分和邻居列表方法的组合结果在最有效的八叉树结构的蒙特卡罗辐射转移模拟。

英文摘要:

A crucial aspect of 3D Monte Carlo radiative transfer is the choice of the spatial grid used to partition the dusty medium. We critically investigate the use of octree grids in Monte Carlo dust radiative transfer, with two different octree construction algorithms (regular and barycentric subdivision) and three different octree traversal algorithms (top-down, neighbour list, and the bookkeeping method). In general, regular octree grids need higher levels of subdivision compared to the barycentric grids for a fixed maximum cell mass threshold criterion. The total number of grid cells, however, depends on the geometry of the model. Surprisingly, regular octree grid simulations turn out to be 10 to 20% more efficient in run time than the barycentric grid simulations, even for those cases where the latter contain fewer grid cells than the former. Furthermore, we find that storing neighbour lists for each cell in an octree, ordered according to decreasing overlap area, is worth the additional memory and implementation overhead: using neighbour lists can cut down the grid traversal by 20% compared to the traditional top-down method. In conclusion, the combination of a regular node subdivision and the neighbour list method results in the most efficient octree structure for Monte Carlo radiative transfer simulations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑