Geometric Algorithms for Identifying and Reconstructing Galaxy Systems
C. Marinoni (CPT, University of Provence, Marseille, France)

TL;DR
This chapter reviews the evolution of geometric algorithms used to identify and reconstruct galaxy groups and clusters, highlighting advancements, challenges, and current best practices in the field.
Contribution
It provides a comprehensive overview of the development of detection techniques for galaxy systems, emphasizing geometric methods and their improvements over time.
Findings
Progression from visual to geometric detection algorithms
Identification of key issues and pitfalls in current methods
Comparison of algorithm performance over historical developments
Abstract
The theme of this book chapter is to discuss algorithms for identifying and reconstructing groups and clusters of galaxies out of the general galaxy distribution. I review the progress of detection techniques through time, from the very first visual-like algorithms to the most performant geometrical methods available today. This will allow readers to understand the development of the field as well as the various issues and pitfalls we are confronted with. This essay is drawn from a talk given by the author at the conference "The World a Jigsaw: Tessellations in the Sciences" held at the Lorentz Center in Leiden. It is intended for a broad audience of scientists (and so does not include full academic referencing), but it may be of interest to specialists.
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
TopicsHistorical Geography and Cartography · Computational Geometry and Mesh Generation · Mathematics and Applications
