| Issue |
A&A
Volume 513, April 2010
|
|
|---|---|---|
| Article Number | A15 | |
| Number of page(s) | 15 | |
| Section | Catalogs and data | |
| DOI | https://doi.org/10.1051/0004-6361/200912428 | |
| Published online | 15 April 2010 | |
The Heidelberg InfraRed Optical Cluster Survey (HIROCS)*
I. Layout, instrumentation, and data analysis
1
Max-Planck-Institut für Astronomie, Königstuhl 17, 69117 Heidelberg, Germany e-mail: roeser@mpia-hd.mpg.de
2
University of Oxford, Department of Physics, Denys Wilkinson Building, Keble Road,
Oxford OX1 3RH, UK
Received:
6
May
2009
Accepted:
7
November
2009
Aims. We describe a survey for distant clusters of galaxies that identified clusters as local overdensities in the 3D galaxy distribution.
Methods. Optical and near-IR imaging in B, R, i, z, and H are used to derive photometric redshifts for objects as faint as m* + 1 at a redshift of 1.5. We outline the astrometric and photometric data reduction. The 3D cluster search, based on the photometric redshifts, is described.
Results. On the basis of the first fully reduced 1 square degree of data, we demonstrate that the objectives of HIROCS have been achieved. Four representative clusters from the list of candidates are presented.
Key words: galaxies: clusters: general / surveys / methods: data analysis
Based on observations collected at the Centro Astronómico Hispano Alemán (CAHA) at Calar Alto, operated jointly by the Max-Planck Institut für Astronomie and the Instituto de Astrofísica de Andalucía (CSIC) and on observations collected at the European Southern Observatory, Chile, during Max-Planck-time.
© ESO, 2010
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.