Author:
Zhou Rong,Chen Chun,Sun Liqun,Lau Francis,Poon Sheung-Hung,Zhang Yong
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 .
Subject
Computational Mathematics,Computational Theory and Mathematics,Numerical Analysis,Theoretical Computer Science
Reference17 articles.
1. More Optimal Packings of Equal Circles in a Square
2. A circle packing algorithm
3. Asymptotics of greedy energy points
4. Geometric Discrepancy: An Illustrated Guide;Matousek,1999
5. The Discrepancy Method: Randomness and Complexity;Chazelle,2000
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献