The Application of kd-tree in Astronomy

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

The basic idea of the kd-tree algorithm is to recursively partition a point set P by hyperplanes, and to store the obtained partitioning in a binary tree. Due to its immense popularity, many applications in astronomy have been implemented. The algorithm can been used to solve a near neighbor problem for cross-identification of huge catalogs and realize the classification of astronomical objects. Since kd-tree can speed up query and partition spaces, some approaches based on it have been applied for photometric redshift measurement. We give the case studies of kd-tree in astronomy to show its importance and performance.
4 pages, 3 tables, ADASS XVII conference

Keywords

Astrophysics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/145871

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0801.2004
 http://arxiv.org/abs/0801.2004

Collections

arXiv