Share Email Print
cover

Proceedings Paper

Discuss on the two algorithms of line-segments and dot-array for region judgement of the sub-satellite purview
Author(s): Hao Nie; Mingming Yang; Yajie Zhu; Peng Zhang
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

When satellite is flying on the orbit for special task like solar flare observation, it requires knowing if the sub-satellite purview was in the ocean area. The relative position between sub-satellite point and the coastline is varying, so the observation condition need be judged in real time according to the current orbital elements. The problem is to solve the status of the relative position between the rectangle purview and the multi connected regions formed by the base data of coastline. Usually the Cohen-Sutherland algorithm is adopted to get the status. It divides the earth map to 9 sections by the four lines extended the rectangle sides. Then the coordinate of boundary points of the connected regions in which section should be confirmed. That method traverses all the boundary points for each judgement. In this paper, two algorithms are presented. The one is based on line-segments, another is based on dot-array. And the data preprocessing and judging procedure of the two methods are focused. The peculiarity of two methods is also analyzed. The method of line-segments treats the connected regions as a set of series line segments. In order to solve the problem, the terminals’ coordinates of the rectangle purview and the line segments at the same latitude are compared. The method of dot-array translates the whole map to a binary image, which can be equal to a dot array. The value set of the sequence pixels in the dot array is gained. The value of the pixels in the rectangle purview is judged to solve the problem. Those two algorithms consume lower soft resource, and reduce much more comparing times because both of them do not need traverse all the boundary points. The analysis indicates that the real-time performance and consumed resource of the two algorithms are similar for the simple coastline, but the method of dot-array is the choice when coastline is quite complicated.

Paper Details

Date Published: 13 April 2015
PDF: 8 pages
Proc. SPIE 9522, Selected Papers from Conferences of the Photoelectronic Technology Committee of the Chinese Society of Astronautics 2014, Part II, 95222K (13 April 2015); doi: 10.1117/12.2181964
Show Author Affiliations
Hao Nie, Beijing Institute of Space Mechanics and Electricity (China)
Mingming Yang, Beijing Institute of Space Mechanics and Electricity (China)
Yajie Zhu, Beijing Institute of Space Mechanics and Electricity (China)
Peng Zhang, Beijing Institute of Space Mechanics and Electricity (China)


Published in SPIE Proceedings Vol. 9522:
Selected Papers from Conferences of the Photoelectronic Technology Committee of the Chinese Society of Astronautics 2014, Part II
Xiangwan Du; Jennifer Liu; Dianyuan Fan; Jialing Le; Yueguang Lv; Jianquan Yao; Weimin Bao; Lijun Wang, Editor(s)

© SPIE. Terms of Use
Back to Top