By Topic

Computation of Geodesic Voronoi Diagrams in Riemannian 3-Space using Medial Equations

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

4 Author(s)

The Voronoi diagram has been investigated intensively throughout the last decades. This has been done not only in the context of Euclidean geometry but also in curved spaces. Except for Kunze et al. (1997) these methods typically make use of some fast marching cube algorithms. In this work we will focus on the computation of Voronoi diagrams including Voronoi objects that are contained in a Riemannian manifold M. Further, we assume throughout this paper that M has a differentiable structure consisting of smooth parametrisation functions fi, i isin 1. This is the reason why the approach presented in this work differs from the aforementioned algorithms. More accurate algorithms can be obtained by using to some medial equations that heavily involve normal coordinates. This approach relies on the precise computation of shortest joins of any two given points , q isin M. For these computations we did not apply shooting methods or related methods. Instead, we used a new perturbation method that operates on a family of deformed manifolds Mt, assuming that Mo has constant sectional curvature. To reduce time and space complexity of the introduced algorithm we suggest to use a randomised incremental construction scheme (RICS). Our approach assumes that those points fulfil a general position requirement for computing the geodesic Voronoi diagram for a set of points. Finally results of some computed Voronoi diagrams will be presented.

Published in:

Cyberworlds, 2007. CW '07. International Conference on

Date of Conference:

24-26 Oct. 2007