{"article_number":"72:1-72:17","oa_version":"Published Version","publication":"42nd International Symposium on Computational Geometry","has_accepted_license":"1","corr_author":"1","title":"Topological simplification guided by forbidden regions","arxiv":1,"quality_controlled":"1","citation":{"ista":"Leśkiewicz J, Furmanek B, Lipiński M, Morozov D. 2026. Topological simplification guided by forbidden regions. 42nd International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 367, 72:1-72:17.","mla":"Leśkiewicz, Jakub, et al. “Topological Simplification Guided by Forbidden Regions.” 42nd International Symposium on Computational Geometry, vol. 367, 72:1-72:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.SoCG.2026.72.","chicago":"Leśkiewicz, Jakub, Bartosz Furmanek, Michał Lipiński, and Dmitriy Morozov. “Topological Simplification Guided by Forbidden Regions.” In 42nd International Symposium on Computational Geometry, Vol. 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.SoCG.2026.72.","short":"J. Leśkiewicz, B. Furmanek, M. Lipiński, D. Morozov, in:, 42nd International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","ieee":"J. Leśkiewicz, B. Furmanek, M. Lipiński, and D. Morozov, “Topological simplification guided by forbidden regions,” in 42nd International Symposium on Computational Geometry, New Brunswick, NJ, United States, 2026, vol. 367.","apa":"Leśkiewicz, J., Furmanek, B., Lipiński, M., & Morozov, D. (2026). Topological simplification guided by forbidden regions. In 42nd International Symposium on Computational Geometry (Vol. 367). New Brunswick, NJ, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2026.72","ama":"Leśkiewicz J, Furmanek B, Lipiński M, Morozov D. Topological simplification guided by forbidden regions. In: 42nd International Symposium on Computational Geometry. Vol 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.SoCG.2026.72"},"intvolume":" 367","publication_identifier":{"isbn":["9783959774185"],"eissn":["1868-8969"]},"das_tickbox":"0","ec_funded":1,"_id":"22002","publication_status":"published","abstract":[{"lang":"eng","text":"Topological simplification is the process of reducing complexity of a function while maintaining its essential features. Its goal is to find a new filter function, which reorders cells of the input complex in a way which eliminates some persistent homological features, without affecting the rest. We present a new approach to simplification based on the concept of forbidden regions and combinatorial dynamics. It allows us to reorder and cancel critical values, whose cancellation is not possible using existing methods because they are not consecutive in the total order. Each such cancellation takes O(c⋅n) time in the worst case, where c is the number of birth-death pairs and n is the size of the input complex."}],"department":[{"_id":"HeEd"}],"month":"05","date_published":"2026-05-27T00:00:00Z","project":[{"name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","call_identifier":"H2020"}],"tmp":{"short":"CC BY (4.0)","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)"},"conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2026-06-02","location":"New Brunswick, NJ, United States","end_date":"2026-06-05"},"oa":1,"year":"2026","external_id":{"arxiv":["2603.16416"]},"status":"public","doi":"10.4230/LIPIcs.SoCG.2026.72","scopus_import":"1","type":"conference","language":[{"iso":"eng"}],"alternative_title":["LIPIcs"],"date_created":"2026-06-14T22:01:43Z","keyword":["persistent homology","topological simplification","depth posets"],"file_date_updated":"2026-06-22T07:39:21Z","OA_place":"publisher","file":[{"file_size":2052749,"file_id":"22110","relation":"main_file","creator":"dernst","content_type":"application/pdf","date_created":"2026-06-22T07:39:21Z","date_updated":"2026-06-22T07:39:21Z","access_level":"open_access","checksum":"3be91c06fdf716c8735b6af64a09a921","success":1,"file_name":"2026_LIPIcSSoCG_Leskiewicz.pdf"}],"article_processing_charge":"No","volume":367,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","acknowledgement":"Jakub Leśkiewicz wants to thank his supervisor, Prof. Marian Mrozek, forscientific guidance, patience, and opportunity to delay the rest of his duties while writing this work.\r\nThe author also extends thanks to his entire family, to Zuzanna Świątek, and to Mikołaj Kardyś,\r\nBEng, MSc, for providing meals during the most intensive periods of work. Jakub Leśkiewicz: The research was partially funded by the Polish National Science Center under Opus Grant No. 2019/35/B/ST1/00874 and Opus Grant 2025/57/B/ST1/00550. Bartosz Furmanek: The research was partially funded by the Polish National Science Center under Opus Grant No. 2019/35/B/ST1/00874 and Opus Grant 2025/57/B/ST1/00550. Michał Lipiński: This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413. \r\nDmitriy Morozov: This work was supported in part by the U.S. Department of Energy, Office\r\nof Science, Office of Advanced Scientific Computing Research, under Contract No. DE-AC02-\r\n05CH11231.","author":[{"last_name":"Leśkiewicz","first_name":"Jakub","full_name":"Leśkiewicz, Jakub"},{"last_name":"Furmanek","first_name":"Bartosz","full_name":"Furmanek, Bartosz"},{"full_name":"Lipiński, Michał","last_name":"Lipiński","orcid":"0000-0001-9789-9750","first_name":"Michał","id":"dfffb474-4317-11ee-8f5c-fe3fc95a425e"},{"first_name":"Dmitriy","last_name":"Morozov","full_name":"Morozov, Dmitriy"}],"OA_type":"gold","ddc":["500"],"date_updated":"2026-06-22T07:45:36Z","day":"27"}