Related papers: Hyperbolic Voronoi diagrams made easy
The arrangement of network nodes in hyperbolic spaces has become a widely studied problem, motivated by numerous results suggesting the existence of hidden metric spaces behind the structure of complex networks. Although several methods…
We develop the theory of orbibundles from a geometrical viewpoint using diffeology. One of our goals is to present new tools allowing to calculate invariants of complex hyperbolic disc orbibundles over $2$-orbifolds appearing in the…
Making use of a unified approach to certain classes of induced representations, we establish here a number of detailed spectral theoretic decomposition results. They apply to specific problems from non-commutative harmonic analysis, ergodic…
Suppose that finitely many disjoint open arcs have been selected on the unit circle, each of length less than $\pi$. Let $L_0$ be a longest among them. One can treat the unit disk as a hyperbolic plane in the Poincare disk model. From this…
We show that, under mild conditions on the underlying metric, duals of appropriately defined anisotropic Voronoi diagrams are embedded triangulations. Furthermore, they always triangulate the convex hull of the vertices, and have other…
We study Voronoi cells in the statistical setting by considering preimages of the maximum likelihood estimator that tessellate an open probability simplex. In general, logarithmic Voronoi cells are convex sets. However, for certain…
We construct new examples of embedded, complete minimal hypersurfaces in quaternionc hyperbolic space and also some minimal foliations. We introduce fans an construct analytic deformations of bisectors.
An algorithm is presented for numerical computation of choreographies in spaces of constant negative curvature in a hyperbolic cotangent potential, extending the ideas given in a companion paper for computing choreographies in the plane in…
In this paper, we study hyperbolic rational maps with finitely connected Fatou sets. We construct models of post-critically finite hyperbolic tree mapping schemes for such maps, generalizing post-critically finite rational maps in the case…
In this paper, we develop numerical algorithms that use small requirements of storage and operations for the computation of hyperbolic cocycles over a rotation. We present fast algorithms for the iteration of the quasi-periodic cocycles and…
We describe an algorithm, meant to be very general, to compute a presentation of the group of units of an order in a (semi)simple algebra over Q. Our method is based on a generalisation of Vorono\"i's algorithm for computing perfect forms,…
In a crowd, individuals make different motion choices such as "moving to destination", "following another pedestrian", and "making a detour". For the sake of convenience, the three direction choices are respectively called destination…
We point out that interesting features in high energy physics data can be determined from properties of Voronoi tessellations of the relevant phase space. For illustration, we focus on the detection of kinematic "edges" in two dimensions,…
While the standard unweighted Voronoi diagram in the plane has linear worst-case complexity, many of its natural generalizations do not. This paper considers two such previously studied generalizations, namely multiplicative and semi…
Cutting a hyperbolic surface X along a simple closed multi-geodesic results in a hyperbolic structure on the complementary subsurface. We study the distribution of the shapes of these subsurfaces in moduli space as boundary lengths go to…
Graphical designs are subsets of vertices of a graph that perfectly average a selected set of eigenvectors of the Graph Laplacian. We show that in highly-structured graphs, graphical designs can coincide with highly structured and…
A numerically efficient, accurate, and easily implemented integration scheme over convex Voronoi polyhedra (VP) is presented for use in {\it ab-initio} electronic-structure calculations. We combine a weighted Voronoi tessellation with…
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…
Due to its geometric properties, hyperbolic space can support high-fidelity embeddings of tree- and graph-structured data, upon which various hyperbolic networks have been developed. Existing hyperbolic networks encode geometric priors not…
The need to understand the structure of hierarchical or high-dimensional data is present in a variety of fields. Hyperbolic spaces have proven to be an important tool for embedding computations and analysis tasks as their non-linear nature…