A new packing density bound in 3-space

被引：0
|
作者：
Smith, EH [1 ]
机构：
[1] Jacksonville State Univ, MCIS Dept, Jacksonville, AL 36265 USA
来源：
DISCRETE & COMPUTATIONAL GEOMETRY | 2005年 / 34卷 / 03期
关键词：
Computational Mathematic; Packing Density; Compact Convex; Lattice Packing; Minkowski Combination;
D O I：
10.1007/s00454-005-1178-y
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
It is shown that every compact convex set K which is centrally symmetric and has a non-empty interior admits a lattice packing of Euclidean 3-space with density greater than or equal to 0.53835.... This is an improvement of the result in [8], which achieved a bound of 0.46421.... Minkowski combinations and the Brunn-Minkowski inequality are used in conjunction with the construction in [8] to achieve a better result.
引用
收藏
页码：537 / 544
页数：8
相关论文
共 50 条
12345