Measuring the Distance Between Merge Trees

  • Kenes BeketayevEmail author
  • Damir Yeliussizov
  • Dmitriy Morozov
  • Gunther H. Weber
  • Bernd Hamann
Conference paper
Part of the Mathematics and Visualization book series (MATHVISUAL)


Merge trees represent the topology of scalar functions. To assess the topological similarity of functions, one can compare their merge trees. To do so, one needs a notion of a distance between merge trees, which we define. We provide examples of using our merge tree distance and compare this new measure to other ways used to characterize topological similarity (bottleneck distance for persistence diagrams) and numerical difference (L -norm of the difference between functions).


Edit Distance Root Branch Naive Algorithm Reeb Graph Persistent Homology 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



The authors thank Aidos Abzhanov. This work was supported by the Director, Office of Advanced Scientific Computing Research, Office of Science, of the U.S. DOE under Contract No. DE-AC02-05CH11231 (Berkeley Lab), and the Program 055 of the Ministry of Edu. and Sci. of the Rep. of Kazakhstan under the contract with the CER, Nazarbayev University.


  1. 1.
    E.W. Bethel, M. Howison, Multi-core and many-core shared-memory parallel raycasting volume rendering optimization and tuning. Int. J. High Perform. Comput. Appl. 26, 399–412 (2012)CrossRefGoogle Scholar
  2. 2.
    S. Biasotti, L. De Floriani, B. Falcidieno, P. Frosini, D. Giorgi, C. Landi, L. Papaleo, M. Spagnuolo, Describing shapes by geometrical-topological properties of real functions. ACM Comput. Surv. 40, 12:1–12:87 (2008)Google Scholar
  3. 3.
    S. Biasotti, M. Marini, M. Spagnuolo, B. Falcidieno, Sub-part correspondence by structural descriptors of 3D shapes. Comput. Aided Des. 38(9), 1002–1019 (2006)CrossRefGoogle Scholar
  4. 4.
    P. Bille, A survey on tree edit distance and related problems. J. Theor. Comput. Sci. 337, 217–239 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    R.L. Boyell, H. Ruston, Hybrid techniques for real-time radar simulation, in Proceedings of the Fall Joint Computer Conference, Las Vegas (IEEE, 1963), pp. 445–458Google Scholar
  6. 6.
    H. Bunke, K. Riesen, Graph edit distance: optimal and suboptimal algorithms with applications, in Analysis of Complex Networks: From Biology to Linguistics, ed. by M. Dehmer, F. Emmert-Streib (Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim, 2009), pp. 113–143CrossRefGoogle Scholar
  7. 7.
    H. Carr, J. Snoeyink, U. Axen, Computing contour trees in all dimensions. Comput. Geom. Theory Appl. 24(2), 75–94 (2003)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    D. Cohen-Steiner, H. Edelsbrunner, J. Harer, Stability of persistence diagrams, in Proceedings of 21st Annual Symposium on Computational Geometry, Pisa (ACM, 2005), pp. 263–271Google Scholar
  9. 9.
    H. Edelsbrunner, J. Harer, V. Natarajan, V. Pascucci, Morse-Smale complexes for piecewise linear 3-manifolds, in Proceedings of the 19th Symposium on Computational Geometry, San Diego, 2003, pp. 361–370Google Scholar
  10. 10.
    H. Edelsbrunner, J. Harer, A. Zomorodian, Hierarchical Morse-Smale complexes for piecewise linear 2-manifold. Discret. Comput. Geom. 30, 87–107 (2003)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    C. Flamm, I.L. Hofacker, P. Stadler, M. Wolfinger, Barrier trees of degenerate landscapes. Phys. Chem. 216, 155–173 (2002)Google Scholar
  12. 12.
    S. Gerber, P.T. Bremer, V. Pascucci, R. Whitaker, Visual exploration of high dimensional scalar functions. IEEE Trans. Vis. Comput. Graph. 16(6), 1271–1280 (2010)CrossRefGoogle Scholar
  13. 13.
    C. Heine, G. Scheuermann, C. Flamm, I.L. Hofacker, P.F. Stadler, Visualization of barrier tree sequences. IEEE Trans. Vis. Comput. Graph. 12(5), 781–788 (2006)CrossRefGoogle Scholar
  14. 14.
    M. Hilaga, Y. Shinagawa, T. Kohmura, T.L. Kunii, Topology matching for fully automatic similarity estimation of 3D shapes, in SIGGRAPH’01, Los Angeles (ACM, 2001), pp. 203–212Google Scholar
  15. 15.
    T. Jiang, E. Lawler, L. Wang, Aligning sequences via an evolutionary tree: complexity and approximation, in Symposium on Theory of Computing, Montréal, 1994, pp. 760–769Google Scholar
  16. 16.
    J.W. Milnor, Morse Theory (Princeton University Press, Princeton, 1963)zbMATHGoogle Scholar
  17. 17.
    J.R. Munkres, Elements of Algebraic Topology (Addison-Wesley, Redwood City, 1984)zbMATHGoogle Scholar
  18. 18.
    P. Oesterling, C. Heine, H. Janicke, G. Scheuermann, G. Heyer, Visualization of high-dimensional point clouds using their density distribution’s topology. IEEE Trans. Vis. Comput. Graph. 17, 1547–1559 (2011)CrossRefGoogle Scholar
  19. 19.
    V. Pascucci, K. Cole-McLaughlin, G. Scorzelli, Multi-resolution computation and presentation of contour trees. Technical report UCRL-PROC-208680, LLNL, 2005Google Scholar
  20. 20.
    V. Pascucci, G. Scorzelli, P.T. Bremer, A. Mascarenhas, Robust on-line computation of Reeb graphs: simplicity and speed. ACM Trans. Graph. 26(3), 58.1–58.9 (2007)CrossRefGoogle Scholar
  21. 21.
    G. Reeb, Sur les points singuliers d’une forme de pfaff complement intergrable ou d’une fonction numerique. C. R. Acad. Sci. Paris 222, 847–849 (1946)zbMATHMathSciNetGoogle Scholar
  22. 22.
    D.M. Thomas, V. Natarajan, Symmetry in scalar field topology. IEEE Trans. Vis. Comput. Graph. 17(12), 2035–2044 (2011)CrossRefGoogle Scholar
  23. 23.
    G.H. Weber, P.T. Bremer, V. Pascucci, Topological landscapes: a terrain metaphor for scientific data. IEEE Trans. Vis. Comput. Graph. 13(6), 1416–1423 (2007)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Kenes Beketayev
    • 1
    • 2
    Email author
  • Damir Yeliussizov
    • 3
  • Dmitriy Morozov
    • 1
  • Gunther H. Weber
    • 1
    • 4
  • Bernd Hamann
    • 4
  1. 1.Lawrence Berkeley National LaboratoryBerkeleyUSA
  2. 2.Nazarbayev UniversityAstanaKazakhstan
  3. 3.Kazakh-British Technical UniversityAlmatyKazakhstan
  4. 4.Department of Computer Science, Institute for Data Analysis and Visualization (IDAV)University of CaliforniaDavisUSA

Personalised recommendations