{"license":"https://creativecommons.org/licenses/by/4.0/","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","publication_identifier":{"eissn":["14320444"],"issn":["01795376"]},"oa":1,"publication":"Discrete and Computational Geometry","language":[{"iso":"eng"}],"year":"2019","intvolume":"        62","file":[{"relation":"main_file","checksum":"f9d00e166efaccb5a76bbcbb4dcea3b4","content_type":"application/pdf","date_created":"2019-02-06T10:10:46Z","file_id":"5932","creator":"dernst","date_updated":"2020-07-14T12:47:10Z","file_size":599339,"file_name":"2018_DiscreteCompGeometry_Edelsbrunner.pdf","access_level":"open_access"}],"issue":"4","department":[{"_id":"HeEd"}],"volume":62,"file_date_updated":"2020-07-14T12:47:10Z","date_published":"2019-12-01T00:00:00Z","abstract":[{"text":"The order-k Voronoi tessellation of a locally finite set 𝑋⊆ℝ𝑛 decomposes ℝ𝑛 into convex domains whose points have the same k nearest neighbors in X. Assuming X is a stationary Poisson point process, we give explicit formulas for the expected number and total area of faces of a given dimension per unit volume of space. We also develop a relaxed version of discrete Morse theory and generalize by counting only faces, for which the k nearest points in X are within a given distance threshold.","lang":"eng"}],"_id":"5678","external_id":{"arxiv":["1709.09380"]},"quality_controlled":"1","scopus_import":1,"doi":"10.1007/s00454-018-0049-2","date_updated":"2021-01-12T08:06:55Z","ec_funded":1,"ddc":["516"],"month":"12","date_created":"2018-12-16T22:59:20Z","page":"865–878","status":"public","publisher":"Springer","publication_status":"published","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020","grant_number":"788183"},{"name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","call_identifier":"FWF"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"article_processing_charge":"Yes (via OA deal)","title":"Poisson–Delaunay Mosaics of Order k","day":"01","author":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"first_name":"Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","full_name":"Nikitenko, Anton","last_name":"Nikitenko"}],"has_accepted_license":"1","citation":{"ama":"Edelsbrunner H, Nikitenko A. Poisson–Delaunay Mosaics of Order k. <i>Discrete and Computational Geometry</i>. 2019;62(4):865–878. doi:<a href=\"https://doi.org/10.1007/s00454-018-0049-2\">10.1007/s00454-018-0049-2</a>","ieee":"H. Edelsbrunner and A. Nikitenko, “Poisson–Delaunay Mosaics of Order k,” <i>Discrete and Computational Geometry</i>, vol. 62, no. 4. Springer, pp. 865–878, 2019.","ista":"Edelsbrunner H, Nikitenko A. 2019. Poisson–Delaunay Mosaics of Order k. Discrete and Computational Geometry. 62(4), 865–878.","apa":"Edelsbrunner, H., &#38; Nikitenko, A. (2019). Poisson–Delaunay Mosaics of Order k. <i>Discrete and Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-018-0049-2\">https://doi.org/10.1007/s00454-018-0049-2</a>","mla":"Edelsbrunner, Herbert, and Anton Nikitenko. “Poisson–Delaunay Mosaics of Order K.” <i>Discrete and Computational Geometry</i>, vol. 62, no. 4, Springer, 2019, pp. 865–878, doi:<a href=\"https://doi.org/10.1007/s00454-018-0049-2\">10.1007/s00454-018-0049-2</a>.","chicago":"Edelsbrunner, Herbert, and Anton Nikitenko. “Poisson–Delaunay Mosaics of Order K.” <i>Discrete and Computational Geometry</i>. Springer, 2019. <a href=\"https://doi.org/10.1007/s00454-018-0049-2\">https://doi.org/10.1007/s00454-018-0049-2</a>.","short":"H. Edelsbrunner, A. Nikitenko, Discrete and Computational Geometry 62 (2019) 865–878."},"oa_version":"Published Version","related_material":{"record":[{"relation":"dissertation_contains","id":"6287","status":"public"}]},"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)"}}