Abstract
Reeb graphs are combinatorial signatures that capture shape properties from the perspective of a chosen function. One of the most important questions is whether Reeb graphs are robust against function perturbations that may occur because of noise and approximation errors in the data acquisition process. In this work we tackle the problem of stability by providing an editing distance between Reeb graphs of orientable surfaces in terms of the cost necessary to transform one graph into another by edit operations. Our main result is that the editing distance between two Reeb graphs is upper bounded by the extent of the difference of the associated functions, measured by the maximum norm. This yields the stability property under function perturbations.
Chapter PDF
Similar content being viewed by others
References
Bauer, U., Ge, X., Wang, Y.: Measuring distance between Reeb graphs. No. arXiv:1307.2839v1 (2013)
Beketayev, K., Yeliussizov, D., Morozov, D., Weber, G.H., Hamann, B.: Measuring the distance between merge trees. In: Topological Methods in Data Analysis and Visualization V (TopoInVis 2013) (2013)
Biasotti, S., Giorgi, D., Spagnuolo, M., Falcidieno, B.: Reeb graphs for shape analysis and applications. Theoretical Computer Science 392, 5–22 (2008)
Biasotti, S., Marini, S., Spagnuolo, M., Falcidieno, B.: Sub-part correspondence by structural descriptors of 3D shapes. Computer-Aided Design 38(9), 1002–1019 (2006)
Cerf, J.: La stratification naturelle des espaces de fonctions différentiables réelles et le théorème de la pseudo-isotopie. Inst. Hautes Études Sci. Publ. Math. 39, 5–173 (1970)
Di Fabio, B., Landi, C.: Reeb graphs of curves are stable under function perturbations. Mathematical Methods in the Applied Sciences 35(12), 1456–1471 (2012)
Di Fabio, B., Landi, C.: Reeb graphs of surfaces are stable under function perturbations. Tech. Rep. 3956, Università di Bologna (February 2014), http://amsacta.cib.unibo.it/3956/
Donatini, P., Frosini, P.: Natural pseudodistances between closed manifolds. Forum Mathematicum 16(5), 695–715 (2004)
Gao, X., Xiao, B., Tao, D., Li, X.: A survey of graph edit distance. Pattern Anal. Appl. 13(1), 113–129 (2010)
Hilaga, M., Shinagawa, Y., Kohmura, T., Kunii, T.L.: Topology matching for fully automatic similarity estimation of 3D shapes. In: ACM Computer Graphics (Proc. SIGGRAPH 2001), pp. 203–212. ACM Press, Los Angeles (2001)
Kudryavtseva, E.A.: Reduction of Morse functions on surfaces to canonical form by smooth deformation. Regul. Chaotic Dyn. 4(3), 53–60 (1999)
Ling, H., Okada, K.: An efficient earth mover’s distance algorithm for robust histogram comparison. IEEE Transactions on Pattern Analysis and Machine Intelligence 29, 840–853 (2007)
Masumoto, Y., Saeki, O.: A smooth function on a manifold with given reeb graph. Kyushu J. Math. 65(1), 75–84 (2011)
Ohbuchi, R., Takei, T.: Shape-similarity comparison of 3D models using alpha shapes. In: 11th Pacific Conference on Computer Graphics and Applications, pp. 293–302 (2003)
Reeb, G.: Sur les points singuliers d’une forme de Pfaff complétement intégrable ou d’une fonction numérique. Comptes Rendus de L’Académie ses Sciences 222, 847–849 (1946)
Shinagawa, Y., Kunii, T.L.: Constructing a Reeb Graph automatically from cross sections. IEEE Computer Graphics and Applications 11(6), 44–51 (1991)
Shinagawa, Y., Kunii, T.L., Kergosien, Y.L.: Surface coding based on morse theory. IEEE Computer Graphics and Applications 11(5), 66–78 (1991)
Wu, H.Y., Zha, H., Luo, T., Wang, X.L., Ma, S.: Global and local isometry-invariant descriptor for 3D shape comparison and partial matching. In: 2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 438–445 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Di Fabio, B., Landi, C. (2014). Stable Shape Comparison of Surfaces via Reeb Graphs. In: Barcucci, E., Frosini, A., Rinaldi, S. (eds) Discrete Geometry for Computer Imagery. DGCI 2014. Lecture Notes in Computer Science, vol 8668. Springer, Cham. https://doi.org/10.1007/978-3-319-09955-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-09955-2_17
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09954-5
Online ISBN: 978-3-319-09955-2
eBook Packages: Computer ScienceComputer Science (R0)