Power diagrams: properties, algorithms and applications
SIAM Journal on Computing
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Voronoi diagram in statistical parametric space by Kullback-Leibler divergence
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
On the combinatorial complexity of euclidean Voronoi cells and convex hulls of d-dimensional spheres
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Online Routing in Triangulations
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
The Voronoi Diagram of Curved Objects
Discrete & Computational Geometry
On a conjecture related to geometric routing
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
Distributed computation of virtual coordinates
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct Greedy Graph Drawing in the Hyperbolic Plane
Graph Drawing
α-divergence is unique, belonging to both f-divergence and Bregman divergence classes
IEEE Transactions on Information Theory
Hyperbolic Voronoi Diagrams Made Easy
ICCSA '10 Proceedings of the 2010 International Conference on Computational Science and Its Applications
3D hyperbolic Voronoi diagrams
Computer-Aided Design
Hyperbolic centroidal Voronoi tessellation
Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
Revisiting Hyperbolic Voronoi Diagrams from Theoretical, Applied and Generalized Viewpoints
ISVD '10 Proceedings of the 2010 International Symposium on Voronoi Diagrams in Science and Engineering
Quantum Information & Computation
Convex hull and voronoi diagram of additively weighted points
ESA'05 Proceedings of the 13th annual European conference on Algorithms
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
| Hi-index | 0.00 |
This paper revisits hyperbolic Voronoi diagrams, which have been investigated since mid 1990's by Onishi et al., from three standpoints, background theory, new applications, and geometric extensions. First, we review two ideas to compute hyperbolic Voronoi diagrams of points. One of them is Onishi's method to compute a hyperbolic Voronoi diagram from a Euclidean Voronoi diagram. The other one is a linearization of hyperbolic Voronoi diagrams. We show that a hyperbolic Voronoi diagram of points in the upper half-space model becomes an affine diagram, which is part of a power diagram in the Euclidean space. This gives another proof of a result obtained by Nielsen and Nock on the hyperbolic Klein model. Furthermore, we consider this linearization from the view point of information geometry. In the parametric space of normal distributions, the hyperbolic Voronoi diagram is induced by the Fisher metric while the divergence diagram is given by the Kullback-Leibler divergence on a dually flat structure. We show that the linearization of hyperbolic Voronoi diagrams is similar to one of two flat coordinates in the dually flat space, and our result is interesting in view of the linearization having information-geometric interpretations. Secondly, from the viewpoint of new applications, we discuss the relation between the hyperbolic Voronoi diagram and the greedy embedding in the hyperbolic plane. Kleinberg proved that in the hyperbolic plane the greedy routing is always possible. We point out that results of previous studies about the greedy embedding use a property that any tree is realized as a hyperbolic Delaunay graph easily. Finally, we generalize hyperbolic Voronoi diagrams. We consider hyperbolic Voronoi diagrams of spheres by two measures and hyperbolic Voronoi diagrams of geodesic segments, and propose algorithms for them, whose ideas are similar to those of computing hyperbolic Voronoi diagrams of points.