Papers
Topics
Authors
Recent
Search
2000 character limit reached

Recognition of the Spherical Laguerre Voronoi Diagram

Published 10 May 2017 in cs.CG | (1705.03911v1)

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.

Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.