首页> 外文期刊>Astronomy and astrophysics >Hierarchical octree and k-d tree grids for 3D radiative transfer simulations
【24h】

Hierarchical octree and k-d tree grids for 3D radiative transfer simulations

机译:用于3D辐射传递模拟的分层八叉树和k-d树网格

获取原文

摘要

Context. A crucial ingredient for numerically solving the three-dimensional radiative transfer problem is the choice of the grid that discretizes the transfer medium. Many modern radiative transfer codes, whether using Monte Carlo or ray tracing techniques, are equipped with hierarchical octree-based grids to accommodate a wide dynamic range in densities. Aims. We critically investigate two different aspects of octree grids in the framework of Monte Carlo dust radiative transfer. Inspired by their common use in computer graphics applications, we test hierarchical k-d tree grids as an alternative for octree grids. On the other hand, we investigate which node subdivision-stopping criteria are optimal for constructing of hierarchical grids. Methods. We implemented a k-d tree grid in the 3D radiative transfer code SKIRT and compared it with the previously implemented octree grid. We also considered three different node subdivision-stopping criteria (based on mass, optical depth, and density gradient thresholds). Based on a small suite of test models, we compared the efficiency and accuracy of the different grids, according to various quality metrics. Results. For a given set of requirements, the k-d tree grids only require half the number of cells of the corresponding octree. Moreover, for the same number of grid cells, the k-d tree is characterized by higher discretization accuracy. Concerning the subdivision stopping criteria, we find that an optical depth criterion is not a useful alternative to the more standard mass threshold, since the resulting grids show a poor accuracy. Both criteria can be combined; however, in the optimal combination, for which we provide a simple approximate recipe, this can lead to a 20% reduction in the number of cells needed to reach a certain grid quality. An additional density gradient threshold criterion can be added that solves the problem of poorly resolving sharp edges and strong density gradients. Conclusions. We advocate the use of k-d trees and the proposed combination of criteria to set up hierarchical grids for 3D radiative transfer. These recipes are straightforward for implementing and should help to develop faster and more accurate 3D radiative transfer codes.
机译:上下文。在数值上解决三维辐射传输问题的关键因素是选择离散化传输介质的网格。许多现代的辐射转移代码,无论是使用蒙特卡洛还是射线追踪技术,都配备了基于分层八叉树的网格,以适应宽广的密度动态范围。目的我们在蒙特卡洛尘埃辐射转移的框架内批判性地研究八叉树网格的两个不同方面。受它们在计算机图形应用程序中的普遍使用的启发,我们测试了分层k-d树网格作为八叉树网格的替代方法。另一方面,我们研究了哪种节点细分停止准则最适合构建层次网格。方法。我们在3D辐射传递代码SKIRT中实现了k-d树网格,并将其与先前实现的八叉树网格进行了比较。我们还考虑了三种不同的节点细分停止标准(基于质量,光学深度和密度梯度阈值)。基于一整套测试模型,我们根据各种质量指标比较了不同网格的效率和准确性。结果。对于给定的一组要求,k-d树网格仅需要相应八叉树的单元数目的一半。此外,对于相同数量的网格单元,k-d树的特征在于更高的离散化精度。关于细分停止标准,我们发现光学深度标准不是更标准质量阈值的有用替代方法,因为生成的栅格显示出较差的精度。这两个标准可以合并;但是,在最佳组合中(我们提供了一个简单的近似公式),可以使达到一定网格质量所需的像元数量减少20%。可以添加一个附加的密度梯度阈值标准,以解决难以解决尖锐边缘和强密度梯度的问题。结论。我们提倡使用k-d树和建议的标准组合来建立用于3D辐射传递的分层网格。这些配方易于实现,应有助于开发更快,更准确的3D辐射传输代码。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号