{"file":[{"creator":"kschuh","file_id":"6624","date_updated":"2020-07-14T12:47:34Z","access_level":"open_access","file_name":"Elsevier_2019_Edelsbrunner.pdf","relation":"main_file","date_created":"2019-07-08T15:24:26Z","checksum":"7c99be505dc7533257d42eb1830cef04","file_size":2665013,"content_type":"application/pdf"}],"intvolume":"        73","language":[{"iso":"eng"}],"scopus_import":"1","quality_controlled":"1","title":"Holes and dependences in an ordered complex","oa_version":"Published Version","year":"2019","publisher":"Elsevier","ec_funded":1,"tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"day":"01","date_published":"2019-08-01T00:00:00Z","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","date_updated":"2023-09-07T13:15:29Z","volume":73,"has_accepted_license":"1","type":"journal_article","isi":1,"_id":"6608","doi":"10.1016/j.cagd.2019.06.003","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert"},{"id":"4D4AA390-F248-11E8-B48F-1D18A9856A87","last_name":"Ölsböck","orcid":"0000-0002-4672-8297","full_name":"Ölsböck, Katharina","first_name":"Katharina"}],"related_material":{"record":[{"id":"7460","status":"public","relation":"dissertation_contains"}]},"publication":"Computer Aided Geometric Design","publication_status":"published","abstract":[{"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.","lang":"eng"}],"department":[{"_id":"HeEd"}],"article_processing_charge":"No","citation":{"ieee":"H. Edelsbrunner and K. Ölsböck, “Holes and dependences in an ordered complex,” <i>Computer Aided Geometric Design</i>, vol. 73. Elsevier, pp. 1–15, 2019.","short":"H. Edelsbrunner, K. Ölsböck, Computer Aided Geometric Design 73 (2019) 1–15.","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>","mla":"Edelsbrunner, Herbert, and Katharina Ölsböck. “Holes and Dependences in an Ordered Complex.” <i>Computer Aided Geometric Design</i>, vol. 73, Elsevier, 2019, pp. 1–15, doi:<a href=\"https://doi.org/10.1016/j.cagd.2019.06.003\">10.1016/j.cagd.2019.06.003</a>.","apa":"Edelsbrunner, H., &#38; Ölsböck, K. (2019). Holes and dependences in an ordered complex. <i>Computer Aided Geometric Design</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cagd.2019.06.003\">https://doi.org/10.1016/j.cagd.2019.06.003</a>","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."},"month":"08","date_created":"2019-07-07T21:59:20Z","project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","call_identifier":"FWF","name":"Persistence and stability of geometric complexes"}],"status":"public","page":"1-15","external_id":{"isi":["000485207800001"]},"ddc":["000"],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"file_date_updated":"2020-07-14T12:47:34Z"}