Stable Shape Comparison of Surfaces via Reeb Graphs

  • Barbara Di Fabio
  • Claudia Landi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8668)

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.

Keywords

Shape similarity editing distance Morse function 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bauer, U., Ge, X., Wang, Y.: Measuring distance between Reeb graphs. No. arXiv:1307.2839v1 (2013)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Biasotti, S., Giorgi, D., Spagnuolo, M., Falcidieno, B.: Reeb graphs for shape analysis and applications. Theoretical Computer Science 392, 5–22 (2008)CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    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)CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    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)CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    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/
  8. 8.
    Donatini, P., Frosini, P.: Natural pseudodistances between closed manifolds. Forum Mathematicum 16(5), 695–715 (2004)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Gao, X., Xiao, B., Tao, D., Li, X.: A survey of graph edit distance. Pattern Anal. Appl. 13(1), 113–129 (2010)CrossRefMathSciNetGoogle Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    Kudryavtseva, E.A.: Reduction of Morse functions on surfaces to canonical form by smooth deformation. Regul. Chaotic Dyn. 4(3), 53–60 (1999)CrossRefMATHMathSciNetGoogle Scholar
  12. 12.
    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)CrossRefGoogle Scholar
  13. 13.
    Masumoto, Y., Saeki, O.: A smooth function on a manifold with given reeb graph. Kyushu J. Math. 65(1), 75–84 (2011)CrossRefMATHMathSciNetGoogle Scholar
  14. 14.
    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)Google Scholar
  15. 15.
    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)MATHMathSciNetGoogle Scholar
  16. 16.
    Shinagawa, Y., Kunii, T.L.: Constructing a Reeb Graph automatically from cross sections. IEEE Computer Graphics and Applications 11(6), 44–51 (1991)CrossRefGoogle Scholar
  17. 17.
    Shinagawa, Y., Kunii, T.L., Kergosien, Y.L.: Surface coding based on morse theory. IEEE Computer Graphics and Applications 11(5), 66–78 (1991)CrossRefGoogle Scholar
  18. 18.
    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)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Barbara Di Fabio
    • 1
    • 3
  • Claudia Landi
    • 2
    • 3
  1. 1.Dipartimento di MatematicaUniversità di BolognaItaly
  2. 2.DISMIUniversità di Modena e Reggio EmiliaItaly
  3. 3.ARCESUniversità di BolognaItaly

Personalised recommendations