The Application of kd-tree in Astronomy
| dc.creator | Gao, Dan | |
| dc.creator | Zhang, Yanxia | |
| dc.creator | Zhao, Yongheng | |
| dc.date | 2008-01-14 | |
| dc.date.accessioned | 2026-07-07T08:54:16Z | |
| dc.date.available | 2026-07-07T08:54:16Z | |
| dc.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. | |
| dc.description | 4 pages, 3 tables, ADASS XVII conference | |
| dc.identifier | https://arxiv.org/abs/0801.2004 | |
| dc.identifier | http://arxiv.org/abs/0801.2004 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/145871 | |
| dc.subject | Astrophysics | |
| dc.title | The Application of kd-tree in Astronomy | |
| dc.type | text |