scientific article; zbMATH DE number 2117213
From MaRDI portal
Publication:4828544
zbMath1061.52011MaRDI QIDQ4828544
Publication date: 22 November 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
coveringpackingcloudsparametric densityNewton numberWulff shapeHadwiger numbercontainer packingsfinite arrangements of convex bodiessausage problems
Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)
Related Items (53)
Long time behavior of stochastic hard ball systems ⋮ Packing and covering with balls on Busemann surfaces ⋮ Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries ⋮ On the optimal order of worst case complexity of direct search ⋮ Covering the plane with translates of a triangle ⋮ Connectedness and other geometric properties of suns and Chebyshev sets ⋮ Intersections of random sets ⋮ Covering an ellipsoid with equal balls ⋮ A Quantitative Helly-Type Theorem: Containment in a Homothet ⋮ Three-point bounds for energy minimization ⋮ On kissing numbers and spherical codes in high dimensions ⋮ A concentration inequality for random polytopes, Dirichlet-Voronoi tiling numbers and the geometric balls and bins problem ⋮ Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality ⋮ Optimal recovery of isotropic classes of twice-differentiable multivariate functions ⋮ Unnamed Item ⋮ The smallest convex \(k\)-gon containing \(n\) congruent disks ⋮ Dense forests constructed from grids ⋮ LARGE SIGNED SUBSET SUMS ⋮ Packing circles into perimeter-minimizing convex hulls ⋮ On fast Johnson-Lindenstrauss embeddings of compact submanifolds of \(\mathbb{R}^N\) with boundary ⋮ Quantitative Steinitz theorem: A polynomial bound ⋮ A quantitative stability result for the sphere packing problem in dimensions 8 and 24 ⋮ On polarization of spherical codes and designs ⋮ Sigma-Delta Quantization for Fusion Frames and Distributed Sensor Networks ⋮ Explicit constructions of centrally symmetric \(k\)-neighborly polytopes and large strictly antipodal sets ⋮ Mesh ratios for best-packing and limits of minimal energy configurations ⋮ Geometry where direction matters -- or does it? ⋮ Packing, covering and tiling in two-dimensional spaces ⋮ Rigidity of spherical codes ⋮ Minimal 𝑁-point diameters and 𝑓-best-packing constants in ℝ^{𝕕} ⋮ Nearly optimal coverings of a sphere with generalized spherical segments ⋮ On packing density of growing size circles ⋮ Translative packing of a convex body by sequences of its positive homothetic copies ⋮ On packing \(\mathbb R^3\) with thin tori ⋮ On isoperimetric inequalities in Minkowski spaces ⋮ On the distance of polytopes with few vertices to the Euclidean ball ⋮ Low-degree minimal spanning trees in normed spaces ⋮ Translative covering by unit squares ⋮ Bounds for codes and designs in complex subspaces ⋮ Packings, sausages and catastrophes ⋮ Parallel packing and covering of an equilateral triangle with sequences of squares ⋮ Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces? ⋮ Chromatic numbers of spheres ⋮ Uniform tight frames as optimal signals ⋮ Near optimal minimal convex hulls of disks ⋮ Too Acute to Be True: The Story of Acute Sets ⋮ Stability and approximation of statistical limit laws for multidimensional piecewise expanding maps ⋮ Blocking numbers and fixing numbers of convex bodies ⋮ Universally optimal distribution of points on spheres ⋮ Bounds for spherical codes: The Levenshtein framework lifted ⋮ Asymptotics of best-packing on rectifiable sets ⋮ Covering by homothets and illuminating convex bodies ⋮ Polarization problem on a higher-dimensional sphere for a simplex
This page was built for publication:
