By Topic

Revisiting Hyperbolic Voronoi Diagrams from Theoretical, Applied and Generalized Viewpoints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tanuma, T. ; Grad. Sch. of Inf. Sci. & Technol., Univ. of Tokyo, Tokyo, Japan ; Imai, H. ; Moriyama, S.

Voronoi diagram in the hyperbolic space, hyperbolic Voronoi diagrams for short, as well as that with respect to information-geometric divergences has been investigated since mid 1990's by Onishi et al. This paper revisits the hyperbolic Voronoi diagram from three standpoints, background theory, new applications, and geometric extensions. First, viewed from statistical estimation and 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 hyperbolic Voronoi diagram becomes flat by a linearization similar to one of two flat coordinates in the dually flat space, and it is a part of some power diagram. This gives another proof for the result recently obtained by Nielsen and Nock on the hyperbolic Klein model, completely different linearized model. Our result is interesting in view of the linearization having information geometric interpretations. Second, 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 sites of hyperbolic Voronoi diagrams. Specifically, we consider Voronoi diagrams of geodesic segments in the upper half-plane and propose an algorithm for them.

Published in:

Voronoi Diagrams in Science and Engineering (ISVD), 2010 International Symposium on

Date of Conference:

28-30 June 2010