Towards Uniform Online Spherical Tessellations

Bell, Paul

Abstract

The problem of uniformly placing points onto a sphere finds applications in many areas. For example, points on the sphere correspond to unit quaternions as well as to the group of rotations SO(3) and the online version of generating uniform rotations (known as “incremental generation”) plays a crucial role in a large number of engineering applications ranging from robotics and aeronautics to computer graphics. An online version of this problem was recently studied with respect to the <jats:italic>gap ratio</jats:italic> as a measure of uniformity. The first online algorithm of Chen et al. was upper-bounded by 5.99 and later improved to 3.69, which is achieved by considering a circumscribed dodecahedron followed by a recursive decomposition of each face. In this paper we provide a more efficient tessellation technique based on the regular icosahedron, which improves the upper-bound for the online version of this problem, decreasing it to approximately 2.84. Moreover, we show that the lower bound for the gap ratio of placing at least three points is and for at least four points is no less than 1.726.</jats:p>

Citation

Bell, P., & Potapov, I. (2022). Towards Uniform Online Spherical Tessellations. Discrete and Computational Geometry, 67(4), 1124-1146. https://doi.org/10.1007/s00454-022-00384-x

• Journal Article Type: Article
• Acceptance Date: Dec 27, 2021
• Online Publication Date: Mar 22, 2022
• Publication Date: 2022-06
• Journal: Discrete &amp; Computational Geometry
• Print ISSN: 0179-5376
• Publisher: Springer Verlag
• Peer Reviewed: Peer Reviewed
• Volume: 67
• Issue: 4
• Pages: 1124-1146
• DOI: https://doi.org/10.1007/s00454-022-00384-x
• Keywords: online algorithms; discrepancy theory; spherical trigonometry; uniform point placement; computational geometry
• Publisher URL: https://link.springer.com/article/10.1007/s00454-022-00384-x#article-info