Related papers: Measure Theoretic Reeb Graphs and Reeb Spaces

This article proposes to integrate two Reeb graphs with the information of their isosurfaces' inclusion relation. As computing power evolves, there arise numerical data that have small-scale physics inside larger ones -- for example, small…

We study the question of approximating a compact geodesic metric space by metric graphs satisfying a uniform upper bound on their first Betti number. We prove that, up to a suitable multiplicative constant, Reeb graphs of distance functions…

In this article, we study the question of the statistical convergence of the 1-dimensional Mapper to its continuous analogue, the Reeb graph. We show that the Mapper is an optimal estimator of the Reeb graph, which gives, as a byproduct, a…

Topological simplification of scalar and vector fields is well-established as an effective method for analysing and visualising complex data sets. For multi-field data, topological analysis requires simultaneous advances both mathematically…

Reeb spaces of smooth functions are fundamental and strong tools in understanding manifolds via smooth functions with mild critical points. They are defined as the natural spaces of all connected components of level sets. They are also…

There are two rather distinct approaches to Morse theory nowadays: smooth and discrete. We propose to study a real valued function by assembling all associated sections in a topological category. From this point of view, Reeb functions on…

We present theory and practice for robust implementations of bivariate Jacobi set and Reeb space algorithms. Robustness is a fundamental topic in computational geometry that deals with the issues of numerical errors and degenerate cases in…

In this paper, we develop the theory of Sobolev spaces on locally finite graphs, including completeness, reflexivity, separability, and Sobolev inequalities. Since there is no exact concept of dimension on graphs, classical methods that…

We give a new answer to so-called realization problems of graphs as Reeb graphs of smooth functions with prescribed preimages of regular values having nice structures. We present a best possible answer for functions on 3-dimensional closed…

We discuss reconstructing smooth real algebraic maps onto curves whose Reeb graph is as prescribed. This can be contributed to real algebraic geometry, especially in explicit examples in real algebraic geometry in a new way. The Reeb graph…

Comparison of graph structure is a ubiquitous task in data analysis and machine learning, with diverse applications in fields such as neuroscience, cyber security, social network analysis, and bioinformatics, among others. Discovery and…

The cell complex structure is one of the most fundamental structures in topology and combinatorics, the Morse decomposition of a dynamical system analyzes the global gradient behavior, and the Reeb graph of a function is an elementary tool…

Reeb graphs are simple topological descriptors with applications in many areas like topological data analysis and computational geometry. Despite their prevalence, visualization of Reeb graphs has received less attention. In this paper, we…

A Reeb space is defined as the space of all the connected components of inverse images of a smooth map, which is a fundamental tool in studying smooth manifolds using generic smooth maps whose codimensions are not positive such as Morse…

In this paper we introduce a novel family of attributed graphs for the purpose of shape discrimination. Our graphs typically arise from variations on the Mapper graph construction, which is an approximation of the Reeb graph for point cloud…

Reeb graphs are widely used in a range of fields for the purposes of analyzing and comparing complex spaces via a simpler combinatorial object. Further, they are closely related to extended persistence diagrams, which largely but not…

Metric graphs are ubiquitous in science and engineering. For example, many data are drawn from hidden spaces that are graph-like, such as the cosmic web. A metric graph offers one of the simplest yet still meaningful ways to represent the…

Graphs are used in almost every scientific discipline to express relations among a set of objects. Algorithms that compare graphs, and output a closeness score, or a correspondence among their nodes, are thus extremely important. Despite…

We prove a Reeb sphere theorem for finite simple graphs. The result bridges two different definitions of spheres in graph theory. We also reformulate Morse conditions in terms of the center manifolds, the level surface graphs {f=f(x)} in…

Graph embeddings have emerged as a powerful tool for representing complex network structures in a low-dimensional space, enabling the use of efficient methods that employ the metric structure in the embedding space as a proxy for the…