{"_id":"2156","doi":"10.1145/2582112.2582169","conference":{"location":"Kyoto, Japan","name":"SoCG: Symposium on Computational Geometry","start_date":"2014-06-08","end_date":"2014-06-11"},"author":[{"full_name":"Bauer, Ulrich","first_name":"Ulrich","orcid":"0000-0002-9683-0724","last_name":"Bauer","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ge, Xiaoyin","first_name":"Xiaoyin","last_name":"Ge"},{"last_name":"Wang","full_name":"Wang, Yusu","first_name":"Yusu"}],"abstract":[{"text":"We propose a metric for Reeb graphs, called the functional distortion distance. Under this distance, the Reeb graph is stable against small changes of input functions. At the same time, it remains discriminative at differentiating input functions. In particular, the main result is that the functional distortion distance between two Reeb graphs is bounded from below by the bottleneck distance between both the ordinary and extended persistence diagrams for appropriate dimensions. As an application of our results, we analyze a natural simplification scheme for Reeb graphs, and show that persistent features in Reeb graph remains persistent under simplification. Understanding the stability of important features of the Reeb graph under simplification is an interesting problem on its own right, and critical to the practical usage of Reeb graphs. Copyright is held by the owner/author(s).","lang":"eng"}],"publication":"Proceedings of the Annual Symposium on Computational Geometry","publication_status":"published","type":"conference","date_updated":"2021-01-12T06:55:39Z","project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493","name":"Topological Complex Systems","call_identifier":"FP7"}],"status":"public","page":"464 - 473","oa":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HeEd"}],"acknowledgement":"National Science Foundation under grants CCF-1319406, CCF-1116258.","month":"06","date_created":"2018-12-11T11:56:02Z","citation":{"mla":"Bauer, Ulrich, et al. “Measuring Distance between Reeb Graphs.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 464–73, doi:<a href=\"https://doi.org/10.1145/2582112.2582169\">10.1145/2582112.2582169</a>.","ama":"Bauer U, Ge X, Wang Y. Measuring distance between Reeb graphs. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:464-473. doi:<a href=\"https://doi.org/10.1145/2582112.2582169\">10.1145/2582112.2582169</a>","short":"U. Bauer, X. Ge, Y. Wang, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–473.","ieee":"U. Bauer, X. Ge, and Y. Wang, “Measuring distance between Reeb graphs,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 464–473.","ista":"Bauer U, Ge X, Wang Y. 2014. Measuring distance between Reeb graphs. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 464–473.","chicago":"Bauer, Ulrich, Xiaoyin Ge, and Yusu Wang. “Measuring Distance between Reeb Graphs.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 464–73. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582169\">https://doi.org/10.1145/2582112.2582169</a>.","apa":"Bauer, U., Ge, X., &#38; Wang, Y. (2014). Measuring distance between Reeb graphs. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 464–473). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582169\">https://doi.org/10.1145/2582112.2582169</a>"},"scopus_import":1,"quality_controlled":"1","title":"Measuring distance between Reeb graphs","main_file_link":[{"url":"http://arxiv.org/abs/1307.2839","open_access":"1"}],"oa_version":"Submitted Version","publist_id":"4850","language":[{"iso":"eng"}],"day":"01","publisher":"ACM","year":"2014","ec_funded":1,"date_published":"2014-06-01T00:00:00Z"}