Convexity of Sub-polygons of Convex Polygons
Iosif Pinelis

TL;DR
This paper proves that all sub-polygons of a convex polygon are convex and establishes conditions under which an n-gon is convex based on its sub-polygons, contributing to the understanding of polygon convexity properties.
Contribution
It introduces new proofs that all sub-polygons of a convex polygon are convex and characterizes convexity of n-gons via their sub-(n-1)-gons.
Findings
All sub-polygons of a convex polygon are convex.
Convexity of all sub-(n-1)-gons implies the n-gon is convex for n ≥ 5.
Provides related geometric results on polygon convexity.
Abstract
A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices {V_0,...,V_{n-1}}. It is proved that all sub-polygons of any convex polygon with distinct vertices are convex. It is also proved that, if all sub-(n-1)-gons of an n-gon with n\ge5 are convex, then the n-gon is convex. Other related results are given.
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
TopicsComputational Geometry and Mesh Generation · Point processes and geometric inequalities · Mathematics and Applications
