Lewiner Thomas, Lopes Hélio, Tavares Geovan
Laboratório MatMídia, Departamento de Matemática, Pontifícia Universidade Católica do Rio de Janeiro, Rua Marques de São Vicente 225, Gávea, Rio de Janeiro, RJ, Brasil.
IEEE Trans Vis Comput Graph. 2004 Sep-Oct;10(5):499-508. doi: 10.1109/TVCG.2004.18.
Morse theory is a powerful tool for investigating the topology of smooth manifolds. It has been widely used by the computational topology, computer graphics, and geometric modeling communities to devise topology-based algorithms and data structures. Forman introduced a discrete version of this theory which is purely combinatorial. This work aims to build, visualize, and apply the basic elements of Forman's discrete Morse theory. It intends to use some of those concepts to visually study the topology of an object. As a basis, an algorithmic construction of optimal Forman's discrete gradient vector fields is provided. This construction is then used to topologically analyze mesh compression schemes, such as Edgebreaker and Grow&Fold. In particular, this paper proves that the complexity class of the strategy optimization of Grow&Fold is MAX-SNP hard.
莫尔斯理论是研究光滑流形拓扑结构的有力工具。它已被计算拓扑学、计算机图形学和几何建模领域广泛用于设计基于拓扑的算法和数据结构。福尔曼引入了该理论的离散版本,它是纯组合的。这项工作旨在构建、可视化并应用福尔曼离散莫尔斯理论的基本元素。它打算使用其中一些概念来直观地研究物体的拓扑结构。作为基础,提供了最优福尔曼离散梯度向量场的算法构造。然后将此构造用于拓扑分析网格压缩方案,如边折叠算法和增长折叠算法。特别地,本文证明了增长折叠算法的策略优化的复杂度类是MAX-SNP难的。