Cloud computing and hyperbolic Voronoi diagrams on the sphere
Abstract
In this work we study the minimization problem for the total distance in a cloud computing network on the sphere. We give a solution to this problem in terms of hyperbolic Voronoi diagrams on the sphere. We present results of computer simulations illustrating the solution.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.