The Santalo point of a planar convex set

DOI10.1016/0893-9659(93)90011-BzbMATH Open0779.49047MaRDI QIDQ1802415FDOQ1802415

Mark J. Kaiser

Publication date: 9 January 1994

Published in: Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

planar convex polygonminimum area polar set

Mathematics Subject Classification ID

Minimal surfaces and optimization (49Q05) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Cites Work

• On some affine isoperimetric inequalities
• Geominimal surface area
• A random polynomial-time algorithm for approximating the volume of convex bodies
• Polytope Volume Computation
• On the Complexity of Computing the Volume of a Polyhedron
• Acceleration and Parallelization of the Path-Following Interior Point Method for a Linearly Constrained Convex Quadratic Problem
• Polar reciprocal convex bodies
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Crystals, gauges, podals, and polars.
• The shapes of the future are here!
• An analogue of the Blaschke-Santaló inequality for billiard dynamics

Recommendations

• Title not available (Why is that?) 👍 👎
• Finding minimum area \(k\)-gons 👍 👎
• Finding the smallest triangles containing a given convex polygon 👍 👎
• The Blaschke-Steinhardt point of a planar convex set 👍 👎
• COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON 👍 👎

This page was built for publication: The Santalo point of a planar convex set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802415)