TY - GEN
T1 - Revisiting hyperbolic Voronoi diagrams in two and higher dimensions from theoretical, applied and generalized viewpoints
AU - Tanuma, Toshihiro
AU - Imai, Hiroshi
AU - Moriyama, Sonoko
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
KW - Voronoi diagrams
KW - divergences
KW - geodesic segments
KW - greedy embedding
KW - hyperbolic geometry
KW - spheres
UR - http://www.scopus.com/inward/record.url?scp=81755178338&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=81755178338&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-25249-5_1
DO - 10.1007/978-3-642-25249-5_1
M3 - Conference contribution
AN - SCOPUS:81755178338
SN - 9783642252488
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
EP - 30
BT - Transactions on Computational Science XIV - Special Issue on Voronoi Diagrams and Delaunay Triangulation
T2 - 7th International Symposium on Voronoi Diagrams
Y2 - 28 June 2010 through 30 June 2010
ER -