pith. sign in

arxiv: 1705.03911 · v1 · pith:ZNGNZQ7Unew · submitted 2017-05-10 · 💻 cs.CG

Recognition of the Spherical Laguerre Voronoi Diagram

classification 💻 cs.CG
keywords laguerresphericalvoronoidiagramtessellationalgorithmconstructonly
0
0 comments X
read the original abstract

In this paper, we construct an algorithm for determining whether a given tessellation on a sphere is a spherical Laguerre Voronoi diagram or not. For spherical Laguerre tessellations, not only the locations of the Voronoi generators, but also their weights are required to recover. However, unlike the ordinary spherical Voronoi diagram, the generator set is not unique, which makes the problem difficult. To solve the problem, we use the property that a tessellation is a spherical Laguerre Voronoi diagram if and only if there is a polyhedron whose central projection coincides with the tessellation. We determine the degrees of freedom for the polyhedron, and then construct an algorithm for recognizing Laguerre tessellations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.