Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs

DOI10.1007/s00454-015-9674-1zbMath1315.68252arXiv1305.1172OpenAlexW2014995425MaRDI QIDQ2349859

Yanyan Li

Publication date: 18 June 2015

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.1172

zbMATH Keywords

metric spacesGromov-Hausdorff distancetopological data analysisReeb graph

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Global geometric and topological methods (à la Gromov); differential geometric analysis on metric spaces (53C23)

Related Items (5)

A higher-dimensional homologically persistent skeleton ⋮ On the Reconstruction of Geodesic Subspaces of ℝN ⋮ Approximation of metric spaces by Reeb graphs: Cycle rank of a Reeb graph, the co-rank of the fundamental group, and large components of level sets on Riemannian manifolds ⋮ Unnamed Item ⋮ A Fast Approximate Skeleton with Guarantees for Any Cloud of Points in a Euclidean Space

Uses Software

• OpenStreetMap

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonparametric ridge estimation
• On the path density of a gradient field
• Some properties of invariant sets of a flow
• Computing persistent homology
• Topological persistence and simplification
• Curve reconstruction: Connecting dots with good reason
• Graph induced complex on point data
• Adaptive multiscale detection of filamentary structures in a background of uniform random points
• A deterministic o(m log m) time algorithm for the reeb graph
• The Structure and Stability of Persistence Modules
• Improved embeddings of graph metrics into random trees
• Topology and data
• Measuring Distance between Reeb Graphs
• Gromov-Hausdorff Approximation of Filament Structure Using Reeb-type Graph
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• The Geometry of Nonparametric Filament Estimation
• Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs
• Reconstructing approximate tree metrics
• A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
• A tight bound on approximating arbitrary metrics by tree metrics
• Reconstructing curves with sharp corners

This page was built for publication: Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs