Related papers: Discrete Morse Functions and Watersheds
We consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size. Based on a common graph-based formalism, we analyze existing data structures for simplicial…
Image segmentation is the process of partitioning an image into meaningful segments. The meaning of the segments is subjective due to the definition of homogeneity is varied based on the users perspective hence the automation of the…
Associated to every closed, embedded submanifold $N$ of a connected Riemannian manifold $M$, there is the distance function $d_N$ which measures the distance of a point in $M$ from $N$. We analyze the square of this function and show that…
A discrete d-manifold is a finite simple graph G=(V,E) where all unit spheres are (d-1)-spheres. A d-sphere is a d-manifold for which one can remove a vertex to make it contractible. A graph is contractible if one can remove a vertex with…
In this paper, we consider a class of Morse-Smale diffeomorphisms defined on a closed 3-manifold (non-necessarily orientable) under the assumption that all their saddle points have the same dimension of the unstable manifolds. The simplest…
We study the computation of the flow of water on imprecise terrains. We consider two approaches to modeling flow on a terrain: one where water flows across the surface of a polyhedral terrain in the direction of steepest descent, and one…
A mathematical smooth function means that the function has continuous derivatives to a certain degree C(k). We call it a k-smooth function or a smooth function if k can grow infinitively. Based on quantum physics, there is no such smooth…
In this work, we design a nearly linear time discrete Morse theory based algorithm for computing homology groups of 2-manifolds, thereby establishing the fact that computing homology groups of 2-manifolds is remarkably easy. Unlike previous…
Easy lowering local minima, after introducing valley functions on smooth manifolds gives, without gluing technicities, "M. Morse's lemma's" canonical form, moving critical values and eliminating pair of critical points theorems, reducing…
Morse decompositions partition the flows in a vector field into equivalent structures. Given such a decomposition, one can define a further summary of its flow structure by what is called a connection matrix.These matrices, a generalization…
Associated to every closed, embedded submanifold $N$ in a connected Riemannian manifold $M$, there is the distance function $d_N$ which measures the distance of a point in $M$ from $N$. We analyze the square of this function and show that…
The Dushnik-Miller dimension of a poset $\le$ is the minimal number $d$ of linear extensions $\le_1, \ldots , \le_d$ of $\le$ such that $\le$ is the intersection of $\le_1, \ldots , \le_d$. Supremum sections are simplicial complexes…
In this paper, we give a necessary and sufficient condition that discrete Morse functions on a digraph can be extended to be Morse functions on its transitive closure, from this we can extend the Morse theory to digraphs by using…
In this note, we provide a smooth variational principle on Wasserstein space by constructing a smooth gauge-type function using the sliced Wasserstein distance. This function is a crucial tool for optimization problems and in viscosity…
Given two discrete Morse functions on a simplicial complex, we introduce the {\em connectedness homomorphism} between the corresponding discrete Morse complexes. This concept leads to a novel framework for studying the connectedness in…
We present an algorithm for approximating a function defined over a $d$-dimensional manifold utilizing only noisy function values at locations sampled from the manifold with noise. To produce the approximation we do not require any…
A Morse function f on a manifold with corners M allows the characterization of the Morse data for a critical point by the Morse index. In fact, a modified gradient flow allows a proof of the Morse theorems in a manner similar to that of…
Compressed manifold modes are locally supported analogues of eigenfunctions of the Laplace-Beltrami operator of a manifold. In this paper we describe an algorithm for the calculation of modes for discrete manifolds that, in experiments,…
Image partitioning, or segmentation without semantics, is the task of decomposing an image into distinct segments, or equivalently to detect closed contours. Most prior work either requires seeds, one per segment; or a threshold; or…
Gradient descent, or negative gradient flow, is a standard technique in optimization to find minima of functions. Many implementations of gradient descent rely on discretized versions, i.e., moving in the gradient direction for a set step…