Reeb graphs: approximation and persistence
type: Item
instance of: scholarly article
title: Reeb graphs: approximation and persistence
zbMATH Open document ID: 1261.68095
author: Yusu Wang
author: Tamal K. Dey
published in: Discrete \& Computational Geometry
publication date: 2013-03-18T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 6146008
zbMATH Keywords: persistent Reeb graph homology
describes a project that uses: ShortLoop
MaRDI profile type: Publication
full work available at URL: s00454-012-9463-z
OpenAlex ID: W2151335375
cites work: Vietoris-rips complexes also provide topologically correct reconstructions of sampled shapes
cites work: Reeb graphs for shape analysis and applications
cites work: Zigzag persistence
cites work: Zigzag persistent homology and real-valued functions
cites work: Q4633915
cites work: Persistence-based clustering in riemannian manifolds
cites work: Towards persistence-based reconstruction in euclidean spaces
cites work: Extending persistence using Poincaré and Lefschetz duality
cites work: Q3601530
cites work: Loops in Reeb graphs of 2-manifolds
cites work: Curve and Surface Reconstruction
cites work: Cut locus and topology from surface point data
cites work: Approximating cycles in a shortest basis of the first homology group from point data
cites work: Efficient Output-Sensitive Construction of Reeb Graphs
cites work: Efficient algorithms for computing Reeb graphs
cites work: Q3514524
cites work: Time-varying Reeb graphs for continuous space-time data
cites work: Topological persistence and simplification
cites work: A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
cites work: Q4819371
cites work: Q4266107
cites work: Finding the homology of submanifolds with high confidence from random samples
DOI: 10.1007/S00454-012-9463-Z
Recommended article: Reeb graphs
Recommended article: Reconstructing embedded graphs from persistence diagrams
Recommended article: Q5376196
Recommended article: Persistent graphs and cyclic polytope triangulations
Recommended article: Rigidity and reconstruction for graphs
Recommended article: Efficient algorithms for computing Reeb graphs
Recommended article: Q3728936
Recommended article: Steady and ranging sets in graph persistence
Recommended article: A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
Recommended article: Approximation and decomposition by extremal graphs
description: scientific article; zbMATH DE number 6146008