Bell, PC and Potapov, I (2022) Towards Uniform Online Spherical Tessellations. Discrete and Computational Geometry: an international journal of mathematics and computer science. ISSN 0179-5376

Preview

Text Towards Uniform Online Spherical Tessellations.pdf - Published Version Available under License Creative Commons Attribution. Download (762kB) | Preview

Abstract

The problem of uniformly placing N 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 gap ratio 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 1.618 and for at least four points is no less than 1.726.

Item Type:	Article
Uncontrolled Keywords:	0101 Pure Mathematics, 0103 Numerical and Computational Mathematics, 0802 Computation Theory and Mathematics
Subjects:	Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software
Divisions:	Computer Science and Mathematics
Publisher:	Springer
Date Deposited:	28 Feb 2022 12:32
Last Modified:	05 Apr 2022 09:00
DOI or ID number:	10.1007/s00454-022-00384-x
URI:	https://researchonline.ljmu.ac.uk/id/eprint/16438

View Item