Abstract
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 electrons 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Asano, T.: Online uniformity of integer points on a line. Inf. Process. Lett. 109, 57–60 (2008)
Asano, T., Teramoto, S.: On-line uniformity of points. In: Book of Abstracts for 8th Hellenic-European Conference on Computer Mathematics and its Applications, Athens, Greece, September, pp. 21–22 (2007)
Badanidiyuru, A., Kleinberg, R., Singer, Y.: Analytically exact spiral scheme for generating uniformly distributed points on the unit sphere. J. Comput. Sci. 2(1), 88–91 (2011)
Bishnu, A., Desai, S., Ghosh, A., Goswami, M., Paul, S.: Uniformity of point samples in metric spaces using gap ratio. In: Jain, R., Jain, S., Stephan, F. (eds.) TAMC 2015. LNCS, vol. 9076, pp. 347–358. Springer, Heidelberg (2015). doi:10.1007/978-3-319-17142-5_30
Chazelle, B.: The Discrepancy Method: Randomness and Complexity. Cambridge University Press, Cambridge (2000)
Cook, J.M.: An efficient method for generating uniformly distributed points on the surface on an \(n\)-dimensional sphere (remarks). Commun. ACM 2(10), 26 (1959)
Collins, C.R., Stephenson, K.: A circle packing algorithm. Comput. Geom.: Theory Appl. 25(3), 233–256 (2003)
Hicks, J.S., Wheeling, R.F.: An efficient method for generating uniformly distributed points on the surface of an \(n\)-dimensional sphere. Commun. ACM 2(4), 17–19 (1959)
Koay, C.G.: Distributing points uniformly on the unit sphere under a mirror reflection symmetry constraint. J. Comput. Sci. 5(5), 696–700 (2014)
Matoušek, J.: Geometric Discrepancy. Springer, Heidelberg (1991)
Nurmela, K.J., Östergård, P.R.J.: More optimal packings of equal circles in a square. Discrete Comput. Geom. 22(3), 439–457 (1999)
Teramoto, S., Asano, T., Katoh, N., Doerr, B.: Inserting points uniformly at every instance. IEICE Trans. Inf. Syst. E89–D(8), 2348–2356 (2006)
Thomson, J.J.: On the structure of the atom: an investigation of the stability and periods of oscillation of a number of corpuscles arranged at equal intervals around the circumference of a circle; with application of the results to the theory of atomic structure. Philos. Mag. Ser. 6 7(39), 237–265 (1904)
Zhang, Y., Chang, Z., Chin, F.Y.L., Ting, H.-F., Tsin, Y.H.: Uniformly inserting points on square grid. Inf. Process. Lett. 111, 773–779 (2011)
Acknowledgements
This research is supported by National Key Research and Development Program of China under Grant 2016YFB0201401, National High Technology Research and Development Program of China under Grant Nos. 2014AA01A302, 2015AA050201, China’s NSFC grants (Nos. 61402461, 61433012, U1435215), and Shenzhen basic research grant JCYJ20160229195940462.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Chen, C., Lau, F.C.M., Poon, SH., Zhang, Y., Zhou, R. (2017). Online Inserting Points Uniformly on the Sphere. In: Poon, SH., Rahman, M., Yen, HC. (eds) WALCOM: Algorithms and Computation. WALCOM 2017. Lecture Notes in Computer Science(), vol 10167. Springer, Cham. https://doi.org/10.1007/978-3-319-53925-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-53925-6_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-53924-9
Online ISBN: 978-3-319-53925-6
eBook Packages: Computer ScienceComputer Science (R0)