[{"intvolume":"       206","year":"2024","acknowledgement":"We are grateful to Balázs Keszegh, and to the members of the Miklós Schweitzer Competition committee of 2022 for valuable discussions, and Shira Zerbib for pointing out several important mathematical typos.","issue":"8","publication_identifier":{"eissn":["1096-0899"],"issn":["0097-3165"]},"article_number":"105889","arxiv":1,"title":"Odd-sunflowers","doi":"10.1016/j.jcta.2024.105889","license":"https://creativecommons.org/licenses/by-nc/4.0/","type":"journal_article","publication":"Journal of Combinatorial Theory, Series A","date_published":"2024-08-01T00:00:00Z","language":[{"iso":"eng"}],"scopus_import":"1","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png"},"article_type":"original","date_created":"2024-03-31T22:01:11Z","citation":{"short":"P. Frankl, J. Pach, D. Pálvölgyi, Journal of Combinatorial Theory, Series A 206 (2024).","ama":"Frankl P, Pach J, Pálvölgyi D. Odd-sunflowers. <i>Journal of Combinatorial Theory, Series A</i>. 2024;206(8). doi:<a href=\"https://doi.org/10.1016/j.jcta.2024.105889\">10.1016/j.jcta.2024.105889</a>","ista":"Frankl P, Pach J, Pálvölgyi D. 2024. Odd-sunflowers. Journal of Combinatorial Theory, Series A. 206(8), 105889.","ieee":"P. Frankl, J. Pach, and D. Pálvölgyi, “Odd-sunflowers,” <i>Journal of Combinatorial Theory, Series A</i>, vol. 206, no. 8. Elsevier, 2024.","chicago":"Frankl, Peter, János Pach, and Dömötör Pálvölgyi. “Odd-Sunflowers.” <i>Journal of Combinatorial Theory, Series A</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.jcta.2024.105889\">https://doi.org/10.1016/j.jcta.2024.105889</a>.","mla":"Frankl, Peter, et al. “Odd-Sunflowers.” <i>Journal of Combinatorial Theory, Series A</i>, vol. 206, no. 8, 105889, Elsevier, 2024, doi:<a href=\"https://doi.org/10.1016/j.jcta.2024.105889\">10.1016/j.jcta.2024.105889</a>.","apa":"Frankl, P., Pach, J., &#38; Pálvölgyi, D. (2024). Odd-sunflowers. <i>Journal of Combinatorial Theory, Series A</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jcta.2024.105889\">https://doi.org/10.1016/j.jcta.2024.105889</a>"},"OA_place":"publisher","file":[{"access_level":"open_access","creator":"dernst","date_created":"2025-01-09T08:37:20Z","relation":"main_file","file_id":"18791","success":1,"checksum":"ffc29d65e712849f0d31009271e06a63","content_type":"application/pdf","date_updated":"2025-01-09T08:37:20Z","file_name":"2024_JourCombiTheoryA_Frankl.pdf","file_size":366029}],"oa_version":"Published Version","status":"public","department":[{"_id":"HeEd"}],"volume":206,"month":"08","abstract":[{"lang":"eng","text":"Extending the notion of sunflowers, we call a family of at least two sets an odd-sunflower if every element of the underlying set is contained in an odd number of sets or in none of them. It follows from the Erdős–Szemerédi conjecture, recently proved by Naslund and Sawin, that there is a constant <2 such that every family of subsets of an n-element set that contains no odd-sunflower consists of at most n sets. We construct such families of size at least 1.5021n. We also characterize minimal odd-sunflowers of triples."}],"isi":1,"article_processing_charge":"No","day":"01","external_id":{"arxiv":["2310.16701"],"isi":["001217739200001"]},"OA_type":"hybrid","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-04T13:20:39Z","file_date_updated":"2025-01-09T08:37:20Z","oa":1,"publisher":"Elsevier","ddc":["510"],"has_accepted_license":"1","author":[{"first_name":"Peter","last_name":"Frankl","full_name":"Frankl, Peter"},{"full_name":"Pach, János","last_name":"Pach","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","first_name":"János"},{"first_name":"Dömötör","last_name":"Pálvölgyi","full_name":"Pálvölgyi, Dömötör"}],"_id":"15247","publication_status":"published","quality_controlled":"1","corr_author":"1"},{"date_created":"2024-05-12T22:01:03Z","article_type":"original","ec_funded":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"oa_version":"Published Version","file":[{"relation":"main_file","date_created":"2025-04-23T08:01:36Z","creator":"dernst","file_id":"19612","access_level":"open_access","file_name":"2024_JourApplCompTopo_BiswasRa.pdf","date_updated":"2025-04-23T08:01:36Z","file_size":522831,"content_type":"application/pdf","success":1,"checksum":"0ee15c1493a6413cf356ab2f32c81a9e"}],"OA_place":"publisher","citation":{"mla":"Biswas, Ranita, et al. “Depth in Arrangements: Dehn–Sommerville–Euler Relations with Applications.” <i>Journal of Applied and Computational Topology</i>, vol. 8, Springer Nature, 2024, pp. 557–78, doi:<a href=\"https://doi.org/10.1007/s41468-024-00173-w\">10.1007/s41468-024-00173-w</a>.","apa":"Biswas, R., Cultrera di Montesano, S., Edelsbrunner, H., &#38; Saghafian, M. (2024). Depth in arrangements: Dehn–Sommerville–Euler relations with applications. <i>Journal of Applied and Computational Topology</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s41468-024-00173-w\">https://doi.org/10.1007/s41468-024-00173-w</a>","chicago":"Biswas, Ranita, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, and Morteza Saghafian. “Depth in Arrangements: Dehn–Sommerville–Euler Relations with Applications.” <i>Journal of Applied and Computational Topology</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/s41468-024-00173-w\">https://doi.org/10.1007/s41468-024-00173-w</a>.","ista":"Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. 2024. Depth in arrangements: Dehn–Sommerville–Euler relations with applications. Journal of Applied and Computational Topology. 8, 557–578.","ieee":"R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, and M. Saghafian, “Depth in arrangements: Dehn–Sommerville–Euler relations with applications,” <i>Journal of Applied and Computational Topology</i>, vol. 8. Springer Nature, pp. 557–578, 2024.","ama":"Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. Depth in arrangements: Dehn–Sommerville–Euler relations with applications. <i>Journal of Applied and Computational Topology</i>. 2024;8:557-578. doi:<a href=\"https://doi.org/10.1007/s41468-024-00173-w\">10.1007/s41468-024-00173-w</a>","short":"R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, Journal of Applied and Computational Topology 8 (2024) 557–578."},"related_material":{"record":[{"relation":"earlier_version","id":"11658","status":"public"}]},"status":"public","article_processing_charge":"Yes (via OA deal)","volume":8,"month":"09","abstract":[{"lang":"eng","text":"The depth of a cell in an arrangement of n (non-vertical) great-spheres in Sd is the number of great-spheres that pass above the cell. We prove Euler-type relations, which imply extensions of the classic Dehn–Sommerville relations for convex polytopes to sublevel sets of the depth function, and we use the relations to extend the expressions for the number of faces of neighborly polytopes to the number of cells of levels in neighborly arrangements."}],"department":[{"_id":"HeEd"}],"acknowledgement":"The authors thank Uli Wagner and Emo Welzl for comments on an earlier version of this paper, and for pointing out related work in the prior literature.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria). This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, Grant No. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35.","year":"2024","intvolume":"         8","title":"Depth in arrangements: Dehn–Sommerville–Euler relations with applications","pmid":1,"publication_identifier":{"eissn":["2367-1734"],"issn":["2367-1726"]},"doi":"10.1007/s41468-024-00173-w","scopus_import":"1","publication":"Journal of Applied and Computational Topology","language":[{"iso":"eng"}],"date_published":"2024-09-01T00:00:00Z","type":"journal_article","oa":1,"file_date_updated":"2025-04-23T08:01:36Z","author":[{"id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","first_name":"Ranita","last_name":"Biswas","orcid":"0000-0002-5372-7890","full_name":"Biswas, Ranita"},{"full_name":"Cultrera Di Montesano, Sebastiano","orcid":"0000-0001-6249-0832","last_name":"Cultrera Di Montesano","id":"34D2A09C-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastiano"},{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"id":"f86f7148-b140-11ec-9577-95435b8df824","first_name":"Morteza","last_name":"Saghafian","full_name":"Saghafian, Morteza"}],"_id":"15380","ddc":["510"],"has_accepted_license":"1","publisher":"Springer Nature","publication_status":"published","quality_controlled":"1","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["39308789"]},"day":"01","OA_type":"hybrid","project":[{"call_identifier":"H2020","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183"},{"name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes"}],"date_updated":"2025-05-14T09:27:57Z","page":"557-578"},{"publication_status":"published","quality_controlled":"1","conference":{"location":"Athens, Greece","end_date":"2024-06-14","name":"SoCG: Symposium on Computational Geometry"},"file_date_updated":"2024-06-17T08:33:40Z","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","has_accepted_license":"1","ddc":["510"],"author":[{"full_name":"Kourimska, Hana","last_name":"Kourimska","orcid":"0000-0001-7841-0091","first_name":"Hana","id":"D9B8E14C-3C26-11EA-98F5-1F833DDC885E"},{"first_name":"André","last_name":"Lieutier","full_name":"Lieutier, André"},{"id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs","full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220","last_name":"Wintraecken"}],"_id":"17144","date_updated":"2025-04-15T07:16:58Z","day":"01","external_id":{"arxiv":["2212.01118"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","grant_number":"788183","call_identifier":"H2020"},{"call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science","grant_number":"Z00342"},{"call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes"},{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"M03073","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","name":"Learning and triangulating manifolds via collapses"}],"status":"public","department":[{"_id":"HeEd"}],"abstract":[{"text":"We prove that the medial axis of closed sets is Hausdorff stable in the following sense: Let 𝒮 ⊆ ℝ^d be a fixed closed set that contains a bounding sphere. That is, the bounding sphere is part of the set 𝒮. Consider the space of C^{1,1} diffeomorphisms of ℝ^d to itself, which keep the bounding sphere invariant. The map from this space of diffeomorphisms (endowed with a Banach norm) to the space of closed subsets of ℝ^d (endowed with the Hausdorff distance), mapping a diffeomorphism F to the closure of the medial axis of F(𝒮), is Lipschitz. This extends a previous stability result of Chazal and Soufflet on the stability of the medial axis of C² manifolds under C² ambient diffeomorphisms.","lang":"eng"}],"volume":293,"month":"06","article_processing_charge":"No","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ec_funded":1,"date_created":"2024-06-16T22:01:06Z","citation":{"short":"H. Kourimska, A. Lieutier, M. Wintraecken, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ama":"Kourimska H, Lieutier A, Wintraecken M. The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms. In: <i>40th International Symposium on Computational Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.69\">10.4230/LIPIcs.SoCG.2024.69</a>","ista":"Kourimska H, Lieutier A, Wintraecken M. 2024. The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 69.","ieee":"H. Kourimska, A. Lieutier, and M. Wintraecken, “The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms,” in <i>40th International Symposium on Computational Geometry</i>, Athens, Greece, 2024, vol. 293.","chicago":"Kourimska, Hana, André Lieutier, and Mathijs Wintraecken. “The Medial Axis of Any Closed Bounded Set Is Lipschitz Stable with Respect to the Hausdorff Distance Under Ambient Diffeomorphisms.” In <i>40th International Symposium on Computational Geometry</i>, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.69\">https://doi.org/10.4230/LIPIcs.SoCG.2024.69</a>.","apa":"Kourimska, H., Lieutier, A., &#38; Wintraecken, M. (2024). The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms. In <i>40th International Symposium on Computational Geometry</i> (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.69\">https://doi.org/10.4230/LIPIcs.SoCG.2024.69</a>","mla":"Kourimska, Hana, et al. “The Medial Axis of Any Closed Bounded Set Is Lipschitz Stable with Respect to the Hausdorff Distance Under Ambient Diffeomorphisms.” <i>40th International Symposium on Computational Geometry</i>, vol. 293, 69, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.69\">10.4230/LIPIcs.SoCG.2024.69</a>."},"alternative_title":["LIPIcs"],"file":[{"access_level":"open_access","date_created":"2024-06-17T08:33:40Z","creator":"dernst","relation":"main_file","file_id":"17150","success":1,"checksum":"b40ff456c19294adb5d9613fcfd751c6","content_type":"application/pdf","date_updated":"2024-06-17T08:33:40Z","file_size":1612558,"file_name":"2024_LIPICS_Kourimska.pdf"}],"oa_version":"Published Version","doi":"10.4230/LIPIcs.SoCG.2024.69","type":"conference","publication":"40th International Symposium on Computational Geometry","language":[{"iso":"eng"}],"date_published":"2024-06-01T00:00:00Z","scopus_import":"1","intvolume":"       293","year":"2024","acknowledgement":"This research has been supported by the European Research Council (ERC), grant No. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant No. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant No. I 02979-N35.\r\nSupported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, the Austrian science fund (FWF) grant No. M-3073, and the welcome package from IDEX of the Université Cô d'Azur.\r\nWe are greatly indebted to Fred Chazal for sharing his insights. We further thank Erin Chambers, Christopher Fillmore, and Elizabeth Stephenson for early discussions and all members of the Edelsbrunner group (Institute of Science and Technology Austria) and the Datashape team (Inria) for the atmosphere in which this research was conducted.","publication_identifier":{"isbn":["9783959773164"],"issn":["1868-8969"]},"article_number":"69","arxiv":1,"title":"The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms"},{"date_updated":"2024-06-17T08:41:56Z","external_id":{"arxiv":["2402.15787"]},"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","quality_controlled":"1","conference":{"location":"Athens, Greece","end_date":"2024-06-14","start_date":"2024-06-11","name":"SoCG: Symposium on Computational Geometry"},"file_date_updated":"2024-06-17T08:40:04Z","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","has_accepted_license":"1","ddc":["510"],"_id":"17145","author":[{"first_name":"Günter","last_name":"Rote","full_name":"Rote, Günter"},{"last_name":"Rüber","full_name":"Rüber, Moritz","first_name":"Moritz"},{"last_name":"Saghafian","full_name":"Saghafian, Morteza","first_name":"Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824"}],"doi":"10.4230/LIPIcs.SoCG.2024.76","type":"conference","publication":"40th International Symposium on Computational Geometry","date_published":"2024-06-01T00:00:00Z","language":[{"iso":"eng"}],"scopus_import":"1","intvolume":"       293","year":"2024","acknowledgement":"Part of this work was done while G.R. enjoyed the hospitality of the Institute of Science and Technology Austria (ISTA) as a visiting professor during his sabbatical in the winter semester 2022/23.","article_number":"76","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773164"]},"arxiv":1,"title":"Grid peeling of parabolas","status":"public","department":[{"_id":"HeEd"}],"month":"06","volume":293,"abstract":[{"text":"Grid peeling is the process of repeatedly removing the convex hull vertices of the grid points that lie inside a given convex curve. It has been conjectured that, for a more and more refined grid, grid peeling converges to a continuous process, the affine curve-shortening flow, which deforms the curve based on the curvature. We prove this conjecture for one class of curves, parabolas with a vertical axis, and we determine the value of the constant factor in the formula that relates the two processes.","lang":"eng"}],"article_processing_charge":"No","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2024-06-16T22:01:06Z","citation":{"ieee":"G. Rote, M. Rüber, and M. Saghafian, “Grid peeling of parabolas,” in <i>40th International Symposium on Computational Geometry</i>, Athens, Greece, 2024, vol. 293.","ista":"Rote G, Rüber M, Saghafian M. 2024. Grid peeling of parabolas. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 76.","chicago":"Rote, Günter, Moritz Rüber, and Morteza Saghafian. “Grid Peeling of Parabolas.” In <i>40th International Symposium on Computational Geometry</i>, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.76\">https://doi.org/10.4230/LIPIcs.SoCG.2024.76</a>.","apa":"Rote, G., Rüber, M., &#38; Saghafian, M. (2024). Grid peeling of parabolas. In <i>40th International Symposium on Computational Geometry</i> (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.76\">https://doi.org/10.4230/LIPIcs.SoCG.2024.76</a>","mla":"Rote, Günter, et al. “Grid Peeling of Parabolas.” <i>40th International Symposium on Computational Geometry</i>, vol. 293, 76, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.76\">10.4230/LIPIcs.SoCG.2024.76</a>.","short":"G. Rote, M. Rüber, M. Saghafian, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ama":"Rote G, Rüber M, Saghafian M. Grid peeling of parabolas. In: <i>40th International Symposium on Computational Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.76\">10.4230/LIPIcs.SoCG.2024.76</a>"},"alternative_title":["LIPIcs"],"file":[{"success":1,"checksum":"fbad1de06383a6b7e8a1cb3e8c7205ce","content_type":"application/pdf","date_updated":"2024-06-17T08:40:04Z","file_name":"2024_LIPICS_Rote.pdf","file_size":1430896,"access_level":"open_access","date_created":"2024-06-17T08:40:04Z","creator":"dernst","relation":"main_file","file_id":"17151"}],"oa_version":"Published Version"},{"day":"01","external_id":{"arxiv":["2310.14801"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"H2020","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended"},{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35"},{"call_identifier":"FWF","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342"}],"date_updated":"2025-12-01T15:19:20Z","conference":{"end_date":"2024-06-14","location":"Athens, Greece","start_date":"2024-06-11","name":"SoCG: Symposium on Computational Geometry"},"file_date_updated":"2024-06-17T08:46:33Z","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","has_accepted_license":"1","ddc":["510"],"_id":"17146","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"},{"first_name":"János","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","last_name":"Pach","full_name":"Pach, János"}],"publication_status":"published","quality_controlled":"1","intvolume":"       293","year":"2024","acknowledgement":"The first author is supported by the European Research Council (ERC), grant no. 788183, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant no. {I 02979-N35.} The second author is supported by the European Research Council (ERC), grant \"GeoScape\" and by the Hungarian Science Foundation (NKFIH), grant K-131529. Both authors are supported by the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.\r\nThe authors thank Matt Kahle for communicating the question about extremal Čech complexes, Ben Schweinhart for early discussions on the linked circles construction in three dimensions, and Gábor Tardos for helpful remarks and suggestions.","article_number":"53","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773164"]},"arxiv":1,"title":"Maximum Betti numbers of Čech complexes","doi":"10.4230/LIPIcs.SoCG.2024.53","type":"conference","date_published":"2024-06-01T00:00:00Z","language":[{"iso":"eng"}],"publication":"40th International Symposium on Computational Geometry","scopus_import":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2024-06-16T22:01:06Z","ec_funded":1,"citation":{"ama":"Edelsbrunner H, Pach J. Maximum Betti numbers of Čech complexes. In: <i>40th International Symposium on Computational Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.53\">10.4230/LIPIcs.SoCG.2024.53</a>","short":"H. Edelsbrunner, J. Pach, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ieee":"H. Edelsbrunner and J. Pach, “Maximum Betti numbers of Čech complexes,” in <i>40th International Symposium on Computational Geometry</i>, Athens, Greece, 2024, vol. 293.","ista":"Edelsbrunner H, Pach J. 2024. Maximum Betti numbers of Čech complexes. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 53.","mla":"Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” <i>40th International Symposium on Computational Geometry</i>, vol. 293, 53, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.53\">10.4230/LIPIcs.SoCG.2024.53</a>.","apa":"Edelsbrunner, H., &#38; Pach, J. (2024). Maximum Betti numbers of Čech complexes. In <i>40th International Symposium on Computational Geometry</i> (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.53\">https://doi.org/10.4230/LIPIcs.SoCG.2024.53</a>","chicago":"Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” In <i>40th International Symposium on Computational Geometry</i>, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.53\">https://doi.org/10.4230/LIPIcs.SoCG.2024.53</a>."},"alternative_title":["LIPIcs"],"file":[{"success":1,"checksum":"5442d44fb89d77477a87668d6e61aac9","content_type":"application/pdf","date_updated":"2024-06-17T08:46:33Z","file_size":766562,"file_name":"2024_LIPICS_Edelsbrunner.pdf","access_level":"open_access","date_created":"2024-06-17T08:46:33Z","creator":"dernst","relation":"main_file","file_id":"17152"}],"oa_version":"Published Version","status":"public","related_material":{"record":[{"status":"public","id":"20657","relation":"later_version"}]},"department":[{"_id":"HeEd"}],"abstract":[{"lang":"eng","text":"The Upper Bound Theorem for convex polytopes implies that the p-th Betti number of the Čech complex of any set of N points in ℝ^d and any radius satisfies β_p = O(N^m), with m = min{p+1, ⌈d/2⌉}. We construct sets in even and odd dimensions, which prove that this upper bound is asymptotically tight. For example, we describe a set of N = 2(n+1) points in ℝ³ and two radii such that the first Betti number of the Čech complex at one radius is (n+1)² - 1, and the second Betti number of the Čech complex at the other radius is n². In particular, there is an arrangement of n contruent balls in ℝ³ that enclose a quadratic number of voids, which answers a long-standing open question in computational geometry."}],"month":"06","volume":293,"article_processing_charge":"No"},{"doi":"10.4230/LIPIcs.SoCG.2024.11","type":"conference","scopus_import":"1","date_published":"2024-06-06T00:00:00Z","publication":"40th International Symposium on Computational Geometry","language":[{"iso":"eng"}],"year":"2024","intvolume":"       293","acknowledgement":"This research has been supported by the European Research Council (ERC), grant No. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant No. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant No. I 02979-N35.\r\nWintraecken, Mathijs: Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, the Austrian science fund (FWF) grant No. M-3073, and the welcome package from IDEX of the Université Côte d'Azur.","publication_identifier":{"isbn":["9783959773164"],"eissn":["1868-8969"]},"arxiv":1,"title":"Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds","status":"public","department":[{"_id":"GradSch"},{"_id":"HeEd"}],"article_processing_charge":"No","month":"06","volume":293,"abstract":[{"text":"In this article we extend and strengthen the seminal work by Niyogi, Smale, and Weinberger on the learning of the homotopy type from a sample of an underlying space. In their work, Niyogi, Smale, and Weinberger studied samples of C² manifolds with positive reach embedded in ℝ^d. We extend their results in the following ways: - As the ambient space we consider both ℝ^d and Riemannian manifolds with lower bounded sectional curvature. - In both types of ambient spaces, we study sets of positive reach - a significantly more general setting than C² manifolds - as well as general manifolds of positive reach. - The sample P of a set (or a manifold) 𝒮 of positive reach may be noisy. We work with two one-sided Hausdorff distances - ε and δ - between P and 𝒮. We provide tight bounds in terms of ε and δ, that guarantee that there exists a parameter r such that the union of balls of radius r centred at the sample P deformation-retracts to 𝒮. We exhibit their tightness by an explicit construction. We carefully distinguish the roles of δ and ε. This is not only essential to achieve tight bounds, but also sensible in practical situations, since it allows one to adapt the bound according to sample density and the amount of noise present in the sample separately.","lang":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ec_funded":1,"date_created":"2024-06-25T11:45:58Z","alternative_title":["LIPIcs"],"citation":{"ama":"Attali D, Kourimska H, Fillmore CD, et al. Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds. In: <i>40th International Symposium on Computational Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:11:1-11:19. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.11\">10.4230/LIPIcs.SoCG.2024.11</a>","short":"D. Attali, H. Kourimska, C.D. Fillmore, I. Ghosh, A. Lieutier, E.R. Stephenson, M. Wintraecken, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 11:1-11:19.","ista":"Attali D, Kourimska H, Fillmore CD, Ghosh I, Lieutier A, Stephenson ER, Wintraecken M. 2024. Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 11:1-11:19.","ieee":"D. Attali <i>et al.</i>, “Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds,” in <i>40th International Symposium on Computational Geometry</i>, Athens, Greece, 2024, vol. 293, p. 11:1-11:19.","apa":"Attali, D., Kourimska, H., Fillmore, C. D., Ghosh, I., Lieutier, A., Stephenson, E. R., &#38; Wintraecken, M. (2024). Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds. In <i>40th International Symposium on Computational Geometry</i> (Vol. 293, p. 11:1-11:19). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.11\">https://doi.org/10.4230/LIPIcs.SoCG.2024.11</a>","mla":"Attali, Dominique, et al. “Tight Bounds for the Learning of Homotopy à La Niyogi, Smale, and Weinberger for Subsets of Euclidean Spaces and of Riemannian Manifolds.” <i>40th International Symposium on Computational Geometry</i>, vol. 293, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 11:1-11:19, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.11\">10.4230/LIPIcs.SoCG.2024.11</a>.","chicago":"Attali, Dominique, Hana Kourimska, Christopher D Fillmore, Ishika Ghosh, André Lieutier, Elizabeth R Stephenson, and Mathijs Wintraecken. “Tight Bounds for the Learning of Homotopy à La Niyogi, Smale, and Weinberger for Subsets of Euclidean Spaces and of Riemannian Manifolds.” In <i>40th International Symposium on Computational Geometry</i>, 293:11:1-11:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.11\">https://doi.org/10.4230/LIPIcs.SoCG.2024.11</a>."},"oa_version":"Published Version","file":[{"file_id":"17171","creator":"cfillmor","date_created":"2024-06-25T11:47:26Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"LIPIcs.SoCG.2024.11.pdf","file_size":20886142,"date_updated":"2024-06-25T11:47:26Z","checksum":"6a2ddc8b51aa58f197a8b294750f1f8d","success":1}],"page":"11:1-11:19","date_updated":"2025-04-15T07:16:57Z","day":"06","external_id":{"arxiv":["2206.10485"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","call_identifier":"H2020"},{"call_identifier":"FWF","grant_number":"Z00342","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","call_identifier":"FWF"},{"_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","name":"Learning and triangulating manifolds via collapses","grant_number":"M03073"}],"publication_status":"published","quality_controlled":"1","file_date_updated":"2024-06-25T11:47:26Z","oa":1,"conference":{"end_date":"2024-06-14","location":"Athens, Greece","start_date":"2024-06-11","name":"SoCG: Symposium on Computational Geometry"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"first_name":"Dominique","full_name":"Attali, Dominique","last_name":"Attali"},{"orcid":"0000-0001-7841-0091","last_name":"Kourimska","full_name":"Kourimska, Hana","id":"D9B8E14C-3C26-11EA-98F5-1F833DDC885E","first_name":"Hana"},{"id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","first_name":"Christopher D","full_name":"Fillmore, Christopher D","last_name":"Fillmore"},{"id":"ee449b28-344d-11ef-a6d5-9ca430e9e9ff","first_name":"Ishika","last_name":"Ghosh","full_name":"Ghosh, Ishika"},{"last_name":"Lieutier","full_name":"Lieutier, André","first_name":"André"},{"id":"2D04F932-F248-11E8-B48F-1D18A9856A87","first_name":"Elizabeth R","orcid":"0000-0002-6862-208X","last_name":"Stephenson","full_name":"Stephenson, Elizabeth R"},{"first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220","last_name":"Wintraecken"}],"_id":"17170","ddc":["516"],"has_accepted_license":"1"},{"doi":"10.1137/22M1489071","type":"journal_article","publication":"SIAM Journal on Discrete Mathematics","language":[{"iso":"eng"}],"date_published":"2024-06-07T00:00:00Z","scopus_import":"1","intvolume":"        38","year":"2024","issue":"2","acknowledgement":"The second author is partially supported by the Alexander von Humboldt Foundation. The sixth author is supported by the European Union's Horizon 2020 research and innovation programme under Marie Sklodowska-Curie grant agreement 754411, and by Austrian Science Fund(FWF) grant M-3073. All other authors are supported by European Research Council (ERC) grant 788183, by the Wittgenstein Prize, by Austrian Science Fund (FWF) grant Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF) grant I 02979-N35.","publication_identifier":{"issn":["0895-4801"]},"arxiv":1,"title":"Brillouin zones of integer lattices and their perturbations","status":"public","department":[{"_id":"HeEd"}],"volume":38,"month":"06","isi":1,"abstract":[{"lang":"eng","text":"For a locally finite set, 𝐴⊆ℝ𝑑\r\n, the 𝑘\r\nth Brillouin zone of 𝑎∈𝐴\r\n is the region of points 𝑥∈ℝ𝑑\r\n for which ‖𝑥−𝑎‖\r\n is the 𝑘\r\nth smallest among the Euclidean distances between 𝑥\r\n and the points in 𝐴\r\n. If 𝐴\r\n is a lattice, the 𝑘\r\nth Brillouin zones of the points in 𝐴\r\n are translates of each other, and together they tile space. Depending on the value of 𝑘\r\n, they express medium- or long-range order in the set. We study fundamental geometric and combinatorial properties of Brillouin zones, focusing on the integer lattice and its perturbations. Our results include the stability of a Brillouin zone under perturbations, a linear upper bound on the number of chambers in a zone for lattices in ℝ2\r\n, and the convergence of the maximum volume of a chamber to zero for the integer lattice."}],"article_processing_charge":"No","date_created":"2024-06-30T22:01:05Z","article_type":"original","ec_funded":1,"citation":{"short":"H. Edelsbrunner, A. Garber, M. Ghafaris, T. Heiss, M. Saghafiant, M. Wintraecken, SIAM Journal on Discrete Mathematics 38 (2024) 1784–1807.","ama":"Edelsbrunner H, Garber A, Ghafaris M, Heiss T, Saghafiant M, Wintraecken M. Brillouin zones of integer lattices and their perturbations. <i>SIAM Journal on Discrete Mathematics</i>. 2024;38(2):1784-1807. doi:<a href=\"https://doi.org/10.1137/22M1489071\">10.1137/22M1489071</a>","chicago":"Edelsbrunner, Herbert, Alexey Garber, Mohadese Ghafaris, Teresa Heiss, Morteza Saghafiant, and Mathijs Wintraecken. “Brillouin Zones of Integer Lattices and Their Perturbations.” <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial and Applied Mathematics, 2024. <a href=\"https://doi.org/10.1137/22M1489071\">https://doi.org/10.1137/22M1489071</a>.","apa":"Edelsbrunner, H., Garber, A., Ghafaris, M., Heiss, T., Saghafiant, M., &#38; Wintraecken, M. (2024). Brillouin zones of integer lattices and their perturbations. <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/22M1489071\">https://doi.org/10.1137/22M1489071</a>","mla":"Edelsbrunner, Herbert, et al. “Brillouin Zones of Integer Lattices and Their Perturbations.” <i>SIAM Journal on Discrete Mathematics</i>, vol. 38, no. 2, Society for Industrial and Applied Mathematics, 2024, pp. 1784–807, doi:<a href=\"https://doi.org/10.1137/22M1489071\">10.1137/22M1489071</a>.","ieee":"H. Edelsbrunner, A. Garber, M. Ghafaris, T. Heiss, M. Saghafiant, and M. Wintraecken, “Brillouin zones of integer lattices and their perturbations,” <i>SIAM Journal on Discrete Mathematics</i>, vol. 38, no. 2. Society for Industrial and Applied Mathematics, pp. 1784–1807, 2024.","ista":"Edelsbrunner H, Garber A, Ghafaris M, Heiss T, Saghafiant M, Wintraecken M. 2024. Brillouin zones of integer lattices and their perturbations. SIAM Journal on Discrete Mathematics. 38(2), 1784–1807."},"oa_version":"Preprint","page":"1784-1807","date_updated":"2025-09-08T08:06:04Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2204.01077"}],"day":"07","external_id":{"arxiv":["2204.01077"],"isi":["001292728600001"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020"},{"_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","name":"Learning and triangulating manifolds via collapses","grant_number":"M03073"},{"grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"Z00342","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","quality_controlled":"1","corr_author":"1","oa":1,"publisher":"Society for Industrial and Applied Mathematics","_id":"17190","author":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"last_name":"Garber","full_name":"Garber, Alexey","first_name":"Alexey"},{"full_name":"Ghafaris, Mohadese","last_name":"Ghafaris","first_name":"Mohadese"},{"full_name":"Heiss, Teresa","last_name":"Heiss","orcid":"0000-0002-1780-2689","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","first_name":"Teresa"},{"first_name":"Morteza","full_name":"Saghafiant, Morteza","last_name":"Saghafiant"},{"first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","orcid":"0000-0002-7472-2220"}]},{"status":"public","department":[{"_id":"HeEd"}],"volume":320,"abstract":[{"lang":"eng","text":"Given a finite set, A ⊆ ℝ², and a subset, B ⊆ A, the MST-ratio is the combined length of the minimum spanning trees of B and A⧵B divided by the length of the minimum spanning tree of A. The question of the supremum, over all sets A, of the maximum, over all subsets B, is related to the Steiner ratio, and we prove this sup-max is between 2.154 and 2.427. Restricting ourselves to 2-dimensional lattices, we prove that the sup-max is 2, while the inf-max is 1.25. By some margin the most difficult of these results is the upper bound for the inf-max, which we prove by showing that the hexagonal lattice cannot have MST-ratio larger than 1.25."}],"isi":1,"month":"10","article_processing_charge":"Yes","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2024-11-17T23:01:47Z","ec_funded":1,"citation":{"ama":"Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. The Euclidean MST-ratio for bi-colored lattices. In: <i>32nd International Symposium on Graph Drawing and Network Visualization</i>. Vol 320. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.GD.2024.3\">10.4230/LIPIcs.GD.2024.3</a>","short":"S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, M. Saghafian, in:, 32nd International Symposium on Graph Drawing and Network Visualization, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ista":"Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. 2024. The Euclidean MST-ratio for bi-colored lattices. 32nd International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network Visualization, LIPIcs, vol. 320, 3.","ieee":"S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian, “The Euclidean MST-ratio for bi-colored lattices,” in <i>32nd International Symposium on Graph Drawing and Network Visualization</i>, Vienna, Austria, 2024, vol. 320.","apa":"Cultrera di Montesano, S., Draganov, O., Edelsbrunner, H., &#38; Saghafian, M. (2024). The Euclidean MST-ratio for bi-colored lattices. In <i>32nd International Symposium on Graph Drawing and Network Visualization</i> (Vol. 320). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.GD.2024.3\">https://doi.org/10.4230/LIPIcs.GD.2024.3</a>","mla":"Cultrera di Montesano, Sebastiano, et al. “The Euclidean MST-Ratio for Bi-Colored Lattices.” <i>32nd International Symposium on Graph Drawing and Network Visualization</i>, vol. 320, 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.GD.2024.3\">10.4230/LIPIcs.GD.2024.3</a>.","chicago":"Cultrera di Montesano, Sebastiano, Ondrej Draganov, Herbert Edelsbrunner, and Morteza Saghafian. “The Euclidean MST-Ratio for Bi-Colored Lattices.” In <i>32nd International Symposium on Graph Drawing and Network Visualization</i>, Vol. 320. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.GD.2024.3\">https://doi.org/10.4230/LIPIcs.GD.2024.3</a>."},"alternative_title":["LIPIcs"],"OA_place":"publisher","file":[{"content_type":"application/pdf","date_updated":"2024-11-18T07:49:25Z","file_size":908541,"file_name":"2024_LIPIcs_CultreradiMontesano.pdf","checksum":"5f9b35e115c3d375e99be78da9054cb4","success":1,"file_id":"18560","creator":"dernst","date_created":"2024-11-18T07:49:25Z","relation":"main_file","access_level":"open_access"}],"oa_version":"Published Version","doi":"10.4230/LIPIcs.GD.2024.3","type":"conference","publication":"32nd International Symposium on Graph Drawing and Network Visualization","language":[{"iso":"eng"}],"date_published":"2024-10-28T00:00:00Z","scopus_import":"1","intvolume":"       320","year":"2024","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, \"Discretization in Geometry and Dynamics\", Austrian Science Fund (FWF), grant no. I 02979-N35.","publication_identifier":{"isbn":["9783959773430"],"issn":["1868-8969"]},"article_number":"3","arxiv":1,"title":"The Euclidean MST-ratio for bi-colored lattices","publication_status":"published","corr_author":"1","quality_controlled":"1","conference":{"end_date":"2024-09-20","location":"Vienna, Austria","name":"GD: Graph Drawing and Network Visualization","start_date":"2024-09-18"},"oa":1,"file_date_updated":"2024-11-18T07:49:25Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ddc":["510"],"has_accepted_license":"1","author":[{"orcid":"0000-0001-6249-0832","last_name":"Cultrera di Montesano","full_name":"Cultrera di Montesano, Sebastiano","id":"34D2A09C-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastiano"},{"id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","first_name":"Ondrej","full_name":"Draganov, Ondrej","orcid":"0000-0003-0464-3823","last_name":"Draganov"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"full_name":"Saghafian, Morteza","last_name":"Saghafian","first_name":"Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824"}],"_id":"18556","date_updated":"2025-12-02T13:50:50Z","external_id":{"arxiv":["2403.10204"],"isi":["001540278400001"]},"day":"28","OA_type":"gold","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"H2020","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183"},{"grant_number":"Z00342","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","call_identifier":"FWF"}]},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","date_created":"2024-12-01T23:01:54Z","OA_place":"publisher","citation":{"ama":"De Nooijer P, Terziadis S, Weinberger A, et al. Removing popular faces in curve arrangements. <i>Journal of Graph Algorithms and Applications</i>. 2024;28(2):47-82. doi:<a href=\"https://doi.org/10.7155/jgaa.v28i2.2988\">10.7155/jgaa.v28i2.2988</a>","short":"P. De Nooijer, S. Terziadis, A. Weinberger, Z. Masárová, T. Mchedlidze, M. Löffler, G. Rote, Journal of Graph Algorithms and Applications 28 (2024) 47–82.","mla":"De Nooijer, Phoebe, et al. “Removing Popular Faces in Curve Arrangements.” <i>Journal of Graph Algorithms and Applications</i>, vol. 28, no. 2, Brown University, 2024, pp. 47–82, doi:<a href=\"https://doi.org/10.7155/jgaa.v28i2.2988\">10.7155/jgaa.v28i2.2988</a>.","apa":"De Nooijer, P., Terziadis, S., Weinberger, A., Masárová, Z., Mchedlidze, T., Löffler, M., &#38; Rote, G. (2024). Removing popular faces in curve arrangements. <i>Journal of Graph Algorithms and Applications</i>. Brown University. <a href=\"https://doi.org/10.7155/jgaa.v28i2.2988\">https://doi.org/10.7155/jgaa.v28i2.2988</a>","chicago":"De Nooijer, Phoebe, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, and Günter Rote. “Removing Popular Faces in Curve Arrangements.” <i>Journal of Graph Algorithms and Applications</i>. Brown University, 2024. <a href=\"https://doi.org/10.7155/jgaa.v28i2.2988\">https://doi.org/10.7155/jgaa.v28i2.2988</a>.","ista":"De Nooijer P, Terziadis S, Weinberger A, Masárová Z, Mchedlidze T, Löffler M, Rote G. 2024. Removing popular faces in curve arrangements. Journal of Graph Algorithms and Applications. 28(2), 47–82.","ieee":"P. De Nooijer <i>et al.</i>, “Removing popular faces in curve arrangements,” <i>Journal of Graph Algorithms and Applications</i>, vol. 28, no. 2. Brown University, pp. 47–82, 2024."},"oa_version":"Published Version","file":[{"access_level":"open_access","date_created":"2024-12-03T09:45:00Z","creator":"dernst","relation":"main_file","file_id":"18609","success":1,"checksum":"be611da6f9d790dc980d6fb7283fe889","content_type":"application/pdf","file_name":"2024_JourGraphAlgorithms_deNooijer.pdf","file_size":1582493,"date_updated":"2024-12-03T09:45:00Z"}],"status":"public","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"article_processing_charge":"No","abstract":[{"text":"A face in a curve arrangement is called popular if it is bounded by the same curve multiple times. Motivated by the automatic generation of curved nonogram puzzles, we investigate possibilities to eliminate the popular faces in an arrangement by inserting a single additional curve. This turns out to be NP-hard; however, it becomes tractable when the number of popular faces is small: We present a randomized FPT-time algorithm where the parameter is the number of popular faces.","lang":"eng"}],"month":"11","volume":28,"year":"2024","intvolume":"        28","issue":"2","acknowledgement":"This work was initiated at the 16th European Research Week on Geometric Graphs in Strobl in 2019. A.W. has been supported by the Austrian Science Fund (FWF): W1230. S.T. has been funded by the Vienna Science and Technology Fund (WWTF) [10.47379/ICT19035] and by the NWO Gravitation project NETWORKS under grant no. 024.002.003. Part of the work was done while A.W. was emplyed at Graz University of Technology. Preliminary versions of this work have been presented at the 38th European Workshop on Computational Geometry (EuroCG\r\n2022) in Perugia [10] and at the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023) in Isola delle Femmine [11].","arxiv":1,"publication_identifier":{"issn":["1526-1719"]},"title":"Removing popular faces in curve arrangements","doi":"10.7155/jgaa.v28i2.2988","type":"journal_article","scopus_import":"1","date_published":"2024-11-03T00:00:00Z","publication":"Journal of Graph Algorithms and Applications","language":[{"iso":"eng"}],"oa":1,"file_date_updated":"2024-12-03T09:45:00Z","publisher":"Brown University","author":[{"last_name":"De Nooijer","full_name":"De Nooijer, Phoebe","first_name":"Phoebe"},{"first_name":"Soeren","last_name":"Terziadis","full_name":"Terziadis, Soeren"},{"full_name":"Weinberger, Alexandra","last_name":"Weinberger","first_name":"Alexandra"},{"first_name":"Zuzana","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","full_name":"Masárová, Zuzana","last_name":"Masárová","orcid":"0000-0002-6660-1322"},{"full_name":"Mchedlidze, Tamara","last_name":"Mchedlidze","first_name":"Tamara"},{"first_name":"Maarten","full_name":"Löffler, Maarten","last_name":"Löffler"},{"last_name":"Rote","full_name":"Rote, Günter","first_name":"Günter"}],"_id":"18604","ddc":["510"],"has_accepted_license":"1","publication_status":"published","DOAJ_listed":"1","corr_author":"1","quality_controlled":"1","day":"03","OA_type":"gold","external_id":{"arxiv":["2202.12175"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"47-82","date_updated":"2024-12-03T09:49:18Z"},{"_id":"18667","author":[{"first_name":"Teresa","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1780-2689","last_name":"Heiss","full_name":"Heiss, Teresa"}],"ddc":["514","516","004"],"has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","file_date_updated":"2024-12-19T10:24:50Z","oa":1,"corr_author":"1","publication_status":"published","keyword":["persistent homology","topological data analysis","periodic","crystalline materials","images","fingerprint"],"project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","day":"17","date_updated":"2026-04-07T12:54:10Z","page":"111","oa_version":"Published Version","file":[{"checksum":"247bb057aed2fba1cd4711917aaa2d77","success":1,"content_type":"application/pdf","file_name":"Teresa_Heiss_PhD_Thesis_final.pdf","date_updated":"2024-12-19T10:24:46Z","file_size":7752253,"access_level":"open_access","file_id":"18686","creator":"theiss","date_created":"2024-12-19T10:24:46Z","relation":"main_file"},{"checksum":"9648b45c07a008ee11a07f99856a139d","content_type":"application/zip","date_updated":"2024-12-19T10:24:50Z","file_size":17197731,"file_name":"PhD_Thesis.zip","access_level":"closed","file_id":"18687","date_created":"2024-12-19T10:24:50Z","creator":"theiss","relation":"source_file"}],"alternative_title":["ISTA Thesis"],"OA_place":"publisher","citation":{"ama":"Heiss T. New methods for applying topological data analysis to materials science. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18667\">10.15479/at:ista:18667</a>","short":"T. Heiss, New Methods for Applying Topological Data Analysis to Materials Science, Institute of Science and Technology Austria, 2024.","mla":"Heiss, Teresa. <i>New Methods for Applying Topological Data Analysis to Materials Science</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18667\">10.15479/at:ista:18667</a>.","apa":"Heiss, T. (2024). <i>New methods for applying topological data analysis to materials science</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18667\">https://doi.org/10.15479/at:ista:18667</a>","chicago":"Heiss, Teresa. “New Methods for Applying Topological Data Analysis to Materials Science.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18667\">https://doi.org/10.15479/at:ista:18667</a>.","ieee":"T. Heiss, “New methods for applying topological data analysis to materials science,” Institute of Science and Technology Austria, 2024.","ista":"Heiss T. 2024. New methods for applying topological data analysis to materials science. Institute of Science and Technology Austria."},"ec_funded":1,"date_created":"2024-12-17T16:17:55Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_processing_charge":"No","month":"12","abstract":[{"text":"Many chemical and physical properties of materials are determined by the material’s shape,\r\nfor example the size of its pores and the width of its tunnels. This makes materials science\r\na prime application area for geometrical and topological methods. Nevertheless many\r\nmethods in topological data analysis have not been satisfyingly extended to the needs of\r\nmaterials science. This thesis provides new methods and new mathematical theorems\r\ntargeted at those specific needs by answering four different research questions. While the\r\nmotivation for each of the research questions arises from materials science, the methods\r\nare versatile and can be applied in different areas as well. \r\n\r\nThe first research question is concerned with image data, for example a three-dimensional\r\ncomputed tomography (CT) scan of a material, like sand or stone. There are two commonly\r\nused topologies for digital images and depending on the application either of them might be\r\nrequired. However, software for computing the topological data analysis method persistence\r\nhomology, usually supports only one of the two topologies. We answer the question how to\r\ncompute persistent homology of an image with respect to one of the two topologies using\r\nsoftware that is intended for the other topology. \r\n\r\nThe second research question is concerned with image data as well, and asks how much\r\nof the topological information of an image is lost when the resolution is coarsened. As\r\ncomputer tomography scanners are more expensive the higher the resolution, it is an\r\nimportant question in materials science to know which resolution is enough to get satisfying\r\npersistent homology. We give theoretical bounds on the information loss based on different\r\ngeometrical properties of the object to be scanned. In addition, we conduct experiments on\r\nsand and stone CT image data. \r\n\r\nThe third research question is motivated by comparing crystalline materials efficiently. As\r\nthe atoms within a crystal repeat periodically, crystalline materials are either modeled by\r\nunmanageable infinite periodic point sets, or by one of their fundamental domains, which is\r\nunstable under perturbation. Therefore a fingerprint of crystalline materials is needed, with\r\nappropriate properties such that comparing the crystals can be eased by comparing the\r\nfingerprints instead. We define the density fingerprint and prove the necessary properties. \r\n\r\nThe fourth research question is motivated by studying the hole-structure or connectedness,\r\ni.e. persistent homology or merge trees, of crystalline materials. A common way to deal\r\nwith periodicity is to take a fundamental domain and identify opposite boundaries to form a\r\ntorus. However, computing persistent homology or merge trees on that torus loses some\r\nof the information materials scientists are interested in and is additionally not stable under\r\ncertain noise. We therefore decorate the merge tree stemming from the torus with additional\r\ninformation describing the density and growth rate of the periodic copies of a component\r\nwithin a growing spherical window. We prove all desired properties, like stability and efficient\r\ncomputability.","lang":"eng"}],"department":[{"_id":"GradSch"},{"_id":"HeEd"}],"related_material":{"record":[{"status":"public","id":"10828","relation":"part_of_dissertation"},{"status":"public","id":"11440","relation":"part_of_dissertation"},{"status":"public","id":"18673","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"9345","status":"public"}]},"status":"public","title":"New methods for applying topological data analysis to materials science","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-052-7"]},"acknowledgement":"I was supported by the European Research Council (ERC) Horizon 2020 project\r\n“Alpha Shape Theory Extended” No. 788183 and by the Pöttinger Scholarship. In addition,\r\nI am very thankful for having been able to attend the second Workshop for Women in\r\nComputational Topology in July 2019, funded by the Mathematical Sciences Institute at\r\nANU, the US National Science Foundation through the award CCF-1841455, the Australian\r\nMathematical Sciences Institute and the Association for Women in Mathematics. Two of the\r\nprojects presented in this thesis started there. One of them reached completion thanks to\r\nfunding from the MSRI Summer Research in Mathematics program awarded to me and my\r\ncollaborators in 2020.","year":"2024","date_published":"2024-12-17T00:00:00Z","language":[{"iso":"eng"}],"type":"dissertation","degree_awarded":"PhD","supervisor":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"}],"doi":"10.15479/at:ista:18667"},{"date_published":"2024-08-29T00:00:00Z","language":[{"iso":"eng"}],"publication":"arXiv","type":"preprint","doi":"10.48550/arXiv.2408.16575","title":"Merge trees of periodic filtrations","arxiv":1,"acknowledgement":"Both authors are partially supported by the European Research Council (ERC) Horizon 2020 project\r\n‘Alpha Shape Theory Extended’, grant no. 788183. The first author is also partially supported by the DFG\r\nCollaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund\r\n(FWF), grant no. I 02979-N35.","year":"2024","article_processing_charge":"No","month":"08","abstract":[{"text":"Motivated by applications to crystalline materials, we generalize the merge tree and the related barcode of a filtered complex to the periodic setting in Euclidean space. They are invariant under isometries, changing bases, and indeed changing lattices. In addition, we prove stability under perturbations and provide an algorithm that under mild geometric conditions typically satisfied by crystalline materials takes O((n+m)logn) time, in which n and m are the numbers of vertices and edges in the quotient complex, respectively.\r\n","lang":"eng"}],"department":[{"_id":"HeEd"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"18667","status":"public"}]},"status":"public","oa_version":"Preprint","OA_place":"repository","citation":{"short":"H. Edelsbrunner, T. Heiss, ArXiv (n.d.).","ama":"Edelsbrunner H, Heiss T. Merge trees of periodic filtrations. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2408.16575\">10.48550/arXiv.2408.16575</a>","ista":"Edelsbrunner H, Heiss T. Merge trees of periodic filtrations. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2408.16575\">10.48550/arXiv.2408.16575</a>.","ieee":"H. Edelsbrunner and T. Heiss, “Merge trees of periodic filtrations,” <i>arXiv</i>. .","chicago":"Edelsbrunner, Herbert, and Teresa Heiss. “Merge Trees of Periodic Filtrations.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2408.16575\">https://doi.org/10.48550/arXiv.2408.16575</a>.","mla":"Edelsbrunner, Herbert, and Teresa Heiss. “Merge Trees of Periodic Filtrations.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2408.16575\">10.48550/arXiv.2408.16575</a>.","apa":"Edelsbrunner, H., &#38; Heiss, T. (n.d.). Merge trees of periodic filtrations. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2408.16575\">https://doi.org/10.48550/arXiv.2408.16575</a>"},"ec_funded":1,"date_created":"2024-12-18T14:06:57Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2408.16575"}],"date_updated":"2026-04-07T12:54:09Z","project":[{"name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","call_identifier":"H2020"},{"call_identifier":"FWF","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2408.16575"]},"day":"29","corr_author":"1","publication_status":"draft","_id":"18673","author":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","first_name":"Teresa","orcid":"0000-0002-1780-2689","last_name":"Heiss","full_name":"Heiss, Teresa"}],"oa":1},{"oa":1,"author":[{"first_name":"Adam","last_name":"Brown","full_name":"Brown, Adam"},{"full_name":"Draganov, Ondrej","last_name":"Draganov","orcid":"0000-0003-0464-3823","id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","first_name":"Ondrej"}],"_id":"18981","publication_status":"draft","corr_author":"1","external_id":{"arxiv":["2209.14993"]},"day":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","call_identifier":"H2020"},{"name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"date_updated":"2026-04-07T11:47:29Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2209.14993"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2025-01-31T17:03:04Z","ec_funded":1,"citation":{"ista":"Brown A, Draganov O. Discrete microlocal Morse theory. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2209.14993\">10.48550/arXiv.2209.14993</a>.","ieee":"A. Brown and O. Draganov, “Discrete microlocal Morse theory,” <i>arXiv</i>. .","apa":"Brown, A., &#38; Draganov, O. (n.d.). Discrete microlocal Morse theory. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2209.14993\">https://doi.org/10.48550/arXiv.2209.14993</a>","mla":"Brown, Adam, and Ondrej Draganov. “Discrete Microlocal Morse Theory.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2209.14993\">10.48550/arXiv.2209.14993</a>.","chicago":"Brown, Adam, and Ondrej Draganov. “Discrete Microlocal Morse Theory.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2209.14993\">https://doi.org/10.48550/arXiv.2209.14993</a>.","ama":"Brown A, Draganov O. Discrete microlocal Morse theory. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2209.14993\">10.48550/arXiv.2209.14993</a>","short":"A. Brown, O. Draganov, ArXiv (n.d.)."},"OA_place":"repository","oa_version":"Preprint","status":"public","related_material":{"record":[{"relation":"later_version","id":"20323","status":"public"},{"relation":"dissertation_contains","id":"18979","status":"public"}]},"department":[{"_id":"HeEd"}],"month":"06","abstract":[{"text":"We establish several results combining discrete Morse theory and microlocal sheaf theory in the setting of finite posets and simplicial complexes. Our primary tool is a computationally tractable description of the bounded derived category of sheaves on a poset with the Alexandrov topology. We prove that each bounded complex of sheaves on a finite poset admits a unique (up to isomorphism of complexes) minimal injective resolution, and we provide algorithms for computing minimal injective resolution of an injective complex, as well as several useful functors between derived categories of sheaves. For the constant sheaf on a simplicial complex, we give asymptotically tight bounds on the complexity of computing the minimal injective resolution using those algorithms. Our main result is a novel definition of the discrete microsupport of a bounded complex of sheaves on a finite poset. We detail several foundational properties of the discrete microsupport, as well as a microlocal generalization of the discrete homological Morse theorem and Morse inequalities.","lang":"eng"}],"article_processing_charge":"No","year":"2024","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European\r\nUnion’s Horizon 2020 research and innovation programme, grant no. 788183, from the Wittgenstein Prize,\r\nAustrian Science Fund (FWF), grant no. Z 342-N31, and from the DFG Collaborative Research Center TRR\r\n109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35.","arxiv":1,"title":"Discrete microlocal Morse theory","doi":"10.48550/arXiv.2209.14993","type":"preprint","language":[{"iso":"eng"}],"date_published":"2024-06-09T00:00:00Z","publication":"arXiv"},{"doi":"10.18653/v1/2024.findings-emnlp.705","scopus_import":"1","date_published":"2024-11-01T00:00:00Z","language":[{"iso":"eng"}],"publication":"Findings of the Association for Computational Linguistics: EMNLP 2024","type":"conference","year":"2024","title":"The shape of word embeddings: Quantifying non-isometry with topological data analysis","arxiv":1,"status":"public","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Word embeddings represent language vocabularies as clouds of d-dimensional points. We investigate how information is conveyed by the general shape of these clouds, instead of representing the semantic meaning of each token. Specifically, we use the notion of persistent homology from topological data analysis (TDA) to measure the distances between language pairs from the shape of their unlabeled embeddings. These distances quantify the degree of non-isometry of the embeddings. To distinguish whether these differences are random training errors or capture real information about the languages, we use the computed distance matrices to construct language phylogenetic trees over 81 Indo-European languages. Careful evaluation shows that our reconstructed trees exhibit strong and statistically-significant similarities to the reference."}],"month":"11","department":[{"_id":"GradSch"},{"_id":"HeEd"}],"date_created":"2025-02-04T16:19:28Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"oa_version":"Published Version","file":[{"content_type":"application/pdf","file_name":"2024_EMNLP_Draganov.pdf","file_size":1312638,"date_updated":"2025-02-10T08:20:34Z","success":1,"checksum":"f4416a5962194f0181ab0dc7f9ef93c0","date_created":"2025-02-10T08:20:34Z","creator":"dernst","relation":"main_file","file_id":"19016","access_level":"open_access"}],"OA_place":"publisher","citation":{"ista":"Draganov O, Skiena S. 2024. The shape of word embeddings: Quantifying non-isometry with topological data analysis. Findings of the Association for Computational Linguistics: EMNLP 2024. EMNLP: Conference on Empirical Methods in Natural Language Processing, 12080–12099.","ieee":"O. Draganov and S. Skiena, “The shape of word embeddings: Quantifying non-isometry with topological data analysis,” in <i>Findings of the Association for Computational Linguistics: EMNLP 2024</i>, Miami, FL, United States, 2024, pp. 12080–12099.","chicago":"Draganov, Ondrej, and Steven Skiena. “The Shape of Word Embeddings: Quantifying Non-Isometry with Topological Data Analysis.” In <i>Findings of the Association for Computational Linguistics: EMNLP 2024</i>, 12080–99. Association for Computational Linguistics, 2024. <a href=\"https://doi.org/10.18653/v1/2024.findings-emnlp.705\">https://doi.org/10.18653/v1/2024.findings-emnlp.705</a>.","apa":"Draganov, O., &#38; Skiena, S. (2024). The shape of word embeddings: Quantifying non-isometry with topological data analysis. In <i>Findings of the Association for Computational Linguistics: EMNLP 2024</i> (pp. 12080–12099). Miami, FL, United States: Association for Computational Linguistics. <a href=\"https://doi.org/10.18653/v1/2024.findings-emnlp.705\">https://doi.org/10.18653/v1/2024.findings-emnlp.705</a>","mla":"Draganov, Ondrej, and Steven Skiena. “The Shape of Word Embeddings: Quantifying Non-Isometry with Topological Data Analysis.” <i>Findings of the Association for Computational Linguistics: EMNLP 2024</i>, Association for Computational Linguistics, 2024, pp. 12080–99, doi:<a href=\"https://doi.org/10.18653/v1/2024.findings-emnlp.705\">10.18653/v1/2024.findings-emnlp.705</a>.","short":"O. Draganov, S. Skiena, in:, Findings of the Association for Computational Linguistics: EMNLP 2024, Association for Computational Linguistics, 2024, pp. 12080–12099.","ama":"Draganov O, Skiena S. The shape of word embeddings: Quantifying non-isometry with topological data analysis. In: <i>Findings of the Association for Computational Linguistics: EMNLP 2024</i>. Association for Computational Linguistics; 2024:12080-12099. doi:<a href=\"https://doi.org/10.18653/v1/2024.findings-emnlp.705\">10.18653/v1/2024.findings-emnlp.705</a>"},"date_updated":"2025-02-10T08:21:37Z","page":"12080-12099","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2404.00500"]},"OA_type":"gold","day":"01","publication_status":"published","corr_author":"1","quality_controlled":"1","file_date_updated":"2025-02-10T08:20:34Z","oa":1,"conference":{"name":"EMNLP: Conference on Empirical Methods in Natural Language Processing","start_date":"2024-11-12","end_date":"2024-11-16","location":"Miami, FL, United States"},"author":[{"full_name":"Draganov, Ondrej","last_name":"Draganov","orcid":"0000-0003-0464-3823","first_name":"Ondrej","id":"2B23F01E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Skiena, Steven","last_name":"Skiena","first_name":"Steven"}],"_id":"18998","ddc":["500"],"has_accepted_license":"1","publisher":"Association for Computational Linguistics"},{"language":[{"iso":"eng"}],"publication":"arXiv","date_published":"2024-06-06T00:00:00Z","type":"preprint","doi":"10.48550/ARXIV.2406.04102","title":"Chromatic topological data analysis","arxiv":1,"article_number":"2406.04102","year":"2024","abstract":[{"text":"Exploring the shape of point configurations has been a key driver in the evolution of TDA (short for topological data analysis) since its infancy. This survey illustrates the recent efforts to broaden these ideas to model spatial interactions among multiple configurations, each distinguished by a color. It describes advances in this area and prepares the ground for further exploration by mentioning unresolved questions and promising research avenues while focusing on the overlap with discrete geometry.","lang":"eng"}],"month":"06","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"HeEd"}],"status":"public","oa_version":"Preprint","citation":{"short":"S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, M. Saghafian, ArXiv (n.d.).","ama":"Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. Chromatic topological data analysis. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/ARXIV.2406.04102\">10.48550/ARXIV.2406.04102</a>","ista":"Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. Chromatic topological data analysis. arXiv, 2406.04102.","ieee":"S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian, “Chromatic topological data analysis,” <i>arXiv</i>. .","chicago":"Cultrera di Montesano, Sebastiano, Ondrej Draganov, Herbert Edelsbrunner, and Morteza Saghafian. “Chromatic Topological Data Analysis.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2406.04102\">https://doi.org/10.48550/ARXIV.2406.04102</a>.","apa":"Cultrera di Montesano, S., Draganov, O., Edelsbrunner, H., &#38; Saghafian, M. (n.d.). Chromatic topological data analysis. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/ARXIV.2406.04102\">https://doi.org/10.48550/ARXIV.2406.04102</a>","mla":"Cultrera di Montesano, Sebastiano, et al. “Chromatic Topological Data Analysis.” <i>ArXiv</i>, 2406.04102, doi:<a href=\"https://doi.org/10.48550/ARXIV.2406.04102\">10.48550/ARXIV.2406.04102</a>."},"OA_place":"repository","date_created":"2025-02-04T16:21:21Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2406.04102"}],"date_updated":"2025-02-10T08:14:27Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"green","day":"06","external_id":{"arxiv":["2406.04102"]},"corr_author":"1","publication_status":"submitted","ddc":["510"],"has_accepted_license":"1","_id":"18999","author":[{"first_name":"Sebastiano","id":"34D2A09C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6249-0832","last_name":"Cultrera di Montesano","full_name":"Cultrera di Montesano, Sebastiano"},{"last_name":"Draganov","orcid":"0000-0003-0464-3823","full_name":"Draganov, Ondrej","id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","first_name":"Ondrej"},{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Saghafian","full_name":"Saghafian, Morteza","first_name":"Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824"}],"oa":1},{"date_created":"2024-09-08T22:01:11Z","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"access_level":"open_access","file_id":"17948","relation":"main_file","creator":"dernst","date_created":"2024-09-09T09:01:12Z","checksum":"624a9e2c5b49d6c38b88b0f675467ba3","success":1,"file_name":"2024_Entropy_Edelsbrunner.pdf","file_size":8025139,"date_updated":"2024-09-09T09:01:12Z","content_type":"application/pdf"}],"oa_version":"Published Version","citation":{"chicago":"Edelsbrunner, Herbert, Katharina Ölsböck, and Hubert Wagner. “Understanding Higher-Order Interactions in Information Space.” <i>Entropy</i>. MDPI, 2024. <a href=\"https://doi.org/10.3390/e26080637\">https://doi.org/10.3390/e26080637</a>.","mla":"Edelsbrunner, Herbert, et al. “Understanding Higher-Order Interactions in Information Space.” <i>Entropy</i>, vol. 26, no. 8, 637, MDPI, 2024, doi:<a href=\"https://doi.org/10.3390/e26080637\">10.3390/e26080637</a>.","apa":"Edelsbrunner, H., Ölsböck, K., &#38; Wagner, H. (2024). Understanding higher-order interactions in information space. <i>Entropy</i>. MDPI. <a href=\"https://doi.org/10.3390/e26080637\">https://doi.org/10.3390/e26080637</a>","ieee":"H. Edelsbrunner, K. Ölsböck, and H. Wagner, “Understanding higher-order interactions in information space,” <i>Entropy</i>, vol. 26, no. 8. MDPI, 2024.","ista":"Edelsbrunner H, Ölsböck K, Wagner H. 2024. Understanding higher-order interactions in information space. Entropy. 26(8), 637.","short":"H. Edelsbrunner, K. Ölsböck, H. Wagner, Entropy 26 (2024).","ama":"Edelsbrunner H, Ölsböck K, Wagner H. Understanding higher-order interactions in information space. <i>Entropy</i>. 2024;26(8). doi:<a href=\"https://doi.org/10.3390/e26080637\">10.3390/e26080637</a>"},"related_material":{"link":[{"relation":"software","url":"https://git.ista.ac.at/katharina.oelsboeck/wrap_2_3-public/"}]},"status":"public","abstract":[{"lang":"eng","text":"Abstract\r\nMethods used in topological data analysis naturally capture higher-order interactions in point cloud data embedded in a metric space. This methodology was recently extended to data living in an information space, by which we mean a space measured with an information theoretical distance. One such setting is a finite collection of discrete probability distributions embedded in the probability simplex measured with the relative entropy (Kullback–Leibler divergence). More generally, one can work with a Bregman divergence parameterized by a different notion of entropy. While theoretical algorithms exist for this setup, there is a paucity of implementations for exploring and comparing geometric-topological properties of various information spaces. The interest of this work is therefore twofold. First, we propose the first robust algorithms and software for geometric and topological data analysis in information space. Perhaps surprisingly, despite working with Bregman divergences, our design reuses robust libraries for the Euclidean case. Second, using the new software, we take the first steps towards understanding the geometric-topological structure of these spaces. In particular, we compare them with the more familiar spaces equipped with the Euclidean and Fisher metrics."}],"month":"08","isi":1,"volume":26,"article_processing_charge":"Yes","department":[{"_id":"HeEd"}],"issue":"8","acknowledgement":"We thank Anton Nikitenko for first observing that the Wrap complex can be characterized as stated in Claim (ii) of the Wrap Complex Lemma, and Ondrej Draganov for correcting a critical mistake in one of our formulas in Section 2.","intvolume":"        26","year":"2024","title":"Understanding higher-order interactions in information space","article_number":"637","pmid":1,"publication_identifier":{"eissn":["1099-4300"]},"doi":"10.3390/e26080637","language":[{"iso":"eng"}],"date_published":"2024-08-01T00:00:00Z","publication":"Entropy","scopus_import":"1","type":"journal_article","oa":1,"file_date_updated":"2024-09-09T09:01:12Z","has_accepted_license":"1","ddc":["510"],"_id":"17891","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"last_name":"Ölsböck","orcid":"0000-0002-4672-8297","full_name":"Ölsböck, Katharina","id":"4D4AA390-F248-11E8-B48F-1D18A9856A87","first_name":"Katharina"},{"full_name":"Wagner, Hubert","last_name":"Wagner","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","first_name":"Hubert"}],"publisher":"MDPI","publication_status":"published","quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["001305543500001"],"pmid":["39202107"]},"day":"01","date_updated":"2025-09-08T09:13:44Z"},{"title":"The ultimate frontier: An optimality construction for homotopy inference (media exposition)","publication_identifier":{"isbn":["9783959773164"]},"article_number":"87","acknowledgement":"This research has been supported by the European Research Council (ERC), grant No. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant No. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant No. I02979-N35. Mathijs Wintraecken: Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, the Austrian science fund (FWF) grant No. M-3073, and the welcome package from IDEX of the Université Côte d’Azur.\r\nWe thank Jean-Daniel Boissonnat, Herbert Edelsbrunner, and Mariette Yvinec for discussion.","intvolume":"       293","year":"2024","date_published":"2024-06-06T00:00:00Z","publication":"40th International Symposium on Computational Geometry","language":[{"iso":"eng"}],"type":"conference","doi":"10.4230/LIPIcs.SoCG.2024.87","file":[{"date_updated":"2024-09-19T10:30:37Z","file_name":"2024_LIPICs_Attali.pdf","file_size":3507177,"content_type":"application/pdf","success":1,"checksum":"9355c2e60b8ec285e1b22719c5b73f1a","relation":"main_file","creator":"dernst","date_created":"2024-09-19T10:30:37Z","file_id":"18098","access_level":"open_access"}],"oa_version":"Published Version","citation":{"short":"D. Attali, H. Kourimska, C.D. Fillmore, I. Ghosh, A. Lieutier, E.R. Stephenson, M. Wintraecken, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ama":"Attali D, Kourimska H, Fillmore CD, et al. The ultimate frontier: An optimality construction for homotopy inference (media exposition). In: <i>40th International Symposium on Computational Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.87\">10.4230/LIPIcs.SoCG.2024.87</a>","ieee":"D. Attali <i>et al.</i>, “The ultimate frontier: An optimality construction for homotopy inference (media exposition),” in <i>40th International Symposium on Computational Geometry</i>, Athens, Greece, 2024, vol. 293.","ista":"Attali D, Kourimska H, Fillmore CD, Ghosh I, Lieutier A, Stephenson ER, Wintraecken M. 2024. The ultimate frontier: An optimality construction for homotopy inference (media exposition). 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 87.","chicago":"Attali, Dominique, Hana Kourimska, Christopher D Fillmore, Ishika Ghosh, Andre Lieutier, Elizabeth R Stephenson, and Mathijs Wintraecken. “The Ultimate Frontier: An Optimality Construction for Homotopy Inference (Media Exposition).” In <i>40th International Symposium on Computational Geometry</i>, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.87\">https://doi.org/10.4230/LIPIcs.SoCG.2024.87</a>.","apa":"Attali, D., Kourimska, H., Fillmore, C. D., Ghosh, I., Lieutier, A., Stephenson, E. R., &#38; Wintraecken, M. (2024). The ultimate frontier: An optimality construction for homotopy inference (media exposition). In <i>40th International Symposium on Computational Geometry</i> (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.87\">https://doi.org/10.4230/LIPIcs.SoCG.2024.87</a>","mla":"Attali, Dominique, et al. “The Ultimate Frontier: An Optimality Construction for Homotopy Inference (Media Exposition).” <i>40th International Symposium on Computational Geometry</i>, vol. 293, 87, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.87\">10.4230/LIPIcs.SoCG.2024.87</a>."},"alternative_title":["LIPIcs"],"date_created":"2024-09-19T10:29:48Z","ec_funded":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"volume":293,"abstract":[{"lang":"eng","text":"In our companion paper \"Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of Euclidean spaces and of Riemannian manifolds\" we gave optimal bounds (in terms of the two one-sided Hausdorff distances) on a sample P of an input shape 𝒮 (either manifold or general set with positive reach) such that one can infer the homotopy of 𝒮 from the union of balls with some radius centred at P, both in Euclidean space and in a Riemannian manifold of bounded curvature. The construction showing the optimality of the bounds is not straightforward. The purpose of this video is to visualize and thus elucidate said construction in the Euclidean setting."}],"month":"06","article_processing_charge":"Yes","department":[{"_id":"HeEd"}],"status":"public","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","grant_number":"788183","call_identifier":"H2020"},{"name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","call_identifier":"FWF"},{"grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"grant_number":"M03073","name":"Learning and triangulating manifolds via collapses","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"06","date_updated":"2025-04-15T07:16:58Z","has_accepted_license":"1","ddc":["000"],"author":[{"last_name":"Attali","full_name":"Attali, Dominique","first_name":"Dominique"},{"orcid":"0000-0001-7841-0091","last_name":"Kourimska","full_name":"Kourimska, Hana","id":"D9B8E14C-3C26-11EA-98F5-1F833DDC885E","first_name":"Hana"},{"last_name":"Fillmore","full_name":"Fillmore, Christopher D","id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","first_name":"Christopher D"},{"full_name":"Ghosh, Ishika","last_name":"Ghosh","id":"ee449b28-344d-11ef-a6d5-9ca430e9e9ff","first_name":"Ishika"},{"first_name":"Andre","full_name":"Lieutier, Andre","last_name":"Lieutier"},{"full_name":"Stephenson, Elizabeth R","last_name":"Stephenson","orcid":"0000-0002-6862-208X","id":"2D04F932-F248-11E8-B48F-1D18A9856A87","first_name":"Elizabeth R"},{"first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","orcid":"0000-0002-7472-2220"}],"_id":"18097","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","conference":{"location":"Athens, Greece","end_date":"2024-06-14","start_date":"2024-06-11","name":"SoCG: Symposium on Computational Geometry"},"file_date_updated":"2024-09-19T10:30:37Z","oa":1,"corr_author":"1","quality_controlled":"1","publication_status":"published"},{"ec_funded":1,"article_type":"original","date_created":"2022-09-11T22:01:57Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"oa_version":"Published Version","file":[{"file_id":"12322","date_created":"2023-01-20T10:02:48Z","creator":"dernst","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2023_Algorithmica_Edelsbrunner.pdf","file_size":911017,"date_updated":"2023-01-20T10:02:48Z","checksum":"71685ca5121f4c837f40c3f8eb50c915","success":1}],"citation":{"chicago":"Edelsbrunner, Herbert, and Georg F Osang. “A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes.” <i>Algorithmica</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s00453-022-01027-6\">https://doi.org/10.1007/s00453-022-01027-6</a>.","apa":"Edelsbrunner, H., &#38; Osang, G. F. (2023). A simple algorithm for higher-order Delaunay mosaics and alpha shapes. <i>Algorithmica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00453-022-01027-6\">https://doi.org/10.1007/s00453-022-01027-6</a>","mla":"Edelsbrunner, Herbert, and Georg F. Osang. “A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes.” <i>Algorithmica</i>, vol. 85, Springer Nature, 2023, pp. 277–95, doi:<a href=\"https://doi.org/10.1007/s00453-022-01027-6\">10.1007/s00453-022-01027-6</a>.","ieee":"H. Edelsbrunner and G. F. Osang, “A simple algorithm for higher-order Delaunay mosaics and alpha shapes,” <i>Algorithmica</i>, vol. 85. Springer Nature, pp. 277–295, 2023.","ista":"Edelsbrunner H, Osang GF. 2023. A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica. 85, 277–295.","short":"H. Edelsbrunner, G.F. Osang, Algorithmica 85 (2023) 277–295.","ama":"Edelsbrunner H, Osang GF. A simple algorithm for higher-order Delaunay mosaics and alpha shapes. <i>Algorithmica</i>. 2023;85:277-295. doi:<a href=\"https://doi.org/10.1007/s00453-022-01027-6\">10.1007/s00453-022-01027-6</a>"},"status":"public","article_processing_charge":"Yes (via OA deal)","abstract":[{"text":"We present a simple algorithm for computing higher-order Delaunay mosaics that works in Euclidean spaces of any finite dimensions. The algorithm selects the vertices of the order-k mosaic from incrementally constructed lower-order mosaics and uses an algorithm for weighted first-order Delaunay mosaics as a black-box to construct the order-k mosaic from its vertices. Beyond this black-box, the algorithm uses only combinatorial operations, thus facilitating easy implementation. We extend this algorithm to compute higher-order α-shapes and provide open-source implementations. We present experimental results for properties of higher-order Delaunay mosaics of random point sets.","lang":"eng"}],"month":"01","isi":1,"volume":85,"department":[{"_id":"HeEd"}],"acknowledgement":"Open access funding provided by Austrian Science Fund (FWF). This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, Grant No. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35.","year":"2023","intvolume":"        85","title":"A simple algorithm for higher-order Delaunay mosaics and alpha shapes","publication_identifier":{"issn":["0178-4617"],"eissn":["1432-0541"]},"pmid":1,"doi":"10.1007/s00453-022-01027-6","scopus_import":"1","publication":"Algorithmica","date_published":"2023-01-01T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","oa":1,"file_date_updated":"2023-01-20T10:02:48Z","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"id":"464B40D6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg F","orcid":"0000-0002-8882-5116","last_name":"Osang","full_name":"Osang, Georg F"}],"_id":"12086","ddc":["510"],"has_accepted_license":"1","publisher":"Springer Nature","publication_status":"published","quality_controlled":"1","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["36687803"],"isi":["000846967100001"]},"day":"01","project":[{"call_identifier":"H2020","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183"},{"name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes"}],"date_updated":"2025-04-23T08:46:48Z","page":"277-295"},{"status":"public","abstract":[{"text":"We present criteria for establishing a triangulation of a manifold. Given a manifold M, a simplicial complex A, and a map H from the underlying space of A to M, our criteria are presented in local coordinate charts for M, and ensure that H is a homeomorphism. These criteria do not require a differentiable structure, or even an explicit metric on M. No Delaunay property of A is assumed. The result provides a triangulation guarantee for algorithms that construct a simplicial complex by working in local coordinate patches. Because the criteria are easily verified in such a setting, they are expected to be of general use.","lang":"eng"}],"volume":69,"isi":1,"month":"01","article_processing_charge":"No","department":[{"_id":"HeEd"}],"date_created":"2023-01-16T10:04:06Z","ec_funded":1,"article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"creator":"dernst","date_created":"2023-02-02T11:01:10Z","relation":"main_file","file_id":"12488","access_level":"open_access","content_type":"application/pdf","file_size":582850,"date_updated":"2023-02-02T11:01:10Z","file_name":"2023_DiscreteCompGeometry_Boissonnat.pdf","success":1,"checksum":"46352e0ee71e460848f88685ca852681"}],"oa_version":"Published Version","citation":{"short":"J.-D. Boissonnat, R. Dyer, A. Ghosh, M. Wintraecken, Discrete &#38; Computational Geometry 69 (2023) 156–191.","ama":"Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. Local criteria for triangulating general manifolds. <i>Discrete &#38; Computational Geometry</i>. 2023;69:156-191. doi:<a href=\"https://doi.org/10.1007/s00454-022-00431-7\">10.1007/s00454-022-00431-7</a>","ista":"Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. 2023. Local criteria for triangulating general manifolds. Discrete &#38; Computational Geometry. 69, 156–191.","ieee":"J.-D. Boissonnat, R. Dyer, A. Ghosh, and M. Wintraecken, “Local criteria for triangulating general manifolds,” <i>Discrete &#38; Computational Geometry</i>, vol. 69. Springer Nature, pp. 156–191, 2023.","chicago":"Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, and Mathijs Wintraecken. “Local Criteria for Triangulating General Manifolds.” <i>Discrete &#38; Computational Geometry</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s00454-022-00431-7\">https://doi.org/10.1007/s00454-022-00431-7</a>.","mla":"Boissonnat, Jean-Daniel, et al. “Local Criteria for Triangulating General Manifolds.” <i>Discrete &#38; Computational Geometry</i>, vol. 69, Springer Nature, 2023, pp. 156–91, doi:<a href=\"https://doi.org/10.1007/s00454-022-00431-7\">10.1007/s00454-022-00431-7</a>.","apa":"Boissonnat, J.-D., Dyer, R., Ghosh, A., &#38; Wintraecken, M. (2023). Local criteria for triangulating general manifolds. <i>Discrete &#38; Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-022-00431-7\">https://doi.org/10.1007/s00454-022-00431-7</a>"},"doi":"10.1007/s00454-022-00431-7","language":[{"iso":"eng"}],"publication":"Discrete & Computational Geometry","date_published":"2023-01-01T00:00:00Z","scopus_import":"1","type":"journal_article","acknowledgement":"This work has been funded by the European Research Council under the European Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher Dimensions). Arijit Ghosh is supported by Ramanujan Fellowship (No. SB/S2/RJN-064/2015). Part of this work was done when Arijit Ghosh was a Researcher at Max-Planck-Institute for Informatics, Germany, supported by the IndoGerman Max Planck Center for Computer Science (IMPECS). Mathijs Wintraecken also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411 and the Austrian Science Fund (FWF): M-3073. A part of the results described in this paper were presented at SoCG 2018 and in [3]. \r\nOpen access funding provided by the Austrian Science Fund (FWF).","intvolume":"        69","year":"2023","title":"Local criteria for triangulating general manifolds","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"publication_status":"published","corr_author":"1","quality_controlled":"1","file_date_updated":"2023-02-02T11:01:10Z","oa":1,"has_accepted_license":"1","ddc":["510"],"author":[{"last_name":"Boissonnat","full_name":"Boissonnat, Jean-Daniel","first_name":"Jean-Daniel"},{"first_name":"Ramsay","full_name":"Dyer, Ramsay","last_name":"Dyer"},{"last_name":"Ghosh","full_name":"Ghosh, Arijit","first_name":"Arijit"},{"id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs","full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220","last_name":"Wintraecken"}],"_id":"12287","publisher":"Springer Nature","date_updated":"2025-04-14T07:44:00Z","page":"156-191","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"01","external_id":{"isi":["000862193600001"]},"keyword":["Computational Theory and Mathematics","Discrete Mathematics and Combinatorics","Geometry and Topology","Theoretical Computer Science"],"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"grant_number":"M03073","name":"Learning and triangulating manifolds via collapses","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2"}]},{"title":"Computing the volume, surface area, mean, and Gaussian curvatures of molecules and their derivatives","pmid":1,"publication_identifier":{"eissn":["1549-960X"],"issn":["1549-9596"]},"acknowledgement":"P.K. acknowledges support from the University of California Multicampus Research Programs and Initiatives (Grant No. M21PR3267) and from the NSF (Grant No.1760485). H.E. acknowledges support from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program, Grant No. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35.\r\nOpen Access is funded by the Austrian Science Fund (FWF).","issue":"3","intvolume":"        63","year":"2023","publication":"Journal of Chemical Information and Modeling","language":[{"iso":"eng"}],"date_published":"2023-02-13T00:00:00Z","scopus_import":"1","type":"journal_article","doi":"10.1021/acs.jcim.2c01346","file":[{"success":1,"checksum":"7d20562269edff1e31b9d6019d4983b0","file_size":8069223,"file_name":"2023_JCIM_Koehl.pdf","date_updated":"2023-08-16T12:21:13Z","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2023-08-16T12:21:13Z","creator":"dernst","file_id":"14070"}],"oa_version":"Published Version","citation":{"ieee":"P. Koehl, A. Akopyan, and H. Edelsbrunner, “Computing the volume, surface area, mean, and Gaussian curvatures of molecules and their derivatives,” <i>Journal of Chemical Information and Modeling</i>, vol. 63, no. 3. American Chemical Society, pp. 973–985, 2023.","ista":"Koehl P, Akopyan A, Edelsbrunner H. 2023. Computing the volume, surface area, mean, and Gaussian curvatures of molecules and their derivatives. Journal of Chemical Information and Modeling. 63(3), 973–985.","chicago":"Koehl, Patrice, Arseniy Akopyan, and Herbert Edelsbrunner. “Computing the Volume, Surface Area, Mean, and Gaussian Curvatures of Molecules and Their Derivatives.” <i>Journal of Chemical Information and Modeling</i>. American Chemical Society, 2023. <a href=\"https://doi.org/10.1021/acs.jcim.2c01346\">https://doi.org/10.1021/acs.jcim.2c01346</a>.","apa":"Koehl, P., Akopyan, A., &#38; Edelsbrunner, H. (2023). Computing the volume, surface area, mean, and Gaussian curvatures of molecules and their derivatives. <i>Journal of Chemical Information and Modeling</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.jcim.2c01346\">https://doi.org/10.1021/acs.jcim.2c01346</a>","mla":"Koehl, Patrice, et al. “Computing the Volume, Surface Area, Mean, and Gaussian Curvatures of Molecules and Their Derivatives.” <i>Journal of Chemical Information and Modeling</i>, vol. 63, no. 3, American Chemical Society, 2023, pp. 973–85, doi:<a href=\"https://doi.org/10.1021/acs.jcim.2c01346\">10.1021/acs.jcim.2c01346</a>.","short":"P. Koehl, A. Akopyan, H. Edelsbrunner, Journal of Chemical Information and Modeling 63 (2023) 973–985.","ama":"Koehl P, Akopyan A, Edelsbrunner H. Computing the volume, surface area, mean, and Gaussian curvatures of molecules and their derivatives. <i>Journal of Chemical Information and Modeling</i>. 2023;63(3):973-985. doi:<a href=\"https://doi.org/10.1021/acs.jcim.2c01346\">10.1021/acs.jcim.2c01346</a>"},"date_created":"2023-02-12T23:00:59Z","article_type":"original","ec_funded":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"abstract":[{"lang":"eng","text":"Geometry is crucial in our efforts to comprehend the structures and dynamics of biomolecules. For example, volume, surface area, and integrated mean and Gaussian curvature of the union of balls representing a molecule are used to quantify its interactions with the water surrounding it in the morphometric implicit solvent models. The Alpha Shape theory provides an accurate and reliable method for computing these geometric measures. In this paper, we derive homogeneous formulas for the expressions of these measures and their derivatives with respect to the atomic coordinates, and we provide algorithms that implement them into a new software package, AlphaMol. The only variables in these formulas are the interatomic distances, making them insensitive to translations and rotations. AlphaMol includes a sequential algorithm and a parallel algorithm. In the parallel version, we partition the atoms of the molecule of interest into 3D rectangular blocks, using a kd-tree algorithm. We then apply the sequential algorithm of AlphaMol to each block, augmented by a buffer zone to account for atoms whose ball representations may partially cover the block. The current parallel version of AlphaMol leads to a 20-fold speed-up compared to an independent serial implementation when using 32 processors. For instance, it takes 31 s to compute the geometric measures and derivatives of each atom in a viral capsid with more than 26 million atoms on 32 Intel processors running at 2.7 GHz. The presence of the buffer zones, however, leads to redundant computations, which ultimately limit the impact of using multiple processors. AlphaMol is available as an OpenSource software."}],"volume":63,"isi":1,"month":"02","article_processing_charge":"No","department":[{"_id":"HeEd"}],"status":"public","project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020"},{"call_identifier":"FWF","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342"},{"call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"13","external_id":{"pmid":["36638318"],"isi":["000920370700001"]},"date_updated":"2025-04-15T07:16:52Z","page":"973-985","has_accepted_license":"1","ddc":["510","540"],"author":[{"last_name":"Koehl","full_name":"Koehl, Patrice","first_name":"Patrice"},{"full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","last_name":"Akopyan","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"}],"_id":"12544","publisher":"American Chemical Society","file_date_updated":"2023-08-16T12:21:13Z","oa":1,"quality_controlled":"1","corr_author":"1","publication_status":"published"},{"doi":"10.1109/icdmw58026.2022.00093","scopus_import":"1","language":[{"iso":"eng"}],"publication":"2022 IEEE International Conference on Data Mining Workshops","date_published":"2023-02-08T00:00:00Z","type":"conference","year":"2023","title":"Visual analytics of mobility network changes observed using mobile phone data during COVID-19 pandemic","article_number":"00093","publication_identifier":{"eissn":["2375-9259"],"eisbn":["9798350346091"]},"status":"public","article_processing_charge":"No","abstract":[{"text":"The limited exchange between human communities is a key factor in preventing the spread of COVID-19. This paper introduces a digital framework that combines an integration of real mobility data at the country scale with a series of modeling techniques and visual capabilities that highlight mobility patterns before and during the pandemic. The findings not only significantly exhibit mobility trends and different degrees of similarities at regional and local levels but also provide potential insight into the emergence of a pandemic on human behavior patterns and their likely socio-economic impacts.","lang":"eng"}],"isi":1,"month":"02","department":[{"_id":"HeEd"}],"date_created":"2023-02-14T07:56:21Z","oa_version":"Submitted Version","file":[{"content_type":"application/pdf","file_name":"Visual Analysis_Mobility_COVID19 - SocDM2022.pdf","file_size":1183339,"date_updated":"2023-02-14T07:58:26Z","checksum":"c253bee25e6dfe484f96662daa119cb6","success":1,"file_id":"12549","creator":"fkarimip","date_created":"2023-02-14T07:58:26Z","relation":"main_file","access_level":"open_access"}],"citation":{"ieee":"M. Forghani, C. Claramunt, F. Karimipour, and G. Heiler, “Visual analytics of mobility network changes observed using mobile phone data during COVID-19 pandemic,” in <i>2022 IEEE International Conference on Data Mining Workshops</i>, Orlando, FL, United States, 2023.","ista":"Forghani M, Claramunt C, Karimipour F, Heiler G. 2023. Visual analytics of mobility network changes observed using mobile phone data during COVID-19 pandemic. 2022 IEEE International Conference on Data Mining Workshops. ICDMW: Conference on Data Mining Workshops, 00093.","mla":"Forghani, Mohammad, et al. “Visual Analytics of Mobility Network Changes Observed Using Mobile Phone Data during COVID-19 Pandemic.” <i>2022 IEEE International Conference on Data Mining Workshops</i>, 00093, Institute of Electrical and Electronics Engineers, 2023, doi:<a href=\"https://doi.org/10.1109/icdmw58026.2022.00093\">10.1109/icdmw58026.2022.00093</a>.","apa":"Forghani, M., Claramunt, C., Karimipour, F., &#38; Heiler, G. (2023). Visual analytics of mobility network changes observed using mobile phone data during COVID-19 pandemic. In <i>2022 IEEE International Conference on Data Mining Workshops</i>. Orlando, FL, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/icdmw58026.2022.00093\">https://doi.org/10.1109/icdmw58026.2022.00093</a>","chicago":"Forghani, Mohammad, Christophe Claramunt, Farid Karimipour, and Georg Heiler. “Visual Analytics of Mobility Network Changes Observed Using Mobile Phone Data during COVID-19 Pandemic.” In <i>2022 IEEE International Conference on Data Mining Workshops</i>. Institute of Electrical and Electronics Engineers, 2023. <a href=\"https://doi.org/10.1109/icdmw58026.2022.00093\">https://doi.org/10.1109/icdmw58026.2022.00093</a>.","ama":"Forghani M, Claramunt C, Karimipour F, Heiler G. Visual analytics of mobility network changes observed using mobile phone data during COVID-19 pandemic. In: <i>2022 IEEE International Conference on Data Mining Workshops</i>. Institute of Electrical and Electronics Engineers; 2023. doi:<a href=\"https://doi.org/10.1109/icdmw58026.2022.00093\">10.1109/icdmw58026.2022.00093</a>","short":"M. Forghani, C. Claramunt, F. Karimipour, G. Heiler, in:, 2022 IEEE International Conference on Data Mining Workshops, Institute of Electrical and Electronics Engineers, 2023."},"date_updated":"2024-10-21T06:01:25Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"isi":["000971492200145"]},"day":"08","publication_status":"published","quality_controlled":"1","oa":1,"file_date_updated":"2023-02-14T07:58:26Z","conference":{"location":"Orlando, FL, United States","end_date":"2022-12-01","name":"ICDMW: Conference on Data Mining Workshops","start_date":"2022-11-28"},"author":[{"first_name":"Mohammad","full_name":"Forghani, Mohammad","last_name":"Forghani"},{"full_name":"Claramunt, Christophe","last_name":"Claramunt","first_name":"Christophe"},{"last_name":"Karimipour","orcid":"0000-0001-6746-4174","full_name":"Karimipour, Farid","id":"2A2BCDC4-CF62-11E9-BE5E-3B1EE6697425","first_name":"Farid"},{"last_name":"Heiler","full_name":"Heiler, Georg","first_name":"Georg"}],"_id":"12548","ddc":["600"],"has_accepted_license":"1","publisher":"Institute of Electrical and Electronics Engineers"}]