Complexity and algorithms for computing Voronoi cells of lattices

Abstract

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.

20 pages, 2 figures, 5 tables

Cited by in corpus (13)

• Computing symmetry groups of polyhedra
• Optimal Template Banks
• Random perfect lattices and the sphere packing problem
• On the best lattice quantizers
• The contact polytope of the Leech lattice (complete version)
• The optimal lattice quantizer in nine dimensions
• Counterexamples to a conjecture of Woods
• Inhomogeneous extreme forms
• Coloring the Voronoi tessellation of lattices
• A polynomial time algorithm for solving the closest vector problem in zonotopal lattices
• Glued lattices are better quantizers than $K_{12}$
• On the Voronoi Conjecture for combinatorially Voronoi parallelohedra in dimension five
• Optimization and Identification of Lattice Quantizers