> Details

Chubet, Oliver A. [Author]; Macnichol, Paul [Author]; Parikh, Parth [Author]; Sheehy, Donald R. [Author]; Sheth, Siddharth S. [Author] ; Oliver A. Chubet and Paul Macnichol and Parth Parikh and Donald R. Sheehy and Siddharth S. Sheth [Contributor]

Greedy Permutations and Finite Voronoi Diagrams (Media Exposition)

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: E-Article; Electronic Conference Proceeding; Text
  • Title: Greedy Permutations and Finite Voronoi Diagrams (Media Exposition)
  • Contributor: Chubet, Oliver A. [Author]; Macnichol, Paul [Author]; Parikh, Parth [Author]; Sheehy, Donald R. [Author]; Sheth, Siddharth S. [Author]
  • imprint: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
  • Language: English
  • DOI: https://doi.org/10.4230/LIPIcs.SoCG.2023.64
  • Keywords: Voronoi diagrams ; greedy permutation
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: 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].
  • Access State: Open Access