论文标题
不均匀包装
Non-uniform packings
论文作者
论文摘要
我们概括了带有与半径不同的情况下的球相同的球形堆积的经典概念。适合集合内部的最大数量的无重叠的球称为其{\ em nor-Ur均匀填充号}。我们表明，非均匀的填料数可以按照球的{\ em平均}半径呈上限，从而导致熟悉的经典形式的界限。
We generalize the classical notion of packing a set by balls with identical radii to the case where the radii may be different. The largest number of such balls that fit inside the set without overlapping is called its {\em non-uniform packing number}. We show that the non-uniform packing number can be upper-bounded in terms of the {\em average} radius of the balls, resulting in bounds of the familiar classical form.
