Related papers: A dynamical system using the Voronoi tessellation
The motion of pedestrians is subject to a wide range of influences and exhibits a rich phenomenology. To enable precise measurement of the density and velocity we use an alternative definition using Voronoi diagrams which exhibits smaller…
We explore how to build a vector field from the various functions involved in a given mathematical program, and show that locally-stable equilibria of the underlying dynamical system are precisely the local solutions of the optimization…
Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoi\v{c}i\'{c} (2003) showed that the limiting set is dense…
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…
This short review is devoted to the problem of the equilibrium of stellar dynamical systems in the context of the Vlasov-Poisson model. In a first part we will review some classical problems posed by the application of the Vlasov-Poisson…
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 describe a new algorithm for computing the Voronoi diagram of a set of $n$ points in constant-dimensional Euclidean space. The running time of our algorithm is $O(f \log n \log \Delta)$ where $f$ is the output complexity of the Voronoi…
A Voronoi diagram partitions the plane into convex cells, each containing the points closest to a single generator. Given such a tessellation, the inverse Voronoi problem seeks the generator set \( S \) that produced it. Our algorithm…
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…
For a group of pedestrians without any spatial boundaries, the methods of density estimation is a wide area of research. Besides, there is a specific difficulty when the density along one given pedestrian trajectory is needed in order to…
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…
This work introduces the Hookean-Voronoi energy, a minimal model for the packing of soft, deformable balls. This is motivated by recent studies of quasi-periodic equilibria arising from dense packings of diblock and star polymers.…
We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the probability that a randomly chosen point converges to a particular neighborhood of a periodic orbit in a fixed number of iterations, and we…
We stress the importance of stochastic geometry as a branch of mathematical statistics particularly suited to model and investigate nontrivial spatial patterns. One of its key concepts, Voronoi tessellations, represents a versatile and…
We study the geodesic Voronoi diagram of a set $S$ of $n$ linearly moving sites inside a static simple polygon $P$ with $m$ vertices. We identify all events where the structure of the Voronoi diagram changes, bound the number of such…
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…
Numerous formulations of finite volume schemes for the Euler and Navier-Stokes equations exist, but in the majority of cases they have been developed for structured and stationary meshes. In many applications, more flexible mesh geometries…
We investigate Voronoi-like tessellations of bipartite quadrangulations on surfaces of arbitrary genus, by using a natural generalization of a bijection of Marcus and Schaeffer allowing to encode such structures into labeled maps with a…
We introduce an adic (Bratteli-Vershik) dynamical system based on a diagram whose path counts from the root are the Delannoy numbers. We identify the ergodic invariant measures, prove total ergodicity for each of them, and initiate the…
Let $P$ be a set of $n$ points and $Q$ a convex $k$-gon in ${\mathbb R}^2$. We analyze in detail the topological (or discrete) changes in the structure of the Voronoi diagram and the Delaunay triangulation of $P$, under the convex distance…