Online inserting points uniformly on the sphere
DOI10.1007/978-3-319-53925-6_19zbMATH Open1434.68689DBLPconf/walcom/ChenLPZZ17OpenAlexW2587827666WikidataQ62041701 ScholiaQ62041701MaRDI QIDQ2980913FDOQ2980913
Authors: Chun Chen, Francis C. M. Lau, Sheung-Hung Poon, Yong Zhang, Rong Zhou 
Publication date: 5 May 2017
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53925-6_19
Recommendations
Online algorithms; streaming algorithms (68W27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Online uniformity of integer points on a line
- Uniformity of point samples in metric spaces using gap ratio
- A circle packing algorithm
- An efficient method for generating uniformly distributed points on the surface of an n -dimensional sphere
- More optimal packings of equal circles in a square
- On-line uniformity of points
- Uniformly inserting points on square grid
Cited In (6)
This page was built for publication: Online inserting points uniformly on the sphere
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980913)
