Online uniformly inserting points on the sphere

Zhou, Rong and Chen, Chun and Sun, Liqun and Lau, Francis and Poon, Sheung-Hung and Zhang, Yong (2018) Online uniformly inserting points on the sphere. Algorithms, 11 (10). 156/1-156/9. ISSN 1999-4893

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Available under Licence Creative Commons Attribution.
Download (583kB) | Preview

Abstract

Uniformly inserting points on the sphere has been found useful in many scientific and engineering fields. Different from the offline version where the number of points is known in advance, we consider the online version of this problem. The requests for point insertion arrive one by one and the target is to insert points as uniformly as possible. To measure the uniformity we use gap ratio which is defined as the ratio of the maximal gap to the minimal gap of two arbitrary inserted points. We propose a two-phase online insertion strategy with gap ratio of at most 3.69. Moreover, the lower bound of the gap ratio is proved to be at least 1.78.

Item Type: Article
Keywords: online algorithms; uniform insertion; gap ratio
Schools/Departments: University of Nottingham Ningbo China > Faculty of Science and Engineering > School of Computer Science
Identification Number: https://doi.org/10.3390/a11100156
Depositing User: Zhou, Elsie
Date Deposited: 05 Dec 2018 10:43
Last Modified: 05 Dec 2018 10:43
URI: http://eprints.nottingham.ac.uk/id/eprint/55649

Actions (Archive Staff Only)

Edit View Edit View