首页> 外文期刊>Computer Graphics Forum: Journal of the European Association for Computer Graphics >A primal/dual representation for discrete Morse complexes on tetrahedral meshes
【24h】

A primal/dual representation for discrete Morse complexes on tetrahedral meshes

机译:四面体网格上离散的摩尔斯复合体的原始/对偶表示

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

摘要

We consider the problem of computing discrete Morse and Morse-Smale complexes on an unstructured tetrahedral mesh discretizing the domain of a 3D scalar field. We use a duality argument to define the cells of the descending Morse complex in terms of the supplied (primal) tetrahedral mesh and those of the ascending complex in terms of its dual mesh. The Morse-Smale complex is then described combinatorially as collections of cells from the intersection of the primal and dual meshes. We introduce a simple compact encoding for discrete vector fields attached to the mesh tetrahedra that is suitable for combination with any topological data structure encoding just the vertices and tetrahedra of the mesh. We demonstrate the effectiveness and scalability of our approach over large unstructured tetrahedral meshes by developing algorithms for computing the discrete gradient field and for extracting the cells of the Morse and Morse-Smale complexes. We compare implementations of our approach on an adjacency-based topological data structure and on the PR-star octree, a compact spatio-topological data structure.
机译:我们考虑在离散化3D标量场域的非结构化四面体网格上计算离散的Morse和Morse-Smale复数的问题。我们使用对偶性参数根据提供的(原始)四面体网格定义降序的Morse复杂单元,并根据其双重网格定义升序复杂的单元。然后将Morse-Smale复合体组合描述为来自原始网格和双重网格相交的单元格集合。我们为附着到网格四面体的离散矢量场引入了一种简单的紧凑编码,适用于与仅编码网格的顶点和四面体的任何拓扑数据结构组合。我们通过开发用于计算离散梯度场以及提取Morse和Morse-Smale复杂单元的算法,证明了我们的方法在大型非结构化四面体网格上的有效性和可扩展性。我们在基于邻接的拓扑数据结构和PR-star八叉树(紧凑的时空拓扑数据结构)上比较了我们方法的实现。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号