首页> 外文期刊>Computers & Graphics >Topologically-consistent simplification of discrete Morse complex
【24h】

Topologically-consistent simplification of discrete Morse complex

机译:离散摩尔斯复合体的拓扑一致简化

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

摘要

We address the problem of simplifying Morse-Smale complexes computed on volume datasets based on discrete Morse theory. Two approaches have been proposed in the literature based on a graph representation of the Morse-Smale complex (explicit approach) and on the encoding of the discrete Morse gradient (implicit approach). It has been shown that this latter can generate topologically-inconsistent representations of the Morse-Smale complex with respect to those computed through the explicit approach. We propose a new simplification algorithm that creates topologically-consistent Morse-Smale complexes and works both with the explicit and the implicit representations. We prove the correctness of our simplification approach, implement it on volume data sets described as unstructured tetrahedral meshes and evaluate its simplification power with respect to the usual Morse simplification algorithm. (C) 2015 Elsevier Ltd. All rights reserved.
机译:我们解决了基于离散摩尔斯理论简化在体积数据集上计算出的摩尔斯-斯马德复合体的问题。文献中已经提出了两种基于莫尔斯-斯马德复合体的图形表示(显式方法)和离散莫尔斯梯度的编码(隐式方法)的方法。已经表明,相对于通过显式方法计算的结果,后者可以生成摩尔斯-斯马德复合体的拓扑不一致表示。我们提出了一种新的简化算法,该算法可创建拓扑一致的Morse-Smale复合体,并同时使用显式表示和隐式表示。我们证明了简化方法的正确性,在描述为非结构化四面体网格的体数据集上实现了该方法,并相对于通常的Morse简化算法评估了其简化能力。 (C)2015 Elsevier Ltd.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号