Related papers: Voronoi cells of discrete point sets
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…
A parallelotope is a polytope whose translation copies fill space without gaps and intersections by interior points. Voronoi conjectured that each parallelotope is an affine image of the Dirichlet domain of a lattice, which is a Voronoi…
A lattice Delaunay polytope D is called perfect if it has the property that there is a unique circumscribing ellipsoid with interior free of lattice points, and with the surface containing only those lattice points that are the vertices of…
A split of a polytope is a (necessarily regular) subdivision with exactly two maximal cells. A polytope is totally splittable if each triangulation (without additional vertices) is a common refinement of splits. This paper establishes a…
A cellular string of a polytope is a sequence of faces stacked on top of each other in a given direction. The poset of cellular strings, ordered by refinement, is known to be homotopy equivalent to a sphere. The subposet of coherent…
We study the Voronoi and void statistics of super-homogeneous (or hyperuniform) point patterns in which the infinite-wavelength density fluctuations vanish. Super-homogeneous or hyperuniform point patterns arise in one-component plasmas,…
A large class of real $3$-dimensional nilpotent polynomial vector fields of arbitrary degree is considered. The aim of this work is to present general properties of the discrete and continuous dynamical systems induced by these vector…
We trace movements of certain points in space-time along their corresponding continuous path. We partition the space at every moment of time using alpha-Complexes, Voronoi medusa is then the collection or union of restricted Voronoi cells…
Many polytopes arising in polyhedral combinatorics are linear projections of higher-dimensional polytopes with significantly fewer facets. Such lifts may yield compressed representations of polytopes, which are typically used to construct…
Consider a Voronoi tiling of the Euclidean space based on a realization of a inhomogeneous Poisson random set. A Voronoi polyomino is a finite and connected union of Voronoi tiles. In this paper we provide tail bounds for the number of…
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…
$n$ independent random points drawn from a density $f$ in $R^d$ define a random Voronoi partition. We study the measure of a typical cell of the partition. We prove that the asymptotic distribution of the probability measure of the cell…
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…
The typical cell of a Voronoi tessellation generated by $n+1$ uniformly distributed random points on the $d$-dimensional unit sphere $\mathbb S^d$ is studied. Its $f$-vector is identified in distribution with the $f$-vector of a beta'…
We are interested in dendrites for which all invariant measures of zero-entropy mappings have discrete spectrum, and we prove that this holds when the closure of the endpoint set of the dendrite is countable. This solves an open question…
A polytope $D$ whose vertices belong to a lattice of rank $d$ is Delaunay if there is a circumscribing $d$-dimensional ellipsoid, $E$, with interior free of lattice points so that the vertices of $D$ lie on $E$. If in addition, the…
Voronoi mosaics inspired by the seed points placed on the Archimedes Spirals are reported. Voronoi entropy was calculated for these patterns. Equidistant and non-equidistant patterns are treated. Voronoi mosaics built from cells of equal…
For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…
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…
Voronoi diagrams are a fundamental geometric data structure for obtaining proximity relations. We consider collections of axis-aligned orthogonal polyhedra in two and three-dimensional space under the max-norm, which is a particularly…