Next Article in Journal
LSTM Accelerator for Convolutional Object Identification
Previous Article in Journal
Real-Time Tumor Motion Tracking in 3D Using Planning 4D CT Images during Image-Guided Radiation Therapy
Article Menu

Export Article

Open AccessArticle
Algorithms 2018, 11(10), 156; https://doi.org/10.3390/a11100156

Online Uniformly Inserting Points on the Sphere

1
Research Center for High Performance Computing, Joint Engineering Research Center for Health Big Data Intelligent Analysis Technology, Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, 1068 Xueyuan Avenue, Shenzhen University Town, Shenzhen 518055, China
2
University of Chinese Academy of Sciences, 19(A) Yuquan Road, Shijingshan District, Beijing 100049, China
3
Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong, China
4
School of Computer Science, University of Nottingham Ningbo China, 199 Taikang East Road, Ningbo 315100, China
This paper is an extended version of our paper published in the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017).
*
Author to whom correspondence should be addressed.
Received: 11 August 2018 / Revised: 25 September 2018 / Accepted: 11 October 2018 / Published: 16 October 2018
Full-Text   |   PDF [570 KB, uploaded 16 October 2018]   |  

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 . View Full-Text
Keywords: online algorithms; uniform insertion; gap ratio online algorithms; uniform insertion; gap ratio
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Zhou, R.; Chen, C.; Sun, L.; Lau, F.C.M.; Poon, S.-H.; Zhang, Y. Online Uniformly Inserting Points on the Sphere. Algorithms 2018, 11, 156.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top