arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0804.0036math.MGcs.CGcs.ITmath.ITmath.NT
收藏

格的Voronoi胞的计算复杂性及算法

Complexity and algorithms for computing Voronoi cells of lattices

Mathieu Dutour Sikiric, Achill Schuermann, Frank Vallentin

摘要:

在本文中,我们关注的是寻找顶点的Voronoi细胞的欧几里德格。给定一个格的基,我们证明了计算顶点数是一个P-hard问题。另一方面,我们描述了一个算法,这个问题是特别适合于低维(说,在最多12维)和高度对称格。我们使用我们的实现,这大大优于目前的计算机代数系统,找到的Voronoi细胞的顶点和量化常数的一些突出的晶格。

英文摘要:

In this paper we are concerned with finding the vertices of the Voronoi cell of a Euclidean lattice. Given a basis of a lattice, we prove that computing the number of vertices is a #P-hard problem. On the other hand we describe an algorithm for this problem which is especially suited for low dimensional (say dimensions at most 12) and for highly-symmetric lattices. We use our implementation, which drastically outperforms those of current computer algebra systems, to find the vertices of Voronoi cells and quantizer constants of some prominent lattices.

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

↑