Abstract

In this paper we show that the spherical cap discrepancy of the point set given by centers of pixels in the HEALPix tessellation (short for Hierarchical, Equal Area and iso-Latitude Pixelation) of the unit 2-sphere is lower and upper bounded by order square root of the number of points, and compute explicit constants. This adds to the currently known (short) collection of explicitly constructed sets whose discrepancy converges with order 𝑁−1/2, matching the asymptotic order for i.i.d. random point sets. We describe the HEALPix framework in more detail and give explicit formulas for the boundaries and pixel centers. We then introduce the notion of an 𝑛-convex curve and prove an upper bound on how many fundamental domains are intersected by such curves, and in particular we show that boundaries of spherical caps have this property. Lastly, we mention briefly that a jittered sampling technique works in the HEALPix framework as well.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.