arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2007.07795cs.CG
收藏

来自Reeb图截断平滑的度量族

A family of metrics from the truncated smoothing of Reeb graphs

St. Louis University(圣路易斯大学);Michigan State University(密歇根州立大学)

Erin Wolf Chambers, Elizabeth Munch, Tim Ophelders

AI总结:

本文引入截断平滑扩展,定义了推广Reeb图交织距离的度量族。通过截断局部极值附近部分,结合平滑后保持连通性,构建了斜率m∈[0,1]的范畴流,并给出稳定度量。

摘要:

本文介绍了一种扩展Reeb图平滑的截断平滑方法,从而定义了一族推广Reeb图交织距离的度量。通过在平滑过程中截断局部极值附近部分,控制截断量由参数τ决定。形式化截断为函子后,证明其在平滑后防止函数范围扩展,并在τ∈[0,2ε]时保持连通性。对于τ∈[0,ε],利用额外结构构建范畴流,为任意斜率m∈[0,1]构造交织距离,推广原交织距离(m=0)。尽管度量不稳定,但任意m,m'∈[0,1)的度量强等价,从而每个度量在乘法常数下稳定。最后讨论该度量在Reeb图更广泛度量族中的影响。

英文摘要:

In this paper, we introduce an extension of smoothing on Reeb graphs, which we call truncated smoothing; this in turn allows us to define a new family of metrics which generalize the interleaving distance for Reeb graphs. Intuitively, we "chop off" parts near local minima and maxima during the course of smoothing, where the amount cut is controlled by a parameter $τ$. After formalizing truncation as a functor, we show that when applied after the smoothing functor, this prevents extensive expansion of the range of the function, and yields particularly nice properties (such as maintaining connectivity) when combined with smoothing for $0 \leq τ\leq 2\varepsilon$, where $\varepsilon$ is the smoothing parameter. Then, for the restriction of $τ\in [0,\varepsilon]$, we have additional structure which we can take advantage of to construct a categorical flow for any choice of slope $m \in [0,1]$. Using the infrastructure built for a category with a flow, this then gives an interleaving distance for every $m \in [0,1]$, which is a generalization of the original interleaving distance, which is the case $m=0$. While the resulting metrics are not stable, we show that any pair of these for $m,m' \in [0,1)$ are strongly equivalent metrics, which in turn gives stability of each metric up to a multiplicative constant. We conclude by discussing implications of this metric within the broader family of metrics for Reeb graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑