{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:32:59Z","timestamp":1772022779889,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030337193","type":"print"},{"value":"9783030337209","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-33720-9_8","type":"book-chapter","created":{"date-parts":[[2019,12,18]],"date-time":"2019-12-18T10:48:15Z","timestamp":1576666095000},"page":"99-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Propagate and Pair: A Single-Pass Approach to Critical Point Pairing in Reeb Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7026-7454","authenticated-orcid":false,"given":"Junyi","family":"Tu","sequence":"first","affiliation":[]},{"given":"Mustafa","family":"Hajij","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0873-9518","authenticated-orcid":false,"given":"Paul","family":"Rosen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,21]]},"reference":[{"issue":"4","key":"8_CR1","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/s00454-006-1265-8","volume":"36","author":"PK Agarwal","year":"2006","unstructured":"Agarwal, P.K., Edelsbrunner, H., Harer, J., Wang, Y.: Extreme elevation on a 2-manifold. Discrete Comput. Geom. 36(4), 553\u2013572 (2006)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"8_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s00371-002-0182-y","volume":"19","author":"M Attene","year":"2003","unstructured":"Attene, M., Biasotti, S., Spagnuolo, M.: Shape understanding by contour-driven retiling. Vis. Comput. 19(2), 127\u2013138 (2003)","journal-title":"Vis. Comput."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bajaj, C.L., Pascucci, V., Schikore, D.R.: The contour spectrum. In: Proceedings of the 8th IEEE Visualization, p. 167-ff (1997)","DOI":"10.1109\/VISUAL.1997.663875"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Bauer, U., Ge, X., Wang, Y.: Measuring distance between Reeb graphs. In: Symposium on Computational Geometry, p. 464 (2014)","DOI":"10.1145\/2582112.2582169"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Boyell, R.L., Ruston, H.: Hybrid techniques for real-time radar simulation. In: Proceedings of the November 12\u201314, Fall Joint Computer Conference, pp. 445\u2013458 (1963)","DOI":"10.1145\/1463822.1463869"},{"issue":"2","key":"8_CR6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0925-7721(02)00093-7","volume":"24","author":"H Carr","year":"2003","unstructured":"Carr, H., Snoeyink, J., Axen, U.: Computing contour trees in all dimensions. Comput. Geom. Theory Appl. 24(2), 75\u201394 (2003)","journal-title":"Comput. Geom. Theory Appl."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Carr, H., Snoeyink, J., van de Panne, M.: Simplifying flexible isosurfaces using local geometric measures. In: Proceedings of the 15th IEEE Visualization, pp. 497\u2013504 (2004)","DOI":"10.1109\/VISUAL.2004.96"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Cole-McLaughlin, K., Edelsbrunner, H., Harer, J., Natarajan, V., Pascucci, V.: Loops in Reeb graphs of 2-manifolds. In: Symposium on Computational Geometry, pp. 344\u2013350 (2003)","DOI":"10.1145\/777792.777844"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-540-92182-0_50","volume-title":"Algorithms and Computation","author":"H Doraiswamy","year":"2008","unstructured":"Doraiswamy, H., Natarajan, V.: Efficient output-sensitive construction of Reeb graphs. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 556\u2013567. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92182-0_50"},{"issue":"6","key":"8_CR10","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1016\/j.comgeo.2008.12.003","volume":"42","author":"H Doraiswamy","year":"2009","unstructured":"Doraiswamy, H., Natarajan, V.: Efficient algorithms for computing Reeb graphs. Comput. Geom. 42(6), 606\u2013616 (2009)","journal-title":"Comput. Geom."},{"issue":"2","key":"8_CR11","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1109\/TVCG.2012.115","volume":"19","author":"H Doraiswamy","year":"2013","unstructured":"Doraiswamy, H., Natarajan, V.: Computing Reeb graphs as a union of contour trees. IEEE Trans. Visual Comput. Graphics 19(2), 249\u2013262 (2013)","journal-title":"IEEE Trans. Visual Comput. Graphics"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H., Harer, J., Mascarenhas, A., Pascucci, V.: Time-varying Reeb graphs for continuous space-time data. In: Symposium on Computational Geometry, pp. 366\u2013372 (2004)","DOI":"10.1145\/997817.997872"},{"key":"8_CR13","unstructured":"Edelsbrunner, H., Letscher, D., Zomorodian, A.: Topological persistence and simplification. In: Symposium on Foundations of Computer Science, pp. 454\u2013463 (2000)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Harvey, W., Wang, Y., Wenger, R.: A randomized O (m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes. In: Symposium on Computational Geometry, pp. 267\u2013276 (2010)","DOI":"10.1145\/1810959.1811005"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Hilaga, M., Shinagawa, Y.: Topology matching for fully automatic similarity estimation of 3D shapes. In: SIGGRAPH, pp. 203\u2013212 (2001)","DOI":"10.1145\/383259.383282"},{"issue":"2","key":"8_CR16","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1006\/ciun.1994.1011","volume":"59","author":"IS Kweon","year":"1994","unstructured":"Kweon, I.S., Kanade, T.: Extracting topographic terrain features from elevation maps. CVGIP Image Underst. 59(2), 171\u2013182 (1994)","journal-title":"CVGIP Image Underst."},{"issue":"2","key":"8_CR17","doi-asserted-by":"crossref","first-page":"47","DOI":"10.18608\/jla.2017.42.6","volume":"4","author":"E Munch","year":"2017","unstructured":"Munch, E.: A user\u2019s guide to topological data analysis. J. Learn. Analytics 4(2), 47\u201361 (2017)","journal-title":"J. Learn. Analytics"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Parsa, S.: A deterministic $$O(m \\log m)$$ time algorithm for the Reeb graph. In: ACM Symposium on Computational Geometry (SoCG), pp. 269\u2013276 (2012)","DOI":"10.1145\/2261250.2261289"},{"key":"8_CR19","unstructured":"Pascucci, V., Cole-McLaughlin, K., Scorzelli, G.: Multi-resolution computation and presentation of contour trees. In: IASTED Conference on Visualization, Imaging, and Image Processing, pp. 452\u2013290 (2004)"},{"issue":"3","key":"8_CR20","doi-asserted-by":"crossref","first-page":"58.1","DOI":"10.1145\/1276377.1276449","volume":"26","author":"V Pascucci","year":"2007","unstructured":"Pascucci, V., Scorzelli, G., Bremer, P.T., Mascarenhas, A.: Robust on-line computation of Reeb graphs: simplicity and speed. ACM Trans. Graph. 26(3), 58.1\u201358.9 (2007)","journal-title":"ACM Trans. Graph."},{"key":"8_CR21","first-page":"847","volume":"222","author":"G Reeb","year":"1946","unstructured":"Reeb, G.: Sur les points singuliers dune forme de pfaff completement intgrable ou dune fonction numrique. CR Acad. Sci. Paris 222, 847\u2013849 (1946)","journal-title":"CR Acad. Sci. Paris"},{"key":"8_CR22","unstructured":"Rosen, P., et al.: Using contour trees in the analysis and visualization of radio astronomy data cubes. In: TopoInVis (2019)"},{"key":"8_CR23","unstructured":"Singh, G., M\u00e9moli, F., Carlsson, G.E.: Topological methods for the analysis of high dimensional data sets and 3D object recognition. In: Eurographics SPBG, pp. 91\u2013100 (2007)"},{"issue":"1","key":"8_CR24","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.gmod.2003.08.002","volume":"66","author":"S Takahashi","year":"2004","unstructured":"Takahashi, S., Takeshima, Y., Fujishiro, I.: Topological volume skeletonization and its application to transfer function design. Graph. Models 66(1), 24\u201349 (2004)","journal-title":"Graph. Models"},{"issue":"1","key":"8_CR25","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1111\/j.1467-8659.2008.01190.x","volume":"28","author":"J Tierny","year":"2009","unstructured":"Tierny, J., Vandeborre, J.P., Daoudi, M.: Partial 3D shape retrieval by Reeb pattern unfolding. Comput. Graphics Forum 28(1), 41\u201355 (2009)","journal-title":"Comput. Graphics Forum"}],"container-title":["Lecture Notes in Computer Science","Advances in Visual Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33720-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T18:47:13Z","timestamp":1743878833000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-33720-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030337193","9783030337209"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33720-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISVC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Visual Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lake Tahoe, NV","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isvc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.isvc.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"163","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"91","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}