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(n \log \Delta)$ time for low-dimensional data using this method.

@inproceedings{chubet23greedy,
	Author = {Oliver A. Chubet and Paul Macnichol and Parth Parikh and Donald R. Sheehy and Siddharth S. Sheth},
	Booktitle = {Proceedings of the 39th International Symposium on Computational Geometry (SoCG 2023)},
	Title = {Greedy Permutations and Finite Voronoi Diagrams},
  PAges = {64:1--64:5},
	Year = {2023}}