Papers › Computing Voronoi Diagrams in the Polar-Coordinate Model of the Hyperbolic Plane
Computing Voronoi Diagrams in the Polar-Coordinate Model of the Hyperbolic Plane
Tobias Friedrich, Maximilian Katzmann, Leon Schiller
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.
A Voronoi diagram is a basic geometric structure that partitions the space into regions associated with a given set of sites, such that all points in a region are closer to the corresponding site than to all other sites. While being thoroughly studied in Euclidean space, they are also of interest in hyperbolic space. In fact, there are several algorithms for computing hyperbolic Voronoi diagrams that work with the various models used to describe hyperbolic geometry. However, the polar-coordinate model has not been considered before, despite its popularity in the network science community. While Voronoi diagrams have the potential to advance this field, the model is geometrically not as approachable as other models, which impedes the development of geometric algorithms. In this paper, we present an algorithm for computing Voronoi diagrams natively in the polar-coordinate model of the hyperbolic plane. The approach is based on Fortune's sweep line algorithm for Euclidean Voronoi diagrams. We characterize the hyperbolic counterparts of the concepts it utilizes and introduce adaptations necessary to account for the differences. We implemented our algorithm and compared it with the corresponding CGAL implementation. While not being as numerically stable, our method has proven to be useful as a reference, which helped resolving fundamental issues in the implementation of the state-of-the-art method.
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