Two New Contributions to the Visualization of AMR Grids: I. Interactive Rendering of Extreme-Scale 2-Dimensional Grids II. Novel Selection Filters in Arbitrary Dimension
Two New Contributions to the Visualization of AMR Grids: I. Interactive Rendering of Extreme-Scale 2-Dimensional Grids II. Novel Selection Filters in Arbitrary Dimension
复制标题
对 AMR 网格可视化的两项新贡献： I. 超大规模二维网格的交互式渲染 II．
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Philippe P. Pébaÿ
中科院分区：
文献类型：
--
作者：
Guénolé Harel;Jacques;Philippe P. Pébaÿ
我们在这里展示了继续工作的结果，以进一步实现我们在[Harel，Lekien，Pebay-2017]中概述的愿景，使用我们提出的超树网格范例对基于树的自适应网格细化（AMR）模拟进行可视化和分析。
下文中提出的第一个滤波器实现了一种自适应方法，以加速2维AMR网格的渲染，从而解决了在处理大的和/或深度细化的网格时发生的交互性损失所带来的问题。具体来说，会考虑视图参数，以便：一方面，避免创建视图区域之外的表面元素;另一方面，利用细节级别属性来剔除那些被认为太小而不可见的单元格相对于给定的视图参数。这种自适应方法通常会大幅提高渲染性能。
此外，两个新的选择过滤器提供了数据分析能力，允许提取超树网格中的那些单元格，这些单元格在某种意义上被认为是相关的，无论是几何上还是拓扑上。在描述了这些新算法之后，我们说明了它们在可视化工具包（VTK）中的使用，我们实现了它们。本说明最后对今后的工作提出了一些建议。
We present here the result of continuation work, performed to further fulfill the vision we outlined in [Harel,Lekien,Pebay-2017] for the visualization and analysis of tree-based adaptive mesh refinement (AMR) simulations, using the hypertree grid paradigm which we proposed.
The first filter presented hereafter implements an adaptive approach in order to accelerate the rendering of 2-dimensional AMR grids, hereby solving the problem posed by the loss of interactivity that occurs when dealing with large and/or deeply refined meshes. Specifically, view parameters are taken into account, in order to: on one hand, avoid creating surface elements that are outside of the view area; on the other hand, utilize level-of-detail properties to cull those cells that are deemed too small to be visible with respect to the given view parameters. This adaptive approach often results in a massive increase in rendering performance.
In addition, two new selection filters provide data analysis capabilities, by means of allowing for the extraction of those cells within a hypertree grid that are deemed relevant in some sense, either geometrically or topologically. After a description of these new algorithms, we illustrate their use within the Visualization Toolkit (VTK) in which we implemented them. This note ends with some suggestions for subsequent work.