[{"type":"journal_article","oa_version":"Published Version","_id":"17891","department":[{"_id":"HeEd"}],"intvolume":"        26","publication_status":"published","citation":{"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>","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.","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>","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>.","short":"H. Edelsbrunner, K. Ölsböck, H. Wagner, Entropy 26 (2024).","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>.","ista":"Edelsbrunner H, Ölsböck K, Wagner H. 2024. Understanding higher-order interactions in information space. Entropy. 26(8), 637."},"author":[{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"id":"4D4AA390-F248-11E8-B48F-1D18A9856A87","last_name":"Ölsböck","first_name":"Katharina","orcid":"0000-0002-4672-8297","full_name":"Ölsböck, Katharina"},{"id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Hubert","full_name":"Wagner, Hubert"}],"title":"Understanding higher-order interactions in information space","doi":"10.3390/e26080637","year":"2024","day":"01","pmid":1,"external_id":{"pmid":["39202107"],"isi":["001305543500001"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"content_type":"application/pdf","file_name":"2024_Entropy_Edelsbrunner.pdf","checksum":"624a9e2c5b49d6c38b88b0f675467ba3","file_size":8025139,"relation":"main_file","date_updated":"2024-09-09T09:01:12Z","success":1,"file_id":"17948","access_level":"open_access","date_created":"2024-09-09T09:01:12Z","creator":"dernst"}],"date_published":"2024-08-01T00:00:00Z","date_updated":"2025-09-08T09:13:44Z","isi":1,"issue":"8","language":[{"iso":"eng"}],"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.","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","has_accepted_license":"1","scopus_import":"1","related_material":{"link":[{"relation":"software","url":"https://git.ista.ac.at/katharina.oelsboeck/wrap_2_3-public/"}]},"publication":"Entropy","publication_identifier":{"eissn":["1099-4300"]},"abstract":[{"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.","lang":"eng"}],"status":"public","month":"08","ddc":["510"],"article_number":"637","file_date_updated":"2024-09-09T09:01:12Z","article_type":"original","publisher":"MDPI","volume":26,"article_processing_charge":"Yes","date_created":"2024-09-08T22:01:11Z","oa":1,"quality_controlled":"1"},{"publication_identifier":{"issn":["01795376"],"eissn":["14320444"]},"publication":"Discrete and Computational Geometry","ec_funded":1,"volume":64,"article_processing_charge":"Yes (via OA deal)","quality_controlled":"1","oa":1,"date_created":"2020-04-19T22:00:56Z","ddc":["510"],"publisher":"Springer Nature","file_date_updated":"2020-11-20T13:22:21Z","article_type":"original","page":"759-775","status":"public","abstract":[{"lang":"eng","text":"Generalizing the decomposition of a connected planar graph into a tree and a dual tree, we prove a combinatorial analog of the classic Helmholtz–Hodge decomposition of a smooth vector field. Specifically, we show that for every polyhedral complex, K, and every dimension, p, there is a partition of the set of p-cells into a maximal p-tree, a maximal p-cotree, and a collection of p-cells whose cardinality is the p-th reduced Betti number of K. Given an ordering of the p-cells, this tri-partition is unique, and it can be computed by a matrix reduction algorithm that also constructs canonical bases of cycle and boundary groups."}],"month":"03","corr_author":"1","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","grant_number":"788183"},{"grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","call_identifier":"FWF"}],"author":[{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"orcid":"0000-0002-4672-8297","full_name":"Ölsböck, Katharina","id":"4D4AA390-F248-11E8-B48F-1D18A9856A87","last_name":"Ölsböck","first_name":"Katharina"}],"publication_status":"published","citation":{"mla":"Edelsbrunner, Herbert, and Katharina Ölsböck. “Tri-Partitions and Bases of an Ordered Complex.” <i>Discrete and Computational Geometry</i>, vol. 64, Springer Nature, 2020, pp. 759–75, doi:<a href=\"https://doi.org/10.1007/s00454-020-00188-x\">10.1007/s00454-020-00188-x</a>.","short":"H. Edelsbrunner, K. Ölsböck, Discrete and Computational Geometry 64 (2020) 759–775.","chicago":"Edelsbrunner, Herbert, and Katharina Ölsböck. “Tri-Partitions and Bases of an Ordered Complex.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s00454-020-00188-x\">https://doi.org/10.1007/s00454-020-00188-x</a>.","ista":"Edelsbrunner H, Ölsböck K. 2020. Tri-partitions and bases of an ordered complex. Discrete and Computational Geometry. 64, 759–775.","ama":"Edelsbrunner H, Ölsböck K. Tri-partitions and bases of an ordered complex. <i>Discrete and Computational Geometry</i>. 2020;64:759-775. doi:<a href=\"https://doi.org/10.1007/s00454-020-00188-x\">10.1007/s00454-020-00188-x</a>","ieee":"H. Edelsbrunner and K. Ölsböck, “Tri-partitions and bases of an ordered complex,” <i>Discrete and Computational Geometry</i>, vol. 64. Springer Nature, pp. 759–775, 2020.","apa":"Edelsbrunner, H., &#38; Ölsböck, K. (2020). Tri-partitions and bases of an ordered complex. <i>Discrete and Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-020-00188-x\">https://doi.org/10.1007/s00454-020-00188-x</a>"},"title":"Tri-partitions and bases of an ordered complex","_id":"7666","department":[{"_id":"HeEd"}],"intvolume":"        64","type":"journal_article","oa_version":"Published Version","scopus_import":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","has_accepted_license":"1","isi":1,"acknowledgement":"This project has received funding from the European Research Council under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 78818 Alpha). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through Grant No. I02979-N35 of the Austrian Science Fund (FWF).","language":[{"iso":"eng"}],"external_id":{"isi":["000520918800001"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_updated":"2020-11-20T13:22:21Z","relation":"main_file","file_size":701673,"content_type":"application/pdf","checksum":"f8cc96e497f00c38340b5dafe0cb91d7","file_name":"2020_DiscreteCompGeo_Edelsbrunner.pdf","date_created":"2020-11-20T13:22:21Z","creator":"dernst","access_level":"open_access","file_id":"8786","success":1}],"date_published":"2020-03-20T00:00:00Z","date_updated":"2025-04-14T07:48:36Z","doi":"10.1007/s00454-020-00188-x","year":"2020","day":"20"},{"publisher":"Springer Nature","file_date_updated":"2020-10-08T08:56:14Z","ddc":["510"],"quality_controlled":"1","date_created":"2020-07-19T22:00:59Z","oa":1,"article_processing_charge":"No","volume":15,"month":"06","status":"public","abstract":[{"lang":"eng","text":"Discrete Morse theory has recently lead to new developments in the theory of random geometric complexes. This article surveys the methods and results obtained with this new approach, and discusses some of its shortcomings. It uses simulations to illustrate the results and to form conjectures, getting numerical estimates for combinatorial, topological, and geometric properties of weighted and unweighted Delaunay mosaics, their dual Voronoi tessellations, and the Alpha and Wrap complexes contained in the mosaics."}],"page":"181-218","ec_funded":1,"publication":"Topological Data Analysis","publication_identifier":{"issn":["2193-2808"],"eissn":["2197-8549"],"isbn":["9783030434076"]},"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreements No 78818 Alpha and No 638176). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","language":[{"iso":"eng"}],"alternative_title":["Abel Symposia"],"isi":1,"scopus_import":"1","related_material":{"record":[{"id":"19630","relation":"dissertation_contains","status":"public"}]},"has_accepted_license":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"22","year":"2020","doi":"10.1007/978-3-030-43408-3_8","date_published":"2020-06-22T00:00:00Z","date_updated":"2026-04-07T12:35:47Z","external_id":{"isi":["001321861000008"]},"file":[{"access_level":"open_access","date_created":"2020-10-08T08:56:14Z","creator":"dernst","success":1,"file_id":"8628","relation":"main_file","date_updated":"2020-10-08T08:56:14Z","content_type":"application/pdf","file_name":"2020-B-01-PoissonExperimentalSurvey.pdf","checksum":"7b5e0de10675d787a2ddb2091370b8d8","file_size":2207071}],"title":"Radius functions on Poisson–Delaunay mosaics and related complexes experimentally","project":[{"call_identifier":"H2020","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183"},{"grant_number":"638176","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"publication_status":"published","citation":{"chicago":"Edelsbrunner, Herbert, Anton Nikitenko, Katharina Ölsböck, and Peter Synak. “Radius Functions on Poisson–Delaunay Mosaics and Related Complexes Experimentally.” In <i>Topological Data Analysis</i>, 15:181–218. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-43408-3_8\">https://doi.org/10.1007/978-3-030-43408-3_8</a>.","short":"H. Edelsbrunner, A. Nikitenko, K. Ölsböck, P. Synak, in:, Topological Data Analysis, Springer Nature, 2020, pp. 181–218.","ista":"Edelsbrunner H, Nikitenko A, Ölsböck K, Synak P. 2020. Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. Topological Data Analysis. , Abel Symposia, vol. 15, 181–218.","mla":"Edelsbrunner, Herbert, et al. “Radius Functions on Poisson–Delaunay Mosaics and Related Complexes Experimentally.” <i>Topological Data Analysis</i>, vol. 15, Springer Nature, 2020, pp. 181–218, doi:<a href=\"https://doi.org/10.1007/978-3-030-43408-3_8\">10.1007/978-3-030-43408-3_8</a>.","ama":"Edelsbrunner H, Nikitenko A, Ölsböck K, Synak P. Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. In: <i>Topological Data Analysis</i>. Vol 15. Springer Nature; 2020:181-218. doi:<a href=\"https://doi.org/10.1007/978-3-030-43408-3_8\">10.1007/978-3-030-43408-3_8</a>","ieee":"H. Edelsbrunner, A. Nikitenko, K. Ölsböck, and P. Synak, “Radius functions on Poisson–Delaunay mosaics and related complexes experimentally,” in <i>Topological Data Analysis</i>, 2020, vol. 15, pp. 181–218.","apa":"Edelsbrunner, H., Nikitenko, A., Ölsböck, K., &#38; Synak, P. (2020). Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. In <i>Topological Data Analysis</i> (Vol. 15, pp. 181–218). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-43408-3_8\">https://doi.org/10.1007/978-3-030-43408-3_8</a>"},"author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"first_name":"Anton","last_name":"Nikitenko","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0659-3201","full_name":"Nikitenko, Anton"},{"orcid":"0000-0002-4672-8297","full_name":"Ölsböck, Katharina","id":"4D4AA390-F248-11E8-B48F-1D18A9856A87","last_name":"Ölsböck","first_name":"Katharina"},{"full_name":"Synak, Peter","first_name":"Peter","id":"331776E2-F248-11E8-B48F-1D18A9856A87","last_name":"Synak"}],"oa_version":"Submitted Version","type":"conference","intvolume":"        15","department":[{"_id":"HeEd"}],"_id":"8135"},{"degree_awarded":"PhD","publication_identifier":{"issn":["2663-337X"]},"ddc":["514"],"file_date_updated":"2020-07-14T12:47:58Z","publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","oa":1,"date_created":"2020-02-06T14:56:53Z","abstract":[{"lang":"eng","text":"Many methods for the reconstruction of shapes from sets of points produce ordered simplicial complexes, which are collections of vertices, edges, triangles, and their higher-dimensional analogues, called simplices, in which every simplex gets assigned a real value measuring its size. This thesis studies ordered simplicial complexes, with a focus on their topology, which reflects the connectedness of the represented shapes and the presence of holes. We are interested both in understanding better the structure of these complexes, as well as in developing algorithms for applications.\r\n\r\nFor the Delaunay triangulation, the most popular measure for a simplex is the radius of the smallest empty circumsphere. Based on it, we revisit Alpha and Wrap complexes and experimentally determine their probabilistic properties for random data. Also, we prove the existence of tri-partitions, propose algorithms to open and close holes, and extend the concepts from Euclidean to Bregman geometries."}],"status":"public","month":"02","page":"155","publication_status":"published","author":[{"full_name":"Ölsböck, Katharina","orcid":"0000-0002-4672-8297","last_name":"Ölsböck","id":"4D4AA390-F248-11E8-B48F-1D18A9856A87","first_name":"Katharina"}],"citation":{"ieee":"K. Ölsböck, “The hole system of triangulated shapes,” Institute of Science and Technology Austria, 2020.","apa":"Ölsböck, K. (2020). <i>The hole system of triangulated shapes</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:7460\">https://doi.org/10.15479/AT:ISTA:7460</a>","ama":"Ölsböck K. The hole system of triangulated shapes. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7460\">10.15479/AT:ISTA:7460</a>","mla":"Ölsböck, Katharina. <i>The Hole System of Triangulated Shapes</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7460\">10.15479/AT:ISTA:7460</a>.","ista":"Ölsböck K. 2020. The hole system of triangulated shapes. Institute of Science and Technology Austria.","chicago":"Ölsböck, Katharina. “The Hole System of Triangulated Shapes.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:7460\">https://doi.org/10.15479/AT:ISTA:7460</a>.","short":"K. Ölsböck, The Hole System of Triangulated Shapes, Institute of Science and Technology Austria, 2020."},"corr_author":"1","OA_place":"publisher","title":"The hole system of triangulated shapes","type":"dissertation","oa_version":"Published Version","_id":"7460","supervisor":[{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"}],"department":[{"_id":"HeEd"},{"_id":"GradSch"}],"alternative_title":["ISTA Thesis"],"language":[{"iso":"eng"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","has_accepted_license":"1","related_material":{"record":[{"relation":"part_of_dissertation","id":"6608","status":"public"}]},"keyword":["shape reconstruction","hole manipulation","ordered complexes","Alpha complex","Wrap complex","computational topology","Bregman geometry"],"doi":"10.15479/AT:ISTA:7460","year":"2020","day":"10","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"file":[{"access_level":"open_access","creator":"koelsboe","date_created":"2020-02-06T14:43:54Z","file_id":"7461","relation":"main_file","date_updated":"2020-07-14T12:47:58Z","checksum":"1df9f8c530b443c0e63a3f2e4fde412e","file_name":"thesis_ist-final_noack.pdf","content_type":"application/pdf","file_size":76195184},{"date_updated":"2020-07-14T12:47:58Z","relation":"source_file","file_size":122103715,"checksum":"7a52383c812b0be64d3826546509e5a4","file_name":"latex-files.zip","content_type":"application/x-zip-compressed","creator":"koelsboe","date_created":"2020-02-06T14:52:45Z","access_level":"closed","file_id":"7462","description":"latex source files, figures"}],"date_published":"2020-02-10T00:00:00Z","date_updated":"2026-04-08T07:23:21Z"},{"publication_status":"published","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"full_name":"Ölsböck, Katharina","orcid":"0000-0002-4672-8297","last_name":"Ölsböck","id":"4D4AA390-F248-11E8-B48F-1D18A9856A87","first_name":"Katharina"}],"citation":{"short":"H. Edelsbrunner, K. Ölsböck, Computer Aided Geometric Design 73 (2019) 1–15.","chicago":"Edelsbrunner, Herbert, and Katharina Ölsböck. “Holes and Dependences in an Ordered Complex.” <i>Computer Aided Geometric Design</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.cagd.2019.06.003\">https://doi.org/10.1016/j.cagd.2019.06.003</a>.","ista":"Edelsbrunner H, Ölsböck K. 2019. Holes and dependences in an ordered complex. Computer Aided Geometric Design. 73, 1–15.","mla":"Edelsbrunner, Herbert, and Katharina Ölsböck. “Holes and Dependences in an Ordered Complex.” <i>Computer Aided Geometric Design</i>, vol. 73, Elsevier, 2019, pp. 1–15, doi:<a href=\"https://doi.org/10.1016/j.cagd.2019.06.003\">10.1016/j.cagd.2019.06.003</a>.","ama":"Edelsbrunner H, Ölsböck K. Holes and dependences in an ordered complex. <i>Computer Aided Geometric Design</i>. 2019;73:1-15. doi:<a href=\"https://doi.org/10.1016/j.cagd.2019.06.003\">10.1016/j.cagd.2019.06.003</a>","ieee":"H. Edelsbrunner and K. Ölsböck, “Holes and dependences in an ordered complex,” <i>Computer Aided Geometric Design</i>, vol. 73. Elsevier, pp. 1–15, 2019.","apa":"Edelsbrunner, H., &#38; Ölsböck, K. (2019). Holes and dependences in an ordered complex. <i>Computer Aided Geometric Design</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cagd.2019.06.003\">https://doi.org/10.1016/j.cagd.2019.06.003</a>"},"project":[{"grant_number":"788183","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended"},{"name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I02979-N35"}],"title":"Holes and dependences in an ordered complex","_id":"6608","intvolume":"        73","department":[{"_id":"HeEd"}],"type":"journal_article","oa_version":"Published Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","has_accepted_license":"1","scopus_import":"1","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"7460"}]},"isi":1,"language":[{"iso":"eng"}],"file":[{"file_id":"6624","creator":"kschuh","date_created":"2019-07-08T15:24:26Z","access_level":"open_access","file_size":2665013,"file_name":"Elsevier_2019_Edelsbrunner.pdf","checksum":"7c99be505dc7533257d42eb1830cef04","content_type":"application/pdf","date_updated":"2020-07-14T12:47:34Z","relation":"main_file"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)"},"external_id":{"isi":["000485207800001"]},"date_updated":"2026-04-08T07:23:21Z","date_published":"2019-08-01T00:00:00Z","doi":"10.1016/j.cagd.2019.06.003","year":"2019","day":"01","publication":"Computer Aided Geometric Design","ec_funded":1,"volume":73,"article_processing_charge":"No","date_created":"2019-07-07T21:59:20Z","oa":1,"quality_controlled":"1","ddc":["000"],"file_date_updated":"2020-07-14T12:47:34Z","publisher":"Elsevier","page":"1-15","abstract":[{"lang":"eng","text":"We use the canonical bases produced by the tri-partition algorithm in (Edelsbrunner and Ölsböck, 2018) to open and close holes in a polyhedral complex, K. In a concrete application, we consider the Delaunay mosaic of a finite set, we let K be an Alpha complex, and we use the persistence diagram of the distance function to guide the hole opening and closing operations. The dependences between the holes define a partial order on the cells in K that characterizes what can and what cannot be constructed using the operations. The relations in this partial order reveal structural information about the underlying filtration of complexes beyond what is expressed by the persistence diagram."}],"status":"public","month":"08"}]