[{"date_created":"2020-09-28T08:59:27Z","date_updated":"2023-08-22T09:33:34Z","doi":"10.1109/ESGCO49734.2020.9158054","isi":1,"publication_status":"published","month":"08","year":"2020","conference":{"end_date":"2020-07-15","location":"Pisa, Italy","name":"ESGCO: European Study Group on Cardiovascular Oscillations","start_date":"2020-07-15"},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"None","date_published":"2020-08-01T00:00:00Z","author":[{"last_name":"Graff","first_name":"Grzegorz","full_name":"Graff, Grzegorz"},{"first_name":"Beata","last_name":"Graff","full_name":"Graff, Beata"},{"last_name":"Jablonski","orcid":"0000-0002-3536-9866","first_name":"Grzegorz","id":"4483EF78-F248-11E8-B48F-1D18A9856A87","full_name":"Jablonski, Grzegorz"},{"full_name":"Narkiewicz, Krzysztof","first_name":"Krzysztof","last_name":"Narkiewicz"}],"title":"The application of persistent homology in the analysis of heart rate variability","department":[{"_id":"HeEd"}],"type":"conference","scopus_import":"1","_id":"8580","publisher":"IEEE","article_processing_charge":"No","external_id":{"isi":["000621172600045"]},"article_number":"9158054","quality_controlled":"1","fulldoi":"https://doi.org/10.1109/ESGCO49734.2020.9158054","citation":{"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>","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>.","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>","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.","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.","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>."},"publication_identifier":{"isbn":["9781728157511"]},"language":[{"iso":"eng"}],"status":"public","abstract":[{"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.","lang":"eng"}],"day":"01","publication":"11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, "},{"language":[{"iso":"eng"}],"license":"https://creativecommons.org/licenses/by/3.0/","status":"public","intvolume":"       173","abstract":[{"lang":"eng","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. "}],"publication":"28th Annual European Symposium on Algorithms","volume":173,"_id":"8703","article_processing_charge":"No","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","article_number":"75","alternative_title":["LIPIcs"],"quality_controlled":"1","date_published":"2020-08-26T00:00:00Z","author":[{"first_name":"Georg F","orcid":"0000-0002-8882-5116","last_name":"Osang","full_name":"Osang, Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rouxel-Labbé, Mael","last_name":"Rouxel-Labbé","first_name":"Mael"},{"first_name":"Monique","last_name":"Teillaud","full_name":"Teillaud, Monique"}],"title":"Generalizing CGAL periodic Delaunay triangulations","publication_status":"published","year":"2020","has_accepted_license":"1","file":[{"date_created":"2020-10-27T14:31:52Z","relation":"main_file","date_updated":"2020-10-27T14:31:52Z","file_name":"2020_LIPIcs_Osang.pdf","file_size":733291,"file_id":"8712","checksum":"fe0f7c49a99ed870c671b911e10d5496","content_type":"application/pdf","creator":"cziletti","success":1,"access_level":"open_access"}],"file_date_updated":"2020-10-27T14:31:52Z","day":"26","oa":1,"scopus_import":"1","tmp":{"short":"CC BY (3.0)","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","image":"/images/cc_by.png"},"fulldoi":"https://doi.org/10.4230/LIPIcs.ESA.2020.75","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771627"]},"citation":{"short":"G.F. Osang, M. Rouxel-Labbé, M. Teillaud, in:, 28th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","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>.","ista":"Osang GF, Rouxel-Labbé M, Teillaud M. 2020. Generalizing CGAL periodic Delaunay triangulations. 28th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 173, 75.","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>","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>"},"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"9056"}]},"project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"department":[{"_id":"HeEd"}],"ec_funded":1,"type":"conference","date_created":"2020-10-25T23:01:18Z","doi":"10.4230/LIPIcs.ESA.2020.75","date_updated":"2026-04-08T07:01:29Z","month":"08","conference":{"start_date":"2020-09-07","name":"ESA: European Symposium on Algorithms","location":"Virtual, Online; Pisa, Italy","end_date":"2020-09-09"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","oa_version":"Published Version","ddc":["000"]},{"publication_status":"published","has_accepted_license":"1","year":"2020","title":"The weighted Gaussian curvature derivative of a space-filling diagram","author":[{"full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","first_name":"Arseniy","last_name":"Akopyan"},{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"}],"date_published":"2020-07-21T00:00:00Z","issue":"1","external_id":{"arxiv":["1908.06777"]},"quality_controlled":"1","_id":"9156","article_processing_charge":"No","publisher":"De Gruyter","volume":8,"publication":"Computational and Mathematical Biophysics","abstract":[{"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.","lang":"eng"}],"license":"https://creativecommons.org/licenses/by/4.0/","intvolume":"         8","status":"public","language":[{"iso":"eng"}],"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).","month":"07","oa_version":"Published Version","ddc":["510"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","arxiv":1,"date_created":"2021-02-17T15:12:44Z","date_updated":"2025-04-14T07:48:34Z","doi":"10.1515/cmb-2020-0101","ec_funded":1,"department":[{"_id":"HeEd"}],"type":"journal_article","project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Persistence and stability of geometric complexes"}],"page":"74-88","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"fulldoi":"https://doi.org/10.1515/cmb-2020-0101","publication_identifier":{"issn":["2544-7297"]},"citation":{"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>","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>","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.","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.","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>."},"scopus_import":"1","oa":1,"article_type":"original","day":"21","file":[{"date_updated":"2021-02-19T13:33:19Z","relation":"main_file","date_created":"2021-02-19T13:33:19Z","file_id":"9170","file_size":707452,"file_name":"2020_CompMathBiophysics_Akopyan.pdf","checksum":"ca43a7440834eab6bbea29c59b56ef3a","creator":"dernst","content_type":"application/pdf","success":1,"access_level":"open_access"}],"file_date_updated":"2021-02-19T13:33:19Z"},{"oa_version":"Published Version","ddc":["510"],"corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","doi":"10.1515/cmb-2020-0100","date_created":"2021-02-17T15:13:01Z","date_updated":"2025-04-14T07:48:35Z","type":"journal_article","ec_funded":1,"department":[{"_id":"HeEd"}],"project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I02979-N35"}],"page":"51-67","fulldoi":"https://doi.org/10.1515/cmb-2020-0100","publication_identifier":{"issn":["2544-7297"]},"citation":{"short":"A. Akopyan, H. Edelsbrunner, Computational and Mathematical Biophysics 8 (2020) 51–67.","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>.","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>","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>.","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>","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."},"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"day":"20","article_type":"original","file_date_updated":"2021-02-19T13:56:24Z","file":[{"checksum":"cea41de9937d07a3b927d71ee8b4e432","creator":"dernst","content_type":"application/pdf","date_created":"2021-02-19T13:56:24Z","date_updated":"2021-02-19T13:56:24Z","relation":"main_file","file_id":"9171","file_size":562359,"file_name":"2020_CompMathBiophysics_Akopyan2.pdf","access_level":"open_access","success":1}],"has_accepted_license":"1","year":"2020","publication_status":"published","title":"The weighted mean curvature derivative of a space-filling diagram","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","first_name":"Herbert","last_name":"Edelsbrunner"}],"date_published":"2020-06-20T00:00:00Z","quality_controlled":"1","issue":"1","publisher":"De Gruyter","article_processing_charge":"No","_id":"9157","volume":8,"publication":"Computational and Mathematical Biophysics","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."}],"intvolume":"         8","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).","language":[{"iso":"eng"}],"status":"public"},{"oa":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"fulldoi":"https://doi.org/10.1515/mathm-2020-0106","publication_identifier":{"issn":["2353-3390"]},"citation":{"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>","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.","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>.","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.","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>.","short":"R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, Mathematical Morphology - Theory and Applications 4 (2020) 143–158."},"file":[{"access_level":"open_access","success":1,"checksum":"4a1043fa0548a725d464017fe2483ce0","creator":"dernst","content_type":"application/pdf","date_created":"2021-03-22T08:56:37Z","relation":"main_file","date_updated":"2021-03-22T08:56:37Z","file_id":"9272","file_size":3668725,"file_name":"2020_MathMorpholTheoryAppl_Biswas.pdf"}],"file_date_updated":"2021-03-22T08:56:37Z","article_type":"original","day":"17","date_created":"2021-03-16T08:55:19Z","doi":"10.1515/mathm-2020-0106","date_updated":"2025-04-14T07:48:35Z","month":"11","ddc":["510"],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","page":"143-158","project":[{"call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","name":"Alpha Shape Theory Extended"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes"}],"ec_funded":1,"department":[{"_id":"HeEd"}],"type":"journal_article","_id":"9249","article_processing_charge":"No","publisher":"De Gruyter","issue":"1","quality_controlled":"1","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"}],"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. ","language":[{"iso":"eng"}],"intvolume":"         4","status":"public","volume":4,"publication":"Mathematical Morphology - Theory and Applications","publication_status":"published","has_accepted_license":"1","year":"2020","date_published":"2020-11-17T00:00:00Z","author":[{"full_name":"Biswas, Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas","orcid":"0000-0002-5372-7890","first_name":"Ranita"},{"full_name":"Largeteau-Skapin, Gaëlle","last_name":"Largeteau-Skapin","first_name":"Gaëlle"},{"first_name":"Rita","last_name":"Zrour","full_name":"Zrour, Rita"},{"full_name":"Andres, Eric","first_name":"Eric","last_name":"Andres"}],"title":"Digital objects in rhombic dodecahedron grid"},{"day":"20","scopus_import":"1","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2006.14908","open_access":"1"}],"citation":{"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.","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>.","short":"J. Pach, G. Tardos, G. Tóth, in:, 28th International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2020, 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>","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.","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>."},"fulldoi":"https://doi.org/10.1007/978-3-030-68766-3_28","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783030687656"]},"project":[{"name":"Mathematics, Computer Science","call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342"}],"page":"359-371","department":[{"_id":"HeEd"}],"type":"conference","doi":"10.1007/978-3-030-68766-3_28","date_created":"2021-03-28T22:01:44Z","date_updated":"2025-04-15T07:16:52Z","month":"09","conference":{"location":"Virtual, Online","end_date":"2020-09-18","start_date":"2020-09-16","name":"GD: Graph Drawing and Network Visualization"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"oa_version":"Preprint","language":[{"iso":"eng"}],"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.","intvolume":"     12590","status":"public","abstract":[{"lang":"eng","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⟶∞ ."}],"publication":"28th International Symposium on Graph Drawing and Network Visualization","volume":12590,"_id":"9299","article_processing_charge":"No","publisher":"Springer Nature","external_id":{"arxiv":["2006.14908"]},"quality_controlled":"1","date_published":"2020-09-20T00:00:00Z","author":[{"first_name":"János","last_name":"Pach","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","full_name":"Pach, János"},{"full_name":"Tardos, Gábor","last_name":"Tardos","first_name":"Gábor"},{"last_name":"Tóth","first_name":"Géza","full_name":"Tóth, Géza"}],"series_title":"LNCS","title":"Crossings between non-homotopic edges","publication_status":"published","year":"2020"},{"publication":"Journal of Computational Geometry","volume":11,"language":[{"iso":"eng"}],"intvolume":"        11","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).","status":"public","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"}],"quality_controlled":"1","issue":"2","article_processing_charge":"Yes","publisher":"Carleton University","_id":"9630","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"full_name":"Virk, Ziga","id":"2E36B656-F248-11E8-B48F-1D18A9856A87","first_name":"Ziga","last_name":"Virk"},{"last_name":"Wagner","orcid":"0009-0009-9111-8429","first_name":"Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Hubert"}],"title":"Topological data analysis in information space","date_published":"2020-12-14T00:00:00Z","year":"2020","has_accepted_license":"1","publication_status":"published","day":"14","article_type":"original","file_date_updated":"2021-08-11T11:55:11Z","file":[{"access_level":"open_access","success":1,"creator":"asandaue","content_type":"application/pdf","checksum":"f02d0b2b3838e7891a6c417fc34ffdcd","file_id":"9882","file_name":"2020_JournalOfComputationalGeometry_Edelsbrunner.pdf","file_size":1449234,"relation":"main_file","date_created":"2021-08-11T11:55:11Z","date_updated":"2021-08-11T11:55:11Z"}],"publication_identifier":{"eissn":["1920-180X"]},"fulldoi":"https://doi.org/10.20382/jocg.v11i2a7","citation":{"short":"H. Edelsbrunner, Z. Virk, H. Wagner, Journal of Computational Geometry 11 (2020) 162–182.","ista":"Edelsbrunner H, Virk Z, Wagner H. 2020. Topological data analysis in information space. Journal of Computational Geometry. 11(2), 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>.","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>","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."},"tmp":{"short":"CC BY (3.0)","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","image":"/images/cc_by.png"},"scopus_import":"1","oa":1,"type":"journal_article","department":[{"_id":"HeEd"}],"project":[{"grant_number":"I4887","_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316","name":"Persistent Homology, Algorithms and Stochastic Geometry"}],"page":"162-182","corr_author":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa_version":"Published Version","ddc":["510","000"],"month":"12","date_updated":"2026-04-02T14:35:31Z","doi":"10.20382/jocg.v11i2a7","date_created":"2021-07-04T22:01:26Z"},{"author":[{"first_name":"Arseniy","orcid":"0000-0002-2548-617X","last_name":"Akopyan","full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Karasev, Roman","first_name":"Roman","last_name":"Karasev"}],"series_title":"LNM","title":"Gromov's waist of non-radial Gaussian measures and radial non-Gaussian measures","date_published":"2020-06-21T00:00:00Z","publication_status":"published","year":"2020","isi":1,"publication":"Geometric Aspects of Functional Analysis","volume":2256,"language":[{"iso":"eng"}],"status":"public","intvolume":"      2256","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"}],"external_id":{"isi":["000557689300003"],"arxiv":["1808.07350"]},"quality_controlled":"1","_id":"74","article_processing_charge":"No","publisher":"Springer Nature","department":[{"_id":"HeEd"},{"_id":"JaMa"}],"ec_funded":1,"type":"book_chapter","project":[{"grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics"}],"page":"1-27","month":"06","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","doi":"10.1007/978-3-030-36020-7_1","date_updated":"2025-07-10T11:54:33Z","date_created":"2018-12-11T11:44:29Z","day":"21","editor":[{"last_name":"Klartag","first_name":"Bo'az","full_name":"Klartag, Bo'az"},{"last_name":"Milman","first_name":"Emanuel","full_name":"Milman, Emanuel"}],"fulldoi":"https://doi.org/10.1007/978-3-030-36020-7_1","citation":{"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>.","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>","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>","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>.","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.","short":"A. Akopyan, R. Karasev, in:, B. Klartag, E. Milman (Eds.), Geometric Aspects of Functional Analysis, Springer Nature, 2020, pp. 1–27."},"publication_identifier":{"isbn":["9783030360191"],"issn":["0075-8434"],"eisbn":["9783030360207"],"eissn":["1617-9692"]},"oa":1,"scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1808.07350","open_access":"1"}]},{"article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","_id":"7460","alternative_title":["ISTA Thesis"],"keyword":["shape reconstruction","hole manipulation","ordered complexes","Alpha complex","Wrap complex","computational topology","Bregman geometry"],"degree_awarded":"PhD","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."}],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","language":[{"iso":"eng"}],"status":"public","has_accepted_license":"1","year":"2020","publication_status":"published","date_published":"2020-02-10T00:00:00Z","title":"The hole system of triangulated shapes","author":[{"id":"4D4AA390-F248-11E8-B48F-1D18A9856A87","full_name":"Ölsböck, Katharina","last_name":"Ölsböck","orcid":"0000-0002-4672-8297","first_name":"Katharina"}],"OA_place":"publisher","oa":1,"fulldoi":"https://doi.org/10.15479/AT:ISTA:7460","publication_identifier":{"issn":["2663-337X"]},"supervisor":[{"orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"citation":{"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.","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>","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>.","ista":"Ölsböck K. 2020. The hole system of triangulated shapes. Institute of Science and Technology Austria.","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."},"tmp":{"short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png"},"file_date_updated":"2020-07-14T12:47:58Z","file":[{"access_level":"open_access","content_type":"application/pdf","creator":"koelsboe","checksum":"1df9f8c530b443c0e63a3f2e4fde412e","file_name":"thesis_ist-final_noack.pdf","file_size":76195184,"file_id":"7461","relation":"main_file","date_updated":"2020-07-14T12:47:58Z","date_created":"2020-02-06T14:43:54Z"},{"access_level":"closed","date_created":"2020-02-06T14:52:45Z","relation":"source_file","date_updated":"2020-07-14T12:47:58Z","file_id":"7462","file_size":122103715,"file_name":"latex-files.zip","description":"latex source files, figures","checksum":"7a52383c812b0be64d3826546509e5a4","creator":"koelsboe","content_type":"application/x-zip-compressed"}],"day":"10","date_created":"2020-02-06T14:56:53Z","doi":"10.15479/AT:ISTA:7460","date_updated":"2026-04-08T07:23:21Z","oa_version":"Published Version","ddc":["514"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","corr_author":"1","month":"02","page":"155","related_material":{"record":[{"id":"6608","relation":"part_of_dissertation","status":"public"}]},"type":"dissertation","department":[{"_id":"HeEd"},{"_id":"GradSch"}]},{"date_published":"2020-02-13T00:00:00Z","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nikitenko, Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","last_name":"Nikitenko","orcid":"0000-0002-0659-3201","first_name":"Anton"}],"title":"Weighted Poisson–Delaunay mosaics","isi":1,"publication_status":"published","year":"2020","intvolume":"        64","language":[{"iso":"eng"}],"status":"public","abstract":[{"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$.","lang":"eng"}],"publication":"Theory of Probability and its Applications","volume":64,"_id":"7554","publisher":"SIAM","article_processing_charge":"No","external_id":{"arxiv":["1705.08735"],"isi":["000551393100007"]},"issue":"4","quality_controlled":"1","page":"595-614","project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"department":[{"_id":"HeEd"}],"ec_funded":1,"type":"journal_article","date_created":"2020-03-01T23:00:39Z","date_updated":"2025-07-10T11:54:44Z","doi":"10.1137/S0040585X97T989726","month":"02","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","article_type":"original","day":"13","scopus_import":"1","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1705.08735","open_access":"1"}],"fulldoi":"https://doi.org/10.1137/S0040585X97T989726","publication_identifier":{"issn":["0040-585X"],"eissn":["1095-7219"]},"citation":{"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.","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>.","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>","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.","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>."}},{"abstract":[{"text":"The input to the token swapping problem is a graph with vertices v1, v2, . . . , vn, and n tokens with labels 1,2, . . . , n, one on each vertex.  The goal is to get token i to vertex vi for all i= 1, . . . , n using a minimum number of swaps, where a swap exchanges the tokens on the endpoints of an edge.Token swapping on a tree, also known as “sorting with a transposition tree,” is not known to be in P nor NP-complete.  We present some partial results:\r\n1.  An optimum swap sequence may need to perform a swap on a leaf vertex that has the correct token (a “happy leaf”), disproving a conjecture of Vaughan.\r\n2.  Any algorithm that fixes happy leaves—as all known approximation algorithms for the problem do—has approximation factor at least 4/3.  Furthermore, the two best-known 2-approximation algorithms have approximation factor exactly 2.\r\n3.  A generalized problem—weighted coloured token swapping—is NP-complete on trees, but solvable in polynomial time on paths and stars.  In this version, tokens and  vertices  have  colours,  and  colours  have  weights.   The  goal  is  to  get  every token to a vertex of the same colour, and the cost of a swap is the sum of the weights of the two tokens involved.","lang":"eng"}],"status":"public","language":[{"iso":"eng"}],"day":"16","publication":"arXiv","main_file_link":[{"url":"https://arxiv.org/abs/1903.06981","open_access":"1"}],"_id":"7950","oa":1,"article_processing_charge":"No","article_number":"1903.06981","external_id":{"arxiv":["1903.06981"]},"citation":{"apa":"Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D., … Turcotte, A. (n.d.). Token swapping on trees. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1903.06981\">https://doi.org/10.48550/arXiv.1903.06981</a>","ieee":"A. Biniaz <i>et al.</i>, “Token swapping on trees,” <i>arXiv</i>. .","mla":"Biniaz, Ahmad, et al. “Token Swapping on Trees.” <i>ArXiv</i>, 1903.06981, doi:<a href=\"https://doi.org/10.48550/arXiv.1903.06981\">10.48550/arXiv.1903.06981</a>.","ama":"Biniaz A, Jain K, Lubiw A, et al. Token swapping on trees. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1903.06981\">10.48550/arXiv.1903.06981</a>","chicago":"Biniaz, Ahmad, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, and Alexi Turcotte. “Token Swapping on Trees.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1903.06981\">https://doi.org/10.48550/arXiv.1903.06981</a>.","ista":"Biniaz A, Jain K, Lubiw A, Masárová Z, Miltzow T, Mondal D, Naredla AM, Tkadlec J, Turcotte A. Token swapping on trees. arXiv, 1903.06981.","short":"A. Biniaz, K. Jain, A. Lubiw, Z. Masárová, T. Miltzow, D. Mondal, A.M. Naredla, J. Tkadlec, A. Turcotte, ArXiv (n.d.)."},"fulldoi":"https://doi.org/10.48550/arXiv.1903.06981","related_material":{"record":[{"id":"12833","status":"public","relation":"later_version"},{"id":"7944","status":"public","relation":"dissertation_contains"}]},"date_published":"2019-03-16T00:00:00Z","department":[{"_id":"HeEd"},{"_id":"UlWa"},{"_id":"KrCh"}],"title":"Token swapping on trees","author":[{"full_name":"Biniaz, Ahmad","first_name":"Ahmad","last_name":"Biniaz"},{"first_name":"Kshitij","last_name":"Jain","full_name":"Jain, Kshitij"},{"full_name":"Lubiw, Anna","first_name":"Anna","last_name":"Lubiw"},{"first_name":"Zuzana","orcid":"0000-0002-6660-1322","last_name":"Masárová","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","full_name":"Masárová, Zuzana"},{"full_name":"Miltzow, Tillmann","last_name":"Miltzow","first_name":"Tillmann"},{"full_name":"Mondal, Debajyoti","last_name":"Mondal","first_name":"Debajyoti"},{"first_name":"Anurag Murty","last_name":"Naredla","full_name":"Naredla, Anurag Murty"},{"last_name":"Tkadlec","first_name":"Josef","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Turcotte, Alexi","last_name":"Turcotte","first_name":"Alexi"}],"type":"preprint","doi":"10.48550/arXiv.1903.06981","date_created":"2020-06-08T12:25:25Z","date_updated":"2026-04-08T07:23:00Z","month":"03","publication_status":"draft","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2019","arxiv":1},{"oa":1,"scopus_import":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"fulldoi":"https://doi.org/10.20382/jocg.v10i1a9","publication_identifier":{"issn":["1920-180X"]},"citation":{"short":"R. Dyer, G. Vegter, M. Wintraecken, Journal of Computational Geometry  10 (2019) 223–256.","chicago":"Dyer, Ramsay, Gert Vegter, and Mathijs Wintraecken. “Simplices Modelled on Spaces of Constant Curvature.” <i>Journal of Computational Geometry </i>. Carleton University, 2019. <a href=\"https://doi.org/10.20382/jocg.v10i1a9\">https://doi.org/10.20382/jocg.v10i1a9</a>.","ista":"Dyer R, Vegter G, Wintraecken M. 2019. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 10(1), 223–256.","mla":"Dyer, Ramsay, et al. “Simplices Modelled on Spaces of Constant Curvature.” <i>Journal of Computational Geometry </i>, vol. 10, no. 1, Carleton University, 2019, pp. 223–256, doi:<a href=\"https://doi.org/10.20382/jocg.v10i1a9\">10.20382/jocg.v10i1a9</a>.","apa":"Dyer, R., Vegter, G., &#38; Wintraecken, M. (2019). Simplices modelled on spaces of constant curvature. <i>Journal of Computational Geometry </i>. Carleton University. <a href=\"https://doi.org/10.20382/jocg.v10i1a9\">https://doi.org/10.20382/jocg.v10i1a9</a>","ieee":"R. Dyer, G. Vegter, and M. Wintraecken, “Simplices modelled on spaces of constant curvature,” <i>Journal of Computational Geometry </i>, vol. 10, no. 1. Carleton University, pp. 223–256, 2019.","ama":"Dyer R, Vegter G, Wintraecken M. Simplices modelled on spaces of constant curvature. <i>Journal of Computational Geometry </i>. 2019;10(1):223–256. doi:<a href=\"https://doi.org/10.20382/jocg.v10i1a9\">10.20382/jocg.v10i1a9</a>"},"file":[{"access_level":"open_access","file_id":"6516","file_size":2170882,"file_name":"mainJournalFinal.pdf","date_created":"2019-06-03T09:30:01Z","relation":"main_file","date_updated":"2020-07-14T12:47:32Z","creator":"mwintrae","content_type":"application/pdf","checksum":"57b4df2f16a74eb499734ec8ee240178"}],"file_date_updated":"2020-07-14T12:47:32Z","day":"01","doi":"10.20382/jocg.v10i1a9","date_created":"2019-06-03T09:35:33Z","date_updated":"2021-01-12T08:07:50Z","month":"07","ddc":["510"],"oa_version":"Published Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","page":"223–256","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"ec_funded":1,"department":[{"_id":"HeEd"}],"type":"journal_article","_id":"6515","publisher":"Carleton University","issue":"1","quality_controlled":"1","abstract":[{"lang":"eng","text":"We give non-degeneracy criteria for Riemannian simplices based on simplices in spaces of constant sectional curvature. It extends previous work on Riemannian simplices, where we developed Riemannian simplices with respect to Euclidean reference simplices. The criteria we give in this article are in terms of quality measures for spaces of constant curvature that we develop here. We see that simplices in spaces that have nearly constant curvature, are already non-degenerate under very weak quality demands. This is of importance because it allows for sampling of Riemannian manifolds based on anisotropy of the manifold and not (absolute) curvature."}],"status":"public","intvolume":"        10","language":[{"iso":"eng"}],"volume":10,"publication":"Journal of Computational Geometry ","publication_status":"published","has_accepted_license":"1","year":"2019","date_published":"2019-07-01T00:00:00Z","title":"Simplices modelled on spaces of constant curvature","author":[{"full_name":"Dyer, Ramsay","first_name":"Ramsay","last_name":"Dyer"},{"last_name":"Vegter","first_name":"Gert","full_name":"Vegter, Gert"},{"id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","full_name":"Wintraecken, Mathijs","first_name":"Mathijs","orcid":"0000-0002-7472-2220","last_name":"Wintraecken"}]},{"file_date_updated":"2020-07-14T12:47:34Z","file":[{"checksum":"7c99be505dc7533257d42eb1830cef04","content_type":"application/pdf","creator":"kschuh","date_updated":"2020-07-14T12:47:34Z","relation":"main_file","date_created":"2019-07-08T15:24:26Z","file_size":2665013,"file_name":"Elsevier_2019_Edelsbrunner.pdf","file_id":"6624","access_level":"open_access"}],"day":"01","scopus_import":"1","oa":1,"fulldoi":"https://doi.org/10.1016/j.cagd.2019.06.003","citation":{"ieee":"H. Edelsbrunner and K. Ölsböck, “Holes and dependences in an ordered complex,” <i>Computer Aided Geometric Design</i>, vol. 73. Elsevier, pp. 1–15, 2019.","mla":"Edelsbrunner, Herbert, and Katharina Ölsböck. “Holes and Dependences in an Ordered Complex.” <i>Computer Aided Geometric Design</i>, vol. 73, Elsevier, 2019, pp. 1–15, doi:<a href=\"https://doi.org/10.1016/j.cagd.2019.06.003\">10.1016/j.cagd.2019.06.003</a>.","apa":"Edelsbrunner, H., &#38; Ölsböck, K. (2019). Holes and dependences in an ordered complex. <i>Computer Aided Geometric Design</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cagd.2019.06.003\">https://doi.org/10.1016/j.cagd.2019.06.003</a>","ama":"Edelsbrunner H, Ölsböck K. Holes and dependences in an ordered complex. <i>Computer Aided Geometric Design</i>. 2019;73:1-15. doi:<a href=\"https://doi.org/10.1016/j.cagd.2019.06.003\">10.1016/j.cagd.2019.06.003</a>","short":"H. Edelsbrunner, K. Ölsböck, Computer Aided Geometric Design 73 (2019) 1–15.","chicago":"Edelsbrunner, Herbert, and Katharina Ölsböck. “Holes and Dependences in an Ordered Complex.” <i>Computer Aided Geometric Design</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.cagd.2019.06.003\">https://doi.org/10.1016/j.cagd.2019.06.003</a>.","ista":"Edelsbrunner H, Ölsböck K. 2019. Holes and dependences in an ordered complex. Computer Aided Geometric Design. 73, 1–15."},"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"project":[{"grant_number":"788183","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes"}],"page":"1-15","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"7460"}]},"type":"journal_article","department":[{"_id":"HeEd"}],"ec_funded":1,"doi":"10.1016/j.cagd.2019.06.003","date_updated":"2026-04-08T07:23:21Z","date_created":"2019-07-07T21:59:20Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","ddc":["000"],"oa_version":"Published Version","month":"08","intvolume":"        73","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","status":"public","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We use the canonical bases produced by the tri-partition algorithm in (Edelsbrunner and Ölsböck, 2018) to open and close holes in a polyhedral complex, K. In a concrete application, we consider the Delaunay mosaic of a finite set, we let K be an Alpha complex, and we use the persistence diagram of the distance function to guide the hole opening and closing operations. The dependences between the holes define a partial order on the cells in K that characterizes what can and what cannot be constructed using the operations. The relations in this partial order reveal structural information about the underlying filtration of complexes beyond what is expressed by the persistence diagram."}],"publication":"Computer Aided Geometric Design","volume":73,"publisher":"Elsevier","article_processing_charge":"No","_id":"6608","quality_controlled":"1","external_id":{"isi":["000485207800001"]},"date_published":"2019-08-01T00:00:00Z","title":"Holes and dependences in an ordered complex","author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"full_name":"Ölsböck, Katharina","id":"4D4AA390-F248-11E8-B48F-1D18A9856A87","first_name":"Katharina","orcid":"0000-0002-4672-8297","last_name":"Ölsböck"}],"isi":1,"year":"2019","has_accepted_license":"1","publication_status":"published"},{"ec_funded":1,"department":[{"_id":"HeEd"}],"author":[{"last_name":"Vegter","first_name":"Gert","full_name":"Vegter, Gert"},{"orcid":"0000-0002-7472-2220","first_name":"Mathijs","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","full_name":"Wintraecken, Mathijs"}],"title":"The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds","type":"conference","date_published":"2019-08-01T00:00:00Z","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"page":"275-279","publication_status":"published","month":"08","oa_version":"Submitted Version","has_accepted_license":"1","ddc":["004"],"conference":{"location":"Edmonton, Canada","end_date":"2019-08-10","start_date":"2019-08-08","name":"CCCG: Canadian Conference in Computational Geometry"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2019","date_created":"2019-07-12T08:34:57Z","date_updated":"2021-01-12T08:08:16Z","publication":"The 31st Canadian Conference in Computational Geometry","day":"01","file":[{"checksum":"ceabd152cfa55170d57763f9c6c60a53","content_type":"application/pdf","creator":"mwintrae","date_updated":"2020-07-14T12:47:34Z","date_created":"2019-07-12T08:32:46Z","relation":"main_file","file_size":321176,"file_name":"IntrinsicExtrinsicCCCG2019.pdf","file_id":"6629","access_level":"open_access"}],"file_date_updated":"2020-07-14T12:47:34Z","abstract":[{"text":"Fejes Tóth [5] and Schneider [9] studied approximations of smooth convex hypersurfaces in Euclidean space by piecewise  flat  triangular  meshes  with  a  given  number of  vertices  on  the  hypersurface  that  are  optimal  with respect  to  Hausdorff  distance.   They  proved  that  this Hausdorff distance decreases inversely proportional with m 2/(d−1),  where m is  the  number  of  vertices  and d is the  dimension  of  Euclidean  space.   Moreover  the  pro-portionality constant can be expressed in terms of the Gaussian curvature, an intrinsic quantity.  In this short note, we prove the extrinsic nature of this constant for manifolds of sufficiently high codimension.  We do so by constructing an family of isometric embeddings of the flat torus in Euclidean space.","lang":"eng"}],"status":"public","language":[{"iso":"eng"}],"citation":{"short":"G. Vegter, M. Wintraecken, in:, The 31st Canadian Conference in Computational Geometry, 2019, pp. 275–279.","ista":"Vegter G, Wintraecken M. 2019. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. The 31st Canadian Conference in Computational Geometry. CCCG: Canadian Conference in Computational Geometry, 275–279.","chicago":"Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” In <i>The 31st Canadian Conference in Computational Geometry</i>, 275–79, 2019.","ama":"Vegter G, Wintraecken M. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In: <i>The 31st Canadian Conference in Computational Geometry</i>. ; 2019:275-279.","mla":"Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” <i>The 31st Canadian Conference in Computational Geometry</i>, 2019, pp. 275–79.","ieee":"G. Vegter and M. Wintraecken, “The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds,” in <i>The 31st Canadian Conference in Computational Geometry</i>, Edmonton, Canada, 2019, pp. 275–279.","apa":"Vegter, G., &#38; Wintraecken, M. (2019). The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In <i>The 31st Canadian Conference in Computational Geometry</i> (pp. 275–279). Edmonton, Canada."},"quality_controlled":"1","_id":"6628","scopus_import":1,"oa":1},{"date_updated":"2025-04-15T06:50:28Z","date_created":"2019-07-14T21:59:19Z","doi":"10.12775/TMNA.2019.008","month":"06","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","arxiv":1,"oa_version":"Preprint","page":"457-490","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"department":[{"_id":"HeEd"}],"ec_funded":1,"type":"journal_article","scopus_import":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1612.06926"}],"citation":{"mla":"Akopyan, Arseniy, et al. “Lower and Upper Bounds for the Waists of Different Spaces.” <i>Topological Methods in Nonlinear Analysis</i>, vol. 53, no. 2, Akademicka Platforma Czasopism, 2019, pp. 457–90, doi:<a href=\"https://doi.org/10.12775/TMNA.2019.008\">10.12775/TMNA.2019.008</a>.","apa":"Akopyan, A., Hubard, A., &#38; Karasev, R. (2019). Lower and upper bounds for the waists of different spaces. <i>Topological Methods in Nonlinear Analysis</i>. Akademicka Platforma Czasopism. <a href=\"https://doi.org/10.12775/TMNA.2019.008\">https://doi.org/10.12775/TMNA.2019.008</a>","ieee":"A. Akopyan, A. Hubard, and R. Karasev, “Lower and upper bounds for the waists of different spaces,” <i>Topological Methods in Nonlinear Analysis</i>, vol. 53, no. 2. Akademicka Platforma Czasopism, pp. 457–490, 2019.","ama":"Akopyan A, Hubard A, Karasev R. Lower and upper bounds for the waists of different spaces. <i>Topological Methods in Nonlinear Analysis</i>. 2019;53(2):457-490. doi:<a href=\"https://doi.org/10.12775/TMNA.2019.008\">10.12775/TMNA.2019.008</a>","short":"A. Akopyan, A. Hubard, R. Karasev, Topological Methods in Nonlinear Analysis 53 (2019) 457–490.","chicago":"Akopyan, Arseniy, Alfredo Hubard, and Roman Karasev. “Lower and Upper Bounds for the Waists of Different Spaces.” <i>Topological Methods in Nonlinear Analysis</i>. Akademicka Platforma Czasopism, 2019. <a href=\"https://doi.org/10.12775/TMNA.2019.008\">https://doi.org/10.12775/TMNA.2019.008</a>.","ista":"Akopyan A, Hubard A, Karasev R. 2019. Lower and upper bounds for the waists of different spaces. Topological Methods in Nonlinear Analysis. 53(2), 457–490."},"fulldoi":"https://doi.org/10.12775/TMNA.2019.008","day":"01","isi":1,"publication_status":"published","year":"2019","date_published":"2019-06-01T00:00:00Z","title":"Lower and upper bounds for the waists of different spaces","author":[{"full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","first_name":"Arseniy","orcid":"0000-0002-2548-617X"},{"first_name":"Alfredo","last_name":"Hubard","full_name":"Hubard, Alfredo"},{"full_name":"Karasev, Roman","last_name":"Karasev","first_name":"Roman"}],"_id":"6634","publisher":"Akademicka Platforma Czasopism","article_processing_charge":"No","external_id":{"arxiv":["1612.06926"],"isi":["000472541600004"]},"issue":"2","quality_controlled":"1","intvolume":"        53","language":[{"iso":"eng"}],"status":"public","abstract":[{"lang":"eng","text":"In this paper we prove several new results around Gromov's waist theorem. We give a simple proof of Vaaler's theorem on sections of the unit cube using the Borsuk-Ulam-Crofton technique, consider waists of real and complex projective spaces, flat tori, convex bodies in Euclidean space; and establish waist-type results in terms of the Hausdorff measure."}],"publication":"Topological Methods in Nonlinear Analysis","volume":53},{"department":[{"_id":"HeEd"}],"type":"conference","project":[{"call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes"}],"page":"31:1-31:14","month":"06","ddc":["510"],"oa_version":"Published Version","arxiv":1,"corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2019-06-21","location":"Portland, OR, United States","name":"SoCG 2019: Symposium on Computational Geometry","start_date":"2019-06-18"},"date_updated":"2024-10-09T20:58:55Z","doi":"10.4230/LIPICS.SOCG.2019.31","date_created":"2019-07-17T10:36:09Z","day":"01","file":[{"access_level":"open_access","checksum":"8ec8720730d4c789bf7b06540f1c29f4","content_type":"application/pdf","creator":"dernst","date_created":"2019-07-24T06:40:01Z","relation":"main_file","date_updated":"2020-07-14T12:47:35Z","file_size":1355179,"file_name":"2019_LIPICS_Edelsbrunner.pdf","file_id":"6666"}],"file_date_updated":"2020-07-14T12:47:35Z","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"fulldoi":"https://doi.org/10.4230/LIPICS.SOCG.2019.31","citation":{"chicago":"Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data Analysis in Information Space.” In <i>35th International Symposium on Computational Geometry</i>, 129:31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. <a href=\"https://doi.org/10.4230/LIPICS.SOCG.2019.31\">https://doi.org/10.4230/LIPICS.SOCG.2019.31</a>.","ista":"Edelsbrunner H, Virk Z, Wagner H. 2019. Topological data analysis in information space. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129, 31:1-31:14.","short":"H. Edelsbrunner, Z. Virk, H. Wagner, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14.","apa":"Edelsbrunner, H., Virk, Z., &#38; Wagner, H. (2019). Topological data analysis in information space. In <i>35th International Symposium on Computational Geometry</i> (Vol. 129, p. 31:1-31:14). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.SOCG.2019.31\">https://doi.org/10.4230/LIPICS.SOCG.2019.31</a>","ieee":"H. Edelsbrunner, Z. Virk, and H. Wagner, “Topological data analysis in information space,” in <i>35th International Symposium on Computational Geometry</i>, Portland, OR, United States, 2019, vol. 129, p. 31:1-31:14.","mla":"Edelsbrunner, Herbert, et al. “Topological Data Analysis in Information Space.” <i>35th International Symposium on Computational Geometry</i>, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14, doi:<a href=\"https://doi.org/10.4230/LIPICS.SOCG.2019.31\">10.4230/LIPICS.SOCG.2019.31</a>.","ama":"Edelsbrunner H, Virk Z, Wagner H. Topological data analysis in information space. In: <i>35th International Symposium on Computational Geometry</i>. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:31:1-31:14. doi:<a href=\"https://doi.org/10.4230/LIPICS.SOCG.2019.31\">10.4230/LIPICS.SOCG.2019.31</a>"},"publication_identifier":{"isbn":["9783959771047"]},"oa":1,"scopus_import":1,"author":[{"orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Virk, Ziga","last_name":"Virk","first_name":"Ziga"},{"last_name":"Wagner","first_name":"Hubert","full_name":"Wagner, Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87"}],"title":"Topological data analysis in information space","date_published":"2019-06-01T00:00:00Z","publication_status":"published","has_accepted_license":"1","year":"2019","volume":129,"publication":"35th International Symposium on Computational Geometry","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\r\nneeded 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"}],"intvolume":"       129","status":"public","language":[{"iso":"eng"}],"external_id":{"arxiv":["1903.08510"]},"alternative_title":["LIPIcs"],"quality_controlled":"1","_id":"6648","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"scopus_import":"1","oa":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"fulldoi":"https://doi.org/10.1007/s41468-019-00029-8","citation":{"ama":"Boissonnat J-D, Lieutier A, Wintraecken M. The reach, metric distortion, geodesic convexity and the variation of tangent spaces. <i>Journal of Applied and Computational Topology</i>. 2019;3(1-2):29–58. doi:<a href=\"https://doi.org/10.1007/s41468-019-00029-8\">10.1007/s41468-019-00029-8</a>","mla":"Boissonnat, Jean-Daniel, et al. “The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces.” <i>Journal of Applied and Computational Topology</i>, vol. 3, no. 1–2, Springer Nature, 2019, pp. 29–58, doi:<a href=\"https://doi.org/10.1007/s41468-019-00029-8\">10.1007/s41468-019-00029-8</a>.","ieee":"J.-D. Boissonnat, A. Lieutier, and M. Wintraecken, “The reach, metric distortion, geodesic convexity and the variation of tangent spaces,” <i>Journal of Applied and Computational Topology</i>, vol. 3, no. 1–2. Springer Nature, pp. 29–58, 2019.","apa":"Boissonnat, J.-D., Lieutier, A., &#38; Wintraecken, M. (2019). The reach, metric distortion, geodesic convexity and the variation of tangent spaces. <i>Journal of Applied and Computational Topology</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s41468-019-00029-8\">https://doi.org/10.1007/s41468-019-00029-8</a>","short":"J.-D. Boissonnat, A. Lieutier, M. Wintraecken, Journal of Applied and Computational Topology 3 (2019) 29–58.","ista":"Boissonnat J-D, Lieutier A, Wintraecken M. 2019. The reach, metric distortion, geodesic convexity and the variation of tangent spaces. Journal of Applied and Computational Topology. 3(1–2), 29–58.","chicago":"Boissonnat, Jean-Daniel, André Lieutier, and Mathijs Wintraecken. “The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces.” <i>Journal of Applied and Computational Topology</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/s41468-019-00029-8\">https://doi.org/10.1007/s41468-019-00029-8</a>."},"publication_identifier":{"eissn":["2367-1734"],"issn":["2367-1726"]},"file":[{"checksum":"a5b244db9f751221409cf09c97ee0935","content_type":"application/pdf","creator":"dernst","date_updated":"2020-07-14T12:47:36Z","date_created":"2019-07-31T08:09:56Z","relation":"main_file","file_size":2215157,"file_name":"2019_JournAppliedComputTopol_Boissonnat.pdf","file_id":"6741","access_level":"open_access"}],"file_date_updated":"2020-07-14T12:47:36Z","article_type":"original","day":"01","doi":"10.1007/s41468-019-00029-8","date_updated":"2025-04-14T07:44:06Z","date_created":"2019-07-24T08:37:29Z","month":"06","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"oa_version":"Published Version","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"page":"29–58","department":[{"_id":"HeEd"}],"ec_funded":1,"type":"journal_article","_id":"6671","publisher":"Springer Nature","article_processing_charge":"Yes (via OA deal)","issue":"1-2","quality_controlled":"1","language":[{"iso":"eng"}],"status":"public","intvolume":"         3","abstract":[{"lang":"eng","text":"In this paper we discuss three results. The first two concern general sets of positive reach: we first characterize the reach of a closed set by means of a bound on the metric distortion between the distance measured in the ambient Euclidean space and the shortest path distance measured in the set. Secondly, we prove that the intersection of a ball with radius less than the reach with the set is geodesically convex, meaning that the shortest path between any two points in the intersection lies itself in the intersection. For our third result we focus on manifolds with positive reach and give a bound on the angle between tangent spaces at two different points in terms of the reach and the distance between the two points."}],"publication":"Journal of Applied and Computational Topology","volume":3,"publication_status":"published","year":"2019","has_accepted_license":"1","date_published":"2019-06-01T00:00:00Z","title":"The reach, metric distortion, geodesic convexity and the variation of tangent spaces","author":[{"full_name":"Boissonnat, Jean-Daniel","first_name":"Jean-Daniel","last_name":"Boissonnat"},{"last_name":"Lieutier","first_name":"André","full_name":"Lieutier, André"},{"last_name":"Wintraecken","first_name":"Mathijs","orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","full_name":"Wintraecken, Mathijs"}]},{"isi":1,"publication_status":"published","year":"2019","date_published":"2019-10-01T00:00:00Z","title":"The Regge symmetry, confocal conics, and the Schläfli formula","author":[{"full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","first_name":"Arseniy","last_name":"Akopyan"},{"full_name":"Izmestiev, Ivan","first_name":"Ivan","last_name":"Izmestiev"}],"_id":"6793","article_processing_charge":"No","publisher":"London Mathematical Society","issue":"5","external_id":{"arxiv":["1903.04929"],"isi":["000478560200001"]},"quality_controlled":"1","abstract":[{"lang":"eng","text":"The Regge symmetry is a set of remarkable relations between two tetrahedra whose edge lengths are related in a simple fashion. It was first discovered as a consequence of an asymptotic formula in mathematical physics. Here, we give a simple geometric proof of Regge symmetries in Euclidean, spherical, and hyperbolic geometry."}],"intvolume":"        51","status":"public","language":[{"iso":"eng"}],"volume":51,"publication":"Bulletin of the London Mathematical Society","date_updated":"2025-07-10T11:53:52Z","date_created":"2019-08-11T21:59:23Z","doi":"10.1112/blms.12276","month":"10","oa_version":"Preprint","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"788183","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended"}],"page":"765-775","ec_funded":1,"department":[{"_id":"HeEd"}],"type":"journal_article","main_file_link":[{"url":"https://arxiv.org/abs/1903.04929","open_access":"1"}],"scopus_import":"1","oa":1,"fulldoi":"https://doi.org/10.1112/blms.12276","citation":{"ieee":"A. Akopyan and I. Izmestiev, “The Regge symmetry, confocal conics, and the Schläfli formula,” <i>Bulletin of the London Mathematical Society</i>, vol. 51, no. 5. London Mathematical Society, pp. 765–775, 2019.","apa":"Akopyan, A., &#38; Izmestiev, I. (2019). The Regge symmetry, confocal conics, and the Schläfli formula. <i>Bulletin of the London Mathematical Society</i>. London Mathematical Society. <a href=\"https://doi.org/10.1112/blms.12276\">https://doi.org/10.1112/blms.12276</a>","mla":"Akopyan, Arseniy, and Ivan Izmestiev. “The Regge Symmetry, Confocal Conics, and the Schläfli Formula.” <i>Bulletin of the London Mathematical Society</i>, vol. 51, no. 5, London Mathematical Society, 2019, pp. 765–75, doi:<a href=\"https://doi.org/10.1112/blms.12276\">10.1112/blms.12276</a>.","ama":"Akopyan A, Izmestiev I. The Regge symmetry, confocal conics, and the Schläfli formula. <i>Bulletin of the London Mathematical Society</i>. 2019;51(5):765-775. doi:<a href=\"https://doi.org/10.1112/blms.12276\">10.1112/blms.12276</a>","short":"A. Akopyan, I. Izmestiev, Bulletin of the London Mathematical Society 51 (2019) 765–775.","chicago":"Akopyan, Arseniy, and Ivan Izmestiev. “The Regge Symmetry, Confocal Conics, and the Schläfli Formula.” <i>Bulletin of the London Mathematical Society</i>. London Mathematical Society, 2019. <a href=\"https://doi.org/10.1112/blms.12276\">https://doi.org/10.1112/blms.12276</a>.","ista":"Akopyan A, Izmestiev I. 2019. The Regge symmetry, confocal conics, and the Schläfli formula. Bulletin of the London Mathematical Society. 51(5), 765–775."},"publication_identifier":{"issn":["0024-6093"],"eissn":["1469-2120"]},"article_type":"original","day":"01"},{"year":"2019","publication_status":"published","isi":1,"author":[{"first_name":"Adam","last_name":"Brown","full_name":"Brown, Adam","id":"70B7FDF6-608D-11E9-9333-8535E6697425"}],"title":"Arakawa-Suzuki functors for Whittaker modules","date_published":"2019-11-15T00:00:00Z","quality_controlled":"1","external_id":{"isi":["000487176300011"],"arxiv":["1805.04676"]},"publisher":"Elsevier","article_processing_charge":"No","_id":"6828","volume":538,"publication":"Journal of Algebra","abstract":[{"text":"In this paper we construct a family of exact functors from the category of Whittaker modules of the simple complex Lie algebra of type  to the category of finite-dimensional modules of the graded affine Hecke algebra of type . Using results of Backelin [2] and of Arakawa-Suzuki [1], we prove that these functors map standard modules to standard modules (or zero) and simple modules to simple modules (or zero). Moreover, we show that each simple module of the graded affine Hecke algebra appears as the image of a simple Whittaker module. Since the Whittaker category contains the BGG category  as a full subcategory, our results generalize results of Arakawa-Suzuki [1], which in turn generalize Schur-Weyl duality between finite-dimensional representations of  and representations of the symmetric group .","lang":"eng"}],"intvolume":"       538","status":"public","language":[{"iso":"eng"}],"oa_version":"Preprint","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","arxiv":1,"month":"11","doi":"10.1016/j.jalgebra.2019.07.027","date_created":"2019-08-22T07:54:13Z","date_updated":"2023-08-29T07:11:47Z","type":"journal_article","department":[{"_id":"HeEd"}],"page":"261-289","fulldoi":"https://doi.org/10.1016/j.jalgebra.2019.07.027","publication_identifier":{"issn":["0021-8693"]},"citation":{"ieee":"A. Brown, “Arakawa-Suzuki functors for Whittaker modules,” <i>Journal of Algebra</i>, vol. 538. Elsevier, pp. 261–289, 2019.","apa":"Brown, A. (2019). Arakawa-Suzuki functors for Whittaker modules. <i>Journal of Algebra</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jalgebra.2019.07.027\">https://doi.org/10.1016/j.jalgebra.2019.07.027</a>","mla":"Brown, Adam. “Arakawa-Suzuki Functors for Whittaker Modules.” <i>Journal of Algebra</i>, vol. 538, Elsevier, 2019, pp. 261–89, doi:<a href=\"https://doi.org/10.1016/j.jalgebra.2019.07.027\">10.1016/j.jalgebra.2019.07.027</a>.","ama":"Brown A. Arakawa-Suzuki functors for Whittaker modules. <i>Journal of Algebra</i>. 2019;538:261-289. doi:<a href=\"https://doi.org/10.1016/j.jalgebra.2019.07.027\">10.1016/j.jalgebra.2019.07.027</a>","chicago":"Brown, Adam. “Arakawa-Suzuki Functors for Whittaker Modules.” <i>Journal of Algebra</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.jalgebra.2019.07.027\">https://doi.org/10.1016/j.jalgebra.2019.07.027</a>.","ista":"Brown A. 2019. Arakawa-Suzuki functors for Whittaker modules. Journal of Algebra. 538, 261–289.","short":"A. Brown, Journal of Algebra 538 (2019) 261–289."},"main_file_link":[{"url":"https://arxiv.org/abs/1805.04676","open_access":"1"}],"oa":1,"day":"15","article_type":"original"},{"article_processing_charge":"No","publisher":"IEEE","_id":"7216","scopus_import":"1","fulldoi":"https://doi.org/10.1109/ITSC.2019.8917514","publication_identifier":{"isbn":["9781538670248"]},"citation":{"ama":"Osang GF, Cook J, Fabrikant A, Gruteser M. LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale. In: <i>2019 IEEE Intelligent Transportation Systems Conference</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ITSC.2019.8917514\">10.1109/ITSC.2019.8917514</a>","apa":"Osang, G. F., Cook, J., Fabrikant, A., &#38; Gruteser, M. (2019). LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale. In <i>2019 IEEE Intelligent Transportation Systems Conference</i>. Auckland, New Zealand: IEEE. <a href=\"https://doi.org/10.1109/ITSC.2019.8917514\">https://doi.org/10.1109/ITSC.2019.8917514</a>","ieee":"G. F. Osang, J. Cook, A. Fabrikant, and M. Gruteser, “LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale,” in <i>2019 IEEE Intelligent Transportation Systems Conference</i>, Auckland, New Zealand, 2019.","mla":"Osang, Georg F., et al. “LiveTraVeL: Real-Time Matching of Transit Vehicle Trajectories to Transit Routes at Scale.” <i>2019 IEEE Intelligent Transportation Systems Conference</i>, 8917514, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ITSC.2019.8917514\">10.1109/ITSC.2019.8917514</a>.","ista":"Osang GF, Cook J, Fabrikant A, Gruteser M. 2019. LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale. 2019 IEEE Intelligent Transportation Systems Conference. ITSC: Intelligent Transportation Systems Conference, 8917514.","chicago":"Osang, Georg F, James Cook, Alex Fabrikant, and Marco Gruteser. “LiveTraVeL: Real-Time Matching of Transit Vehicle Trajectories to Transit Routes at Scale.” In <i>2019 IEEE Intelligent Transportation Systems Conference</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ITSC.2019.8917514\">https://doi.org/10.1109/ITSC.2019.8917514</a>.","short":"G.F. Osang, J. Cook, A. Fabrikant, M. Gruteser, in:, 2019 IEEE Intelligent Transportation Systems Conference, IEEE, 2019."},"quality_controlled":"1","article_number":"8917514","external_id":{"isi":["000521238102050"]},"abstract":[{"text":"We present LiveTraVeL (Live Transit Vehicle Labeling), a real-time system to label a stream of noisy observations of transit vehicle trajectories with the transit routes they are serving (e.g., northbound bus #5). In order to scale efficiently to large transit networks, our system first retrieves a small set of candidate routes from a geometrically indexed data structure, then applies a fine-grained scoring step to choose the best match. Given that real-time data remains unavailable for the majority of the world’s transit agencies, these inferences can help feed a real-time map of a transit system’s trips, infer transit trip delays in real time, or measure and correct noisy transit tracking data. This system can run on vehicle observations from a variety of sources that don’t attach route information to vehicle observations, such as public imagery streams or user-contributed transit vehicle sightings.We abstract away the specifics of the sensing system and demonstrate the effectiveness of our system on a \"semisynthetic\" dataset of all New York City buses, where we simulate sensed trajectories by starting with fully labeled vehicle trajectories reported via the GTFS-Realtime protocol, removing the transit route IDs, and perturbing locations with synthetic noise. Using just the geometric shapes of the trajectories, we demonstrate that our system converges on the correct route ID within a few minutes, even after a vehicle switches from serving one trip to the next.","lang":"eng"}],"status":"public","language":[{"iso":"eng"}],"publication":"2019 IEEE Intelligent Transportation Systems Conference","day":"28","isi":1,"doi":"10.1109/ITSC.2019.8917514","date_updated":"2023-09-06T14:50:28Z","date_created":"2019-12-29T23:00:47Z","oa_version":"None","year":"2019","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","conference":{"location":"Auckland, New Zealand","end_date":"2019-10-30","start_date":"2019-10-27","name":"ITSC: Intelligent Transportation Systems Conference"},"month":"11","publication_status":"published","date_published":"2019-11-28T00:00:00Z","type":"conference","title":"LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale","department":[{"_id":"HeEd"}],"author":[{"full_name":"Osang, Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg F","orcid":"0000-0002-8882-5116","last_name":"Osang"},{"full_name":"Cook, James","last_name":"Cook","first_name":"James"},{"first_name":"Alex","last_name":"Fabrikant","full_name":"Fabrikant, Alex"},{"full_name":"Gruteser, Marco","first_name":"Marco","last_name":"Gruteser"}]}]