Finding galaxy clusters using Voronoi tessellations

被引:139
|
作者
Ramella, M
Boschin, W
Fadda, D
Nonino, M
机构
[1] Osserv Astron Trieste, I-34100 Trieste, Italy
[2] Univ Trieste, Dipartimento Astron, I-34100 Trieste, Italy
[3] Inst Astrofis Canarias, E-38200 San Cristobal la Laguna, Tenerife, Spain
关键词
cosmology : large-scale structure of Universe; galaxies : clusters : general; galaxies : statistics;
D O I
10.1051/0004-6361:20010071
中图分类号
P1 [天文学];
学科分类号
0704 ;
摘要
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 clusters and determine their main features: size, richness and contrast above the background. The VGCF uses the Voronoi tessellation to evaluate the local density and to identify clusters as significative density fluctuations above the background. The significance threshold needs to be set by the user, but experimenting with different choices is very easy since it does not require a whole new run of the algorithm. The VGCF is non-parametric and does not smooth the data. As a consequence, clusters are identified irrespective of their shape and their identification is only slightly affected by border effects and by holes in the galaxy distribution on the sky. The algorithm is fast, and automatically assigns members to structures. A test run of the VGCF on the PDCS field centered at alpha = 13(h)26(m) and delta = +29 degrees 52 ' (J2000) produces 37 clusters. Of these clusters, 12 are VGCF counterparts of the 13 PDCS clusters detected at the 3 sigma level and with estimated redshifts from z = 0.2 to z = 0.6. Of the remaining 25 systems, 2 are PDCS clusters with confidence level < 3<sigma> and redshift z I 0.6. Inspection of the 23 new VGCF dusters indicates that several of these clusters may have been missed by the matched filter algorithm for one or more of the following reasons: a) they are very poor, b) they are extremely elongated, c) they lie too close to a rich and/or low redshift cluster.
引用
收藏
页码:776 / 786
页数:11
相关论文
共 50 条
  • [11] Converting Tessellations into Graphs: From Voronoi Tessellations to Complete Graphs
    Gilevich, Artem
    Shoval, Shraga
    Nosonovsky, Michael
    Frenkel, Mark
    Bormashenko, Edward
    MATHEMATICS, 2024, 12 (15)
  • [12] Modeling hollow fiber membrane separations using voronoi tessellations
    Long, R
    Liang, TT
    Rogers, J
    Yarbro, S
    PLUTONIUM FUTURES-THE SCIENCE, 2000, 532 : 257 - 257
  • [13] Detecting combinatorial hierarchy in tilings using derived Voronoi tessellations
    Frank, NP
    DISCRETE & COMPUTATIONAL GEOMETRY, 2003, 29 (03) : 459 - 476
  • [14] Gaussian Process Modeling of Heterogeneity and Discontinuities Using Voronoi Tessellations
    Pope, Christopher A.
    Gosling, John Paul
    Barber, Stuart
    Johnson, Jill S.
    Yamaguchi, Takanobu
    Feingold, Graham
    Blackwell, Paul G.
    TECHNOMETRICS, 2021, 63 (01) : 53 - 63
  • [15] Detecting Combinatorial Hierarchy in Tilings Using Derived Voronoi Tessellations
    Discrete & Computational Geometry, 2003, 29 : 459 - 467
  • [16] Voronoi Tessellations based simple optimizer
    Bajpai, Prathu
    Bansal, Jagdish Chand
    INFORMATION SCIENCES, 2024, 676
  • [17] Anisotropic centroidal Voronoi tessellations and their applications
    Du, Q
    Wang, DS
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2005, 26 (03): : 737 - 761
  • [18] Bernoulli Cluster Field: Voronoi Tessellations
    Ivan Saxl
    Petr Ponizil
    Applications of Mathematics, 2002, 47 (2) : 157 - 167
  • [19] Halftoning with Weighted Centroidal Voronoi Tessellations
    Inoue, Kohei
    Urahama, Kiichi
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2012, E95A (06) : 1103 - 1105
  • [20] AddiVortes: (Bayesian) Additive Voronoi Tessellations
    Stone, Adam J.
    Gosling, John Paul
    JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS, 2024,