Online Inserting Points Uniformly on the Sphere
文献类型：会议论文
| 作者 | Chun Chen; Francis Lau; Sheung-Hung Poon; Yong Zhang; Rong Zhou |
| 出版日期 | 2017 |
| 会议日期 | 2017 |
| 会议地点 | Hsinchu, Taiwan |
| 英文摘要 | In many scientific and engineering applications, there are occasions where points need to be inserted uniformly onto a sphere. Previous works on uniform point insertion mainly focus on the offline version, i.e., to compute N positions on the sphere for a given interger N with the objective to distribute these points as uniformly as possible. An example application is the Thomson problem where the task is to find the minimum electrostatic potential energy configuration of N elec-trons constrained on the surface of a sphere. In this paper, we study the online version of uniformly inserting points on the sphere. The number of inserted points is not known in advance, which means the points are inserted one at a time and the insertion algorithm does not know when to stop. As before, the objective is achieve a distribution of the points that is as uniform as possible at each step. The uniformity is measured by the gap ratio, the ratio between the maximal gap and the minimal gap of any pair of inserted points. We give a two-phase algorithm by using the structure of the regular dodecahedron, of which the gap ratio is upper bounded by 5.99. This is the first result for online uniform point insertion on the sphere. |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/12637]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 作者单位 | 2017 |
| 推荐引用方式 GB/T 7714 | Chun Chen,Francis Lau,Sheung-Hung Poon,et al. Online Inserting Points Uniformly on the Sphere[C]. 见:. Hsinchu, Taiwan. 2017. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。