首页> 外文学位 >Simplification and visual effectiveness of morse connection graphs.
【24h】

Simplification and visual effectiveness of morse connection graphs.

机译:莫尔斯电连接图的简化和视觉效果。

获取原文
获取原文并翻译 | 示例

摘要

Vector field visualization has been a popular research topic in the past few decades. Vector field features have traditionally been defined as trajectories with certain special properties. Examples of such features include stationary points, periodic trajectories and separatrices. However, such features are generally fragile with respect to perturbation of the data, or the choice of a numerical method used to approximate the trajectories. Because of this, algorithms to compute them are not robust enough to be practical.;An alternative approach uses Morse sets, regions of close to circulating flow, as topological features. Morse sets can be computed using graph algorithms from a finite directed graph representing all trajectories. Algorithms for computing Morse sets are generally more robust since the resulting features are sets of points with properties that can be rigorously verified by an automatic algorithm rather than individual trajectories that can only be approximated. The Morse Connection Graph, whose nodes correspond to Morse sets and arcs represent trajectories that connect them, provides a concise summary of the flow structure. One shortcoming of Morse Connection Graphs (MCG) is the lack of ability to convey information on high-level flow structure in a visually effective manner. This paper describes a method to simplify Morse decompositions by iteratively merging pairs of Morse sets that are adjacent in the Morse Connection Graph (MCG). When Morse sets A and B are merged, they are replaced by a single Morse set, that can be thought of as the union of A, B and all trajectories connecting A and B. Cost criteria for the possible Morse set mergers are evaluated based on resulting size, complexity as well as user input factors. Visual representation of the MCG is improved using a triangulation of the Morse space along with a specialized trajectory visualization algorithm. Smoothing techniques are discussed to make the resulting visualization more effective at conveying information to the user.
机译:在过去的几十年中,矢量场可视化一直是热门的研究主题。传统上,矢量场特征被定义为具有某些特殊属性的轨迹。此类特征的示例包括固定点,周期性轨迹和分离。但是,这些特征通常在数据扰动或用于近似轨迹的数值方法的选择方面是脆弱的。因此,计算它们的算法不够健壮,无法实用。;另一种方法是使用摩尔斯集(接近循环流的区域)作为拓扑特征。莫尔斯集可以使用图算法从代表所有轨迹的有限有向图中计算出来。用于计算摩尔斯集的算法通常更健壮,因为生成的特征是具有自动算法可以严格验证的属性的点集,而不是只能近似的单个轨迹。摩尔斯连接图的节点对应于摩尔斯集,弧表示连接它们的轨迹,它提供了流结构的简要摘要。莫尔斯电连接图(MCG)的一个缺点是缺乏以视觉有效的方式在高层流动结构上传达信息的能力。本文介绍了一种通过迭代合并Morse连接图(MCG)中相邻的Morse集对来简化Morse分解的方法。当Morse集 A B 合并时,它们被单个Morse集代替,可以将其视为 A,B 以及连接 A B。的所有轨迹。基于结果的规模,复杂性以及用户输入因素,评估可能的莫尔斯电汇合并的成本标准。 MCG的视觉表示通过使用Morse空间的三角剖分以及专用的轨迹可视化算法得到了改善。讨论了平滑技术,以使所得的可视化效果更有效地向用户传达信息。

著录项

  • 作者

    Sipeki, Levente.;

  • 作者单位

    Colorado School of Mines.;

  • 授予单位 Colorado School of Mines.;
  • 学科 Computer Science.
  • 学位 M.S.
  • 年度 2013
  • 页码 65 p.
  • 总页数 65
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号