The Application of kd-tree in Astronomy

Details The Application of kd-tree in Astronomy The Application of kd-tree in Astronomy

2008-01-14

arxiv.org/abs/0801.2004v1

Astronomy and Astrophysics

Astrophysics

4 pages, 3 tables, ADASS XVII conference

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Application of kd-tree in Astronomy does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Application of kd-tree in Astronomy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Application of kd-tree in Astronomy will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-633607