Lattice Packing and Covering of Convex Bodies

被引：4
|
作者：
Gruber, Peter M. [1 ]
机构：
[1] Vienna Univ Technol, Inst Diskrete Math & Geometrie, A-1040 Vienna, Austria
来源：
PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS | 2011年 / 275卷 / 01期
关键词：
QUADRATIC-FORMS; CONTINUOUS PARAMETERS; DENSEST LATTICE; CLASSIFICATION; GEOMETRY; VORONOI; JOHN;
D O I：
10.1134/S0081543811080165
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The aim of this article is twofold. First, to indicate briefly major problems and developments dealing with lattice packings and coverings of balls and convex bodies. Second, to survey more recent results on uniqueness of lattice packings and coverings of extreme density, on characterization of local minima and maxima of the density and on estimates of the kissing number. Emphasis is on results in general dimensions.
引用
收藏
页码：229 / 238
页数：10
相关论文
共 50 条
  • [31] Packing and Covering with Centrally Symmetric Convex Disks
    Ismailescu, Dan
    Kim, Brian
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2014, 51 (02) : 495 - 508
  • [32] PACKING AND COVERING THE PLANE WITH TRANSLATES OF A CONVEX POLYGON
    MOUNT, DM
    SILVERMAN, R
    [J]. JOURNAL OF ALGORITHMS, 1990, 11 (04) : 564 - 580
  • [33] Packing and Covering with Centrally Symmetric Convex Disks
    Dan Ismailescu
    Brian Kim
    [J]. Discrete & Computational Geometry, 2014, 51 : 495 - 508
  • [34] Finite packing and covering by congruent convex domains
    Károly Böröczky
    [J]. Discrete & Computational Geometry, 2003, 30 : 185 - 193
  • [35] Extremum properties of lattice packing and covering with circles
    Gruber, Peter M.
    [J]. ADVANCES IN GEOMETRY, 2016, 16 (01) : 93 - 110
  • [36] Computational Approaches to Lattice Packing and Covering Problems
    Achill Schurmann
    Frank Vallentin
    [J]. Discrete & Computational Geometry, 2006, 35 : 73 - 116
  • [37] Computational approaches to lattice packing and covering problems
    Schürmann, A
    Vallentin, F
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2006, 35 (01) : 73 - 116
  • [38] Covering Convex Bodies and the Closest Vector Problem
    Naszodi, Marton
    Venzin, Moritz
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2022, 67 (04) : 1191 - 1210
  • [39] Covering Convex Bodies and the Closest Vector Problem
    Márton Naszódi
    Moritz Venzin
    [J]. Discrete & Computational Geometry, 2022, 67 : 1191 - 1210
  • [40] Online Algorithms for Covering and Packing Problems with Convex Objectives
    Azar, Yossi
    Buchbinder, Niv
    Chan, T-H. Hubert
    Chen, Shahar
    Cohen, Ilan Reuven
    Gupta, Anupam
    Huang, Zhiyi
    Kang, Ning
    Nagarajan, Viswanath
    Naor, Joseph
    Panigrahi, Debmalya
    [J]. 2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2016, : 148 - 157
12345