{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T09:54:43Z","timestamp":1775814883687,"version":"3.50.1"},"reference-count":68,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","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:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Visual. Comput. Graphics"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/tvcg.2023.3326601","type":"journal-article","created":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T17:53:15Z","timestamp":1698256395000},"page":"1-11","source":"Crossref","is-referenced-by-count":5,"title":["Merge Tree Geodesics and Barycenters with Path Mappings"],"prefix":"10.1109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5526-7138","authenticated-orcid":false,"given":"Florian","family":"Wetzels","sequence":"first","affiliation":[{"name":"University of Kaiserslautern-Landau, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0037-0314","authenticated-orcid":false,"given":"Mathieu","family":"Pont","sequence":"additional","affiliation":[{"name":"CNRS / Sorbonne University, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0056-2831","authenticated-orcid":false,"given":"Julien","family":"Tierny","sequence":"additional","affiliation":[{"name":"CNRS / Sorbonne University, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1669-8549","authenticated-orcid":false,"given":"Christoph","family":"Garth","sequence":"additional","affiliation":[{"name":"University of Kaiserslautern-Landau, Germany"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/b978-012387582-2\/50038-1"},{"key":"ref2","article-title":"An edit distance for reeb graphs","volume-title":"9th Eurographics Workshop on 3D Object Retrieval, 3DOR@Eurographics 2016","author":"Bauer","year":"2016"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2582112.2582169"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04099-8_10"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2022.3209395"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2009.69"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2010.253"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-73301-2"},{"key":"ref9","first-page":"49","article-title":"Path seeds and flexible isosurfaces - using topology for exploratory visualization","volume-title":"5th Joint Eurographics - IEEE TCVG Symposium on Visualization, VisSym 2003","author":"Carr","year":"2003"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.07.021"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1542362.1542407"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-006-1276-5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-010-9060-6"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/069"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997872"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/sfcs.2000.892133"},{"key":"ref17","first-page":"147","article-title":"Using the triangle inequality to accelerate k-means","volume-title":"Machine Learning, Proceedings of the Twentieth International Conference (ICML 2003)","author":"Elkan","year":"2003"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-94893-1_10"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-016-9758-6"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2018.2864432"},{"key":"ref21","article-title":"Intrinsic interleaving distance for merge trees","volume":"1908.00063","author":"Gasparovic","year":"2019","journal-title":"CoRR"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12359"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12933"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383282"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/bf01908075"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2022.3209387"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.5220\/0002817201320139"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/tit.1982.1056489"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/vis49827.2021.9623286"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13985"},{"key":"ref31","volume-title":"Source Code for Fuzzy Contour Trees: Alignment and Joint Layout of Multiple Contour Trees","author":"Lohfink","year":"2021"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/amm.869.9"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2019.2934368"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13164"},{"key":"ref35","article-title":"Interleaving distance between merge trees","author":"Morozov","year":"2014","journal-title":"TopoInVis"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442526"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04099-8_6"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/pacificvis.2015.7156386"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/topoinvis57755.2022.00016"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44684-4_5"},{"key":"ref41","article-title":"Multi-resolution computation and presentation of contour trees","volume-title":"IASTED","author":"Pascucci","year":"2004"},{"key":"ref42","volume-title":"The IEEE SciVis Contest","author":"Patchett","year":"2018"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2021.3114839"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2022.3215001"},{"issue":"6","key":"ref45","article-title":"Free computational fluid dynamics","volume":"2","author":"Popinet","year":"2004","journal-title":"ClusterWorld"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12360"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13163"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2018.2883630"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/pacificvis.2016.7465251"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2018.2873612"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2021.3122176"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.gmod.2003.08.002"},{"key":"ref53","volume-title":"The IEEE SciVis Contest","author":"Taylor","year":"2008"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2011.236"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2013.148"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2017.2743938"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-014-9604-7"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2019.2934256"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2007.70601"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2010.198"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/topoinvis57755.2022.00010"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14547"},{"key":"ref63","volume-title":"Merge tree geodesics and barycenters with path mappings (supplementary source code)","author":"Wetzels","year":"2023"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/ldav.2012.6378962"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1615\/int.j.uncertaintyquantification.2012003956"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2022.3163349"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14331"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/tvcg.2019.2934242"}],"container-title":["IEEE Transactions on Visualization and Computer Graphics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/2945\/4359476\/10296528.pdf?arnumber=10296528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T01:52:22Z","timestamp":1705024342000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10296528\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":68,"URL":"https:\/\/doi.org\/10.1109\/tvcg.2023.3326601","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]]}}}