Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces

DOI10.1007/BF02187841zbMath0747.52003MaRDI QIDQ1182991

Victor Klee, Peter Gritzmann

Publication date: 28 June 1992

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131195

zbMATH Keywords

widthdiameterconvex bodiespolytope radii

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items

Chebyshev approximation of a point set by a straight line, Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces, Behaviour of inradius, circumradius, and diameter in generalized Minkowski spaces, Successive radii and Orlicz Minkowski sum, New algorithms for \(k\)-center and extensions, SHARPENING GEOMETRIC INEQUALITIES USING COMPUTABLE SYMMETRY MEASURES, Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\), All convex polyhedra can be clamped with parallel jaw grippers, Geometric dilation of closed planar curves: New lower bounds, On the reverse isodiametric problem and Dvoretzky-Rogers-type volume bounds, Estimating sizes of a convex body by successive diameters and widths, Tightening and reversing the arithmetic-harmonic mean inequality for symmetrizations of convex sets, Diversities and the generalized circumradius, No dimension-independent core-sets for containment under homothetics, Tractability from overparametrization: the example of the negative perceptron, Dimensionality-reduced subspace clustering, Successive radii and Minkowski addition, Successive radii and ball operators in generalized Minkowski spaces, Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems, Meissner's mysterious bodies, Intrinsic volumes and successive radii, On the families of successive radii and the sum of convex sets, Packing minima and lattice points in convex bodies, Is a complete, reduced set necessarily of constant width?, Hunting for reduced polytopes, Deciding uniqueness in norm maximazation, The asymmetry of complete and constant width bodies in general normed spaces and the Jung constant, Approximating the maximum overlap of polygons under translation, Reduced convex bodies in Euclidean space -- a survey, Reduced convex bodies in finite dimensional normed spaces: a survey, Mean projection and section radii of convex bodies, Deterministic and randomized polynomial‐time approximation of radii, The largest \(k\)-ball in a \(d\)-dimensional box, Approximate Kernel Clustering, Radii minimal projections of polytopes and constrained optimization of symmetric polynomials, SUCCESSIVE RADII OF FAMILIES OF CONVEX BODIES, New Algorithms for k-Center and Extensions, A Semidefinite Hierarchy for Containment of Spectrahedra, Fixed-parameter complexity and approximability of norm maximization, On computing the diameter of a point set in high dimensional Euclidean space.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Estimates for the minimal width of polytopes inscribed in convex bodies
• Computational complexity of norm-maximization
• The difference body of a convex body
• Minimalstellen von Funktionen und Extremalpunkte
• Inspheres and inner products
• Geometric algorithms and combinatorial optimization
• Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
• Über die beste Annäherung von Funktionen einer gegebenen Funktionenklasse
• Convex regions and projections in Minkowski spaces
• Zwei Extremalprobleme der Minkowski-Geometrie
• Notes on Minkowski Geometry (I): Relations between the Circumradius, Diameter, Inradius and Minimal Width of a Convex Set
• DIAMETERS OF SETS IN FUNCTION SPACES AND THE THEORY OF BEST APPROXIMATIONS
• Circumspheres and Inner Products.
• Good and Bad Radii of Convex Polygons
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• On equidistant sets in normed linear spaces
• Regular Simplices with Rational Vertices
• Best n -Dimensional Approximation to Sets of Functions
• Some Characterizations of Inner-Product Spaces
• On Sets of Distances of n Points