Related papers: Hyperbolic Voronoi diagrams made easy
The computation of Voronoi Diagrams, or their dual Delauney triangulations is difficult in high dimensions. In a recent publication Polianskii and Pokorny propose an iterative randomized algorithm facilitating the approximation of Voronoi…
The Voronoi diagram is a certain geometric data structure which has numerous applications in various scientific and technological fields. The theory of algorithms for computing 2D Euclidean Voronoi diagrams of point sites is rich and…
Recent research in representation learning has shown that hierarchical data lends itself to low-dimensional and highly informative representations in hyperbolic space. However, even if hyperbolic embeddings have gathered attention in image…
We determine explicit formulas for the bisectors used in constructing a Dirichlet fundamental domain in hyperbolic two and three space. They are compared with the isometric spheres employed in the construction of a Ford domain and used to…
Hyperbolic programming is the problem of computing the infimum of a linear function when restricted to the hyperbolicity cone of a hyperbolic polynomial, a generalization of semidefinite programming. We propose an approach based on symbolic…
We describe the development of a new software tool, called "Pomelo", for the calculation of Set Voronoi diagrams. Voronoi diagrams are a spatial partition of the space around the particles into separate Voronoi cells, e.g. applicable to…
Consider the Poincare disc model for hyperbolic geometry. In this paper, a convenient computational formula is developed along with an aesthetic geometric interpretation. Two proofs, one geometric and one analytical, of each result are…
In this thesis we study sets of points in the plane and their Voronoi diagrams, in particular when the points coincide. We bring together two ways of studying point sets that have received a lot of attention in recent years: Voronoi…
This article presents an algorithm to compute digital images of Voronoi, Johnson-Mehl or Laguerre diagrams of a set of punctual sites, in a domain of a Euclidean space of any dimension. The principle of the algorithm is, in a first step, to…
We use Lie sphere geometry to describe two large categories of generalized Voronoi diagrams that can be encoded in terms of the Lie quadric, the Lie inner product, and polyhedra. The first class consists of diagrams defined in terms of…
For the analysis of systems consisting of small, regular objects, the methods of mathematical morphology applied to images of these systems are well-suited. One of these methods is the use of Voronoi polygons. It was found that the Voronoi…
Cellular structures manifest their outstanding mechanical properties in many biological systems. One key challenge for designing and optimizing these geometrically complicated structures lies in devising an effective geometric…
This work constructs symbolic dynamics for non-uniformly hyperbolic surface maps with a set of discontinuities $D$. We allow the derivative of points nearby $D$ to be unbounded, of the order of a negative power of the distance to $D$. Under…
In this paper, we study a problem related to geometry of bisectors in quaternionic hyperbolic geometry. We develop some of the basic theory of bisectors in quaternionic hyperbolic space $H^n_Q$. In particular, we show that quaternionic…
Motivated by an experimental study of groups generated by reflections in planar patterns of tangent circles, we describe some methods for constructing and studying representation spaces of holonomy groups of infinite volume hyperbolic…
Voronoi tessellation, also known as Voronoi diagram, is an important computational geometry technique that has applications in various scientific disciplines. It involves dividing a given space into regions based on the proximity to a set…
Consider polynomial maps $f:\C\to\C$ of degree $d\ge 2$, or more generally polynomial maps from a finite union of copies of $\C$ to itself. In the space of suitably normalized maps of this type, the hyperbolic maps form an open set called…
For a given set of points $U$ on a sphere $S$, the order $k$ spherical Voronoi diagram $SV_k(U)$ decomposes the surface of $S$ into regions whose points have the same $k$ nearest points of $U$. Hyeon-Suk Na, Chung-Nim Lee, and Otfried…
This paper continues a geometric study of Harvey's Complex of Curves, whose ultimate goal is to apply the theory of hyperbolic spaces and groups to algorithmic questions for the Mapping Class Group and geometric properties of Kleinian…
Hyperbolic geometry plays an important role within function theory of the disk. For example, via the Schwarz-Pick Lemma, the isometries of the unit disk $\mathbb D$ with respect to this geometry are the conformal self-maps of $\mathbb D$.…