On the reverse Loomis-Whitney inequality

DOI10.1007/S00454-017-9949-9zbMath1400.52008arXiv1607.07891OpenAlexW2963789736MaRDI QIDQ724946

Peter Gritzmann, Paolo Gronchi, Stefano Campi

Publication date: 26 July 2018

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

Full work available at URL: https://arxiv.org/abs/1607.07891

zbMATH Keywords

volumealgorithmsprojectionconvex bodyLoomis-Whitney inequalitysmallest enclosing box

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (6)

Reverse Loomis-Whitney inequalities via isotropicity ⋮ A Grassmannian Loomis–Whitney inequality and its dual ⋮ Estimating volume and surface area of a convex body via its projections or sections ⋮ On the reverse dual Loomis-Whitney inequality ⋮ Rogers-Shephard and local Loomis-Whitney type inequalities ⋮ Bounds on the lattice point enumerator via slices and projections

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Projections, entropy and sumsets
• Estimates of Loomis-Whitney type for intrinsic volumes
• Zur besten Beleuchtung konvexer Polyeder
• Restricted chord projection and affine inequalities
• On the multilinear restriction and Kakeya conjectures
• Entropy and isoperimetry for linear and non-linear group actions.
• Some characterizing properties of the simplex
• Optimal estimation theory for dynamic systems with set membership uncertainty: An overview
• Best constants in Young's inequality, its converse, and its generalization to more than three functions
• On the complexity of some basic problems in computational convexity. I. Containment problems
• Finding optimal shadows of polytopes
• Uniform cover inequalities for the volume of coordinate sections and projections of convex bodies
• On the average volume of sections of convex bodies
• The mean volume of boxes and cylinders circumscribed about a convex body
• A nonlinear generalisation of the Loomis-Whitney inequality and applications
• On the complexity of some geometric problems in unbounded dimension
• Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
• Polytope Projection and Projection Polytopes
• Reverse and dual Loomis-Whitney-type inequalities
• Geometric stability via information theory
• The problem of calculating the volume of a polyhedron is enumerably hard
• Convex Bodies Associated with a Given Convex Body
• Polytope Volume Computation
• Volume Ratios and a Reverse Isoperimetric Inequality
• Finding minimal enclosing boxes
• A Volume Inequality Concerning Sections of Convex Sets
• On the Complexity of Computing the Volume of a Polyhedron
• On the Algorithmic Complexity of Minkowski's Reconstruction Theorem
• Shadows of Convex Bodies
• Determining the minimum-area encasing rectangle for an arbitrary closed curve
• Volumes of projection bodies
• Local Stereology
• On The Complexity of Computing Mixed Volumes
• Deterministic and randomized polynomial‐time approximation of radii
• Inequalities for the Surface Area of Projections of Convex Bodies
• Projections of Bodies and Hereditary Properties of Hypergraphs
• Behaviour of the Brascamp–Lieb constant
• Convex Bodies The Brunn-MinkowskiTheory
• The mean surface area of the boxes circumscribed about a convex body
• An inequality related to the isoperimetric inequality
• Compressed sensing

This page was built for publication: On the reverse Loomis-Whitney inequality