{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T16:05:39Z","timestamp":1772553939804,"version":"3.50.1"},"reference-count":69,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"BPI","award":["P112017-2661376\/DOS0021427"],"award-info":[{"award-number":["P112017-2661376\/DOS0021427"]}]},{"DOI":"10.13039\/501100003032","name":"ANRT","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003032","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Kitware SAS CIFRE","award":["#2015\/1039"],"award-info":[{"award-number":["#2015\/1039"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2019,8,1]]},"DOI":"10.1109\/tpds.2019.2898436","type":"journal-article","created":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T01:05:26Z","timestamp":1549674326000},"page":"1889-1905","source":"Crossref","is-referenced-by-count":35,"title":["Task-Based Augmented Contour Trees with Fibonacci Heaps"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6288-4540","authenticated-orcid":false,"given":"Charles","family":"Gueunet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3117-9122","authenticated-orcid":false,"given":"Pierre","family":"Fortin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Jomier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0056-2831","authenticated-orcid":false,"given":"Julien","family":"Tierny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2012.03.019"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2011.249"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141993"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2346332"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2008.01190.x"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383282"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12361"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.186"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.2312\/egsh.20171014"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2011.270"},{"key":"ref60","first-page":"89","article-title":"Distributed contour trees","author":"morozov","year":"2013","journal-title":"Proc Topological Methods Data Anal Vis"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/LDAV.2017.8231846"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.88"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/77635.77639"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/PacificVis.2018.00015"},{"key":"ref64","doi-asserted-by":"crossref","DOI":"10.1515\/9781400881802","author":"milnor","year":"1963","journal-title":"Morse Theory"},{"key":"ref27","first-page":"452","article-title":"Multi-resolution computation and presentation of contour trees","author":"pascucci","year":"2004","journal-title":"Proc IASTED Vis Imag Image Process Conf"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/777792.777844"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-002-2885-2"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.47"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"ref68","article-title":"OpenMP application program interface, V 4.5","year":"2015"},{"key":"ref69","article-title":"Power of 10: Time scales in user experience","author":"nielsen","year":"2009"},{"key":"ref2","author":"pascucci","year":"2010","journal-title":"Topological Data Analysis and Visualization Theory Algorithms and Applications"},{"key":"ref1","author":"edelsbrunner","year":"2009","journal-title":"Computational Topology An Introduction"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2346434"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/262839.269238"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12596"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.16"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/VISUAL.2004.96"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.70601"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2012.228"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/LDAV.2016.7874312"},{"key":"ref51","article-title":"libtourtre: A contour tree library","author":"dillard","year":"2007"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2017.2743938"},{"key":"ref58","first-page":"32","article-title":"A hybrid solution to calculating augmented join trees of 2d scalar fields in parallel","author":"rosen","year":"2017","journal-title":"Proc Int Conf Comput -Aided Des"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/MCG.2016.48"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1970.11992523"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1052-3"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2004.05.002"},{"key":"ref53","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/LDAV.2016.7874333"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/276884.276892"},{"key":"ref11","first-page":"918","article-title":"Computing contour trees in all dimensions","author":"carr","year":"2000","journal-title":"Proc 11th ACM-SIAM Ann Symp Discret Algorithms"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.70603"},{"key":"ref12","first-page":"847","article-title":"Sur les points singuliers d'une forme de Pfaff complètement intégrable ou d'une fonction numérique","volume":"222","author":"reeb","year":"1946","journal-title":"Comptes Rendus de l Acad&#x00E9 mie des Sciences"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/38.90568"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276449"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.10.018"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2009.163"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2008.110"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.95"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12123"},{"key":"ref4","author":"tierny","year":"2018","journal-title":"Topological Data Analysis for Scientific Visualization"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12933"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442526"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2010.253"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1463822.1463869"},{"key":"ref7","article-title":"Triplet Merge Trees","author":"smirnov","year":"2017","journal-title":"TopoInVis"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/PACIFICVIS.2015.7156387"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009159"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2015.2452919"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1111\/j.1365-2966.2011.18395.x"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2012.6507496"},{"key":"ref47","article-title":"Using contour trees in the analysis and visualization of radio astronomy data cubes","author":"rosen","year":"2017","journal-title":"CoRR"},{"key":"ref42","article-title":"Visualizing ensembles of viscous fingers","author":"favelier","year":"2016","journal-title":"IEEE SciVis Contest"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2015.2467432"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2346403"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/AMM.869.9"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/8763865\/08637719.pdf?arnumber=8637719","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:42:39Z","timestamp":1657744959000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8637719\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,1]]},"references-count":69,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2019.2898436","relation":{},"ISSN":["1045-9219","1558-2183","2161-9883"],"issn-type":[{"value":"1045-9219","type":"print"},{"value":"1558-2183","type":"electronic"},{"value":"2161-9883","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,1]]}}}