2026-07-23T17:34:39Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:17914 2024-03-06T11:00:42Z ddc:004 open_access

Greedy Permutations and Finite Voronoi Diagrams (Media Exposition) Chubet, Oliver A. Macnichol, Paul Parikh, Parth Sheehy, Donald R. Sheth, Siddharth S. greedy permutation Voronoi diagrams We illustrate the computation of a greedy permutation using finite Voronoi diagrams. We describe the neighbor graph, which is a sparse graph data structure that facilitates efficient point location to insert a new Voronoi cell. This data structure is not dependent on a Euclidean metric space. The greedy permutation is computed in O(nlog Δ) time for low-dimensional data using this method [Sariel Har-Peled and Manor Mendel, 2006; Donald R. Sheehy, 2020]. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Oliver A. Chubet and Paul Macnichol and Parth Parikh and Donald R. Sheehy and Siddharth S. Sheth 2023 Is Part Of LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SoCG.2023.64 urn:nbn:de:0030-drops-179146 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.64 eng https://creativecommons.org/licenses/by/4.0/legalcode