zobov: a parameter-free void-finding algorithm

@article{Neyrinck2008zobovAP,
  title={zobov: a parameter-free void-finding algorithm},
  author={Mark C. Neyrinck},
  journal={Monthly Notices of the Royal Astronomical Society},
  year={2008},
  volume={386},
  pages={2101-2109}
}
  • M. Neyrinck
  • Published 18 December 2007
  • Computer Science
  • Monthly Notices of the Royal Astronomical Society
zobov (ZOnes Bordering On Voidness) is an algorithm that finds density depressions in a set of points, without any free parameters, or assumptions about shape. It uses the Voronoi tessellation to estimate densities, which it uses to find both voids and subvoids. It also measures probabilities that each void or subvoid arises from Poisson fluctuations. This paper describes the zobov algorithm, and the results from its application to the dark matter particles in a region of the Millennium… 

Figures and Tables from this paper

Defining Cosmological Voids in the Millennium Simulation Using the Parameter-free ZOBOV Algorithm

The Zones Bordering On Voidness (ZOBOV) parameter-free void-finding algorithm is applied to data from the 2005 N-body Millennium Simulation. Voids can be used as a distance estimator for cosmic

PARAVT: Parallel Voronoi tessellation code

A robust void-finding algorithm using computational geometry and parallelization techniques

This thesis presents an efficient, fast and robust void-finding algorithm, that is both robust and efficient, that takes advantage of the properties of certain features, such as Delaunay triangulations and k-nearest-neighbour search algorithms.

VORONOI TESSELLATION AND NON-PARAMETRIC HALO CONCENTRATION

We present and test Tessellation-based Recovery of Amorphous halo Concentrations (TesseRACt), a non-parametric technique for recovering the concentration of simulated dark matter halos using Voronoi

Meshing the Universe : Identifying Voids in Cosmological Simulations Through In Situ Parallel Voronoi Tessellation

This work presents a prototype method for computing a Voronoi tessellation in parallel from large particle datasets and demonstrates performance and scalability in a single time step, and also compute time-varyingTessellations to better understand the temporal dynamics of voids.

The Voronoi tessellation method in astronomy.

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

STRUCTURE IN THE 3D GALAXY DISTRIBUTION. II. VOIDS AND WATERSHEDS OF LOCAL MAXIMA AND MINIMA

The major uncertainties in studies of the multi-scale structure of the universe arise not from observational errors but from the variety of legitimate definitions and detection methods for individual

DIVE in the cosmic web: voids with Delaunay Triangulation from discrete matter tracer distributions

We present a novel parameter-free cosmological void finder (\textsc{dive}, Delaunay TrIangulation Void findEr) based on Delaunay Triangulation (DT), which efficiently computes the empty spheres

The nature of voids – I. Watershed void finders and their connection with theoretical models

The statistical study of voids in the matter distribution promises to be an important tool for precision cosmology, but there are known discrepancies between theoretical models of voids and the voids
...

References

SHOWING 1-10 OF 47 REFERENCES

voboz: an almost-parameter-free halo-finding algorithm

We have developed an algorithm, called VOBOZ (VOronoi BOund Zones), to find haloes in an N-body dark matter simulation; it has as little dependence on free parameters as we can manage. By using the

Finding galaxy clusters using Voronoi tessellations

We present an objective and automated procedure for detecting clusters of galaxies in imaging galaxy surveys. Our Voronoi Galaxy Cluster Finder (VGCF) uses galaxy positions and magnitudes to find

The Cosmic Web: Geometric Analysis

The lecture notes describe the Delaunay Tessellation Field Estimator for Cosmic Web analysis. The high sensitivity of Voronoi/Delaunay tessellations to the local point distribution is used to obtain

Zipf’s law for fractal voids and a new void-finder

Abstract.Voids are a prominent feature of fractal point distributions but there is no precise definition of what is a void (except in one dimension). Here we propose a definition of voids that uses

Voids in the Large-Scale Structure

Voids are the most prominent feature of the large-scale structure of the universe. Still, their incorporation into quantitative analysis of it has been relatively recent, owing essentially to the

Voids in the distribution of galaxies: an assessment of their significance and derivation of a void spectrum.

An algorithm to search for nearly spherical regions which are devoid of bright galaxies is presented. The presence of empty regions, or voids, is an intrinsic property of any spatial point data. Some

Density estimators in particle hydrodynamics DTFE versus regular SPH

We present the results of a study comparing density maps reconstructed by the Delaunay Tessellation Field Estimator (DTFE) and by regular SPH kernel-based techniques. The density maps are constructed

Shapes and sizes of voids in the Lambda cold dark matter universe: excursion set approach

We study the global distribution and morphology of dark matter voids in a Lambda cold dark matter (� CDM) universe using density fields generated by N-body simulations. Voids are defined as isolated

A cosmic watershed: the WVF void detection technique

On megaparsec scales the Universe is permeated by an intricate filigree of clusters, filaments, sheets and voids, the cosmic web. For the understanding of its dynamical and hierarchical history it is

Voids in the Point Source Catalogue Survey and the Updated Zwicky Catalog

We describe an algorithm to detect voids in galaxy redshift surveys. The method is based on the void finder algorithm of El-Ad & Piran. We apply a series of tests to determine how accurately we are