首页> 外文会议>International Conference on Shape Modeling and Applications >Subdomain aware contour trees and contour evolution in time-dependent scalar fields
【24h】

Subdomain aware contour trees and contour evolution in time-dependent scalar fields

机译:子域意识到轮廓树和时间依赖标量字段的轮廓演变

获取原文

摘要

For time-dependent scalar fields, one is often interested in topology changes of contours in time. In this paper, we focus on describing how contours split and merge over a certain time interval. Rather than attempting to describe all individual contour splitting and merging events, we focus on the simpler and therefore more tractable in practice problem: describing and querying the cumulative effect of the splitting and merging events over a user-specified time interval. Using our system one can, for example, find all contours at time t/sub 0/ that continue to two contours at time t/sub 1/ without hitting the boundary of the domain. For any such contour, there has to be a bifurcation happening to it somewhere between the two times, but, in addition to that, many other events may possibly happen without changing the cumulative outcome (e.g. merging with several contours born after t/sub 0/ or splitting off several contours that disappear before t/sub 1/). Our approach is flexible enough to enable other types of queries, if they can be cast as counting queries for numbers of connected components of intersections of contours with certain simply connected domains. Examples of such queries include finding contours with large life spans, contours avoiding certain subset of the domain over a given time interval or contours that continue to two at a later time and then merge back to one some time later. Experimental results show that our method can handle large 3D (2 space dimensions plus time) and 4D (3D+time) datasets. Both preprocessing and query algorithms can easily be parallelized.
机译:对于时间依赖的标量字段,通常对时间轮廓的拓扑变化感兴趣。在本文中,我们专注于描述轮廓如何分裂和合并在某个时间间隔内。我们不是尝试描述所有单独的轮廓分裂和合并事件,而不是在实践问题上专注于更简单,因此更具易行的问题:描述和查询分割和合并事件的累积效果在用户指定的时间间隔中。例如,使用我们的系统可以在时间t / sub 0 /在时间t / sub 1 /不击中域的边界,找到所有轮廓。对于任何这样的轮廓,在两次之间的某个地方必须发生分叉,但是,除此之外,还可能发生许多其他事件,而可能发生而不改变累积结果(例如,与T / SUB 0之后出生的几个轮廓合并/或分离在t / sub 1 /之前消失的几个轮廓。我们的方法足够灵活,可以启用其他类型的查询,如果它们可以被转换为计数查询,用于对某些简单连接的域的轮廓的交叉点的连接组件数量的数量进行计数查询。这些查询的示例包括查找具有大寿命的轮廓,轮廓避免域的某些子集在给定的时间间隔或稍后继续两个的轮廓上,然后在稍后将返回到一个时间。实验结果表明,我们的方法可以处理大3D(2个空间尺寸加时间)和4D(3D +时间)数据集。预处理和查询算法都可以容易地并行化。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号