VEGA: Voids idEntification using Genetic Algorithm
P. Ghafour, S. Tavasoli, M. R. Shojaei

TL;DR
VEGA is a new algorithm that uses Voronoi tessellation, convex hulls, and genetic algorithms to identify cosmic voids, offering a reliable and flexible method for analyzing large-scale structures in cosmology.
Contribution
The paper introduces VEGA, a novel void-finding algorithm combining Voronoi tessellation, convex hulls, and genetic algorithms, improving the identification of cosmic voids.
Findings
VEGA produces reliable void populations comparable to existing methods.
VEGA effectively identifies voids with diverse shapes and densities.
The method enhances spatial accessibility and seed point detection for void construction.
Abstract
Cosmic voids are large, nearly empty regions that lie between the web of galaxies, filaments and walls, and are recognized for their extensive applications in the field of cosmology and astrophysics. Despite their significance, a universal definition of voids remains unsettled as various void-finding methods identify different types of voids, each differing in shape and density, based on the method that were used. In this paper, we present VEGA, a novel algorithm for void identification. VEGA utilizes Voronoi tessellation to divide the dataset space into spatial cells and applies the Convex Hull algorithm to estimate the volume of each cell. It then integrates Genetic Algorithm analysis with luminosity density contrast to filter out over-dense cells and retain the remaining ones, referred to as void block cells. These filtered cells form the basis for constructing the final void…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVehicle License Plate Recognition
