space sciences and exploration
Farshad Somayehee; Amir Ali Nikkhah; Jafar Roshanian
Volume 14, Issue 2 , June 2021, , Pages 103-110
Abstract
In this paper, a new algorithm for determining the density of scattered data at the surface of the sphere is presented and then the proposed algorithm along with Geodesic Weighted K-Means clustering and Deluany triangulation are used to make uniform star catalogs. Comparison of the results with the results ...
Read More
In this paper, a new algorithm for determining the density of scattered data at the surface of the sphere is presented and then the proposed algorithm along with Geodesic Weighted K-Means clustering and Deluany triangulation are used to make uniform star catalogs. Comparison of the results with the results of other related articles shows that the proposed algorithm resulted in a significant decrease in the probability of observing a large number of stars in all simulated star sensor fields of view. This improvement is due to the uniformity of the star catalog, especially in the celestial sphere poles due to the proposed density determination algorithm. On the other hand, the use of a proper data density algorithm has increased the likelihood of observing a few stars (such as 3 or 5) in all fields of view used in the Monte Carlo simulation.
