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

关于周期距离计算中最小偏斜晶胞数的注记

Note on minimal number of skewed unit cells for periodic distance calculation

Senja Barthel

摘要:

一个平行六面体需要多少个副本,才能确保平行六面体中的每一个点都存在另一个点的副本,使得它们之间的距离等于当平行六面体的相对位置被确定时这对点之间的距离?这个问题在欧几里得空间中通过构造满足上述条件的最小域来回答。我们还描述了如何获得晶格的所有原始单元(即,封闭的基本域),实现所需的最小数量的副本,并给予他们明确的二维和三维。

英文摘要:

How many copies of a parallelepiped are needed to ensure that for every point in the parallelepiped a copy of each other point exists, such that the distance between them equals the distance of the pair of points when the opposite sites of the parallelepiped are identified? This question is answered in Euclidean space by constructing the smallest domain that fulfills the above condition. We also describe how to obtain all primitive cells of a lattice (i.e., closures of fundamental domains) that realise the smallest number of copies needed and give them explicitly in 2D and 3D.

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

↑