{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T20:59:13Z","timestamp":1778878753936,"version":"3.51.4"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research","award":["DE-SC-0019039"],"award-info":[{"award-number":["DE-SC-0019039"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Visual. Comput. Graphics"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1109\/tvcg.2022.3209395","type":"journal-article","created":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T19:33:13Z","timestamp":1664998393000},"page":"1168-1177","source":"Crossref","is-referenced-by-count":12,"title":["Computing a Stable Distance on Merge Trees"],"prefix":"10.1109","volume":"29","author":[{"given":"Brian","family":"Bollen","sequence":"first","affiliation":[{"name":"Department of Mathematics, The University of Arizona, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pasindu","family":"Tennakoon","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Arizona, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4302-1704","authenticated-orcid":false,"given":"Joshua A.","family":"Levine","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Arizona, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2011.236"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/322139.322143"},{"key":"ref33","article-title":"Sur les points singuliers d'une forme de Pfaff complètement integrable ou d'une fonction numérique","author":"reeb","year":"1946","journal-title":"Acad Sci"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276449"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/b106657_2"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2011.27"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2021.3122176"},{"key":"ref36","first-page":"1","author":"sridharamurthy","year":"2018","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13163"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12360"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1064092.1064133"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-008-9027-z"},{"key":"ref40","article-title":"The Topology ToolKit","author":"tierny","year":"2017","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-016-9763-9"},{"key":"ref13","author":"developers","year":"2013","journal-title":"Distances and represnetations of peristence diagrams (persim 0 3 1)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/mma.2533"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-016-9758-6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2012.287"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/777792.777846"},{"key":"ref18","author":"edelsbrunner","year":"2022","journal-title":"Computational Topology An Introduction"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-002-2885-2"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.186"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2582112.2582169"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383282"},{"key":"ref3","article-title":"An Edit Distance for Reeb Graphs","author":"bauer","year":"2016","journal-title":"Eurographics Workshop on 3D Object Retrieval"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04099-8_10"},{"key":"ref29","article-title":"Interleaving distance between merge trees","author":"morozov","year":"0","journal-title":"Proceedings of TopoInVis"},{"key":"ref5","article-title":"The Reeb graph edit distance is universal","volume":"12","author":"bauer","year":"2020","journal-title":"Foundations of Computational Mathematics"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2010.253"},{"key":"ref7","article-title":"Reeb graph metrics from the ground up","volume":"abs 2110 5631","author":"bollen","year":"2021","journal-title":"CoRR"},{"key":"ref2","first-page":"14:1","article-title":"Quasi-universality of reeb graph distances","volume":"224","author":"bauer","year":"2022","journal-title":"38th International Symposium on Computational Geometry"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3185466"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(02)00093-7"},{"key":"ref20","author":"garey","year":"1990","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687631"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2346403"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF02698687"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2008.110"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/PACIFICVIS.2017.8031584"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2009.163"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3072959.3073684"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12933"},{"key":"ref44","first-page":"1","article-title":"A structural average of labeled merge trees for uncertainty visualization","author":"yan","year":"2019","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.70603"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14331"}],"container-title":["IEEE Transactions on Visualization and Computer Graphics"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/2945\/9991003\/9912347-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/2945\/9991003\/09912347.pdf?arnumber=9912347","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T15:57:21Z","timestamp":1671638241000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9912347\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":45,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tvcg.2022.3209395","relation":{},"ISSN":["1077-2626","1941-0506","2160-9306"],"issn-type":[{"value":"1077-2626","type":"print"},{"value":"1941-0506","type":"electronic"},{"value":"2160-9306","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1]]}}}