Related papers: Voronoi cells in random split trees

Many physical systems can be studied as collections of particles embedded in space, evolving through deterministic evolution equations. Natural questions arise concerning how to characterize these arrangements - are they ordered or…

For each integer $k \geq 2$, we introduce a sequence of $k$-ary discrete trees constructed recursively by choosing at each step an edge uniformly among the present edges and grafting on "its middle" $k-1$ new edges. When $k=2$, this…

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…

For any small constant $\epsilon>0$, the Erd\H{o}s-R\'enyi random graph $G(n,\frac{1+\epsilon}{n})$ with high probability has a unique largest component which contains $(1\pm O(\epsilon))2\epsilon n$ vertices. Let $G_c(n,p)$ be obtained by…

We find a simple, closed formula for the proportion of vertices which are $k$-protected in all unlabeled rooted plane trees on $n$ vertices. We also find that, as $n$ goes to infinity, the average rank of a random vertex in a tree of size…

We study Voronoi diagrams for distance functions that add together two convex functions, each taking as its argument the difference between Cartesian coordinates of two planar points. When the functions do not grow too quickly, then the…

We study the discrete Voronoi game, where two players alternately claim vertices of a graph for t rounds. In the end, the remaining vertices are divided such that each player receives the vertices that are closer to his or her claimed…

Poisson Voronoi tessellations have been used in modeling many types of systems across different sciences, from geography and astronomy to telecommunications. The existing literature on the statistical properties of Poisson Voronoi cells is…

The simple cubic lattice defines a set of points at regular distances. The volume of the Voronoi cells around each point may serve as a weight for integration over the entire space. We add interstitial points to this grid according to the…

Characterizing structural inhomogeneity is an essential step in understanding the mechanical response of amorphous materials. We introduce a threshold-free measure based on the field of vectors pointing from the center of each particle to…

Consider a rooted binary tree with n nodes. Assign with the root the abscissa 0, and with the left (resp. right) child of a node of abscissa i the abscissa i-1 (resp. i+1). We prove that the number of binary trees of size n having exactly…

We consider the probability that a spanning tree chosen uniformly at random from a graph can be partitioned into a fixed number $k$ of trees of equal size by removing $k-1$ edges. In that case, the spanning tree is called {\em splittable}.…

Since the Voronoi diagram appears in many applications, the topic of improving its computational efficiency remains attractive. We propose a novel yet efficient method to compute Voronoi diagrams bounded by a given domain, i.e., the clipped…

Minimization diagrams encompass a large class of diagrams of interest in the literature, such as generalized Voronoi diagrams. We develop an abstract perturbation theory and perform a sensitivity analysis for functions depending on sets…

The intersections of beta-Voronoi, beta-prime-Voronoi and Gaussian-Voronoi tessellations in $\mathbb{R}^d$ with $\ell$-dimensional affine subspaces, $1\leq \ell\leq d-1$, are shown to be random tessellations of the same type but with…

We study the geometry of a random unicellular map which is uniformly distributed on the set of all unicellular maps whose genus size is proportional to the number of edges of the map. We prove that the distance between two uniformly…

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$…

In this paper we investigate relationships between the volumes of cells of three-dimensional Voronoi tessellations and the lengths and areas of sections obtained by intersecting the tessellation with a randomly oriented plane. Here, in…

Most current results on coverage control using mobile sensors require that one partitioned cell is the sole responsibility of one sensor. In this paper, we consider a class of generalized Voronoi coverage control problems by using higher…

Poisson point processes provide a versatile framework for modeling the distributions of random points in space. When the space is partitioned into cells, each associated with a single generating point from the Poisson process, there appears…