Skip to main content
Top

2014 | OriginalPaper | Chapter

Measuring the Distance Between Merge Trees

Authors : Kenes Beketayev, Damir Yeliussizov, Dmitriy Morozov, Gunther H. Weber, Bernd Hamann

Published in: Topological Methods in Data Analysis and Visualization III

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

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).

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference 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)CrossRef 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)CrossRef
2.
go back to reference 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) 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)
3.
go back to reference 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)CrossRef 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)CrossRef
5.
go back to reference 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–458 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–458
6.
go back to reference 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–143CrossRef 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–143CrossRef
7.
8.
go back to reference 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–271 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–271
9.
go back to reference 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–370 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–370
10.
go back to reference H. Edelsbrunner, J. Harer, A. Zomorodian, Hierarchical Morse-Smale complexes for piecewise linear 2-manifold. Discret. Comput. Geom. 30, 87–107 (2003)CrossRefMATHMathSciNet H. Edelsbrunner, J. Harer, A. Zomorodian, Hierarchical Morse-Smale complexes for piecewise linear 2-manifold. Discret. Comput. Geom. 30, 87–107 (2003)CrossRefMATHMathSciNet
11.
go back to reference C. Flamm, I.L. Hofacker, P. Stadler, M. Wolfinger, Barrier trees of degenerate landscapes. Phys. Chem. 216, 155–173 (2002) C. Flamm, I.L. Hofacker, P. Stadler, M. Wolfinger, Barrier trees of degenerate landscapes. Phys. Chem. 216, 155–173 (2002)
12.
go back to reference 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)CrossRef 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)CrossRef
13.
go back to reference 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)CrossRef 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)CrossRef
14.
go back to reference 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–212 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–212
15.
go back to reference 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–769 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–769
16.
go back to reference J.W. Milnor, Morse Theory (Princeton University Press, Princeton, 1963)MATH J.W. Milnor, Morse Theory (Princeton University Press, Princeton, 1963)MATH
17.
go back to reference J.R. Munkres, Elements of Algebraic Topology (Addison-Wesley, Redwood City, 1984)MATH J.R. Munkres, Elements of Algebraic Topology (Addison-Wesley, Redwood City, 1984)MATH
18.
go back to reference 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)CrossRef 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)CrossRef
19.
go back to reference V. Pascucci, K. Cole-McLaughlin, G. Scorzelli, Multi-resolution computation and presentation of contour trees. Technical report UCRL-PROC-208680, LLNL, 2005 V. Pascucci, K. Cole-McLaughlin, G. Scorzelli, Multi-resolution computation and presentation of contour trees. Technical report UCRL-PROC-208680, LLNL, 2005
20.
go back to reference 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)CrossRef 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)CrossRef
21.
go back to reference 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)MATHMathSciNet 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)MATHMathSciNet
22.
go back to reference D.M. Thomas, V. Natarajan, Symmetry in scalar field topology. IEEE Trans. Vis. Comput. Graph. 17(12), 2035–2044 (2011)CrossRef D.M. Thomas, V. Natarajan, Symmetry in scalar field topology. IEEE Trans. Vis. Comput. Graph. 17(12), 2035–2044 (2011)CrossRef
23.
go back to reference 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)CrossRef 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)CrossRef
Metadata
Title
Measuring the Distance Between Merge Trees
Authors
Kenes Beketayev
Damir Yeliussizov
Dmitriy Morozov
Gunther H. Weber
Bernd Hamann
Copyright Year
2014
DOI
https://doi.org/10.1007/978-3-319-04099-8_10

Premium Partner