Related papers: Voronoi Grid-Shell Structures
Navigating topological transitions in cellular mechanical systems is a significant challenge for existing simulation methods. While abstract models lack predictive capabilities at the cellular level, explicit network representations…
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…
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…
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…
We introduce VoroFields, a hierarchical neural-field framework for approximating generalized Voronoi diagrams of finite geometric site sets in low-dimensional domains under arbitrary evaluable point-to-site distances. Instead of…
We introduce two new methods to obtain reliable velocity field statistics from N-body simulations, or indeed from any general density and velocity fluctuation field sampled by discrete points. These methods, the {\it Voronoi tessellation…
Real complex networks are often characterized by spatial constraints such as the relative position and adjacency of nodes. The present work describes how Voronoi tessellations of the space where the network is embedded provide not only a…
A jammed packing of frictionless spheres at zero temperature is perfectly specified by the network of contact forces from which mechanical properties can be derived. However, we can alternatively consider a packing as a geometric structure,…
Probabilistic circuits (PCs) enable exact and tractable inference but employ data independent mixture weights that limit their ability to capture local geometry of the data manifold. We propose Voronoi tessellations (VT) as a natural way to…
A novel algorithm to detect coherent structures with sparse Lagrangian particle tracking data, using Voronoi tessellation and techniques from spectral graph theory, is tested. Neighbouring tracer particles are naturally identified through…
3D Voronoi's tessellation method was first applied to identify groups of galaxies in the structure of a supercluster. The sample under consideration consists of more than 7000 galaxies of the Local Supercluster (LS) with radial velocities…
Deformation of crystalline materials is an interesting example of complex system behaviour. Small samples typically exhibit a stochastic-like, irregular response to externally applied stresses, manifested as significant sample-to-sample…
Language models operate on discrete tokens but compute in continuous vector spaces, inducing a Voronoi tessellation over the representation manifold. We study this tessellation empirically on Qwen3.5-4B-Base, making two contributions.…
In this paper, we construct an algorithm for determining whether a given tessellation on a sphere is a spherical Laguerre Voronoi diagram or not. For spherical Laguerre tessellations, not only the locations of the Voronoi generators, but…
We present a variational framework in which Centroidal Voronoi Tessellations (CVTs) arise as local minimizers of a generalized electrostatic energy functional. By modeling interior point distributions in a convex domain as repelling charges…
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…
Determining the masses of new physics particles appearing in decay chains is an important and longstanding problem in high energy phenomenology. Recently it has been shown that these mass measurements can be improved by utilizing the…
High-dimensional data analysis typically focuses on low-dimensional structure, often to aid interpretation and computational efficiency. Graphical models provide a powerful methodology for learning the conditional independence structure in…
We consider problem of constructing purely Voronoi mesh where the union of uncut Voronoi cells approximates the planar computational domain with piecewise-smooth boundary. Smooth boundary fragments are approximated by the Voronoi edges and…
The transition from ordered to disordered structures in Voronoi tessellation is obtained by perturbing the seeds that were originally identified with two types of lattice in 2D and one type in 3D. The area in 2D and the volume in 3D are…