Related papers: GPU Voronoi Diagrams for Random Moving Seeds
In this thesis we study sets of points in the plane and their Voronoi diagrams, in particular when the points coincide. We bring together two ways of studying point sets that have received a lot of attention in recent years: Voronoi…
For the analysis of systems consisting of small, regular objects, the methods of mathematical morphology applied to images of these systems are well-suited. One of these methods is the use of Voronoi polygons. It was found that the Voronoi…
The Voronoi tessellation is a natural way of space segmentation, which has many applications in various fields of science and technology, as well as in social sciences and visual art. The varieties of the Voronoi tessellation methods are…
Topological maps are more suitable than metric maps for robotic exploration tasks. However, real-time updating of accurate and detail-rich environmental topological maps remains a challenge. This paper presents a topological map updating…
We present a general framework for computing two-dimensional Voronoi diagrams of different classes of sites under various distance functions. The framework is sufficiently general to support diagrams embedded on a family of two-dimensional…
Given a network, the statistical ensemble of its graph-Voronoi diagrams with randomly chosen cell centers exhibits properties convertible into information on the network's large scale structures. We define a node-pair level measure called…
The Voronoi tessellation is the partition of space for a given seeds pattern and the result of the partition depends completely on the type of given pattern "random", Poisson-Voronoi tessellations (PVT), or "non-random", Non Poisson-Voronoi…
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…
We present a simple wavefront-like approach for computing multiplicatively weighted Voronoi diagrams of points and straight-line segments in the Euclidean plane. If the input sites may be assumed to be randomly weighted points then the use…
We introduce a dynamical system based on the vertices of Voronoi tessellations. This dynamical system acts on finite or discrete point sets in the plane, taking a point set to the vertex set of its Voronoi tessellation. We explore the…
The compaction dynamics of a granular media subject to a sequence of vertical taps made of fluid pulses is investigated via Molecular Dynamics simulations. Our study focuses on three different levels: macroscopic (volume fraction),…
The anticipated widespread use of unmanned aerial vehicles (UAVs) raises significant safety and security concerns, including trespassing in restricted areas, colliding with other UAVs, and disrupting high-traffic airspaces. To mitigate…
In this article, we propose a numerical method to solve semi-discrete optimal transport problems for gigantic pointsets (108 points and more). By pushing the limits by several orders of magnitude, it opens the path to new applications in…
In stark contrast to the case of images, finding a concise, learnable discrete representation of 3D surfaces remains a challenge. In particular, while polygon meshes are arguably the most common surface representation used in geometry…
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…
Microstructural evolution, particularly grain growth, plays a critical role in shaping the physical, optical, and electronic properties of materials. Traditional phase-field modeling accurately simulates these phenomena but is…
In this paper, an efficient motion planning approach with grid-based generalized Voronoi diagrams (G$ \mathbf{^2} $VD) is newly proposed for mobile robots. Different from existing approaches, the novelty of this work is twofold: 1) a new…
Let $S$ be a planar $n$-point set. A triangulation for $S$ is a maximal plane straight-line graph with vertex set $S$. The Voronoi diagram for $S$ is the subdivision of the plane into cells such that all points in a cell have the same…
We introduce a numerical framework that enables unprecedented direct numerical studies of the electropermeabilization effects of a cell aggregate at the meso-scale. Our simulations qualitatively replicate the shadowing effect observed in…
Markovian evolving graphs are dynamic-graph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely general and they can well describe important dynamic-network…