The lattice A is an important lattice because of its covering properties in low dimensions. Conway & Sloaqne appear to have been the first to consider the problem of computing the nearest lattice point in A. They developed and later improved an algorithm which is able to compute a nearest point in O(n~2) arithmetic steps. In this paper, a new algorithm is developed which is able to compute a nearest point in O(n log n) steps.
展开▼
