arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1810.01786cs.CG
收藏

实现统一的在线球面镶嵌

Towards Uniform Online Spherical Tessellations

Paul C. Bell, Igor Potapov

摘要:

在球面上均匀放置N个点的问题在许多领域都有应用。例如,球面上的点对应于单位四元数以及旋转群SO(3),并且生成均匀旋转的在线版本(称为“增量生成”)在从机器人和航空到计算机图形学的大量工程应用中起着至关重要的作用。这个问题的一个在线版本,最近研究的间隙比作为衡量均匀性。Chen等人的第一个在线算法的上限为5.99,后来改进为3.69,这是通过考虑外切十二面体然后对每个面进行递归分解来实现的。在本文中,我们提供了一个更有效的镶嵌技术的基础上,正二十面体,提高了这个问题的在线版本的上限,降低到约2.84。此外,我们表明,下限的差距比放置至少三个点是黄金比例,约。1.618,并且至少四个点不小于1.726。

英文摘要:

The problem of uniformly placing N points onto a sphere finds applications in many areas. For example, points on the sphere correspond to unit quaternions as well as to the group of rotations SO(3) and the online version of generating uniform rotations (known as "incremental generation") plays a crucial role in a large number of engineering applications ranging from robotics and aeronautics to computer graphics. An online version of this problem was recently studied with respect to the gap ratio as a measure of uniformity. The first online algorithm of Chen et al. was upper-bounded by 5.99 and later improved to 3.69, which is achieved by considering a circumscribed dodecahedron followed by a recursive decomposition of each face. In this paper we provide a more efficient tessellation technique based on the regular icosahedron, which improves the upper-bound for the online version of this problem, decreasing it to approximately 2.84. Moreover, we show that the lower bound for the gap ratio of placing at least three points is the golden ratio, approx. 1.618, and for at least four points is no less than 1.726.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑