{"volume":85,"intvolume":"        85","year":"2023","isi":1,"file_date_updated":"2023-01-20T10:02:48Z","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.","project":[{"call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize"},{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35"}],"ddc":["510"],"has_accepted_license":"1","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"full_name":"Osang, Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","last_name":"Osang","first_name":"Georg F"}],"publication":"Algorithmica","doi":"10.1007/s00453-022-01027-6","page":"277-295","publication_identifier":{"eissn":["1432-0541"],"issn":["0178-4617"]},"external_id":{"isi":["000846967100001"]},"article_type":"original","citation":{"short":"H. Edelsbrunner, G.F. Osang, Algorithmica 85 (2023) 277–295.","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>.","ista":"Edelsbrunner H, Osang GF. 2023. A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica. 85, 277–295.","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>","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>","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.","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>."},"ec_funded":1,"_id":"12086","language":[{"iso":"eng"}],"date_created":"2022-09-11T22:01:57Z","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","oa":1,"scopus_import":"1","publisher":"Springer Nature","status":"public","quality_controlled":"1","title":"A simple algorithm for higher-order Delaunay mosaics and alpha shapes","day":"01","type":"journal_article","file":[{"content_type":"application/pdf","file_name":"2023_Algorithmica_Edelsbrunner.pdf","access_level":"open_access","creator":"dernst","relation":"main_file","checksum":"71685ca5121f4c837f40c3f8eb50c915","file_id":"12322","success":1,"date_created":"2023-01-20T10:02:48Z","file_size":911017,"date_updated":"2023-01-20T10:02:48Z"}],"date_updated":"2023-06-27T12:53:43Z","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_processing_charge":"Yes (via OA deal)","month":"01","date_published":"2023-01-01T00:00:00Z","publication_status":"published","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"}],"department":[{"_id":"HeEd"}]}