Related papers: GPU Voronoi Diagrams for Random Moving Seeds
Agent-based models are becoming indispensable tools in building design, safety assessments as well as management of emergency egress. However, reliable calibrations of these models should be mandatory before they are used in practice. To…
This paper introduces a new approach toward characterizing local structural features of two-dimensional particle systems. The approach can accurately identify and characterize defects in high-temperature crystals, distinguish a wide range…
Representing a scanned map of the real environment as a topological structure is an important research topic in robotics. Since topological representations of maps save a huge amount of map storage space and online computing time, they are…
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,…
Real-world networks evolve over time via additions or removals of vertices and edges. In current network evolution models, vertex degree varies or grows arbitrarily. A recently introduced degree-preserving network growth (DPG) family of…
We introduce a new class of dynamic point process models with simple and intuitive dynamics that are based on the Voronoi tessellations generated by the processes. Under broad conditions, these processes prove to be ergodic and produce, on…
Consider a dynamical network model featuring mobile stations on the Euclidean plane. The initial locations of the stations are given by a homogeneous Poisson point process. The stations are all moving at a constant speed and in a random…
We present an extension of Voronoi diagrams where when considering which site a client is going to use, in addition to the site distances, other site attributes are also considered (for example, prices or weights). A cell in this diagram is…
In the Hausdorff Voronoi diagram of a set of clusters of points in the plane, the distance between a point t and a cluster P is the maximum Euclidean distance between t and a point in P. This diagram has direct applications in VLSI design.…
Two-dimensional simulations are used to explore topological transitions that occur during the formation of films grown from grains that are seeded on substrates. This is done for a relatively large range of the initial value $\Phi_s$ of the…
In distributed mobile sensing applications, networks of agents that are heterogeneous respecting both actuation as well as body and sensory footprint are often modelled by recourse to power diagrams --- generalized Voronoi diagrams with…
Mobile and embedded platforms are increasingly required to efficiently execute computationally demanding DNNs across heterogeneous processing elements. At runtime, the available hardware resources to DNNs can vary considerably due to other…
In this paper, we propose a novel space partitioning strategy for implicit hierarchy visualization such that the new plot not only has a tidy layout similar to the treemap, but also is flexible to data changes similar to the Voronoi…
Intersections of pedestrian flows feature multiple types, varying in the numbers of flow directions as well as intersecting angles. In this article results from diverse bidirectional flow experiments with different intersecting angles are…
The computation of Voronoi Diagrams, or their dual Delauney triangulations is difficult in high dimensions. In a recent publication Polianskii and Pokorny propose an iterative randomized algorithm facilitating the approximation of Voronoi…
Random walks are a primary means for extracting information from large-scale graphs. While most real-world graphs are inherently dynamic, state-of-the-art random walk engines failed to efficiently support such a critical use case. This…
We consider the Voronoi diagram of lines in $\mathbb{R}^3$ under the Euclidean metric, and give a full classification of its structure in the base case of four lines in general position. We first show that the number of vertices in the…
In this paper, we develop constructive algorithms for generating quasi-uniform point sets and sequences over arbitrary two-dimensional triangular domains. Our proposed method, called the \emph{Voronoi-guided greedy packing} algorithm,…
The transport of sediments by a fluid flow is commonly found in nature and in industry. In nature, it is found in rivers, oceans, deserts, and other environments. In industry, it is found in petroleum pipelines conveying grains, in sewer…
Voronoi grids have been successfully used to represent density structures of gas in astronomical hydrodynamics simulations. While some codes are explicitly built around using a Voronoi grid, others, such as Smoothed Particle Hydrodynamics…