{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T23:37:25Z","timestamp":1729640245518,"version":"3.28.0"},"reference-count":34,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1109\/pacificvis.2013.6596141","type":"proceedings-article","created":{"date-parts":[[2013,9,19]],"date-time":"2013-09-19T15:57:09Z","timestamp":1379606229000},"page":"161-168","source":"Crossref","is-referenced-by-count":15,"title":["Joint Contour Nets: Computation and properties"],"prefix":"10.1109","author":[{"given":"Hamish","family":"Carr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Duke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1145\/1810959.1811005","article-title":"A Randomized O(m log m) Algorithm for Computing Reeb Graphs of Arbitrary Simplicial Complexes","author":"harvey","year":"2010","journal-title":"ACM Symposium on Computational Geometry"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1006\/aima.1997.1650"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01706.x"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.47"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/378583.378626"},{"journal-title":"Fast Matching of Volumetric Functions Using Multi-resolution Dual Contour Trees","year":"2004","author":"zhang","key":"34"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/77635.77639"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2007.11.001"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/1377676.1377720"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61568-9"},{"key":"12","first-page":"37","article-title":"Jacobi Sets of Multiple Morse Functions","author":"edelsbrunner","year":"2002","journal-title":"Foundations of Computational Mathematics"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383282"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/2.35200"},{"key":"22","first-page":"91","article-title":"Simplification of Jacobi Sets","author":"nagaraj","year":"2011","journal-title":"Topological Data Analysis and Visualization Theory Algorithms and Applications Mathematics and Visualization"},{"key":"23","first-page":"269","article-title":"A Deterministic O(m log m) Time Algorithm for the Reeb Graph","author":"parsa","year":"2012","journal-title":"ACM Symposium on Computational Geometry"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1052-3"},{"key":"25","doi-asserted-by":"crossref","DOI":"10.1145\/1276377.1276449","article-title":"Robust On-line Computation of Reeb Graphs: Simplicity and Speed","volume":"26","author":"pascucci","year":"2007","journal-title":"ACM Transactions on Graphics"},{"key":"26","first-page":"847","article-title":"Sur les points singuliers d'une forme de Pfaff comple?tement inte?grable ou d'une fonction nume?rique","volume":"222","author":"reeb","year":"1946","journal-title":"Comptes Rendus de L'Acade?mie des Sciences de Paris"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2008.143"},{"journal-title":"The Visualization Toolkit An Object-Oriented Approach to 3D Graphics","year":"2006","author":"schroeder","key":"28"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321884"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88606-8_5"},{"key":"2","first-page":"72","article-title":"Computing Multidimensional Persistence","volume":"1","author":"carlsson","year":"2010","journal-title":"Computational Geometry"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2012.287"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1463822.1463869"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2009.163"},{"key":"7","article-title":"Computing reeb graphs as a union of contour trees","author":"doraiswamy","year":"2012","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2004.05.002"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.70601"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2006.05.009"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1145\/262839.269238"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(02)00093-7"},{"key":"9","article-title":"Integrating Histograms and Isosurface Statistics","author":"duffy","year":"2012","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"8","first-page":"151","article-title":"Interval based data structure optimisation","author":"duffy","year":"2010","journal-title":"Proceedings Theory and Practice of Computer Graphics 2010"}],"event":{"name":"2013 IEEE Pacific Visualization Symposium (PacificVis)","start":{"date-parts":[[2013,2,27]]},"location":"Sydney, Australia","end":{"date-parts":[[2013,3,1]]}},"container-title":["2013 IEEE Pacific Visualization Symposium (PacificVis)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6588673\/6596110\/06596141.pdf?arnumber=6596141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T00:04:16Z","timestamp":1715990656000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6596141\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/pacificvis.2013.6596141","relation":{},"subject":[],"published":{"date-parts":[[2013,2]]}}}