Related papers: On the Structure of Higher Order Voronoi Cells

Voronoi tessellations are used to partition the Euclidean space into polyhedral regions, which are called Voronoi cells. Labeling the Voronoi cells with the class information, we can map any classification problem into a Voronoi…

We extend the theory of logarithmic Voronoi cells to Gaussian statistical models. In general, a logarithmic Voronoi cell at a point on a Gaussian model is a convex set contained in its log-normal spectrahedron. We show that for models of ML…

We present an extension of Voronoi diagrams where when considering which site a client is going to use, in addition to the site distances, other site attributes are also considered (for example, prices or weights). A cell in this diagram is…

We study the statistics of the Voronoi cell perimeter in large bi-pointed planar quadrangulations. Such maps have two marked vertices at a fixed given distance $2s$ and their Voronoi cell perimeter is simply the length of the frontier which…

Let $P$ be a planar set of $n$ sites in general position. For $k\in\{1,\dots,n-1\}$, the Voronoi diagram of order $k$ for $P$ is obtained by subdividing the plane into cells such that points in the same cell have the same set of nearest $k$…

Higher-order Voronoi diagrams and Delaunay mosaics in polygonal metrics have only recently been studied, yet no tools exist for visualizing them. We introduce a tool that fills this gap, providing dynamic interactive software for…

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…

We revisit a new type of a Voronoi diagram, in which distance is measured from a point to a pair of points. We consider a few more such distance functions, based on geometric primitives, and analyze the structure and complexity of the…

Cells of Voronoi diagrams in two dimensions are usually considered as having edges of zero width. However, this is not the case in several experimental situations in which the thickness of the edges of the cells is relatively large. In this…

The Voronoi-based cellular model is highly successful in describing the motion of two-dimensional confluent cell tissues. In the homogeneous version of this model, the energy of each cell is determined solely by its geometric shape and…

Given a countable set of points in a continuous space, Voronoi tessellation is an intuitive way of partitioning the space according to the distance to the individual points. As a powerful approach to obtain structural information, it has a…

Voronoi cells of varieties encode many features of their metric geometry. We prove that each Voronoi or Delaunay cell of a plane curve appears as the limit of a sequence of cells obtained from point samples of the curve. We use this result…

We consider the Voronoi diagram generated by $n$ i.i.d. $\mathbb{R}^{d}$-valued random variables with an arbitrary underlying probability density function $f$ on $\mathbb{R}^{d}$, and analyse the asymptotic behaviours of certain geometric…

Poisson Voronoi diagrams are useful for modeling and describing various natural patterns and for generating random lattices. Although this particular space tessellation is intensively studied by mathematicians, in two- and three dimensional…

We characterized the combinatorial structure of the Voronoi cell of the $A_n$ lattice in arbitrary dimensions. Based on the well-known fact that the Voronoi cell is the disjoint union of $(n+1)!$ congruent simplices, we show that it is the…

This note describes a simple method to draw random points such that the cells of the corresponding Voronoi tesselation (approximately) satisfy a desired size distribution, for instance, follow a power law. The method is illustrated and…

We consider the Voronoi tessellation based on a homogeneous Poisson point process in $\mathbf{R}^{d}$. For a geometric characteristic of the cells (e.g. the inradius, the circumradius, the volume), we investigate the point process of the…

In this paper we are concerned with finding the vertices of the Voronoi cell of a Euclidean lattice. Given a basis of a lattice, we prove that computing the number of vertices is a #P-hard problem. On the other hand we describe an algorithm…

We study logarithmic Voronoi cells for linear statistical models and partial linear models. The logarithmic Voronoi cells at points on such model are polytopes. To any $d$-dimensional linear model inside the probability simplex…

Let $X$ be a Poisson point process and $K\subset\mathbb{R}^d$ a measurable set. Construct the Voronoi cells of all points $x\in X$ with respect to $X$, and denote by $v_X(K)$ the union of all Voronoi cells with nucleus in $K$. For $K$ a…