A linear-time nearest point algorithm for the lattice An*

被引：0
|
作者：
McKilliam, Robby G. [1 ]
Clarkson, I. Vaughan L. [1 ]
Smith, Warren D. [2 ]
Quinn, Barry G. [2 ]
机构：
[1] Univ Queensland, Sch Informat Technol & Elect Engn, Brisbane, Qld 4072, Australia
[2] Macquarie Univ, EFS, Dept Stat, Sydney, NSW 2109, Australia
来源：
2008 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, VOLS 1-3 | 2008年
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The lattice A(n)* is an important lattice because of its covering properties in low dimensions. Two algorithms exist in the literature that compute the nearest point in the lattice A(n)*, in O(n log n) arithmetic operations. In this paper we describe a new algorithm that requires only O(n) operations. The new algorithm makes use of an approximate sorting procedure called a bucket sort. This is the fastest known nearest point algorithm for this lattice.
引用
收藏
页码：1239 / +
页数：3
相关论文
共 50 条
  • [1] Linear-Time Nearest Point Algorithms for Coxeter Lattices
    McKilliam, Robby G.
    Smith, Warren D.
    Clarkson, I. Vaughan L.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (03) : 1015 - 1022
  • [2] An algorithm to compute a nearest point in the lattice An*
    Vaughan, I
    Clarkson, L
    [J]. APPLIED ALGEBRA, ALGEBRAIC ALGORITHMS AND ERROR-CORRECTING CODES, PROCEEDINGS, 1999, 1719 : 104 - 120
  • [3] A Linear-Time Algorithm for the Aggregation and Visualization of Big Spatial Point Data
    Beilschmidt, Christian
    Fober, Thomas
    Mattig, Michael
    Seeger, Bernhard
    [J]. 25TH ACM SIGSPATIAL INTERNATIONAL CONFERENCE ON ADVANCES IN GEOGRAPHIC INFORMATION SYSTEMS (ACM SIGSPATIAL GIS 2017), 2017,
  • [4] Linear-time algorithm for the generation of trees
    [J]. Algorithmica (New York), 1997, 17 (02):
  • [5] A Linear-Time Algorithm for Seeds Computation
    Kociumaka, Tomasz
    Kubica, Marcin
    Radoszewski, Jakub
    Rytter, Wojciech
    Walen, Tomasz
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2020, 16 (02)
  • [6] A LINEAR-TIME ALGORITHM FOR FINDING AN AMBITUS
    MISHRA, B
    TARJAN, RE
    [J]. ALGORITHMICA, 1992, 7 (5-6) : 521 - 554
  • [7] A linear-time algorithm for the generation of trees
    Alonso, L
    Remy, JL
    Schott, R
    [J]. ALGORITHMICA, 1997, 17 (02) : 162 - 182
  • [8] A linear-time majority tree algorithm
    Amenta, N
    Clarke, F
    John, KS
    [J]. ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2003, 2812 : 216 - 227
  • [9] A linear-time algorithm for the generation of trees
    L. Alonso
    J. L. Rémy
    R. Schott
    [J]. Algorithmica, 1997, 17 : 162 - 182
  • [10] An algorithm to compute the nearest point in the lattice A*n
    McKilliam, Robby G.
    Clarkson, I. Vaughan L.
    Quinn, Barry G.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (09) : 4378 - 4381
12345