重新审视 Morse-Smale 复形的精确几何
Revisiting Accurate Geometry for Morse-Smale Complexes
AI总结:
本文分析离散 Morse-Smale 复形提取中几何嵌入与拓扑连接不一致的问题,证明特定网格上的最速下降法可兼顾二者,并提出面向均匀网格采样数据的准确构造方法。
摘要:
Morse-Smale 复形是可视化数据分析中的一种标准工具。其经典定义建立在对标量函数梯度的连续视角之上,其中梯度的零点即为临界点。这些点通过从鞍点发出的梯度曲线和梯度曲面相连,这些曲线和曲面被称为分界线。在离散情形下,Morse-Smale 复形通常通过构造一个假设最速下降方向的组合梯度来提取。以往工作已经表明,该方法得到的分界线几何嵌入可能与连续情形存在根本性差异。为获得相似的嵌入,研究者提出了用于构造组合梯度的不同方法。本文证明,这些方法会产生不同的拓扑,即临界点之间的连接关系发生改变。此外,我们还证明,当最速下降方法应用于某些类型的网格时,它能够计算出在拓扑和几何上都准确的 Morse-Smale 复形。基于这些观察,我们提出一种方法,使在均匀网格上采样的数据的 Morse-Smale 复形同时获得几何与拓扑准确性。
英文摘要:
The Morse-Smale complex is a standard tool in visual data analysis. The classic definition is based on a continuous view of the gradient of a scalar function where its zeros are the critical points. These points are connected via gradient curves and surfaces emanating from saddle points, known as separatrices. In a discrete setting, the Morse-Smale complex is commonly extracted by constructing a combinatorial gradient assuming the steepest descent direction. Previous works have shown that this method results in a geometric embedding of the separatrices that can be fundamentally different from those in the continuous case. To achieve a similar embedding, different approaches for constructing a combinatorial gradient were proposed. In this paper, we show that these approaches generate a different topology, i.e., the connectivity between critical points changes. Additionally, we demonstrate that the steepest descent method can compute topologically and geometrically accurate Morse-Smale complexes when applied to certain types of grids. Based on these observations, we suggest a method to attain both geometric and topological accuracy for the Morse-Smale complex of data sampled on a uniform grid.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。