Spherical Rectangular Equal-Area Grid (SREAG): Some features
Zinovy Malkin

TL;DR
The paper details the features and capabilities of the Spherical Rectangular Equal-Area Grid (SREAG), including its maximum resolution, computational precision, and formulas for grid configuration.
Contribution
It provides an in-depth analysis of SREAG's features, including maximum resolution, precision, and practical formulas for grid setup.
Findings
Maximum resolution of ~16 arcseconds with 32-bit coding.
Computational precision up to 7×10^{-12}.
Derived formulas for grid configuration and resolution.
Abstract
A new method Spherical Rectangular Equal-Area Grid (SREAG) was proposed in Malkin (2019) for splitting spherical surface into equal-area rectangular cells. In this work, some more detailed features of SREAG are presented. The maximum number of rings that can be achieved with SREAG for coding with 32-bit integer is =41068, which corresponds to the finest resolution of 16. Computational precision of the SREAG is tested. The worst level of precision is for large . Simple expressions were derived to calculate the number of rings for the desired number of cells and for the required resolution.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsElectromagnetic Scattering and Analysis · Scientific Research and Discoveries · Mathematical Approximation and Integration
