Paper:	The Application of kd-tree in Astronomy
Volume:	394, Astronomical Data Analysis Software and Systems (ADASS) XVII
Page:	525
Authors:	Gao, D.; Zhang, Y.; Zhao, Y.
Abstract:	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.

Astronomical Society of the Pacific
Conference Series

© Copyright 1988 - 2024 - Astronomical Society of the Pacific
No part of the material protected by this copyright may be reproduced or used in any form other than for personal use without written permission from the ASP.

Page generated in 0.061 seconds