Papers › Voronoi Diagrams in the Hilbert Metric
Voronoi Diagrams in the Hilbert Metric
Auguste H. Gezalyan, David M. Mount
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The Hilbert metric is a distance function defined for points lying within a convex body. It generalizes the Cayley-Klein model of hyperbolic geometry to any convex set, and it has numerous applications in the analysis and processing of convex bodies. In this paper, we study the geometric and combinatorial properties of the Voronoi diagram of a set of point sites under the Hilbert metric. Given any convex polygon K bounded by m sides, we present two algorithms (one randomized and one deterministic) for computing the Voronoi diagram of an n-element point set in the Hilbert metric induced by K. Our randomized algorithm runs in O(m n + n (logn)(logm n)) expected time, and our deterministic algorithm runs in time O(m n logn). Both algorithms use O(m n) space. We show that the worst-case combinatorial complexity of the Voronoi diagram is Θ(m n).
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections