Related papers: The Voronoi tessellation method in astronomy
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 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…
Nowadays, big data of digital media (including images, videos and 3D graphical models) are frequently modeled as low-dimensional manifold meshes embedded in a high-dimensional feature space. In this paper, we summarized our recent work on…
Since the Voronoi diagram appears in many applications, the topic of improving its computational efficiency remains attractive. We propose a novel yet efficient method to compute Voronoi diagrams bounded by a given domain, i.e., the clipped…
We point out that interesting features in high energy physics data can be determined from properties of Voronoi tessellations of the relevant phase space. For illustration, we focus on the detection of kinematic "edges" in two dimensions,…
The intersections between a spherical shell and the faces of Voronoi's polyhedrons are numerically evaluated. The nodes of these intersections are the points that share the same distances from three nuclei. The nodes are assumed to be the…
We present a new open source code for massive parallel computation of Voronoi tessellations(VT hereafter) in large data sets. The code is focused for astrophysical purposes where VT densities and neighbors are widely used. There are several…
We investigate the application of volume statistics to probe the distribution of underdense regions in the large-scale structure of the Universe. This statistic measures the distortion of Eulerian volume elements relative to Lagrangian ones…
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…
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…
We present a technique to adaptively bin sparse X-ray data using weighted Voronoi tesselations (WVTs). WVT binning is a generalisation of Cappellari & Copin's (2001) Voronoi binning algorithm, developed for integral field spectroscopy. WVT…
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…
Geometric method based on the high-order 3D Voronoi tessellation is proposed for identifying the single galaxies, pairs and triplets. This approach allows to select small galaxy groups and isolated galaxies in different environment and find…
Voronoi tessellations of Poisson point processes are widely used for modeling many types of physical and biological systems. In this paper, we analyze simulated Poisson-Voronoi structures containing a total of 250,000,000 cells to provide…
Ionising feedback from massive stars dramatically affects the interstellar medium local to star forming regions. Numerical simulations are now starting to include enough complexity to produce morphologies and gas properties that are not too…
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…
A multiresolution technique on tessellation graphs for particle dynamics is proposed. This allows to split spatial field data given on millions of discrete particle positions into scale-dependent contributions. The Delaunay tessellation is…
The traditional approach to mobile phone positioning is based on the assumption that the geographical location of a cell tower recorded in a call details record (CDR) is a proxy for a device's location. A Voronoi tessellation is then…
We use a simple fragmentation model to describe the statistical behavior of the Voronoi cell patterns generated by a set of points in 1D and in 2D. In particular, we are interested in the distribution of sizes of these Voronoi cells. Our…
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…