scientific article; zbMATH DE number 2117213
From MaRDI portal
Publication:4828544
zbMATH Open1061.52011MaRDI QIDQ4828544FDOQ4828544
Authors: Károly jun. Böröczky 
Publication date: 22 November 2004
Title of this publication is not available (Why is that?)
Recommendations
coveringpackingcloudsNewton numberWulff shapeHadwiger numberparametric densitycontainer packingsfinite arrangements of convex bodiessausage problems
Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cited In (64)
- Translative packing of a convex body by sequences of its positive homothetic copies
- Title not available (Why is that?)
- Covering and Packing in Linear Space
- Near optimal minimal convex hulls of disks
- Long time behavior of stochastic hard ball systems
- Three-point bounds for energy minimization
- Stability and approximation of statistical limit laws for multidimensional piecewise expanding maps
- Optimal recovery of isotropic classes of twice-differentiable multivariate functions
- Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality
- On the optimal order of worst case complexity of direct search
- Packings, sausages and catastrophes
- Packing circles into perimeter-minimizing convex hulls
- Covering the plane with translates of a triangle
- Polarization problem on a higher-dimensional sphere for a simplex
- Dense forests constructed from grids
- Parallel packing and covering of an equilateral triangle with sequences of squares
- Covering an ellipsoid with equal balls
- Bounds for codes and designs in complex subspaces
- On finite multiple packings
- Classical topics in discrete geometry
- On packing \(\mathbb R^3\) with thin tori
- Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces?
- Bounds for spherical codes: the Levenshtein framework lifted
- Intersections of random sets
- The pursuit of perfect packing
- On polarization of spherical codes and designs
- Connectedness and other geometric properties of suns and Chebyshev sets
- Uniform tight frames as optimal signals
- Chromatic numbers of spheres
- Packing, covering and tiling in two-dimensional spaces
- A concentration inequality for random polytopes, Dirichlet-Voronoi tiling numbers and the geometric balls and bins problem
- The smallest convex \(k\)-gon containing \(n\) congruent disks
- LARGE SIGNED SUBSET SUMS
- Low-degree minimal spanning trees in normed spaces
- Explicit constructions of centrally symmetric \(k\)-neighborly polytopes and large strictly antipodal sets
- Covering by homothets and illuminating convex bodies
- On the distance of polytopes with few vertices to the Euclidean ball
- Too acute to be true: the story of acute sets
- Minimal \(N\)-point diameters and \(f\)-best-packing constants in \(\mathbb R^d\)
- Packing and covering with balls on Busemann surfaces
- Mesh ratios for best-packing and limits of minimal energy configurations
- Kugellagerungen und Konvexgeometrie. (Sphere packings and convex geometry)
- Covering and packing in linear space
- Blocking numbers and fixing numbers of convex bodies
- On isoperimetric inequalities in Minkowski spaces
- Geometry where direction matters -- or does it?
- Universally optimal distribution of points on spheres
- Sigma-delta quantization for fusion frames and distributed sensor networks
- Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries
- Translative covering by unit squares
- Nearly optimal coverings of a sphere with generalized spherical segments
- Rigidity of spherical codes
- On packing density of growing size circles
- Title not available (Why is that?)
- On kissing numbers and spherical codes in high dimensions
- Asymptotics of best-packing on rectifiable sets
- On fast Johnson-Lindenstrauss embeddings of compact submanifolds of \(\mathbb{R}^N\) with boundary
- A quantitative Helly-type theorem: containment in a homothet
- On the number of points at distance at least 1 in the unit four-dimensional cube
- Quantitative Steinitz theorem: A polynomial bound
- Worst-case optimal covering of rectangles by disks
- A quantitative stability result for the sphere packing problem in dimensions 8 and 24
- On the blocking numbers of some special convex bodies
- Classes of homothetic convex sets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4828544)
