Related papers: PARAVT: Parallel Voronoi Tessellation code
VORO++ is a software library written in C++ for computing the Voronoi tessellation, a technique in computational geometry that is widely used for analyzing systems of particles. VORO++ was released in 2009 and is based on computing the…
We have developed a new parallel tree method which will be called the forest method hereafter. This new method uses the sectional Voronoi tessellation (SVT) for the domain decomposition. The SVT decomposes a whole space into polyhedra and…
votess is a library for computing parallel 3D Voronoi tessellations on heterogeneous platforms, from CPUs and GPUs, to future accelerator architectures. To do so, it leverages the SYCL abstraction layer to achieve portability and…
Given a countable set of points in a continuous space, Voronoi tessellation is an intuitive way of partitioning the space according to the distance to the individual points. As a powerful approach to obtain structural information, it has a…
Owing to the natural interpretation and various desirable mathematical properties, centroidal Voronoi tessellations (CVT) have found a wide range of applications and correspondingly a vast development in their literature. However the…
Spatial statistical analysis of multivariate volumetric data can be challenging due to scale, complexity, and occlusion. Advances in topological segmentation, feature extraction, and statistical summarization have helped overcome the…
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…
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 method is developed to compute the chord length distribution along a line which intersects a cellular Universe. The cellular Universe is here modeled by the Poissonian Voronoi Tessellation (PVT) and by a non-Poissonian Voronoi…
We present a detailed description of the Voronoi Tessellation (VT) cluster finder algorithm in 2+1 dimensions, which improves on past implementations of this technique. The need for cluster finder algorithms able to produce reliable cluster…
Voronoi diagrams are essential geometrical structures with numerous applications, particularly astrophysics-driven finite volume methods. While serial algorithms for constructing these entities are well-established, parallel construction…
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…
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…
In this paper we present formulae for chord length distribution in the framework of Poissonian Voronoi Tessellation (PVT) and non Poissonian Voronoi Tessellation (NPVT). The introduction of the scale parameter in the obtained distributions…
In this paper, we review the computational aspects of a multiscale dissipative particle dynamics model for complex fluid simulations based on the feature-rich geometry of the Voronoi tessellation. The geometrical features of the model are…
Centroidal Voronoi tessellation (CVT)-based mesh generation is a very effective technique for creating high-quality Voronoi meshes and their dual Delaunay triangulations that often play a crucial role in applications, including ocean and…
Currently, grid and glass methods are the two most popular choices to generate uniform particle distributions (i.e., pre-initial conditions) for cosmological $N$-body simulations. In this article, we introduce an alternative method called…
A numerically efficient, accurate, and easily implemented integration scheme over convex Voronoi polyhedra (VP) is presented for use in {\it ab-initio} electronic-structure calculations. We combine a weighted Voronoi tessellation with…
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…
Voronoi tessellations have been used to model the geometric arrangement of cells in morphogenetic or cancerous tissues, however so far only with flat hypersurfaces as cell-cell contact borders. In order to reproduce the experimentally…