[{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","type":"journal_article","date_updated":"2023-08-22T09:05:04Z","oa_version":"None","day":"01","doi":"10.1007/s00454-020-00237-5","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"date_published":"2020-10-01T00:00:00Z","external_id":{"isi":["000561483500001"]},"page":"571-574","publication_identifier":{"eissn":["14320444"],"issn":["01795376"]},"scopus_import":"1","citation":{"apa":"Pach, J. (2020). A farewell to Ricky Pollack. <i>Discrete and Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-020-00237-5\">https://doi.org/10.1007/s00454-020-00237-5</a>","mla":"Pach, János. “A Farewell to Ricky Pollack.” <i>Discrete and Computational Geometry</i>, vol. 64, Springer Nature, 2020, pp. 571–74, doi:<a href=\"https://doi.org/10.1007/s00454-020-00237-5\">10.1007/s00454-020-00237-5</a>.","ista":"Pach J. 2020. A farewell to Ricky Pollack. Discrete and Computational Geometry. 64, 571–574.","short":"J. Pach, Discrete and Computational Geometry 64 (2020) 571–574.","chicago":"Pach, János. “A Farewell to Ricky Pollack.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s00454-020-00237-5\">https://doi.org/10.1007/s00454-020-00237-5</a>.","ieee":"J. Pach, “A farewell to Ricky Pollack,” <i>Discrete and Computational Geometry</i>, vol. 64. Springer Nature, pp. 571–574, 2020.","ama":"Pach J. A farewell to Ricky Pollack. <i>Discrete and Computational Geometry</i>. 2020;64:571-574. doi:<a href=\"https://doi.org/10.1007/s00454-020-00237-5\">10.1007/s00454-020-00237-5</a>"},"main_file_link":[{"url":"https://doi.org/10.1007/s00454-020-00237-5","open_access":"1"}],"author":[{"last_name":"Pach","first_name":"János","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","full_name":"Pach, János"}],"year":"2020","publication":"Discrete and Computational Geometry","title":"A farewell to Ricky Pollack","oa":1,"_id":"8323","publication_status":"published","volume":64,"article_type":"letter_note","publisher":"Springer Nature","intvolume":"        64","isi":1,"date_created":"2020-08-30T22:01:12Z","month":"10","status":"public"},{"oa_version":"Preprint","type":"journal_article","date_updated":"2021-12-02T15:10:17Z","day":"09","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","acknowledgement":" This paper would not be written if not for Dan Reznik’s curiosity and persistence; we are very grateful to him. We also thank R. Garcia and J. Koiller for interesting discussions. It is a pleasure to thank the Mathematical Institute of the University of Heidelberg for its stimulating atmosphere. ST thanks M. Bialy for interesting discussions and the Tel Aviv\r\nUniversity for its invariable hospitality. AA was supported by European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 78818 Alpha). RS is supported by NSF Grant DMS-1807320. ST was supported by NSF grant DMS-1510055 and SFB/TRR 191.","ec_funded":1,"department":[{"_id":"HeEd"}],"doi":"10.1007/s40879-020-00426-9","language":[{"iso":"eng"}],"external_id":{"arxiv":["2001.02934"]},"date_published":"2020-09-09T00:00:00Z","arxiv":1,"scopus_import":"1","publication_identifier":{"issn":["2199-675X"],"eissn":["2199-6768"]},"year":"2020","citation":{"mla":"Akopyan, Arseniy, et al. “Billiards in Ellipses Revisited.” <i>European Journal of Mathematics</i>, Springer Nature, 2020, doi:<a href=\"https://doi.org/10.1007/s40879-020-00426-9\">10.1007/s40879-020-00426-9</a>.","apa":"Akopyan, A., Schwartz, R., &#38; Tabachnikov, S. (2020). Billiards in ellipses revisited. <i>European Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s40879-020-00426-9\">https://doi.org/10.1007/s40879-020-00426-9</a>","short":"A. Akopyan, R. Schwartz, S. Tabachnikov, European Journal of Mathematics (2020).","chicago":"Akopyan, Arseniy, Richard Schwartz, and Serge Tabachnikov. “Billiards in Ellipses Revisited.” <i>European Journal of Mathematics</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s40879-020-00426-9\">https://doi.org/10.1007/s40879-020-00426-9</a>.","ista":"Akopyan A, Schwartz R, Tabachnikov S. 2020. Billiards in ellipses revisited. European Journal of Mathematics.","ama":"Akopyan A, Schwartz R, Tabachnikov S. Billiards in ellipses revisited. <i>European Journal of Mathematics</i>. 2020. doi:<a href=\"https://doi.org/10.1007/s40879-020-00426-9\">10.1007/s40879-020-00426-9</a>","ieee":"A. Akopyan, R. Schwartz, and S. Tabachnikov, “Billiards in ellipses revisited,” <i>European Journal of Mathematics</i>. Springer Nature, 2020."},"main_file_link":[{"url":"https://arxiv.org/abs/2001.02934","open_access":"1"}],"author":[{"first_name":"Arseniy","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy"},{"first_name":"Richard","last_name":"Schwartz","full_name":"Schwartz, Richard"},{"first_name":"Serge","last_name":"Tabachnikov","full_name":"Tabachnikov, Serge"}],"quality_controlled":"1","project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"abstract":[{"text":"We prove some recent experimental observations of Dan Reznik concerning periodic billiard orbits in ellipses. For example, the sum of cosines of the angles of a periodic billiard polygon remains constant in the 1-parameter family of such polygons (that exist due to the Poncelet porism). In our proofs, we use geometric and complex analytic methods.","lang":"eng"}],"publication_status":"published","title":"Billiards in ellipses revisited","publication":"European Journal of Mathematics","_id":"8538","oa":1,"publisher":"Springer Nature","article_type":"original","month":"09","date_created":"2020-09-20T22:01:38Z","status":"public"},{"date_published":"2020-08-01T00:00:00Z","external_id":{"isi":["000621172600045"]},"publisher":"IEEE","publication_identifier":{"isbn":["9781728157511"]},"scopus_import":"1","isi":1,"date_created":"2020-09-28T08:59:27Z","conference":{"start_date":"2020-07-15","location":"Pisa, Italy","name":"ESGCO: European Study Group on Cardiovascular Oscillations","end_date":"2020-07-15"},"month":"08","article_number":"9158054","status":"public","citation":{"short":"G. Graff, B. Graff, G. Jablonski, K. Narkiewicz, in:, 11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, , IEEE, 2020.","chicago":"Graff, Grzegorz, Beata Graff, Grzegorz Jablonski, and Krzysztof Narkiewicz. “The Application of Persistent Homology in the Analysis of Heart Rate Variability.” In <i>11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, </i>. IEEE, 2020. <a href=\"https://doi.org/10.1109/ESGCO49734.2020.9158054\">https://doi.org/10.1109/ESGCO49734.2020.9158054</a>.","ista":"Graff G, Graff B, Jablonski G, Narkiewicz K. 2020. The application of persistent homology in the analysis of heart rate variability. 11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, . ESGCO: European Study Group on Cardiovascular Oscillations, 9158054.","ama":"Graff G, Graff B, Jablonski G, Narkiewicz K. The application of persistent homology in the analysis of heart rate variability. In: <i>11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, </i>. IEEE; 2020. doi:<a href=\"https://doi.org/10.1109/ESGCO49734.2020.9158054\">10.1109/ESGCO49734.2020.9158054</a>","ieee":"G. Graff, B. Graff, G. Jablonski, and K. Narkiewicz, “The application of persistent homology in the analysis of heart rate variability,” in <i>11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, </i>, Pisa, Italy, 2020.","apa":"Graff, G., Graff, B., Jablonski, G., &#38; Narkiewicz, K. (2020). The application of persistent homology in the analysis of heart rate variability. In <i>11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, </i>. Pisa, Italy: IEEE. <a href=\"https://doi.org/10.1109/ESGCO49734.2020.9158054\">https://doi.org/10.1109/ESGCO49734.2020.9158054</a>","mla":"Graff, Grzegorz, et al. “The Application of Persistent Homology in the Analysis of Heart Rate Variability.” <i>11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, </i>, 9158054, IEEE, 2020, doi:<a href=\"https://doi.org/10.1109/ESGCO49734.2020.9158054\">10.1109/ESGCO49734.2020.9158054</a>."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","quality_controlled":"1","article_processing_charge":"No","author":[{"full_name":"Graff, Grzegorz","last_name":"Graff","first_name":"Grzegorz"},{"last_name":"Graff","first_name":"Beata","full_name":"Graff, Beata"},{"first_name":"Grzegorz","last_name":"Jablonski","orcid":"0000-0002-3536-9866","full_name":"Jablonski, Grzegorz","id":"4483EF78-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Narkiewicz","first_name":"Krzysztof","full_name":"Narkiewicz, Krzysztof"}],"type":"conference","date_updated":"2023-08-22T09:33:34Z","oa_version":"None","day":"01","year":"2020","publication":"11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, ","title":"The application of persistent homology in the analysis of heart rate variability","language":[{"iso":"eng"}],"doi":"10.1109/ESGCO49734.2020.9158054","department":[{"_id":"HeEd"}],"_id":"8580","publication_status":"published","abstract":[{"lang":"eng","text":"We evaluate the usefulness of persistent homology in the analysis of heart rate variability. In our approach we extract several topological descriptors characterising datasets of RR-intervals, which are later used in classical machine learning algorithms. By this method we are able to differentiate the group of patients with the history of transient ischemic attack and the group of hypertensive patients."}]},{"date_created":"2020-10-25T23:01:18Z","month":"08","conference":{"end_date":"2020-09-09","name":"ESA: Annual European Symposium on Algorithms","location":"Virtual, Online; Pisa, Italy","start_date":"2020-09-07"},"status":"public","article_number":"75","intvolume":"       173","file_date_updated":"2020-10-27T14:31:52Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","volume":173,"project":[{"grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"publication_status":"published","abstract":[{"text":"Even though Delaunay originally introduced his famous triangulations in the case of infinite point sets with translational periodicity, a software that computes such triangulations in the general case is not yet available, to the best of our knowledge. Combining and generalizing previous work, we present a practical algorithm for computing such triangulations. The algorithm has been implemented and experiments show that its performance is as good as the one of the CGAL package, which is restricted to cubic periodicity. ","lang":"eng"}],"title":"Generalizing CGAL periodic Delaunay triangulations","publication":"28th Annual European Symposium on Algorithms","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"9056"}]},"oa":1,"ddc":["000"],"_id":"8703","tmp":{"short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png"},"year":"2020","citation":{"chicago":"Osang, Georg F, Mael Rouxel-Labbé, and Monique Teillaud. “Generalizing CGAL Periodic Delaunay Triangulations.” In <i>28th Annual European Symposium on Algorithms</i>, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">https://doi.org/10.4230/LIPIcs.ESA.2020.75</a>.","short":"G.F. Osang, M. Rouxel-Labbé, M. Teillaud, in:, 28th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ista":"Osang GF, Rouxel-Labbé M, Teillaud M. 2020. Generalizing CGAL periodic Delaunay triangulations. 28th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 75.","ama":"Osang GF, Rouxel-Labbé M, Teillaud M. Generalizing CGAL periodic Delaunay triangulations. In: <i>28th Annual European Symposium on Algorithms</i>. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">10.4230/LIPIcs.ESA.2020.75</a>","ieee":"G. F. Osang, M. Rouxel-Labbé, and M. Teillaud, “Generalizing CGAL periodic Delaunay triangulations,” in <i>28th Annual European Symposium on Algorithms</i>, Virtual, Online; Pisa, Italy, 2020, vol. 173.","mla":"Osang, Georg F., et al. “Generalizing CGAL Periodic Delaunay Triangulations.” <i>28th Annual European Symposium on Algorithms</i>, vol. 173, 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">10.4230/LIPIcs.ESA.2020.75</a>.","apa":"Osang, G. F., Rouxel-Labbé, M., &#38; Teillaud, M. (2020). Generalizing CGAL periodic Delaunay triangulations. In <i>28th Annual European Symposium on Algorithms</i> (Vol. 173). Virtual, Online; Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">https://doi.org/10.4230/LIPIcs.ESA.2020.75</a>"},"quality_controlled":"1","author":[{"first_name":"Georg F","last_name":"Osang","orcid":"0000-0002-8882-5116","full_name":"Osang, Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mael","last_name":"Rouxel-Labbé","full_name":"Rouxel-Labbé, Mael"},{"last_name":"Teillaud","first_name":"Monique","full_name":"Teillaud, Monique"}],"alternative_title":["LIPIcs"],"publication_identifier":{"isbn":["9783959771627"],"issn":["18688969"]},"scopus_import":"1","date_published":"2020-08-26T00:00:00Z","file":[{"content_type":"application/pdf","creator":"cziletti","file_size":733291,"date_created":"2020-10-27T14:31:52Z","relation":"main_file","access_level":"open_access","file_name":"2020_LIPIcs_Osang.pdf","checksum":"fe0f7c49a99ed870c671b911e10d5496","file_id":"8712","date_updated":"2020-10-27T14:31:52Z","success":1}],"ec_funded":1,"license":"https://creativecommons.org/licenses/by/3.0/","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.ESA.2020.75","department":[{"_id":"HeEd"}],"has_accepted_license":"1","type":"conference","date_updated":"2023-09-07T13:29:00Z","oa_version":"Published Version","day":"26","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"abstract":[{"lang":"eng","text":"The morphometric approach [11, 14] writes the solvation free energy as a linear combination of weighted versions of the volume, area, mean curvature, and Gaussian curvature of the space-filling diagram. We give a formula for the derivative of the weighted Gaussian curvature. Together with the derivatives of the weighted volume in [7], the weighted area in [4], and the weighted mean curvature in [1], this yields the derivative of the morphometric expression of solvation free energy."}],"publication_status":"published","project":[{"grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes"}],"_id":"9156","oa":1,"ddc":["510"],"publication":"Computational and Mathematical Biophysics","title":"The weighted Gaussian curvature derivative of a space-filling diagram","year":"2020","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"quality_controlled":"1","author":[{"last_name":"Akopyan","first_name":"Arseniy","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"}],"citation":{"mla":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Gaussian Curvature Derivative of a Space-Filling Diagram.” <i>Computational and Mathematical Biophysics</i>, vol. 8, no. 1, De Gruyter, 2020, pp. 74–88, doi:<a href=\"https://doi.org/10.1515/cmb-2020-0101\">10.1515/cmb-2020-0101</a>.","apa":"Akopyan, A., &#38; Edelsbrunner, H. (2020). The weighted Gaussian curvature derivative of a space-filling diagram. <i>Computational and Mathematical Biophysics</i>. De Gruyter. <a href=\"https://doi.org/10.1515/cmb-2020-0101\">https://doi.org/10.1515/cmb-2020-0101</a>","chicago":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Gaussian Curvature Derivative of a Space-Filling Diagram.” <i>Computational and Mathematical Biophysics</i>. De Gruyter, 2020. <a href=\"https://doi.org/10.1515/cmb-2020-0101\">https://doi.org/10.1515/cmb-2020-0101</a>.","short":"A. Akopyan, H. Edelsbrunner, Computational and Mathematical Biophysics 8 (2020) 74–88.","ista":"Akopyan A, Edelsbrunner H. 2020. The weighted Gaussian curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 8(1), 74–88.","ieee":"A. Akopyan and H. Edelsbrunner, “The weighted Gaussian curvature derivative of a space-filling diagram,” <i>Computational and Mathematical Biophysics</i>, vol. 8, no. 1. De Gruyter, pp. 74–88, 2020.","ama":"Akopyan A, Edelsbrunner H. The weighted Gaussian curvature derivative of a space-filling diagram. <i>Computational and Mathematical Biophysics</i>. 2020;8(1):74-88. doi:<a href=\"https://doi.org/10.1515/cmb-2020-0101\">10.1515/cmb-2020-0101</a>"},"status":"public","month":"07","date_created":"2021-02-17T15:12:44Z","intvolume":"         8","publisher":"De Gruyter","article_type":"original","file_date_updated":"2021-02-19T13:33:19Z","issue":"1","volume":8,"acknowledgement":"The authors of this paper thank Roland Roth for suggesting the analysis of theweighted\r\ncurvature derivatives for the purpose of improving molecular dynamics simulations. They also thank Patrice Koehl for the implementation of the formulas and for his encouragement and advise along the road. Finally, they thank two anonymous reviewers for their constructive criticism.\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 78818 Alpha). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","has_accepted_license":"1","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"doi":"10.1515/cmb-2020-0101","ec_funded":1,"day":"21","oa_version":"Published Version","type":"journal_article","date_updated":"2023-10-17T12:35:10Z","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"publication_identifier":{"issn":["2544-7297"]},"page":"74-88","external_id":{"arxiv":["1908.06777"]},"file":[{"file_name":"2020_CompMathBiophysics_Akopyan.pdf","checksum":"ca43a7440834eab6bbea29c59b56ef3a","access_level":"open_access","success":1,"date_updated":"2021-02-19T13:33:19Z","file_id":"9170","file_size":707452,"content_type":"application/pdf","creator":"dernst","relation":"main_file","date_created":"2021-02-19T13:33:19Z"}],"date_published":"2020-07-21T00:00:00Z"},{"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","type":"journal_article","date_updated":"2023-10-17T12:34:51Z","day":"20","ec_funded":1,"department":[{"_id":"HeEd"}],"has_accepted_license":"1","doi":"10.1515/cmb-2020-0100","language":[{"iso":"eng"}],"acknowledgement":"The authors of this paper thank Roland Roth for suggesting the analysis of the weighted\r\ncurvature derivatives for the purpose of improving molecular dynamics simulations and for his continued encouragement. They also thank Patrice Koehl for the implementation of the formulas and for his encouragement and advise along the road. Finally, they thank two anonymous reviewers for their constructive criticism.\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 78818 Alpha). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","file":[{"file_id":"9171","date_updated":"2021-02-19T13:56:24Z","success":1,"access_level":"open_access","file_name":"2020_CompMathBiophysics_Akopyan2.pdf","checksum":"cea41de9937d07a3b927d71ee8b4e432","date_created":"2021-02-19T13:56:24Z","relation":"main_file","content_type":"application/pdf","creator":"dernst","file_size":562359}],"date_published":"2020-06-20T00:00:00Z","page":"51-67","publication_identifier":{"issn":["2544-7297"]},"citation":{"ista":"Akopyan A, Edelsbrunner H. 2020. The weighted mean curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 8(1), 51–67.","chicago":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Mean Curvature Derivative of a Space-Filling Diagram.” <i>Computational and Mathematical Biophysics</i>. De Gruyter, 2020. <a href=\"https://doi.org/10.1515/cmb-2020-0100\">https://doi.org/10.1515/cmb-2020-0100</a>.","short":"A. Akopyan, H. Edelsbrunner, Computational and Mathematical Biophysics 8 (2020) 51–67.","ieee":"A. Akopyan and H. Edelsbrunner, “The weighted mean curvature derivative of a space-filling diagram,” <i>Computational and Mathematical Biophysics</i>, vol. 8, no. 1. De Gruyter, pp. 51–67, 2020.","ama":"Akopyan A, Edelsbrunner H. The weighted mean curvature derivative of a space-filling diagram. <i>Computational and Mathematical Biophysics</i>. 2020;8(1):51-67. doi:<a href=\"https://doi.org/10.1515/cmb-2020-0100\">10.1515/cmb-2020-0100</a>","apa":"Akopyan, A., &#38; Edelsbrunner, H. (2020). The weighted mean curvature derivative of a space-filling diagram. <i>Computational and Mathematical Biophysics</i>. De Gruyter. <a href=\"https://doi.org/10.1515/cmb-2020-0100\">https://doi.org/10.1515/cmb-2020-0100</a>","mla":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Mean Curvature Derivative of a Space-Filling Diagram.” <i>Computational and Mathematical Biophysics</i>, vol. 8, no. 1, De Gruyter, 2020, pp. 51–67, doi:<a href=\"https://doi.org/10.1515/cmb-2020-0100\">10.1515/cmb-2020-0100</a>."},"author":[{"last_name":"Akopyan","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy"},{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert"}],"quality_controlled":"1","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2020","title":"The weighted mean curvature derivative of a space-filling diagram","publication":"Computational and Mathematical Biophysics","_id":"9157","ddc":["510"],"oa":1,"project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Alpha Shape Theory Extended","grant_number":"788183"},{"grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"abstract":[{"lang":"eng","text":"Representing an atom by a solid sphere in 3-dimensional Euclidean space, we get the space-filling diagram of a molecule by taking the union. Molecular dynamics simulates its motion subject to bonds and other forces, including the solvation free energy. The morphometric approach [12, 17] writes the latter as a linear combination of weighted versions of the volume, area, mean curvature, and Gaussian curvature of the space-filling diagram. We give a formula for the derivative of the weighted mean curvature. Together with the derivatives of the weighted volume in [7], the weighted area in [3], and the weighted Gaussian curvature [1], this yields the derivative of the morphometric expression of the solvation free energy."}],"publication_status":"published","issue":"1","volume":8,"file_date_updated":"2021-02-19T13:56:24Z","publisher":"De Gruyter","article_type":"original","intvolume":"         8","month":"06","date_created":"2021-02-17T15:13:01Z","status":"public"},{"publisher":"De Gruyter","article_type":"original","file_date_updated":"2021-03-22T08:56:37Z","issue":"1","volume":4,"status":"public","month":"11","date_created":"2021-03-16T08:55:19Z","intvolume":"         4","year":"2020","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"quality_controlled":"1","author":[{"id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890","full_name":"Biswas, Ranita","first_name":"Ranita","last_name":"Biswas"},{"first_name":"Gaëlle","last_name":"Largeteau-Skapin","full_name":"Largeteau-Skapin, Gaëlle"},{"full_name":"Zrour, Rita","last_name":"Zrour","first_name":"Rita"},{"last_name":"Andres","first_name":"Eric","full_name":"Andres, Eric"}],"citation":{"ista":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. 2020. Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. 4(1), 143–158.","short":"R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, Mathematical Morphology - Theory and Applications 4 (2020) 143–158.","chicago":"Biswas, Ranita, Gaëlle Largeteau-Skapin, Rita Zrour, and Eric Andres. “Digital Objects in Rhombic Dodecahedron Grid.” <i>Mathematical Morphology - Theory and Applications</i>. De Gruyter, 2020. <a href=\"https://doi.org/10.1515/mathm-2020-0106\">https://doi.org/10.1515/mathm-2020-0106</a>.","ieee":"R. Biswas, G. Largeteau-Skapin, R. Zrour, and E. Andres, “Digital objects in rhombic dodecahedron grid,” <i>Mathematical Morphology - Theory and Applications</i>, vol. 4, no. 1. De Gruyter, pp. 143–158, 2020.","ama":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. Digital objects in rhombic dodecahedron grid. <i>Mathematical Morphology - Theory and Applications</i>. 2020;4(1):143-158. doi:<a href=\"https://doi.org/10.1515/mathm-2020-0106\">10.1515/mathm-2020-0106</a>","apa":"Biswas, R., Largeteau-Skapin, G., Zrour, R., &#38; Andres, E. (2020). Digital objects in rhombic dodecahedron grid. <i>Mathematical Morphology - Theory and Applications</i>. De Gruyter. <a href=\"https://doi.org/10.1515/mathm-2020-0106\">https://doi.org/10.1515/mathm-2020-0106</a>","mla":"Biswas, Ranita, et al. “Digital Objects in Rhombic Dodecahedron Grid.” <i>Mathematical Morphology - Theory and Applications</i>, vol. 4, no. 1, De Gruyter, 2020, pp. 143–58, doi:<a href=\"https://doi.org/10.1515/mathm-2020-0106\">10.1515/mathm-2020-0106</a>."},"abstract":[{"text":"Rhombic dodecahedron is a space filling polyhedron which represents the close packing of spheres in 3D space and the Voronoi structures of the face centered cubic (FCC) lattice. In this paper, we describe a new coordinate system where every 3-integer coordinates grid point corresponds to a rhombic dodecahedron centroid. In order to illustrate the interest of the new coordinate system, we propose the characterization of 3D digital plane with its topological features, such as the interrelation between the thickness of the digital plane and the separability constraint we aim to obtain. We also present the characterization of 3D digital lines and study it as the intersection of multiple digital planes. Characterization of 3D digital sphere with relevant topological features is proposed as well along with the 48-symmetry appearing in the new coordinate system.","lang":"eng"}],"publication_status":"published","project":[{"grant_number":"788183","name":"Alpha Shape Theory Extended","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"_id":"9249","oa":1,"ddc":["510"],"publication":"Mathematical Morphology - Theory and Applications","title":"Digital objects in rhombic dodecahedron grid","page":"143-158","file":[{"date_updated":"2021-03-22T08:56:37Z","file_id":"9272","success":1,"access_level":"open_access","file_name":"2020_MathMorpholTheoryAppl_Biswas.pdf","checksum":"4a1043fa0548a725d464017fe2483ce0","date_created":"2021-03-22T08:56:37Z","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":3668725}],"date_published":"2020-11-17T00:00:00Z","publication_identifier":{"issn":["2353-3390"]},"day":"17","oa_version":"Published Version","date_updated":"2021-03-22T09:01:50Z","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","acknowledgement":"This work has been partially supported by the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation programme, grant no. 788183, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35. ","has_accepted_license":"1","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"doi":"10.1515/mathm-2020-0106","ec_funded":1},{"acknowledgement":"Supported by the National Research, Development and Innovation Office, NKFIH, KKP-133864, K-131529, K-116769, K-132696, by the Higher Educational Institutional Excellence Program 2019 NKFIH-1158-6/2019, the Austrian Science Fund (FWF), grant Z 342-N31, by the Ministry of Education and Science of the Russian Federation MegaGrant No. 075-15-2019-1926, and by the ERC Synergy Grant “Dynasnet” No. 810115. A full version can be found at https://arxiv.org/abs/2006.14908.","department":[{"_id":"HeEd"}],"doi":"10.1007/978-3-030-68766-3_28","language":[{"iso":"eng"}],"day":"20","oa_version":"Preprint","date_updated":"2021-04-06T11:32:32Z","type":"conference","series_title":"LNCS","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","arxiv":1,"scopus_import":"1","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783030687656"],"issn":["0302-9743"]},"page":"359-371","external_id":{"arxiv":["2006.14908"]},"date_published":"2020-09-20T00:00:00Z","abstract":[{"text":"We call a multigraph non-homotopic if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can be shrunk to its end-vertex in the same way. It is easy to see that a non-homotopic multigraph on   n>1  vertices can have arbitrarily many edges. We prove that the number of crossings between the edges of a non-homotopic multigraph with n vertices and   m>4n  edges is larger than   cm2n  for some constant   c>0 , and that this bound is tight up to a polylogarithmic factor. We also show that the lower bound is not asymptotically sharp as n is fixed and   m⟶∞ .","lang":"eng"}],"publication_status":"published","project":[{"name":"The Wittgenstein Prize","grant_number":"Z00342","call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425"}],"_id":"9299","oa":1,"publication":"28th International Symposium on Graph Drawing and Network Visualization","title":"Crossings between non-homotopic edges","year":"2020","author":[{"full_name":"Pach, János","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","first_name":"János","last_name":"Pach"},{"last_name":"Tardos","first_name":"Gábor","full_name":"Tardos, Gábor"},{"last_name":"Tóth","first_name":"Géza","full_name":"Tóth, Géza"}],"quality_controlled":"1","citation":{"ieee":"J. Pach, G. Tardos, and G. Tóth, “Crossings between non-homotopic edges,” in <i>28th International Symposium on Graph Drawing and Network Visualization</i>, Virtual, Online, 2020, vol. 12590, pp. 359–371.","ama":"Pach J, Tardos G, Tóth G. Crossings between non-homotopic edges. In: <i>28th International Symposium on Graph Drawing and Network Visualization</i>. Vol 12590. LNCS. Springer Nature; 2020:359-371. doi:<a href=\"https://doi.org/10.1007/978-3-030-68766-3_28\">10.1007/978-3-030-68766-3_28</a>","ista":"Pach J, Tardos G, Tóth G. 2020. Crossings between non-homotopic edges. 28th International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network VisualizationLNCS vol. 12590, 359–371.","short":"J. Pach, G. Tardos, G. Tóth, in:, 28th International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2020, pp. 359–371.","chicago":"Pach, János, Gábor Tardos, and Géza Tóth. “Crossings between Non-Homotopic Edges.” In <i>28th International Symposium on Graph Drawing and Network Visualization</i>, 12590:359–71. LNCS. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-68766-3_28\">https://doi.org/10.1007/978-3-030-68766-3_28</a>.","apa":"Pach, J., Tardos, G., &#38; Tóth, G. (2020). Crossings between non-homotopic edges. In <i>28th International Symposium on Graph Drawing and Network Visualization</i> (Vol. 12590, pp. 359–371). Virtual, Online: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-68766-3_28\">https://doi.org/10.1007/978-3-030-68766-3_28</a>","mla":"Pach, János, et al. “Crossings between Non-Homotopic Edges.” <i>28th International Symposium on Graph Drawing and Network Visualization</i>, vol. 12590, Springer Nature, 2020, pp. 359–71, doi:<a href=\"https://doi.org/10.1007/978-3-030-68766-3_28\">10.1007/978-3-030-68766-3_28</a>."},"main_file_link":[{"url":"https://arxiv.org/abs/2006.14908","open_access":"1"}],"status":"public","month":"09","conference":{"start_date":"2020-09-16","location":"Virtual, Online","end_date":"2020-09-18","name":"GD: Graph Drawing and Network Visualization"},"date_created":"2021-03-28T22:01:44Z","intvolume":"     12590","publisher":"Springer Nature","volume":12590},{"status":"public","date_created":"2018-12-11T11:44:29Z","month":"06","isi":1,"intvolume":"      2256","publisher":"Springer Nature","editor":[{"first_name":"Bo'az","last_name":"Klartag","full_name":"Klartag, Bo'az"},{"last_name":"Milman","first_name":"Emanuel","full_name":"Milman, Emanuel"}],"volume":2256,"publication_status":"published","abstract":[{"text":"We study the Gromov waist in the sense of t-neighborhoods for measures in the Euclidean  space,  motivated  by  the  famous  theorem  of  Gromov  about  the  waist  of  radially symmetric Gaussian measures.  In particular, it turns our possible to extend Gromov’s original result  to  the  case  of  not  necessarily  radially  symmetric  Gaussian  measure.   We  also  provide examples of measures having no t-neighborhood waist property, including a rather wide class\r\nof compactly supported radially symmetric measures and their maps into the Euclidean space of dimension at least 2.\r\nWe  use  a  simpler  form  of  Gromov’s  pancake  argument  to  produce  some  estimates  of t-neighborhoods of (weighted) volume-critical submanifolds in the spirit of the waist theorems, including neighborhoods of algebraic manifolds in the complex projective space. In the appendix of this paper we provide for reader’s convenience a more detailed explanation of the Caffarelli theorem that we use to handle not necessarily radially symmetric Gaussian\r\nmeasures.","lang":"eng"}],"project":[{"call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics"}],"oa":1,"_id":"74","publication":"Geometric Aspects of Functional Analysis","title":"Gromov's waist of non-radial Gaussian measures and radial non-Gaussian measures","year":"2020","quality_controlled":"1","author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","first_name":"Arseniy","last_name":"Akopyan"},{"last_name":"Karasev","first_name":"Roman","full_name":"Karasev, Roman"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1808.07350"}],"citation":{"apa":"Akopyan, A., &#38; Karasev, R. (2020). Gromov’s waist of non-radial Gaussian measures and radial non-Gaussian measures. In B. Klartag &#38; E. Milman (Eds.), <i>Geometric Aspects of Functional Analysis</i> (Vol. 2256, pp. 1–27). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-36020-7_1\">https://doi.org/10.1007/978-3-030-36020-7_1</a>","mla":"Akopyan, Arseniy, and Roman Karasev. “Gromov’s Waist of Non-Radial Gaussian Measures and Radial Non-Gaussian Measures.” <i>Geometric Aspects of Functional Analysis</i>, edited by Bo’az Klartag and Emanuel Milman, vol. 2256, Springer Nature, 2020, pp. 1–27, doi:<a href=\"https://doi.org/10.1007/978-3-030-36020-7_1\">10.1007/978-3-030-36020-7_1</a>.","ista":"Akopyan A, Karasev R. 2020.Gromov’s waist of non-radial Gaussian measures and radial non-Gaussian measures. In: Geometric Aspects of Functional Analysis. vol. 2256, 1–27.","chicago":"Akopyan, Arseniy, and Roman Karasev. “Gromov’s Waist of Non-Radial Gaussian Measures and Radial Non-Gaussian Measures.” In <i>Geometric Aspects of Functional Analysis</i>, edited by Bo’az Klartag and Emanuel Milman, 2256:1–27. LNM. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-36020-7_1\">https://doi.org/10.1007/978-3-030-36020-7_1</a>.","short":"A. Akopyan, R. Karasev, in:, B. Klartag, E. Milman (Eds.), Geometric Aspects of Functional Analysis, Springer Nature, 2020, pp. 1–27.","ieee":"A. Akopyan and R. Karasev, “Gromov’s waist of non-radial Gaussian measures and radial non-Gaussian measures,” in <i>Geometric Aspects of Functional Analysis</i>, vol. 2256, B. Klartag and E. Milman, Eds. Springer Nature, 2020, pp. 1–27.","ama":"Akopyan A, Karasev R. Gromov’s waist of non-radial Gaussian measures and radial non-Gaussian measures. In: Klartag B, Milman E, eds. <i>Geometric Aspects of Functional Analysis</i>. Vol 2256. LNM. Springer Nature; 2020:1-27. doi:<a href=\"https://doi.org/10.1007/978-3-030-36020-7_1\">10.1007/978-3-030-36020-7_1</a>"},"arxiv":1,"publication_identifier":{"eisbn":["9783030360207"],"issn":["00758434"],"eissn":["16179692"],"isbn":["9783030360191"]},"scopus_import":"1","page":"1-27","date_published":"2020-06-21T00:00:00Z","external_id":{"isi":["000557689300003"],"arxiv":["1808.07350"]},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-36020-7_1","department":[{"_id":"HeEd"},{"_id":"JaMa"}],"ec_funded":1,"day":"21","type":"book_chapter","series_title":"LNM","date_updated":"2023-08-17T13:48:31Z","oa_version":"Preprint","article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"alternative_title":["ISTA Thesis"],"publication_identifier":{"issn":["2663-337X"]},"date_published":"2020-02-10T00:00:00Z","file":[{"access_level":"open_access","checksum":"1df9f8c530b443c0e63a3f2e4fde412e","file_name":"thesis_ist-final_noack.pdf","date_updated":"2020-07-14T12:47:58Z","file_id":"7461","creator":"koelsboe","content_type":"application/pdf","file_size":76195184,"date_created":"2020-02-06T14:43:54Z","relation":"main_file"},{"date_created":"2020-02-06T14:52:45Z","relation":"source_file","creator":"koelsboe","content_type":"application/x-zip-compressed","file_size":122103715,"file_id":"7462","date_updated":"2020-07-14T12:47:58Z","access_level":"closed","description":"latex source files, figures","file_name":"latex-files.zip","checksum":"7a52383c812b0be64d3826546509e5a4"}],"keyword":["shape reconstruction","hole manipulation","ordered complexes","Alpha complex","Wrap complex","computational topology","Bregman geometry"],"page":"155","doi":"10.15479/AT:ISTA:7460","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"},{"_id":"GradSch"}],"has_accepted_license":"1","type":"dissertation","date_updated":"2023-09-07T13:15:30Z","oa_version":"Published Version","day":"10","supervisor":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"}],"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2020-02-06T14:56:53Z","month":"02","status":"public","degree_awarded":"PhD","file_date_updated":"2020-07-14T12:47:58Z","publisher":"Institute of Science and Technology Austria","publication_status":"published","abstract":[{"lang":"eng","text":"Many methods for the reconstruction of shapes from sets of points produce ordered simplicial complexes, which are collections of vertices, edges, triangles, and their higher-dimensional analogues, called simplices, in which every simplex gets assigned a real value measuring its size. This thesis studies ordered simplicial complexes, with a focus on their topology, which reflects the connectedness of the represented shapes and the presence of holes. We are interested both in understanding better the structure of these complexes, as well as in developing algorithms for applications.\r\n\r\nFor the Delaunay triangulation, the most popular measure for a simplex is the radius of the smallest empty circumsphere. Based on it, we revisit Alpha and Wrap complexes and experimentally determine their probabilistic properties for random data. Also, we prove the existence of tri-partitions, propose algorithms to open and close holes, and extend the concepts from Euclidean to Bregman geometries."}],"title":"The hole system of triangulated shapes","ddc":["514"],"related_material":{"record":[{"id":"6608","status":"public","relation":"part_of_dissertation"}]},"oa":1,"_id":"7460","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png"},"year":"2020","citation":{"chicago":"Ölsböck, Katharina. “The Hole System of Triangulated Shapes.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:7460\">https://doi.org/10.15479/AT:ISTA:7460</a>.","short":"K. Ölsböck, The Hole System of Triangulated Shapes, Institute of Science and Technology Austria, 2020.","ista":"Ölsböck K. 2020. The hole system of triangulated shapes. Institute of Science and Technology Austria.","ama":"Ölsböck K. The hole system of triangulated shapes. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7460\">10.15479/AT:ISTA:7460</a>","ieee":"K. Ölsböck, “The hole system of triangulated shapes,” Institute of Science and Technology Austria, 2020.","mla":"Ölsböck, Katharina. <i>The Hole System of Triangulated Shapes</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7460\">10.15479/AT:ISTA:7460</a>.","apa":"Ölsböck, K. (2020). <i>The hole system of triangulated shapes</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:7460\">https://doi.org/10.15479/AT:ISTA:7460</a>"},"author":[{"first_name":"Katharina","last_name":"Ölsböck","orcid":"0000-0002-4672-8297","full_name":"Ölsböck, Katharina","id":"4D4AA390-F248-11E8-B48F-1D18A9856A87"}]},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","day":"13","type":"journal_article","date_updated":"2023-08-18T06:45:48Z","oa_version":"Preprint","doi":"10.1137/S0040585X97T989726","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"ec_funded":1,"page":"595-614","date_published":"2020-02-13T00:00:00Z","external_id":{"arxiv":["1705.08735"],"isi":["000551393100007"]},"publication_identifier":{"issn":["0040585X"],"eissn":["10957219"]},"scopus_import":"1","arxiv":1,"quality_controlled":"1","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","full_name":"Nikitenko, Anton","orcid":"0000-0002-0659-3201","first_name":"Anton","last_name":"Nikitenko"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.08735"}],"citation":{"chicago":"Edelsbrunner, Herbert, and Anton Nikitenko. “Weighted Poisson–Delaunay Mosaics.” <i>Theory of Probability and Its Applications</i>. SIAM, 2020. <a href=\"https://doi.org/10.1137/S0040585X97T989726\">https://doi.org/10.1137/S0040585X97T989726</a>.","short":"H. Edelsbrunner, A. Nikitenko, Theory of Probability and Its Applications 64 (2020) 595–614.","ista":"Edelsbrunner H, Nikitenko A. 2020. Weighted Poisson–Delaunay mosaics. Theory of Probability and its Applications. 64(4), 595–614.","ieee":"H. Edelsbrunner and A. Nikitenko, “Weighted Poisson–Delaunay mosaics,” <i>Theory of Probability and its Applications</i>, vol. 64, no. 4. SIAM, pp. 595–614, 2020.","ama":"Edelsbrunner H, Nikitenko A. Weighted Poisson–Delaunay mosaics. <i>Theory of Probability and its Applications</i>. 2020;64(4):595-614. doi:<a href=\"https://doi.org/10.1137/S0040585X97T989726\">10.1137/S0040585X97T989726</a>","apa":"Edelsbrunner, H., &#38; Nikitenko, A. (2020). Weighted Poisson–Delaunay mosaics. <i>Theory of Probability and Its Applications</i>. SIAM. <a href=\"https://doi.org/10.1137/S0040585X97T989726\">https://doi.org/10.1137/S0040585X97T989726</a>","mla":"Edelsbrunner, Herbert, and Anton Nikitenko. “Weighted Poisson–Delaunay Mosaics.” <i>Theory of Probability and Its Applications</i>, vol. 64, no. 4, SIAM, 2020, pp. 595–614, doi:<a href=\"https://doi.org/10.1137/S0040585X97T989726\">10.1137/S0040585X97T989726</a>."},"year":"2020","oa":1,"_id":"7554","publication":"Theory of Probability and its Applications","title":"Weighted Poisson–Delaunay mosaics","publication_status":"published","abstract":[{"lang":"eng","text":"Slicing a Voronoi tessellation in ${R}^n$ with a $k$-plane gives a $k$-dimensional weighted Voronoi tessellation, also known as a power diagram or Laguerre tessellation. Mapping every simplex of the dual weighted Delaunay mosaic to the radius of the smallest empty circumscribed sphere whose center lies in the $k$-plane gives a generalized discrete Morse function. Assuming the Voronoi tessellation is generated by a Poisson point process in ${R}^n$, we study the expected number of simplices in the $k$-dimensional weighted Delaunay mosaic as well as the expected number of intervals of the Morse function, both as functions of a radius threshold. As a by-product, we obtain a new proof for the expected number of connected components (clumps) in a line section of a circular Boolean model in ${R}^n$."}],"project":[{"grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes"}],"issue":"4","volume":64,"publisher":"SIAM","article_type":"original","isi":1,"intvolume":"        64","status":"public","date_created":"2020-03-01T23:00:39Z","month":"02"},{"doi":"10.1007/s11786-020-00461-5","language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"HeEd"}],"ec_funded":1,"article_processing_charge":"Yes (via OA deal)","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","date_updated":"2021-01-12T08:14:13Z","type":"journal_article","oa_version":"Published Version","publication_identifier":{"issn":["1661-8270"],"eissn":["1661-8289"]},"scopus_import":"1","page":"141-176","date_published":"2020-03-01T00:00:00Z","file":[{"checksum":"1d145f3ab50ccee735983cb89236e609","file_name":"2020_MathCompScie_Choudhary.pdf","access_level":"open_access","success":1,"date_updated":"2020-11-20T10:18:02Z","file_id":"8783","file_size":872275,"content_type":"application/pdf","creator":"dernst","relation":"main_file","date_created":"2020-11-20T10:18:02Z"}],"ddc":["510"],"oa":1,"_id":"7567","publication":"Mathematics in Computer Science","title":"Coxeter triangulations have good quality","publication_status":"published","abstract":[{"lang":"eng","text":"Coxeter triangulations are triangulations of Euclidean space based on a single simplex. By this we mean that given an individual simplex we can recover the entire triangulation of Euclidean space by inductively reflecting in the faces of the simplex. In this paper we establish that the quality of the simplices in all Coxeter triangulations is O(1/d−−√) of the quality of regular simplex. We further investigate the Delaunay property for these triangulations. Moreover, we consider an extension of the Delaunay property, namely protection, which is a measure of non-degeneracy of a Delaunay triangulation. In particular, one family of Coxeter triangulations achieves the protection O(1/d2). We conjecture that both bounds are optimal for triangulations in Euclidean space."}],"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"quality_controlled":"1","author":[{"full_name":"Choudhary, Aruni","first_name":"Aruni","last_name":"Choudhary"},{"first_name":"Siargey","last_name":"Kachanovich","full_name":"Kachanovich, Siargey"},{"orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs","last_name":"Wintraecken"}],"citation":{"apa":"Choudhary, A., Kachanovich, S., &#38; Wintraecken, M. (2020). Coxeter triangulations have good quality. <i>Mathematics in Computer Science</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11786-020-00461-5\">https://doi.org/10.1007/s11786-020-00461-5</a>","mla":"Choudhary, Aruni, et al. “Coxeter Triangulations Have Good Quality.” <i>Mathematics in Computer Science</i>, vol. 14, Springer Nature, 2020, pp. 141–76, doi:<a href=\"https://doi.org/10.1007/s11786-020-00461-5\">10.1007/s11786-020-00461-5</a>.","ieee":"A. Choudhary, S. Kachanovich, and M. Wintraecken, “Coxeter triangulations have good quality,” <i>Mathematics in Computer Science</i>, vol. 14. Springer Nature, pp. 141–176, 2020.","ama":"Choudhary A, Kachanovich S, Wintraecken M. Coxeter triangulations have good quality. <i>Mathematics in Computer Science</i>. 2020;14:141-176. doi:<a href=\"https://doi.org/10.1007/s11786-020-00461-5\">10.1007/s11786-020-00461-5</a>","ista":"Choudhary A, Kachanovich S, Wintraecken M. 2020. Coxeter triangulations have good quality. Mathematics in Computer Science. 14, 141–176.","chicago":"Choudhary, Aruni, Siargey Kachanovich, and Mathijs Wintraecken. “Coxeter Triangulations Have Good Quality.” <i>Mathematics in Computer Science</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s11786-020-00461-5\">https://doi.org/10.1007/s11786-020-00461-5</a>.","short":"A. Choudhary, S. Kachanovich, M. Wintraecken, Mathematics in Computer Science 14 (2020) 141–176."},"year":"2020","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"intvolume":"        14","status":"public","date_created":"2020-03-05T13:30:18Z","month":"03","volume":14,"publisher":"Springer Nature","article_type":"original","file_date_updated":"2020-11-20T10:18:02Z"},{"scopus_import":"1","publication_identifier":{"eissn":["14320444"],"issn":["01795376"]},"external_id":{"isi":["000520918800001"]},"file":[{"access_level":"open_access","checksum":"f8cc96e497f00c38340b5dafe0cb91d7","file_name":"2020_DiscreteCompGeo_Edelsbrunner.pdf","file_id":"8786","date_updated":"2020-11-20T13:22:21Z","success":1,"file_size":701673,"content_type":"application/pdf","creator":"dernst","date_created":"2020-11-20T13:22:21Z","relation":"main_file"}],"date_published":"2020-03-20T00:00:00Z","page":"759-775","ec_funded":1,"has_accepted_license":"1","department":[{"_id":"HeEd"}],"doi":"10.1007/s00454-020-00188-x","language":[{"iso":"eng"}],"acknowledgement":"This project has received funding from the European Research Council under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 78818 Alpha). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through Grant No. I02979-N35 of the Austrian Science Fund (FWF).","article_processing_charge":"Yes (via OA deal)","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","type":"journal_article","date_updated":"2023-08-21T06:13:48Z","day":"20","intvolume":"        64","isi":1,"month":"03","date_created":"2020-04-19T22:00:56Z","status":"public","volume":64,"file_date_updated":"2020-11-20T13:22:21Z","publisher":"Springer Nature","article_type":"original","title":"Tri-partitions and bases of an ordered complex","publication":"Discrete and Computational Geometry","_id":"7666","oa":1,"ddc":["510"],"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"},{"call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","grant_number":"788183"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes"}],"abstract":[{"lang":"eng","text":"Generalizing the decomposition of a connected planar graph into a tree and a dual tree, we prove a combinatorial analog of the classic Helmholtz–Hodge decomposition of a smooth vector field. Specifically, we show that for every polyhedral complex, K, and every dimension, p, there is a partition of the set of p-cells into a maximal p-tree, a maximal p-cotree, and a collection of p-cells whose cardinality is the p-th reduced Betti number of K. Given an ordering of the p-cells, this tri-partition is unique, and it can be computed by a matrix reduction algorithm that also constructs canonical bases of cycle and boundary groups."}],"publication_status":"published","citation":{"mla":"Edelsbrunner, Herbert, and Katharina Ölsböck. “Tri-Partitions and Bases of an Ordered Complex.” <i>Discrete and Computational Geometry</i>, vol. 64, Springer Nature, 2020, pp. 759–75, doi:<a href=\"https://doi.org/10.1007/s00454-020-00188-x\">10.1007/s00454-020-00188-x</a>.","apa":"Edelsbrunner, H., &#38; Ölsböck, K. (2020). Tri-partitions and bases of an ordered complex. <i>Discrete and Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-020-00188-x\">https://doi.org/10.1007/s00454-020-00188-x</a>","ista":"Edelsbrunner H, Ölsböck K. 2020. Tri-partitions and bases of an ordered complex. Discrete and Computational Geometry. 64, 759–775.","short":"H. Edelsbrunner, K. Ölsböck, Discrete and Computational Geometry 64 (2020) 759–775.","chicago":"Edelsbrunner, Herbert, and Katharina Ölsböck. “Tri-Partitions and Bases of an Ordered Complex.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s00454-020-00188-x\">https://doi.org/10.1007/s00454-020-00188-x</a>.","ieee":"H. Edelsbrunner and K. Ölsböck, “Tri-partitions and bases of an ordered complex,” <i>Discrete and Computational Geometry</i>, vol. 64. Springer Nature, pp. 759–775, 2020.","ama":"Edelsbrunner H, Ölsböck K. Tri-partitions and bases of an ordered complex. <i>Discrete and Computational Geometry</i>. 2020;64:759-775. doi:<a href=\"https://doi.org/10.1007/s00454-020-00188-x\">10.1007/s00454-020-00188-x</a>"},"quality_controlled":"1","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner"},{"full_name":"Ölsböck, Katharina","orcid":"0000-0002-4672-8297","id":"4D4AA390-F248-11E8-B48F-1D18A9856A87","first_name":"Katharina","last_name":"Ölsböck"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2020"},{"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","supervisor":[{"last_name":"Wagner","first_name":"Uli","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner"}],"day":"09","oa_version":"Published Version","date_updated":"2023-09-07T13:17:37Z","type":"dissertation","has_accepted_license":"1","department":[{"_id":"HeEd"},{"_id":"UlWa"}],"language":[{"iso":"eng"}],"license":"https://creativecommons.org/licenses/by-sa/4.0/","doi":"10.15479/AT:ISTA:7944","page":"160","file":[{"creator":"zmasarov","content_type":"application/pdf","file_size":13661779,"relation":"main_file","date_created":"2020-06-08T00:34:00Z","checksum":"df688bc5a82b50baee0b99d25fc7b7f0","file_name":"THESIS_Zuzka_Masarova.pdf","access_level":"open_access","file_id":"7945","date_updated":"2020-07-14T12:48:05Z"},{"file_id":"7946","date_updated":"2020-07-14T12:48:05Z","access_level":"closed","file_name":"THESIS_Zuzka_Masarova_SOURCE_FILES.zip","checksum":"45341a35b8f5529c74010b7af43ac188","date_created":"2020-06-08T00:35:30Z","relation":"source_file","file_size":32184006,"creator":"zmasarov","content_type":"application/zip"}],"keyword":["reconfiguration","reconfiguration graph","triangulations","flip","constrained triangulations","shellability","piecewise-linear balls","token swapping","trees","coloured weighted token swapping"],"date_published":"2020-06-09T00:00:00Z","publication_identifier":{"isbn":["978-3-99078-005-3"],"issn":["2663-337X"]},"alternative_title":["ISTA Thesis"],"author":[{"id":"45CFE238-F248-11E8-B48F-1D18A9856A87","full_name":"Masárová, Zuzana","orcid":"0000-0002-6660-1322","last_name":"Masárová","first_name":"Zuzana"}],"citation":{"mla":"Masárová, Zuzana. <i>Reconfiguration Problems</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7944\">10.15479/AT:ISTA:7944</a>.","apa":"Masárová, Z. (2020). <i>Reconfiguration problems</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:7944\">https://doi.org/10.15479/AT:ISTA:7944</a>","ama":"Masárová Z. Reconfiguration problems. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7944\">10.15479/AT:ISTA:7944</a>","ieee":"Z. Masárová, “Reconfiguration problems,” Institute of Science and Technology Austria, 2020.","chicago":"Masárová, Zuzana. “Reconfiguration Problems.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:7944\">https://doi.org/10.15479/AT:ISTA:7944</a>.","short":"Z. Masárová, Reconfiguration Problems, Institute of Science and Technology Austria, 2020.","ista":"Masárová Z. 2020. Reconfiguration problems. Institute of Science and Technology Austria."},"year":"2020","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","short":"CC BY-SA (4.0)","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","image":"/images/cc_by_sa.png"},"_id":"7944","oa":1,"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"7950"},{"status":"public","relation":"part_of_dissertation","id":"5986"}]},"ddc":["516","514"],"title":"Reconfiguration problems","abstract":[{"lang":"eng","text":"This thesis considers two examples of reconfiguration problems: flipping edges in edge-labelled triangulations of planar point sets and swapping labelled tokens placed on vertices of a graph. In both cases the studied structures – all the triangulations of a given point set or all token placements on a given graph – can be thought of as vertices of the so-called reconfiguration graph, in which two vertices are adjacent if the corresponding structures differ by a single elementary operation – by a flip of a diagonal in a triangulation or by a swap of tokens on adjacent vertices, respectively. We study the reconfiguration of one instance of a structure into another via (shortest) paths in the reconfiguration graph.\r\n\r\nFor triangulations of point sets in which each edge has a unique label and a flip transfers the label from the removed edge to the new edge, we prove a polynomial-time testable condition, called the Orbit Theorem, that characterizes when two triangulations of the same point set lie in the same connected component of the reconfiguration graph. The condition was first conjectured by Bose, Lubiw, Pathak and Verdonschot. We additionally provide a polynomial time algorithm that computes a reconfiguring flip sequence, if it exists. Our proof of the Orbit Theorem uses topological properties of a certain high-dimensional cell complex that has the usual reconfiguration graph as its 1-skeleton.\r\n\r\nIn the context of token swapping on a tree graph, we make partial progress on the problem of finding shortest reconfiguration sequences. We disprove the so-called Happy Leaf Conjecture and demonstrate the importance of swapping tokens that are already placed at the correct vertices. We also prove that a generalization of the problem to weighted coloured token swapping is NP-hard on trees but solvable in polynomial time on paths and stars."}],"publication_status":"published","publisher":"Institute of Science and Technology Austria","file_date_updated":"2020-07-14T12:48:05Z","degree_awarded":"PhD","status":"public","month":"06","date_created":"2020-06-08T00:49:46Z"},{"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"abstract":[{"text":"Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. manifolds defined as the zero set of some multivariate vector-valued smooth function f: ℝ^d → ℝ^(d-n). A natural (and efficient) way to approximate an isomanifold is to consider its Piecewise-Linear (PL) approximation based on a triangulation 𝒯 of the ambient space ℝ^d. In this paper, we give conditions under which the PL-approximation of an isomanifold is topologically equivalent to the isomanifold. The conditions are easy to satisfy in the sense that they can always be met by taking a sufficiently fine triangulation 𝒯. This contrasts with previous results on the triangulation of manifolds where, in arbitrary dimensions, delicate perturbations are needed to guarantee topological correctness, which leads to strong limitations in practice. We further give a bound on the Fréchet distance between the original isomanifold and its PL-approximation. Finally we show analogous results for the PL-approximation of an isomanifold with boundary. ","lang":"eng"}],"publication_status":"published","publication":"36th International Symposium on Computational Geometry","title":"The topological correctness of PL-approximations of isomanifolds","_id":"7952","oa":1,"ddc":["510"],"related_material":{"record":[{"id":"9649","status":"public","relation":"later_version"}]},"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2020","citation":{"apa":"Boissonnat, J.-D., &#38; Wintraecken, M. (2020). The topological correctness of PL-approximations of isomanifolds. In <i>36th International Symposium on Computational Geometry</i> (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2020.20\">https://doi.org/10.4230/LIPIcs.SoCG.2020.20</a>","mla":"Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL-Approximations of Isomanifolds.” <i>36th International Symposium on Computational Geometry</i>, vol. 164, 20:1-20:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2020.20\">10.4230/LIPIcs.SoCG.2020.20</a>.","ista":"Boissonnat J-D, Wintraecken M. 2020. The topological correctness of PL-approximations of isomanifolds. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 20:1-20:18.","chicago":"Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL-Approximations of Isomanifolds.” In <i>36th International Symposium on Computational Geometry</i>, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2020.20\">https://doi.org/10.4230/LIPIcs.SoCG.2020.20</a>.","short":"J.-D. Boissonnat, M. Wintraecken, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"J.-D. Boissonnat and M. Wintraecken, “The topological correctness of PL-approximations of isomanifolds,” in <i>36th International Symposium on Computational Geometry</i>, Zürich, Switzerland, 2020, vol. 164.","ama":"Boissonnat J-D, Wintraecken M. The topological correctness of PL-approximations of isomanifolds. In: <i>36th International Symposium on Computational Geometry</i>. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2020.20\">10.4230/LIPIcs.SoCG.2020.20</a>"},"author":[{"full_name":"Boissonnat, Jean-Daniel","last_name":"Boissonnat","first_name":"Jean-Daniel"},{"last_name":"Wintraecken","first_name":"Mathijs","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","conference":{"name":"SoCG: Symposium on Computational Geometry","end_date":"2020-06-26","location":"Zürich, Switzerland","start_date":"2020-06-22"},"month":"06","date_created":"2020-06-09T07:24:11Z","status":"public","article_number":"20:1-20:18","intvolume":"       164","file_date_updated":"2020-07-14T12:48:06Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","volume":164,"ec_funded":1,"department":[{"_id":"HeEd"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.SoCG.2020.20","oa_version":"Published Version","type":"conference","date_updated":"2023-08-02T06:49:16Z","day":"01","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"],"scopus_import":"1","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-143-6"]},"file":[{"file_id":"7969","date_updated":"2020-07-14T12:48:06Z","file_name":"2020_LIPIcsSoCG_Boissonnat.pdf","checksum":"38cbfa4f5d484d267a35d44d210df044","access_level":"open_access","relation":"main_file","date_created":"2020-06-17T10:13:34Z","creator":"dernst","content_type":"application/pdf","file_size":1009739}],"date_published":"2020-06-01T00:00:00Z"},{"intvolume":"        63","isi":1,"month":"06","date_created":"2020-06-14T22:00:51Z","status":"public","volume":63,"issue":"4","publisher":"Springer Nature","article_type":"original","title":"Almost all string graphs are intersection graphs of plane convex sets","publication":"Discrete and Computational Geometry","_id":"7962","oa":1,"project":[{"call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","name":"The Wittgenstein Prize"}],"abstract":[{"lang":"eng","text":"A string graph is the intersection graph of a family of continuous arcs in the plane. The intersection graph of a family of plane convex sets is a string graph, but not all string graphs can be obtained in this way. We prove the following structure theorem conjectured by Janson and Uzzell: The vertex set of almost all string graphs on n vertices can be partitioned into five cliques such that some pair of them is not connected by any edge (n→∞). We also show that every graph with the above property is an intersection graph of plane convex sets. As a corollary, we obtain that almost all string graphs on n vertices are intersection graphs of plane convex sets."}],"publication_status":"published","citation":{"apa":"Pach, J., Reed, B., &#38; Yuditsky, Y. (2020). Almost all string graphs are intersection graphs of plane convex sets. <i>Discrete and Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-020-00213-z\">https://doi.org/10.1007/s00454-020-00213-z</a>","mla":"Pach, János, et al. “Almost All String Graphs Are Intersection Graphs of Plane Convex Sets.” <i>Discrete and Computational Geometry</i>, vol. 63, no. 4, Springer Nature, 2020, pp. 888–917, doi:<a href=\"https://doi.org/10.1007/s00454-020-00213-z\">10.1007/s00454-020-00213-z</a>.","chicago":"Pach, János, Bruce Reed, and Yelena Yuditsky. “Almost All String Graphs Are Intersection Graphs of Plane Convex Sets.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s00454-020-00213-z\">https://doi.org/10.1007/s00454-020-00213-z</a>.","short":"J. Pach, B. Reed, Y. Yuditsky, Discrete and Computational Geometry 63 (2020) 888–917.","ista":"Pach J, Reed B, Yuditsky Y. 2020. Almost all string graphs are intersection graphs of plane convex sets. Discrete and Computational Geometry. 63(4), 888–917.","ieee":"J. Pach, B. Reed, and Y. Yuditsky, “Almost all string graphs are intersection graphs of plane convex sets,” <i>Discrete and Computational Geometry</i>, vol. 63, no. 4. Springer Nature, pp. 888–917, 2020.","ama":"Pach J, Reed B, Yuditsky Y. Almost all string graphs are intersection graphs of plane convex sets. <i>Discrete and Computational Geometry</i>. 2020;63(4):888-917. doi:<a href=\"https://doi.org/10.1007/s00454-020-00213-z\">10.1007/s00454-020-00213-z</a>"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1803.06710"}],"author":[{"last_name":"Pach","first_name":"János","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","full_name":"Pach, János"},{"first_name":"Bruce","last_name":"Reed","full_name":"Reed, Bruce"},{"full_name":"Yuditsky, Yelena","first_name":"Yelena","last_name":"Yuditsky"}],"quality_controlled":"1","year":"2020","scopus_import":"1","publication_identifier":{"issn":["01795376"],"eissn":["14320444"]},"arxiv":1,"external_id":{"isi":["000538229000001"],"arxiv":["1803.06710"]},"date_published":"2020-06-05T00:00:00Z","page":"888-917","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"doi":"10.1007/s00454-020-00213-z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","oa_version":"Preprint","date_updated":"2023-08-21T08:49:18Z","type":"journal_article","day":"05"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"22","oa_version":"Submitted Version","type":"conference","date_updated":"2021-01-12T08:17:06Z","department":[{"_id":"HeEd"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-43408-3_8","ec_funded":1,"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreements No 78818 Alpha and No 638176). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","page":"181-218","file":[{"relation":"main_file","date_created":"2020-10-08T08:56:14Z","file_size":2207071,"content_type":"application/pdf","creator":"dernst","success":1,"date_updated":"2020-10-08T08:56:14Z","file_id":"8628","file_name":"2020-B-01-PoissonExperimentalSurvey.pdf","checksum":"7b5e0de10675d787a2ddb2091370b8d8","access_level":"open_access"}],"date_published":"2020-06-22T00:00:00Z","scopus_import":"1","publication_identifier":{"eissn":["21978549"],"isbn":["9783030434076"],"issn":["21932808"]},"alternative_title":["Abel Symposia"],"author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner"},{"full_name":"Nikitenko, Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","first_name":"Anton","last_name":"Nikitenko"},{"first_name":"Katharina","last_name":"Ölsböck","id":"4D4AA390-F248-11E8-B48F-1D18A9856A87","full_name":"Ölsböck, Katharina"},{"first_name":"Peter","last_name":"Synak","id":"331776E2-F248-11E8-B48F-1D18A9856A87","full_name":"Synak, Peter"}],"quality_controlled":"1","citation":{"ista":"Edelsbrunner H, Nikitenko A, Ölsböck K, Synak P. 2020. Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. Topological Data Analysis. , Abel Symposia, vol. 15, 181–218.","chicago":"Edelsbrunner, Herbert, Anton Nikitenko, Katharina Ölsböck, and Peter Synak. “Radius Functions on Poisson–Delaunay Mosaics and Related Complexes Experimentally.” In <i>Topological Data Analysis</i>, 15:181–218. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-43408-3_8\">https://doi.org/10.1007/978-3-030-43408-3_8</a>.","short":"H. Edelsbrunner, A. Nikitenko, K. Ölsböck, P. Synak, in:, Topological Data Analysis, Springer Nature, 2020, pp. 181–218.","ieee":"H. Edelsbrunner, A. Nikitenko, K. Ölsböck, and P. Synak, “Radius functions on Poisson–Delaunay mosaics and related complexes experimentally,” in <i>Topological Data Analysis</i>, 2020, vol. 15, pp. 181–218.","ama":"Edelsbrunner H, Nikitenko A, Ölsböck K, Synak P. Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. In: <i>Topological Data Analysis</i>. Vol 15. Springer Nature; 2020:181-218. doi:<a href=\"https://doi.org/10.1007/978-3-030-43408-3_8\">10.1007/978-3-030-43408-3_8</a>","mla":"Edelsbrunner, Herbert, et al. “Radius Functions on Poisson–Delaunay Mosaics and Related Complexes Experimentally.” <i>Topological Data Analysis</i>, vol. 15, Springer Nature, 2020, pp. 181–218, doi:<a href=\"https://doi.org/10.1007/978-3-030-43408-3_8\">10.1007/978-3-030-43408-3_8</a>.","apa":"Edelsbrunner, H., Nikitenko, A., Ölsböck, K., &#38; Synak, P. (2020). Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. In <i>Topological Data Analysis</i> (Vol. 15, pp. 181–218). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-43408-3_8\">https://doi.org/10.1007/978-3-030-43408-3_8</a>"},"year":"2020","_id":"8135","ddc":["510"],"oa":1,"title":"Radius functions on Poisson–Delaunay mosaics and related complexes experimentally","publication":"Topological Data Analysis","abstract":[{"lang":"eng","text":"Discrete Morse theory has recently lead to new developments in the theory of random geometric complexes. This article surveys the methods and results obtained with this new approach, and discusses some of its shortcomings. It uses simulations to illustrate the results and to form conjectures, getting numerical estimates for combinatorial, topological, and geometric properties of weighted and unweighted Delaunay mosaics, their dual Voronoi tessellations, and the Alpha and Wrap complexes contained in the mosaics."}],"publication_status":"published","project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"grant_number":"638176","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020","_id":"2533E772-B435-11E9-9278-68D0E5697425"},{"grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"volume":15,"publisher":"Springer Nature","file_date_updated":"2020-10-08T08:56:14Z","intvolume":"        15","status":"public","month":"06","date_created":"2020-07-19T22:00:59Z"},{"acknowledgement":"The authors are greatly indebted to Dror Atariah, Günther Rote and John Sullivan for discussion and suggestions. The authors also thank Jean-Daniel Boissonnat, Ramsay Dyer, David de Laat and Rien van de Weijgaert for discussion. This work has been supported in part by the European Union’s Seventh Framework Programme for Research of the\r\nEuropean Commission, under FET-Open grant number 255827 (CGL Computational Geometry Learning) and ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometry Understanding in Higher Dimensions), the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement number 754411,and the Austrian Science Fund (FWF): Z00342 N31.","has_accepted_license":"1","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"doi":"10.1556/012.2020.57.2.1454","ec_funded":1,"day":"24","oa_version":"Published Version","date_updated":"2023-10-10T13:05:27Z","type":"journal_article","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","publication_identifier":{"issn":["0081-6906"],"eissn":["1588-2896"]},"page":"193-199","external_id":{"isi":["000570978400005"]},"file":[{"date_created":"2020-07-24T07:09:06Z","relation":"main_file","creator":"mwintrae","content_type":"application/pdf","file_size":1476072,"date_updated":"2020-07-24T07:09:06Z","file_id":"8164","access_level":"open_access","file_name":"57-2-05_4214-1454Vegter-Wintraecken_OpenAccess_CC-BY-NC.pdf"}],"date_published":"2020-07-24T00:00:00Z","abstract":[{"lang":"eng","text":"Fejes Tóth [3] studied approximations of smooth surfaces in three-space by piecewise flat triangular meshes with a given number of vertices on the surface that are optimal with respect to Hausdorff distance. He proves that this Hausdorff distance decreases inversely proportional with the number of vertices of the approximating mesh if the surface is convex. He also claims that this Hausdorff distance is inversely proportional to the square of the number of vertices for a specific non-convex surface, namely a one-sheeted hyperboloid of revolution bounded by two congruent circles. We refute this claim, and show that the asymptotic behavior of the Hausdorff distance is linear, that is the same as for convex surfaces."}],"publication_status":"published","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"},{"name":"The Wittgenstein Prize","grant_number":"Z00342","call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425"}],"_id":"8163","ddc":["510"],"oa":1,"publication":"Studia Scientiarum Mathematicarum Hungarica","title":"Refutation of a claim made by Fejes Tóth on the accuracy of surface meshes","year":"2020","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"author":[{"last_name":"Vegter","first_name":"Gert","full_name":"Vegter, Gert"},{"orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","first_name":"Mathijs"}],"quality_controlled":"1","citation":{"apa":"Vegter, G., &#38; Wintraecken, M. (2020). Refutation of a claim made by Fejes Tóth on the accuracy of surface meshes. <i>Studia Scientiarum Mathematicarum Hungarica</i>. Akadémiai Kiadó. <a href=\"https://doi.org/10.1556/012.2020.57.2.1454\">https://doi.org/10.1556/012.2020.57.2.1454</a>","mla":"Vegter, Gert, and Mathijs Wintraecken. “Refutation of a Claim Made by Fejes Tóth on the Accuracy of Surface Meshes.” <i>Studia Scientiarum Mathematicarum Hungarica</i>, vol. 57, no. 2, Akadémiai Kiadó, 2020, pp. 193–99, doi:<a href=\"https://doi.org/10.1556/012.2020.57.2.1454\">10.1556/012.2020.57.2.1454</a>.","ista":"Vegter G, Wintraecken M. 2020. Refutation of a claim made by Fejes Tóth on the accuracy of surface meshes. Studia Scientiarum Mathematicarum Hungarica. 57(2), 193–199.","short":"G. Vegter, M. Wintraecken, Studia Scientiarum Mathematicarum Hungarica 57 (2020) 193–199.","chicago":"Vegter, Gert, and Mathijs Wintraecken. “Refutation of a Claim Made by Fejes Tóth on the Accuracy of Surface Meshes.” <i>Studia Scientiarum Mathematicarum Hungarica</i>. Akadémiai Kiadó, 2020. <a href=\"https://doi.org/10.1556/012.2020.57.2.1454\">https://doi.org/10.1556/012.2020.57.2.1454</a>.","ama":"Vegter G, Wintraecken M. Refutation of a claim made by Fejes Tóth on the accuracy of surface meshes. <i>Studia Scientiarum Mathematicarum Hungarica</i>. 2020;57(2):193-199. doi:<a href=\"https://doi.org/10.1556/012.2020.57.2.1454\">10.1556/012.2020.57.2.1454</a>","ieee":"G. Vegter and M. Wintraecken, “Refutation of a claim made by Fejes Tóth on the accuracy of surface meshes,” <i>Studia Scientiarum Mathematicarum Hungarica</i>, vol. 57, no. 2. Akadémiai Kiadó, pp. 193–199, 2020."},"status":"public","month":"07","date_created":"2020-07-24T07:09:18Z","isi":1,"intvolume":"        57","article_type":"original","publisher":"Akadémiai Kiadó","file_date_updated":"2020-07-24T07:09:06Z","volume":57,"issue":"2"},{"day":"01","oa_version":"Published Version","type":"journal_article","date_updated":"2024-03-04T10:54:04Z","article_processing_charge":"Yes (via OA deal)","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This research has been supported by the DFG Collaborative Research Center SFB/TRR 109 “Discretization in Geometry and Dynamics”, by Polish MNiSzW Grant No. 2621/7.PR/12/2013/2, by the Polish National Science Center under Maestro Grant No. 2014/14/A/ST1/00453 and Grant No. DEC-2013/09/N/ST6/02995. Open Access funding provided by Projekt DEAL.","department":[{"_id":"HeEd"}],"has_accepted_license":"1","doi":"10.1007/s41468-020-00058-8","language":[{"iso":"eng"}],"page":"455-480","file":[{"relation":"main_file","date_created":"2024-03-04T10:52:42Z","file_size":851190,"content_type":"application/pdf","creator":"dernst","success":1,"file_id":"15065","date_updated":"2024-03-04T10:52:42Z","checksum":"eed1168b6e66cd55272c19bb7fca8a1c","file_name":"2020_JourApplCompTopology_Bauer.pdf","access_level":"open_access"}],"date_published":"2020-12-01T00:00:00Z","scopus_import":"1","publication_identifier":{"eissn":["2367-1734"],"issn":["2367-1726"]},"year":"2020","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"quality_controlled":"1","author":[{"full_name":"Bauer, U.","last_name":"Bauer","first_name":"U."},{"last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"id":"4483EF78-F248-11E8-B48F-1D18A9856A87","full_name":"Jablonski, Grzegorz","orcid":"0000-0002-3536-9866","first_name":"Grzegorz","last_name":"Jablonski"},{"full_name":"Mrozek, M.","last_name":"Mrozek","first_name":"M."}],"citation":{"mla":"Bauer, U., et al. “Čech-Delaunay Gradient Flow and Homology Inference for Self-Maps.” <i>Journal of Applied and Computational Topology</i>, vol. 4, no. 4, Springer Nature, 2020, pp. 455–80, doi:<a href=\"https://doi.org/10.1007/s41468-020-00058-8\">10.1007/s41468-020-00058-8</a>.","apa":"Bauer, U., Edelsbrunner, H., Jablonski, G., &#38; Mrozek, M. (2020). Čech-Delaunay gradient flow and homology inference for self-maps. <i>Journal of Applied and Computational Topology</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s41468-020-00058-8\">https://doi.org/10.1007/s41468-020-00058-8</a>","chicago":"Bauer, U., Herbert Edelsbrunner, Grzegorz Jablonski, and M. Mrozek. “Čech-Delaunay Gradient Flow and Homology Inference for Self-Maps.” <i>Journal of Applied and Computational Topology</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s41468-020-00058-8\">https://doi.org/10.1007/s41468-020-00058-8</a>.","short":"U. Bauer, H. Edelsbrunner, G. Jablonski, M. Mrozek, Journal of Applied and Computational Topology 4 (2020) 455–480.","ista":"Bauer U, Edelsbrunner H, Jablonski G, Mrozek M. 2020. Čech-Delaunay gradient flow and homology inference for self-maps. Journal of Applied and Computational Topology. 4(4), 455–480.","ama":"Bauer U, Edelsbrunner H, Jablonski G, Mrozek M. Čech-Delaunay gradient flow and homology inference for self-maps. <i>Journal of Applied and Computational Topology</i>. 2020;4(4):455-480. doi:<a href=\"https://doi.org/10.1007/s41468-020-00058-8\">10.1007/s41468-020-00058-8</a>","ieee":"U. Bauer, H. Edelsbrunner, G. Jablonski, and M. Mrozek, “Čech-Delaunay gradient flow and homology inference for self-maps,” <i>Journal of Applied and Computational Topology</i>, vol. 4, no. 4. Springer Nature, pp. 455–480, 2020."},"abstract":[{"text":"We call a continuous self-map that reveals itself through a discrete set of point-value pairs a sampled dynamical system. Capturing the available information with chain maps on Delaunay complexes, we use persistent homology to quantify the evidence of recurrent behavior. We establish a sampling theorem to recover the eigenspaces of the endomorphism on homology induced by the self-map. Using a combinatorial gradient flow arising from the discrete Morse theory for Čech and Delaunay complexes, we construct a chain map to transform the problem from the natural but expensive Čech complexes to the computationally efficient Delaunay triangulations. The fast chain map algorithm has applications beyond dynamical systems.","lang":"eng"}],"publication_status":"published","_id":"15064","oa":1,"ddc":["500"],"publication":"Journal of Applied and Computational Topology","title":"Čech-Delaunay gradient flow and homology inference for self-maps","article_type":"original","publisher":"Springer Nature","file_date_updated":"2024-03-04T10:52:42Z","volume":4,"issue":"4","status":"public","month":"12","date_created":"2024-03-04T10:47:49Z","intvolume":"         4"},{"status":"public","date_created":"2021-07-04T22:01:26Z","month":"12","intvolume":"        11","article_type":"original","publisher":"Carleton University","file_date_updated":"2021-08-11T11:55:11Z","issue":"2","volume":11,"publication_status":"published","abstract":[{"text":"Various kinds of data are routinely represented as discrete probability distributions. Examples include text documents summarized by histograms of word occurrences and images represented as histograms of oriented gradients. Viewing a discrete probability distribution as a point in the standard simplex of the appropriate dimension, we can understand collections of such objects in geometric and topological terms.  Importantly, instead of using the standard Euclidean distance, we look into dissimilarity measures with information-theoretic justification, and we develop the theory needed for applying topological data analysis in this setting. In doing so, we emphasize constructions that enable the usage of existing computational topology software in this context.","lang":"eng"}],"project":[{"name":"Discretization in Geometry and Dynamics","grant_number":"I4887","_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316"}],"oa":1,"ddc":["510","000"],"_id":"9630","title":"Topological data analysis in information space","publication":"Journal of Computational Geometry","year":"2020","tmp":{"short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png"},"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner"},{"last_name":"Virk","first_name":"Ziga","full_name":"Virk, Ziga","id":"2E36B656-F248-11E8-B48F-1D18A9856A87"},{"id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Hubert","first_name":"Hubert","last_name":"Wagner"}],"quality_controlled":"1","citation":{"mla":"Edelsbrunner, Herbert, et al. “Topological Data Analysis in Information Space.” <i>Journal of Computational Geometry</i>, vol. 11, no. 2, Carleton University, 2020, pp. 162–82, doi:<a href=\"https://doi.org/10.20382/jocg.v11i2a7\">10.20382/jocg.v11i2a7</a>.","apa":"Edelsbrunner, H., Virk, Z., &#38; Wagner, H. (2020). Topological data analysis in information space. <i>Journal of Computational Geometry</i>. Carleton University. <a href=\"https://doi.org/10.20382/jocg.v11i2a7\">https://doi.org/10.20382/jocg.v11i2a7</a>","ieee":"H. Edelsbrunner, Z. Virk, and H. Wagner, “Topological data analysis in information space,” <i>Journal of Computational Geometry</i>, vol. 11, no. 2. Carleton University, pp. 162–182, 2020.","ama":"Edelsbrunner H, Virk Z, Wagner H. Topological data analysis in information space. <i>Journal of Computational Geometry</i>. 2020;11(2):162-182. doi:<a href=\"https://doi.org/10.20382/jocg.v11i2a7\">10.20382/jocg.v11i2a7</a>","short":"H. Edelsbrunner, Z. Virk, H. Wagner, Journal of Computational Geometry 11 (2020) 162–182.","chicago":"Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data Analysis in Information Space.” <i>Journal of Computational Geometry</i>. Carleton University, 2020. <a href=\"https://doi.org/10.20382/jocg.v11i2a7\">https://doi.org/10.20382/jocg.v11i2a7</a>.","ista":"Edelsbrunner H, Virk Z, Wagner H. 2020. Topological data analysis in information space. Journal of Computational Geometry. 11(2), 162–182."},"publication_identifier":{"eissn":["1920180X"]},"scopus_import":"1","page":"162-182","date_published":"2020-12-14T00:00:00Z","file":[{"access_level":"open_access","checksum":"f02d0b2b3838e7891a6c417fc34ffdcd","file_name":"2020_JournalOfComputationalGeometry_Edelsbrunner.pdf","file_id":"9882","date_updated":"2021-08-11T11:55:11Z","success":1,"file_size":1449234,"creator":"asandaue","content_type":"application/pdf","date_created":"2021-08-11T11:55:11Z","relation":"main_file"}],"acknowledgement":"This research is partially supported by the Office of Naval Research, through grant no. N62909-18-1-2038, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","doi":"10.20382/jocg.v11i2a7","language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"HeEd"}],"day":"14","date_updated":"2021-08-11T12:26:34Z","type":"journal_article","oa_version":"Published Version","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","article_processing_charge":"Yes"}]