Title
An edit distance for Reeb graphs
Abstract
We consider the problem of assessing the similarity of 3D shapes using Reeb graphs from the standpoint of robustness under perturbations. For this purpose, 3D objects are viewed as spaces endowed with real-valued functions, while the similarity between the resulting Reeb graphs is addressed through a graph edit distance. The cases of smooth functions on manifolds and piecewise linear functions on polyhedra stand out as the most interesting ones. The main contribution of this paper is the introduction of a general edit distance suitable for comparing Reeb graphs in these settings. This edit distance promises to be useful for applications in 3D object retrieval because of its stability properties in the presence of noise.
Year
DOI
Venue
2016
10.2312/3dor.20161084
3DOR
Field
DocType
ISBN
Edit distance,Graph,Combinatorics,3d shapes,Polyhedron,Robustness (computer science),Piecewise linear function,Manifold,Mathematics,Graph edit distance
Conference
978-3-03868-004-8
Citations 
PageRank 
References 
0
0.34
0
Authors
3
Name
Order
Citations
PageRank
Ulrich Bauer110210.84
B. Di Fabio200.34
Claudia Landi316116.18