{"title":"To use the new sphere pixelization method SREAG","authors":"Z. Malkin","doi":"10.31725/0367-7966-2023-228-10","DOIUrl":null,"url":null,"abstract":"A new method SREAG (Spherical Rectangular Equal-Area Grid) was proposed in Malkin (2019) to divide a spherical surface into rectangular cells of equal area. SREAG grid consists of a set of rings parallel to the equator, and each ring is divided into several cells, the number of which depends on the mean latitude of the ring. This paper presents some SREAG features in more details. The minimum number of rings is four. The maximum number of SREAG rings that can be achieved when using a 32-bit integer is 41068, which corresponds to the full range of resolution from $\\sim$45$^{\\circ}$ to $\\sim$16$''$ The computational accuracy of SREAG is also estimated. Simple expressions were derived to calculate the basic SREAG parameter, number of rings, for the desired number of cells or for the required grid resolution.","PeriodicalId":171274,"journal":{"name":"Publications of the Pulkovo Observatory","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Publications of the Pulkovo Observatory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31725/0367-7966-2023-228-10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
A new method SREAG (Spherical Rectangular Equal-Area Grid) was proposed in Malkin (2019) to divide a spherical surface into rectangular cells of equal area. SREAG grid consists of a set of rings parallel to the equator, and each ring is divided into several cells, the number of which depends on the mean latitude of the ring. This paper presents some SREAG features in more details. The minimum number of rings is four. The maximum number of SREAG rings that can be achieved when using a 32-bit integer is 41068, which corresponds to the full range of resolution from $\sim$45$^{\circ}$ to $\sim$16$''$ The computational accuracy of SREAG is also estimated. Simple expressions were derived to calculate the basic SREAG parameter, number of rings, for the desired number of cells or for the required grid resolution.