{"month":"08","article_processing_charge":"No","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","short":"CC BY (3.0)","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png"},"date_updated":"2023-09-07T13:29:00Z","file":[{"checksum":"fe0f7c49a99ed870c671b911e10d5496","relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"cziletti","file_name":"2020_LIPIcs_Osang.pdf","date_updated":"2020-10-27T14:31:52Z","success":1,"file_id":"8712","file_size":733291,"date_created":"2020-10-27T14:31:52Z"}],"license":"https://creativecommons.org/licenses/by/3.0/","type":"conference","day":"26","department":[{"_id":"HeEd"}],"abstract":[{"text":"Even though Delaunay originally introduced his famous triangulations in the case of infinite point sets with translational periodicity, a software that computes such triangulations in the general case is not yet available, to the best of our knowledge. Combining and generalizing previous work, we present a practical algorithm for computing such triangulations. The algorithm has been implemented and experiments show that its performance is as good as the one of the CGAL package, which is restricted to cubic periodicity. ","lang":"eng"}],"publication_status":"published","date_published":"2020-08-26T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","scopus_import":"1","oa":1,"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-10-25T23:01:18Z","alternative_title":["LIPIcs"],"quality_controlled":"1","title":"Generalizing CGAL periodic Delaunay triangulations","related_material":{"record":[{"status":"public","id":"9056","relation":"dissertation_contains"}]},"status":"public","publication_identifier":{"isbn":["9783959771627"],"issn":["18688969"]},"doi":"10.4230/LIPIcs.ESA.2020.75","author":[{"first_name":"Georg F","last_name":"Osang","full_name":"Osang, Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8882-5116"},{"full_name":"Rouxel-Labbé, Mael","last_name":"Rouxel-Labbé","first_name":"Mael"},{"first_name":"Monique","last_name":"Teillaud","full_name":"Teillaud, Monique"}],"publication":"28th Annual European Symposium on Algorithms","has_accepted_license":"1","language":[{"iso":"eng"}],"_id":"8703","article_number":"75","ec_funded":1,"citation":{"mla":"Osang, Georg F., et al. “Generalizing CGAL Periodic Delaunay Triangulations.” <i>28th Annual European Symposium on Algorithms</i>, vol. 173, 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">10.4230/LIPIcs.ESA.2020.75</a>.","ieee":"G. F. Osang, M. Rouxel-Labbé, and M. Teillaud, “Generalizing CGAL periodic Delaunay triangulations,” in <i>28th Annual European Symposium on Algorithms</i>, Virtual, Online; Pisa, Italy, 2020, vol. 173.","ama":"Osang GF, Rouxel-Labbé M, Teillaud M. Generalizing CGAL periodic Delaunay triangulations. In: <i>28th Annual European Symposium on Algorithms</i>. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">10.4230/LIPIcs.ESA.2020.75</a>","ista":"Osang GF, Rouxel-Labbé M, Teillaud M. 2020. Generalizing CGAL periodic Delaunay triangulations. 28th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 75.","chicago":"Osang, Georg F, Mael Rouxel-Labbé, and Monique Teillaud. “Generalizing CGAL Periodic Delaunay Triangulations.” In <i>28th Annual European Symposium on Algorithms</i>, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">https://doi.org/10.4230/LIPIcs.ESA.2020.75</a>.","apa":"Osang, G. F., Rouxel-Labbé, M., &#38; Teillaud, M. (2020). Generalizing CGAL periodic Delaunay triangulations. In <i>28th Annual European Symposium on Algorithms</i> (Vol. 173). Virtual, Online; Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">https://doi.org/10.4230/LIPIcs.ESA.2020.75</a>","short":"G.F. Osang, M. Rouxel-Labbé, M. Teillaud, in:, 28th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020."},"conference":{"location":"Virtual, Online; Pisa, Italy","end_date":"2020-09-09","start_date":"2020-09-07","name":"ESA: Annual European Symposium on Algorithms"},"year":"2020","intvolume":"       173","volume":173,"ddc":["000"],"project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020"}],"file_date_updated":"2020-10-27T14:31:52Z"}