Width deviation of convex polygons
Shigeki Akiyama, Teturo Kamae

TL;DR
This paper investigates the deviation rate of the width of convex polygons in random directions, identifying shapes that maximize or minimize this deviation, with a focus on polygons approximating Reuleaux bodies and the special case of regular polygons.
Contribution
It characterizes the polygons that minimize the width deviation rate among all n-gons, linking them to Reuleaux bodies and providing explicit formulas for the minimum values.
Findings
Maximum deviation rate occurs for degenerate 2-gons.
Minimum deviation rate for non-power-of-two n-gons is achieved by polygons approximating Reuleaux bodies.
Regular n-gons are not optimal for even n, but are minimal for odd n.
Abstract
We consider the width of a convex -gon in the plane along the random direction and study its deviation rate: We prove that the maximum is attained if and only if degenerates to a -gon. Let be an integer which is not a power of . We show that is the minimum of among all -gons and determine completely the shapes of 's which attain this minimum. They are characterized as polygonal approximations of equi-Reuleaux bodies, found and studied by K.~Reinhardt. In particular, if is odd, then the regular -gon is one of the minimum shapes. When is even, we see that regular -gon is far from optimal.We also observe…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Morphological variations and asymmetry
